{"id":28063,"date":"2022-12-28T08:34:09","date_gmt":"2022-12-28T03:04:09","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/"},"modified":"2022-12-28T08:34:09","modified_gmt":"2022-12-28T03:04:09","slug":"solved-how-preprocessor-i-e-define-works-closed","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/","title":{"rendered":"[Solved] How preprocessor (i.e.#define) works? [closed]"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-33236420\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"33236420\" data-parentid=\"33236151\" data-score=\"-1\" data-position-on-page=\"3\" data-highest-scored=\"0\" data-question-has-accepted-highest-score=\"0\" itemprop=\"suggestedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>In one of my assignment i have implemented simple pre-processor using c.I have used the simple hash table to store the name and its definition.<br \/>\nfor example,<\/p>\n<pre><code>#define a 4\n<\/code><\/pre>\n<p>so here a is name and 4 is its definition.<br \/>\nSo both a and 4 will be stored in the hash table.<br \/>\nnow whenever in program name &#8216;a&#8217; is encountered then it will be simply replaced by 4.<br \/>\ni am posting my code in c for pre-processor.Which is very simple.But it would be very helpful for you to understand how pre-processor works.<\/p>\n<pre><code>#include &lt;stdio.h&gt;\n#include &lt;string.h&gt;\n#include &lt;stdlib.h&gt;\n#include &lt;ctype.h&gt;\n#define HASHSIZE 101\n#define BUFSIZE 100\n#define MAXWORD 100\n\nstruct tnode {\n    int loc[10]; \/\/ to store the locations at which words occur\n    int i; \/\/ to store the index of array loc\n    char *word;\n    int count;\n    struct tnode *left;\n    struct tnode *right;\n};\n\nstatic struct nlist *hashtab[HASHSIZE];\n\nint getword(char *word, int lim);\nstruct tnode *addtree(struct tnode *, char *);\nvoid treeprint(struct tnode *);\nstruct tnode *talloc(void);\n\nstruct nlist {\n    \/* table entry: *\/\n    struct nlist *next;\n    \/* next entry in chain *\/\n    char *name;\n    \/* defined name *\/\n    char *defn;\n    \/* replacement text *\/\n};\n\nchar buf[BUFSIZE];\nint bufp = 0;\n\nunsigned hash(char *s);\nstruct nlist *lookup(char *s);\nchar *strdup1(char *);\nstruct nlist *install(char *name, char *defn);\nint undef(char *s); \/\/ this function will remove entry\n\nstruct tnode *z[10]; \/\/ to store address of each node(word)\nint total = 0;       \/\/ index for array z\nchar s1[1000];       \/\/ to store entire input\nstatic int q = 0;    \/\/ index to s1\n\nint main() {\n    struct nlist *pt;\n    char word[100];\n    char name1[10];\n    char defn1[10];\n    int i = 0;\n    int k = 0;\n    \/*\n    #define pi 5 is entered then...*\/\n    while (getword(word, MAXWORD) != EOF) {\n        if (isalnum(word[0]) &amp;&amp; (i == 0)) {\n            if ((pt = lookup(&amp;word[0])) !=\n                NULL) \/\/ if name1(pi) is already present then replace it with its definition name(5)\n            {\n                strcpy(word, (pt-&gt;defn)); \/\/ if pi is alerady there then replace name by its definition\n                \/\/ strcpy((pt-&gt;defn),word);\n                for (k = 0; word[k] != '\\0'; k++, q++) {\n                    s1[q] = word[k];\n                }\n\n            } else \/\/ otherwise print the word\n            {\n                for (k = 0; word[k] != '\\0'; k++, q++) {\n                    s1[q] = word[k];\n                }\n            }\n        }\n\n        if (isalnum(word[0])) {\n            if (i == 2) \/\/ copy word to defn1(i.e. defn1=5)\n            {\n                strcpy(defn1, word);\n                install(name1, defn1);\n                i = 0;\n            }\n        }\n        if (isalnum(word[0])) {\n            if (i == 1) \/\/ copy the word to name1(i.e. name1=pi)\n            {\n                strcpy(name1, word);\n                i++;\n            }\n        }\n        if (word[0] == '#') {\n            if ((strcmp(word, \"#define\")) == 0) \/\/ if #define found then increase i to get next word(i.e. pi)\n            {\n                i++;\n            } else {\n                for (k = 0; word[k] != '\\0'; k++, q++) {\n                    s1[q] = word[k];\n                }\n            }\n        }\n    }\n\n    \/\/ printf(\"%d\",i);\n    \/\/ printf(\"%s %s\",name,defn);\n    \/\/ printf(\"%s\",pt-&gt;defn);\n    printf(\"%s\", s1);\n}\nunsigned hash(char *s) {\n    unsigned hashval;\n    for (hashval = 0; *s != '\\0'; s++)\n        hashval = *s + 31 * hashval;\n    return hashval % HASHSIZE;\n}\n\/* lookup: look for s in hashtab *\/\nstruct nlist *lookup(char *s) {\n    struct nlist *np;\n    for (np = hashtab[hash(s)]; np != NULL; np = np-&gt;next)\n        if (strcmp(s, np-&gt;name) == 0)\n            return np;\n    \/* found *\/\n    return NULL;\n    \/* not found *\/\n}\n\/* install: put (name, defn) in hashtab *\/\nstruct nlist *install(char *name, char *defn) {\n    struct nlist *np;\n    unsigned hashval;\n    if ((np = lookup(name)) == NULL) { \/* not found *\/\n        np = (struct nlist *)malloc(sizeof(*np));\n        if (np == NULL || (np-&gt;name = strdup1(name)) == NULL)\n            return NULL;\n        hashval = hash(name);\n        np-&gt;next = hashtab[hashval];\n        hashtab[hashval] = np;\n    } else\n        \/* already there *\/\n        free((void *)np-&gt;defn);\n    \/*free previous defn *\/\n    if ((np-&gt;defn = strdup1(defn)) == NULL)\n        return NULL;\n    return np;\n}\nchar *strdup1(char *s) {\n    char *p;\n    \/* make a duplicate of s *\/\n    p = (char *)malloc(strlen(s) + 1); \/* +1 for '\\0' *\/\n    if (p != NULL)\n        strcpy(p, s);\n    return p;\n}\nint undef(char *s) {\n    struct nlist *np1;\n    if ((np1 = lookup(s)) != NULL) {\n        hashtab[hash(s)] = NULL; \/\/ delete the entry in array hashtab associated to s\n        free(np1); \/\/ free memory allocated to s\n        return 1; \/\/ if sucessful then return 1 else 0\n    }\n    return 0;\n}\nint getword(char *word, int lim) {\n    int c, getch(void);\n    void ungetch(int);\n    char *w = word;\n    while (isspace(c = getch())) {\n        s1[q] = ' ';\n        q++;\n    } \/\/ takes the space in string s1\n    if (c != EOF)\n        *w++ = c;\n    if (!isalnum(c) &amp;&amp; (c != '#')) \/*takes all character except #,digit and number in s*\/\n    {\n        if (c != EOF) {\n            s1[q] = c;\n            q++;\n        }\n        *w = '\\0';\n        return c;\n    }\n    for (; --lim &gt; 0; w++)\n        if (!isalnum(*w = getch())) {\n            ungetch(*w);\n            break;\n        }\n    *w = '\\0';\n    return word[0];\n}\nint getch(void) \/* get a (possibly pushed-back) character *\/\n{\n    return (bufp &gt; 0) ? buf[--bufp] : getchar();\n}\nvoid ungetch(int c)\n\/* push character back on input *\/\n{\n    if (bufp &gt;= BUFSIZE)\n        printf(\"ungetch: too many characters\\n\");\n    else\n        buf[bufp++] = c;\n}\n\n\/* addtree: add a node with w, at or below p *\/\nstruct tnode *addtree(struct tnode *p, char *w) {\n    int cond;\n    if (p == NULL) {\n        \/* a new word has arrived *\/\n        p = talloc();\n        \/* make a new node *\/\n        p-&gt;word = strdup(w);\n        p-&gt;count = 1;\n        p-&gt;left = p-&gt;right = NULL;\n    } else if ((cond = strcmp(w, p-&gt;word)) == 0)\n        p-&gt;count++;\n    \/* repeated word *\/\n    else if (cond &lt; 0)\n        \/* less than into left subtree *\/\n        p-&gt;left = addtree(p-&gt;left, w);\n    else\n        \/* greater than into right subtree *\/\n        p-&gt;right = addtree(p-&gt;right, w);\n    return p;\n}\n\n\/* talloc: make a tnode *\/\nstruct tnode *talloc(void) {\n    return (struct tnode *)malloc(sizeof(struct tnode));\n}\n\nvoid treeprint(struct tnode *p) {\n    int i = 0;\n    for (i = 0; i &lt; total; i++)\n        printf(\"%s\", z[i]-&gt;word);\n}\n<\/code><\/pre>\n<p>The code is self explanatory.Mind you it is very simple pre-processor.<\/p>\n<\/p><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\">1<\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved How preprocessor (i.e.#define) works? [closed] <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] In one of my assignment i have implemented simple pre-processor using c.I have used the simple hash table to store the name and its definition. for example, #define a 4 so here a is name and 4 is its definition. So both a and 4 will be stored in the hash table. now whenever &#8230; <a title=\"[Solved] How preprocessor (i.e.#define) works? [closed]\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/\" aria-label=\"More on [Solved] How preprocessor (i.e.#define) works? [closed]\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[324],"class_list":["post-28063","post","type-post","status-publish","format-standard","hentry","category-solved","tag-c"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[Solved] How preprocessor (i.e.#define) works? [closed] - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] How preprocessor (i.e.#define) works? [closed] - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] In one of my assignment i have implemented simple pre-processor using c.I have used the simple hash table to store the name and its definition. for example, #define a 4 so here a is name and 4 is its definition. So both a and 4 will be stored in the hash table. now whenever ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-12-28T03:04:09+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] How preprocessor (i.e.#define) works? [closed]\",\"datePublished\":\"2022-12-28T03:04:09+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/\"},\"wordCount\":119,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"c++\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/\",\"name\":\"[Solved] How preprocessor (i.e.#define) works? [closed] - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2022-12-28T03:04:09+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] How preprocessor (i.e.#define) works? [closed]\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] How preprocessor (i.e.#define) works? [closed] - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] How preprocessor (i.e.#define) works? [closed] - JassWeb","og_description":"[ad_1] In one of my assignment i have implemented simple pre-processor using c.I have used the simple hash table to store the name and its definition. for example, #define a 4 so here a is name and 4 is its definition. So both a and 4 will be stored in the hash table. now whenever ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/","og_site_name":"JassWeb","article_published_time":"2022-12-28T03:04:09+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] How preprocessor (i.e.#define) works? [closed]","datePublished":"2022-12-28T03:04:09+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/"},"wordCount":119,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["c++"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/","url":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/","name":"[Solved] How preprocessor (i.e.#define) works? [closed] - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-12-28T03:04:09+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-how-preprocessor-i-e-define-works-closed\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] How preprocessor (i.e.#define) works? [closed]"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/28063","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=28063"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/28063\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=28063"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=28063"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=28063"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}