= 0) following the siblings.\\n * Returns SP_TRUNCERROR if the file is shorter than expected.\\n * Returns SP_FORMERROR if there is a format error.\\n */\\n static idx_T\\nread_tree_node(\\n FILE\\t*fd,\\n char_u\\t*byts,\\n idx_T\\t*idxs,\\n int\\t\\tmaxidx,\\t\\t // size of arrays\\n idx_T\\tstartidx,\\t // current index in \\\"byts\\\" and \\\"idxs\\\"\\n int\\t\\tprefixtree,\\t // TRUE for reading PREFIXTREE\\n int\\t\\tmaxprefcondnr)\\t // maximum for <prefcondnr>\\n{\\n int\\t\\tlen;\\n int\\t\\ti;\\n int\\t\\tn;\\n idx_T\\tidx = startidx;\\n int\\t\\tc;\\n int\\t\\tc2;\\n#define SHARED_MASK\\t0x8000000\",\n \" len = getc(fd);\\t\\t\\t\\t\\t// <siblingcount>\\n if (len <= 0)\\n\\treturn SP_TRUNCERROR;\",\n \" if (startidx + len >= maxidx)\\n\\treturn SP_FORMERROR;\\n byts[idx++] = len;\",\n \" // Read the byte values, flag/region bytes and shared indexes.\\n for (i = 1; i <= len; ++i)\\n {\\n\\tc = getc(fd);\\t\\t\\t\\t\\t// <byte>\\n\\tif (c < 0)\\n\\t return SP_TRUNCERROR;\\n\\tif (c <= BY_SPECIAL)\\n\\t{\\n\\t if (c == BY_NOFLAGS && !prefixtree)\\n\\t {\\n\\t\\t// No flags, all regions.\\n\\t\\tidxs[idx] = 0;\\n\\t\\tc = 0;\\n\\t }\\n\\t else if (c != BY_INDEX)\\n\\t {\\n\\t\\tif (prefixtree)\\n\\t\\t{\\n\\t\\t // Read the optional pflags byte, the prefix ID and the\\n\\t\\t // condition nr. In idxs[] store the prefix ID in the low\\n\\t\\t // byte, the condition index shifted up 8 bits, the flags\\n\\t\\t // shifted up 24 bits.\\n\\t\\t if (c == BY_FLAGS)\\n\\t\\t\\tc = getc(fd) << 24;\\t\\t// <pflags>\\n\\t\\t else\\n\\t\\t\\tc = 0;\",\n \"\\t\\t c |= getc(fd);\\t\\t\\t// <affixID>\",\n \"\\t\\t n = get2c(fd);\\t\\t\\t// <prefcondnr>\\n\\t\\t if (n >= maxprefcondnr)\\n\\t\\t\\treturn SP_FORMERROR;\\n\\t\\t c |= (n << 8);\\n\\t\\t}\\n\\t\\telse // c must be BY_FLAGS or BY_FLAGS2\\n\\t\\t{\\n\\t\\t // Read flags and optional region and prefix ID. In\\n\\t\\t // idxs[] the flags go in the low two bytes, region above\\n\\t\\t // that and prefix ID above the region.\\n\\t\\t c2 = c;\\n\\t\\t c = getc(fd);\\t\\t\\t// <flags>\\n\\t\\t if (c2 == BY_FLAGS2)\\n\\t\\t\\tc = (getc(fd) << 8) + c;\\t// <flags2>\\n\\t\\t if (c & WF_REGION)\\n\\t\\t\\tc = (getc(fd) << 16) + c;\\t// <region>\\n\\t\\t if (c & WF_AFX)\\n\\t\\t\\tc = (getc(fd) << 24) + c;\\t// <affixID>\\n\\t\\t}\",\n \"\\t\\tidxs[idx] = c;\\n\\t\\tc = 0;\\n\\t }\\n\\t else // c == BY_INDEX\\n\\t {\\n\\t\\t\\t\\t\\t\\t\\t// <nodeidx>\\n\\t\\tn = get3c(fd);\\n\\t\\tif (n < 0 || n >= maxidx)\\n\\t\\t return SP_FORMERROR;\\n\\t\\tidxs[idx] = n + SHARED_MASK;\\n\\t\\tc = getc(fd);\\t\\t\\t\\t// <xbyte>\\n\\t }\\n\\t}\\n\\tbyts[idx++] = c;\\n }\",\n \" // Recursively read the children for non-shared siblings.\\n // Skip the end-of-word ones (zero byte value) and the shared ones (and\\n // remove SHARED_MASK)\\n for (i = 1; i <= len; ++i)\\n\\tif (byts[startidx + i] != 0)\\n\\t{\\n\\t if (idxs[startidx + i] & SHARED_MASK)\\n\\t\\tidxs[startidx + i] &= ~SHARED_MASK;\\n\\t else\\n\\t {\\n\\t\\tidxs[startidx + i] = idx;\\n\\t\\tidx = read_tree_node(fd, byts, idxs, maxidx, idx,\\n\\t\\t\\t\\t\\t\\t prefixtree, maxprefcondnr);\\n\\t\\tif (idx < 0)\\n\\t\\t break;\\n\\t }\\n\\t}\",\n \" return idx;\\n}\",\n \"/*\\n * Reload the spell file \\\"fname\\\" if it's loaded.\\n */\\n static void\\nspell_reload_one(\\n char_u\\t*fname,\\n int\\t\\tadded_word)\\t// invoked through \\\"zg\\\"\\n{\\n slang_T\\t*slang;\\n int\\t\\tdidit = FALSE;\",\n \" FOR_ALL_SPELL_LANGS(slang)\\n {\\n\\tif (fullpathcmp(fname, slang->sl_fname, FALSE, TRUE) == FPC_SAME)\\n\\t{\\n\\t slang_clear(slang);\\n\\t if (spell_load_file(fname, NULL, slang, FALSE) == NULL)\\n\\t\\t// reloading failed, clear the language\\n\\t\\tslang_clear(slang);\\n\\t redraw_all_later(SOME_VALID);\\n\\t didit = TRUE;\\n\\t}\\n }\",\n \" // When \\\"zg\\\" was used and the file wasn't loaded yet, should redo\\n // 'spelllang' to load it now.\\n if (added_word && !didit)\\n\\tdid_set_spelllang(curwin);\\n}\",\n \"\\n/*\\n * Functions for \\\":mkspell\\\".\\n */\",\n \"#define MAXLINELEN 500\\t\\t// Maximum length in bytes of a line in a .aff\\n\\t\\t\\t\\t// and .dic file.\\n/*\\n * Main structure to store the contents of a \\\".aff\\\" file.\\n */\\ntypedef struct afffile_S\\n{\\n char_u\\t*af_enc;\\t// \\\"SET\\\", normalized, alloc'ed string or NULL\\n int\\t\\taf_flagtype;\\t// AFT_CHAR, AFT_LONG, AFT_NUM or AFT_CAPLONG\\n unsigned\\taf_rare;\\t// RARE ID for rare word\\n unsigned\\taf_keepcase;\\t// KEEPCASE ID for keep-case word\\n unsigned\\taf_bad;\\t\\t// BAD ID for banned word\\n unsigned\\taf_needaffix;\\t// NEEDAFFIX ID\\n unsigned\\taf_circumfix;\\t// CIRCUMFIX ID\\n unsigned\\taf_needcomp;\\t// NEEDCOMPOUND ID\\n unsigned\\taf_comproot;\\t// COMPOUNDROOT ID\\n unsigned\\taf_compforbid;\\t// COMPOUNDFORBIDFLAG ID\\n unsigned\\taf_comppermit;\\t// COMPOUNDPERMITFLAG ID\\n unsigned\\taf_nosuggest;\\t// NOSUGGEST ID\\n int\\t\\taf_pfxpostpone;\\t// postpone prefixes without chop string and\\n\\t\\t\\t\\t// without flags\\n int\\t\\taf_ignoreextra;\\t// IGNOREEXTRA present\\n hashtab_T\\taf_pref;\\t// hashtable for prefixes, affheader_T\\n hashtab_T\\taf_suff;\\t// hashtable for suffixes, affheader_T\\n hashtab_T\\taf_comp;\\t// hashtable for compound flags, compitem_T\\n} afffile_T;\",\n \"#define AFT_CHAR\\t0\\t// flags are one character\\n#define AFT_LONG\\t1\\t// flags are two characters\\n#define AFT_CAPLONG\\t2\\t// flags are one or two characters\\n#define AFT_NUM\\t\\t3\\t// flags are numbers, comma separated\",\n \"typedef struct affentry_S affentry_T;\\n// Affix entry from \\\".aff\\\" file. Used for prefixes and suffixes.\\nstruct affentry_S\\n{\\n affentry_T\\t*ae_next;\\t// next affix with same name/number\\n char_u\\t*ae_chop;\\t// text to chop off basic word (can be NULL)\\n char_u\\t*ae_add;\\t// text to add to basic word (can be NULL)\\n char_u\\t*ae_flags;\\t// flags on the affix (can be NULL)\\n char_u\\t*ae_cond;\\t// condition (NULL for \\\".\\\")\\n regprog_T\\t*ae_prog;\\t// regexp program for ae_cond or NULL\\n char\\tae_compforbid;\\t// COMPOUNDFORBIDFLAG found\\n char\\tae_comppermit;\\t// COMPOUNDPERMITFLAG found\\n};\",\n \"#define AH_KEY_LEN 17\\t\\t// 2 x 8 bytes + NUL\",\n \"// Affix header from \\\".aff\\\" file. Used for af_pref and af_suff.\\ntypedef struct affheader_S\\n{\\n char_u\\tah_key[AH_KEY_LEN]; // key for hashtab == name of affix\\n unsigned\\tah_flag;\\t// affix name as number, uses \\\"af_flagtype\\\"\\n int\\t\\tah_newID;\\t// prefix ID after renumbering; 0 if not used\\n int\\t\\tah_combine;\\t// suffix may combine with prefix\\n int\\t\\tah_follows;\\t// another affix block should be following\\n affentry_T\\t*ah_first;\\t// first affix entry\\n} affheader_T;\",\n \"#define HI2AH(hi) ((affheader_T *)(hi)->hi_key)\",\n \"// Flag used in compound items.\\ntypedef struct compitem_S\\n{\\n char_u\\tci_key[AH_KEY_LEN]; // key for hashtab == name of compound\\n unsigned\\tci_flag;\\t// affix name as number, uses \\\"af_flagtype\\\"\\n int\\t\\tci_newID;\\t// affix ID after renumbering.\\n} compitem_T;\",\n \"#define HI2CI(hi) ((compitem_T *)(hi)->hi_key)\",\n \"/*\\n * Structure that is used to store the items in the word tree. This avoids\\n * the need to keep track of each allocated thing, everything is freed all at\\n * once after \\\":mkspell\\\" is done.\\n * Note: \\\"sb_next\\\" must be just before \\\"sb_data\\\" to make sure the alignment of\\n * \\\"sb_data\\\" is correct for systems where pointers must be aligned on\\n * pointer-size boundaries and sizeof(pointer) > sizeof(int) (e.g., Sparc).\\n */\\n#define SBLOCKSIZE 16000\\t// size of sb_data\\ntypedef struct sblock_S sblock_T;\\nstruct sblock_S\\n{\\n int\\t\\tsb_used;\\t// nr of bytes already in use\\n sblock_T\\t*sb_next;\\t// next block in list\\n char_u\\tsb_data[1];\\t// data, actually longer\\n};\",\n \"/*\\n * A node in the tree.\\n */\\ntypedef struct wordnode_S wordnode_T;\\nstruct wordnode_S\\n{\\n union // shared to save space\\n {\\n\\tchar_u\\thashkey[6];\\t// the hash key, only used while compressing\\n\\tint\\tindex;\\t\\t// index in written nodes (valid after first\\n\\t\\t\\t\\t// round)\\n } wn_u1;\\n union // shared to save space\\n {\\n\\twordnode_T *next;\\t// next node with same hash key\\n\\twordnode_T *wnode;\\t// parent node that will write this node\\n } wn_u2;\\n wordnode_T\\t*wn_child;\\t// child (next byte in word)\\n wordnode_T *wn_sibling;\\t// next sibling (alternate byte in word,\\n\\t\\t\\t\\t// always sorted)\\n int\\t\\twn_refs;\\t// Nr. of references to this node. Only\\n\\t\\t\\t\\t// relevant for first node in a list of\\n\\t\\t\\t\\t// siblings, in following siblings it is\\n\\t\\t\\t\\t// always one.\\n char_u\\twn_byte;\\t// Byte for this node. NUL for word end\",\n \" // Info for when \\\"wn_byte\\\" is NUL.\\n // In PREFIXTREE \\\"wn_region\\\" is used for the prefcondnr.\\n // In the soundfolded word tree \\\"wn_flags\\\" has the MSW of the wordnr and\\n // \\\"wn_region\\\" the LSW of the wordnr.\\n char_u\\twn_affixID;\\t// supported/required prefix ID or 0\\n short_u\\twn_flags;\\t// WF_ flags\\n short\\twn_region;\\t// region mask\",\n \"#ifdef SPELL_PRINTTREE\\n int\\t\\twn_nr;\\t\\t// sequence nr for printing\\n#endif\\n};\",\n \"#define WN_MASK\\t 0xffff\\t\\t// mask relevant bits of \\\"wn_flags\\\"\",\n \"#define HI2WN(hi) (wordnode_T *)((hi)->hi_key)\",\n \"/*\\n * Info used while reading the spell files.\\n */\\ntypedef struct spellinfo_S\\n{\\n wordnode_T\\t*si_foldroot;\\t// tree with case-folded words\\n long\\tsi_foldwcount;\\t// nr of words in si_foldroot\",\n \" wordnode_T\\t*si_keeproot;\\t// tree with keep-case words\\n long\\tsi_keepwcount;\\t// nr of words in si_keeproot\",\n \" wordnode_T\\t*si_prefroot;\\t// tree with postponed prefixes\",\n \" long\\tsi_sugtree;\\t// creating the soundfolding trie\",\n \" sblock_T\\t*si_blocks;\\t// memory blocks used\\n long\\tsi_blocks_cnt;\\t// memory blocks allocated\\n int\\t\\tsi_did_emsg;\\t// TRUE when ran out of memory\",\n \" long\\tsi_compress_cnt; // words to add before lowering\\n\\t\\t\\t\\t // compression limit\\n wordnode_T\\t*si_first_free; // List of nodes that have been freed during\\n\\t\\t\\t\\t// compression, linked by \\\"wn_child\\\" field.\\n long\\tsi_free_count;\\t// number of nodes in si_first_free\\n#ifdef SPELL_PRINTTREE\\n int\\t\\tsi_wordnode_nr;\\t// sequence nr for nodes\\n#endif\\n buf_T\\t*si_spellbuf;\\t// buffer used to store soundfold word table\",\n \" int\\t\\tsi_ascii;\\t// handling only ASCII words\\n int\\t\\tsi_add;\\t\\t// addition file\\n int\\t\\tsi_clear_chartab; // when TRUE clear char tables\\n int\\t\\tsi_region;\\t// region mask\\n vimconv_T\\tsi_conv;\\t// for conversion to 'encoding'\\n int\\t\\tsi_memtot;\\t// runtime memory used\\n int\\t\\tsi_verbose;\\t// verbose messages\\n int\\t\\tsi_msg_count;\\t// number of words added since last message\\n char_u\\t*si_info;\\t// info text chars or NULL\\n int\\t\\tsi_region_count; // number of regions supported (1 when there\\n\\t\\t\\t\\t // are no regions)\\n char_u\\tsi_region_name[MAXREGIONS * 2 + 1];\\n\\t\\t\\t\\t// region names; used only if\\n\\t\\t\\t\\t// si_region_count > 1)\",\n \" garray_T\\tsi_rep;\\t\\t// list of fromto_T entries from REP lines\\n garray_T\\tsi_repsal;\\t// list of fromto_T entries from REPSAL lines\\n garray_T\\tsi_sal;\\t\\t// list of fromto_T entries from SAL lines\\n char_u\\t*si_sofofr;\\t// SOFOFROM text\\n char_u\\t*si_sofoto;\\t// SOFOTO text\\n int\\t\\tsi_nosugfile;\\t// NOSUGFILE item found\\n int\\t\\tsi_nosplitsugs;\\t// NOSPLITSUGS item found\\n int\\t\\tsi_nocompoundsugs; // NOCOMPOUNDSUGS item found\\n int\\t\\tsi_followup;\\t// soundsalike: ?\\n int\\t\\tsi_collapse;\\t// soundsalike: ?\\n hashtab_T\\tsi_commonwords;\\t// hashtable for common words\\n time_t\\tsi_sugtime;\\t// timestamp for .sug file\\n int\\t\\tsi_rem_accents;\\t// soundsalike: remove accents\\n garray_T\\tsi_map;\\t\\t// MAP info concatenated\\n char_u\\t*si_midword;\\t// MIDWORD chars or NULL\\n int\\t\\tsi_compmax;\\t// max nr of words for compounding\\n int\\t\\tsi_compminlen;\\t// minimal length for compounding\\n int\\t\\tsi_compsylmax;\\t// max nr of syllables for compounding\\n int\\t\\tsi_compoptions;\\t// COMP_ flags\\n garray_T\\tsi_comppat;\\t// CHECKCOMPOUNDPATTERN items, each stored as\\n\\t\\t\\t\\t// a string\\n char_u\\t*si_compflags;\\t// flags used for compounding\\n char_u\\tsi_nobreak;\\t// NOBREAK\\n char_u\\t*si_syllable;\\t// syllable string\\n garray_T\\tsi_prefcond;\\t// table with conditions for postponed\\n\\t\\t\\t\\t// prefixes, each stored as a string\\n int\\t\\tsi_newprefID;\\t// current value for ah_newID\\n int\\t\\tsi_newcompID;\\t// current value for compound ID\\n} spellinfo_T;\",\n \"static int is_aff_rule(char_u **items, int itemcnt, char *rulename, int\\t mincount);\\nstatic void aff_process_flags(afffile_T *affile, affentry_T *entry);\\nstatic int spell_info_item(char_u *s);\\nstatic unsigned affitem2flag(int flagtype, char_u *item, char_u\\t*fname, int lnum);\\nstatic unsigned get_affitem(int flagtype, char_u **pp);\\nstatic void process_compflags(spellinfo_T *spin, afffile_T *aff, char_u *compflags);\\nstatic void check_renumber(spellinfo_T *spin);\\nstatic void aff_check_number(int spinval, int affval, char *name);\\nstatic void aff_check_string(char_u *spinval, char_u *affval, char *name);\\nstatic int str_equal(char_u *s1, char_u\\t*s2);\\nstatic void add_fromto(spellinfo_T *spin, garray_T *gap, char_u\\t*from, char_u *to);\\nstatic int sal_to_bool(char_u *s);\\nstatic int get_affix_flags(afffile_T *affile, char_u *afflist);\\nstatic int get_pfxlist(afffile_T *affile, char_u *afflist, char_u *store_afflist);\\nstatic void get_compflags(afffile_T *affile, char_u *afflist, char_u *store_afflist);\\nstatic int store_aff_word(spellinfo_T *spin, char_u *word, char_u *afflist, afffile_T *affile, hashtab_T *ht, hashtab_T *xht, int condit, int flags, char_u *pfxlist, int pfxlen);\\nstatic void *getroom(spellinfo_T *spin, size_t len, int align);\\nstatic char_u *getroom_save(spellinfo_T *spin, char_u *s);\\nstatic int store_word(spellinfo_T *spin, char_u *word, int flags, int region, char_u *pfxlist, int need_affix);\\nstatic int tree_add_word(spellinfo_T *spin, char_u *word, wordnode_T *tree, int flags, int region, int affixID);\\nstatic wordnode_T *get_wordnode(spellinfo_T *spin);\\nstatic void free_wordnode(spellinfo_T *spin, wordnode_T *n);\\nstatic void wordtree_compress(spellinfo_T *spin, wordnode_T *root, char *name);\\nstatic long node_compress(spellinfo_T *spin, wordnode_T *node, hashtab_T *ht, long *tot);\\nstatic int node_equal(wordnode_T *n1, wordnode_T *n2);\\nstatic void clear_node(wordnode_T *node);\\nstatic int put_node(FILE *fd, wordnode_T *node, int idx, int regionmask, int prefixtree);\\nstatic int sug_filltree(spellinfo_T *spin, slang_T *slang);\\nstatic int sug_maketable(spellinfo_T *spin);\\nstatic int sug_filltable(spellinfo_T *spin, wordnode_T *node, int startwordnr, garray_T *gap);\\nstatic int offset2bytes(int nr, char_u *buf);\\nstatic void sug_write(spellinfo_T *spin, char_u *fname);\\nstatic void spell_message(spellinfo_T *spin, char_u *str);\\nstatic void init_spellfile(void);\",\n \"// In the postponed prefixes tree wn_flags is used to store the WFP_ flags,\\n// but it must be negative to indicate the prefix tree to tree_add_word().\\n// Use a negative number with the lower 8 bits zero.\\n#define PFX_FLAGS\\t(-256)\",\n \"// flags for \\\"condit\\\" argument of store_aff_word()\\n#define CONDIT_COMB\\t1\\t// affix must combine\\n#define CONDIT_CFIX\\t2\\t// affix must have CIRCUMFIX flag\\n#define CONDIT_SUF\\t4\\t// add a suffix for matching flags\\n#define CONDIT_AFF\\t8\\t// word already has an affix\",\n \"/*\\n * Tunable parameters for when the tree is compressed. Filled from the\\n * 'mkspellmem' option.\\n */\\nstatic long compress_start = 30000;\\t// memory / SBLOCKSIZE\\nstatic long compress_inc = 100;\\t\\t// memory / SBLOCKSIZE\\nstatic long compress_added = 500000;\\t// word count\",\n \"/*\\n * Check the 'mkspellmem' option. Return FAIL if it's wrong.\\n * Sets \\\"sps_flags\\\".\\n */\\n int\\nspell_check_msm(void)\\n{\\n char_u\\t*p = p_msm;\\n long\\tstart = 0;\\n long\\tincr = 0;\\n long\\tadded = 0;\",\n \" if (!VIM_ISDIGIT(*p))\\n\\treturn FAIL;\\n // block count = (value * 1024) / SBLOCKSIZE (but avoid overflow)\\n start = (getdigits(&p) * 10) / (SBLOCKSIZE / 102);\\n if (*p != ',')\\n\\treturn FAIL;\\n ++p;\\n if (!VIM_ISDIGIT(*p))\\n\\treturn FAIL;\\n incr = (getdigits(&p) * 102) / (SBLOCKSIZE / 10);\\n if (*p != ',')\\n\\treturn FAIL;\\n ++p;\\n if (!VIM_ISDIGIT(*p))\\n\\treturn FAIL;\\n added = getdigits(&p) * 1024;\\n if (*p != NUL)\\n\\treturn FAIL;\",\n \" if (start == 0 || incr == 0 || added == 0 || incr > start)\\n\\treturn FAIL;\",\n \" compress_start = start;\\n compress_inc = incr;\\n compress_added = added;\\n return OK;\\n}\",\n \"#ifdef SPELL_PRINTTREE\\n/*\\n * For debugging the tree code: print the current tree in a (more or less)\\n * readable format, so that we can see what happens when adding a word and/or\\n * compressing the tree.\\n * Based on code from Olaf Seibert.\\n */\\n#define PRINTLINESIZE\\t1000\\n#define PRINTWIDTH\\t6\",\n \"#define PRINTSOME(l, depth, fmt, a1, a2) vim_snprintf(l + depth * PRINTWIDTH, \\\\\\n\\t PRINTLINESIZE - PRINTWIDTH * depth, fmt, a1, a2)\",\n \"static char line1[PRINTLINESIZE];\\nstatic char line2[PRINTLINESIZE];\\nstatic char line3[PRINTLINESIZE];\",\n \" static void\\nspell_clear_flags(wordnode_T *node)\\n{\\n wordnode_T\\t*np;\",\n \" FOR_ALL_NODE_SIBLINGS(node, np)\\n {\\n\\tnp->wn_u1.index = FALSE;\\n\\tspell_clear_flags(np->wn_child);\\n }\\n}\",\n \" static void\\nspell_print_node(wordnode_T *node, int depth)\\n{\\n if (node->wn_u1.index)\\n {\\n\\t// Done this node before, print the reference.\\n\\tPRINTSOME(line1, depth, \\\"(%d)\\\", node->wn_nr, 0);\\n\\tPRINTSOME(line2, depth, \\\" \\\", 0, 0);\\n\\tPRINTSOME(line3, depth, \\\" \\\", 0, 0);\\n\\tmsg(line1);\\n\\tmsg(line2);\\n\\tmsg(line3);\\n }\\n else\\n {\\n\\tnode->wn_u1.index = TRUE;\",\n \"\\tif (node->wn_byte != NUL)\\n\\t{\\n\\t if (node->wn_child != NULL)\\n\\t\\tPRINTSOME(line1, depth, \\\" %c -> \\\", node->wn_byte, 0);\\n\\t else\\n\\t\\t// Cannot happen?\\n\\t\\tPRINTSOME(line1, depth, \\\" %c ???\\\", node->wn_byte, 0);\\n\\t}\\n\\telse\\n\\t PRINTSOME(line1, depth, \\\" $ \\\", 0, 0);\",\n \"\\tPRINTSOME(line2, depth, \\\"%d/%d \\\", node->wn_nr, node->wn_refs);\",\n \"\\tif (node->wn_sibling != NULL)\\n\\t PRINTSOME(line3, depth, \\\" | \\\", 0, 0);\\n\\telse\\n\\t PRINTSOME(line3, depth, \\\" \\\", 0, 0);\",\n \"\\tif (node->wn_byte == NUL)\\n\\t{\\n\\t msg(line1);\\n\\t msg(line2);\\n\\t msg(line3);\\n\\t}\",\n \"\\t// do the children\\n\\tif (node->wn_byte != NUL && node->wn_child != NULL)\\n\\t spell_print_node(node->wn_child, depth + 1);\",\n \"\\t// do the siblings\\n\\tif (node->wn_sibling != NULL)\\n\\t{\\n\\t // get rid of all parent details except |\\n\\t STRCPY(line1, line3);\\n\\t STRCPY(line2, line3);\\n\\t spell_print_node(node->wn_sibling, depth);\\n\\t}\\n }\\n}\",\n \" static void\\nspell_print_tree(wordnode_T *root)\\n{\\n if (root != NULL)\\n {\\n\\t// Clear the \\\"wn_u1.index\\\" fields, used to remember what has been\\n\\t// done.\\n\\tspell_clear_flags(root);\",\n \"\\t// Recursively print the tree.\\n\\tspell_print_node(root, 0);\\n }\\n}\\n#endif // SPELL_PRINTTREE\",\n \"/*\\n * Read the affix file \\\"fname\\\".\\n * Returns an afffile_T, NULL for complete failure.\\n */\\n static afffile_T *\\nspell_read_aff(spellinfo_T *spin, char_u *fname)\\n{\\n FILE\\t*fd;\\n afffile_T\\t*aff;\\n char_u\\trline[MAXLINELEN];\\n char_u\\t*line;\\n char_u\\t*pc = NULL;\\n#define MAXITEMCNT 30\\n char_u\\t*(items[MAXITEMCNT]);\\n int\\t\\titemcnt;\\n char_u\\t*p;\\n int\\t\\tlnum = 0;\\n affheader_T\\t*cur_aff = NULL;\\n int\\t\\tdid_postpone_prefix = FALSE;\\n int\\t\\taff_todo = 0;\\n hashtab_T\\t*tp;\\n char_u\\t*low = NULL;\\n char_u\\t*fol = NULL;\\n char_u\\t*upp = NULL;\\n int\\t\\tdo_rep;\\n int\\t\\tdo_repsal;\\n int\\t\\tdo_sal;\\n int\\t\\tdo_mapline;\\n int\\t\\tfound_map = FALSE;\\n hashitem_T\\t*hi;\\n int\\t\\tl;\\n int\\t\\tcompminlen = 0;\\t\\t// COMPOUNDMIN value\\n int\\t\\tcompsylmax = 0;\\t\\t// COMPOUNDSYLMAX value\\n int\\t\\tcompoptions = 0;\\t// COMP_ flags\\n int\\t\\tcompmax = 0;\\t\\t// COMPOUNDWORDMAX value\\n char_u\\t*compflags = NULL;\\t// COMPOUNDFLAG and COMPOUNDRULE\\n\\t\\t\\t\\t\\t// concatenated\\n char_u\\t*midword = NULL;\\t// MIDWORD value\\n char_u\\t*syllable = NULL;\\t// SYLLABLE value\\n char_u\\t*sofofrom = NULL;\\t// SOFOFROM value\\n char_u\\t*sofoto = NULL;\\t\\t// SOFOTO value\",\n \" /*\\n * Open the file.\\n */\\n fd = mch_fopen((char *)fname, \\\"r\\\");\\n if (fd == NULL)\\n {\\n\\tsemsg(_(e_cant_open_file_str), fname);\\n\\treturn NULL;\\n }\",\n \" vim_snprintf((char *)IObuff, IOSIZE, _(\\\"Reading affix file %s...\\\"), fname);\\n spell_message(spin, IObuff);\",\n \" // Only do REP lines when not done in another .aff file already.\\n do_rep = spin->si_rep.ga_len == 0;\",\n \" // Only do REPSAL lines when not done in another .aff file already.\\n do_repsal = spin->si_repsal.ga_len == 0;\",\n \" // Only do SAL lines when not done in another .aff file already.\\n do_sal = spin->si_sal.ga_len == 0;\",\n \" // Only do MAP lines when not done in another .aff file already.\\n do_mapline = spin->si_map.ga_len == 0;\",\n \" /*\\n * Allocate and init the afffile_T structure.\\n */\\n aff = (afffile_T *)getroom(spin, sizeof(afffile_T), TRUE);\\n if (aff == NULL)\\n {\\n\\tfclose(fd);\\n\\treturn NULL;\\n }\\n hash_init(&aff->af_pref);\\n hash_init(&aff->af_suff);\\n hash_init(&aff->af_comp);\",\n \" /*\\n * Read all the lines in the file one by one.\\n */\\n while (!vim_fgets(rline, MAXLINELEN, fd) && !got_int)\\n {\\n\\tline_breakcheck();\\n\\t++lnum;\",\n \"\\t// Skip comment lines.\\n\\tif (*rline == '#')\\n\\t continue;\",\n \"\\t// Convert from \\\"SET\\\" to 'encoding' when needed.\\n\\tvim_free(pc);\\n\\tif (spin->si_conv.vc_type != CONV_NONE)\\n\\t{\\n\\t pc = string_convert(&spin->si_conv, rline, NULL);\\n\\t if (pc == NULL)\\n\\t {\\n\\t\\tsmsg(_(\\\"Conversion failure for word in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t fname, lnum, rline);\\n\\t\\tcontinue;\\n\\t }\\n\\t line = pc;\\n\\t}\\n\\telse\\n\\t{\\n\\t pc = NULL;\\n\\t line = rline;\\n\\t}\",\n \"\\t// Split the line up in white separated items. Put a NUL after each\\n\\t// item.\\n\\titemcnt = 0;\\n\\tfor (p = line; ; )\\n\\t{\\n\\t while (*p != NUL && *p <= ' ') // skip white space and CR/NL\\n\\t\\t++p;\\n\\t if (*p == NUL)\\n\\t\\tbreak;\\n\\t if (itemcnt == MAXITEMCNT)\\t // too many items\\n\\t\\tbreak;\\n\\t items[itemcnt++] = p;\\n\\t // A few items have arbitrary text argument, don't split them.\\n\\t if (itemcnt == 2 && spell_info_item(items[0]))\\n\\t\\twhile (*p >= ' ' || *p == TAB) // skip until CR/NL\\n\\t\\t ++p;\\n\\t else\\n\\t\\twhile (*p > ' ') // skip until white space or CR/NL\\n\\t\\t ++p;\\n\\t if (*p == NUL)\\n\\t\\tbreak;\\n\\t *p++ = NUL;\\n\\t}\",\n \"\\t// Handle non-empty lines.\\n\\tif (itemcnt > 0)\\n\\t{\\n\\t if (is_aff_rule(items, itemcnt, \\\"SET\\\", 2) && aff->af_enc == NULL)\\n\\t {\\n\\t\\t// Setup for conversion from \\\"ENC\\\" to 'encoding'.\\n\\t\\taff->af_enc = enc_canonize(items[1]);\\n\\t\\tif (aff->af_enc != NULL && !spin->si_ascii\\n\\t\\t\\t&& convert_setup(&spin->si_conv, aff->af_enc,\\n\\t\\t\\t\\t\\t\\t\\t p_enc) == FAIL)\\n\\t\\t smsg(_(\\\"Conversion in %s not supported: from %s to %s\\\"),\\n\\t\\t\\t\\t\\t fname, aff->af_enc, p_enc);\\n\\t\\tspin->si_conv.vc_fail = TRUE;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"FLAG\\\", 2)\\n\\t\\t\\t\\t\\t && aff->af_flagtype == AFT_CHAR)\\n\\t {\\n\\t\\tif (STRCMP(items[1], \\\"long\\\") == 0)\\n\\t\\t aff->af_flagtype = AFT_LONG;\\n\\t\\telse if (STRCMP(items[1], \\\"num\\\") == 0)\\n\\t\\t aff->af_flagtype = AFT_NUM;\\n\\t\\telse if (STRCMP(items[1], \\\"caplong\\\") == 0)\\n\\t\\t aff->af_flagtype = AFT_CAPLONG;\\n\\t\\telse\\n\\t\\t smsg(_(\\\"Invalid value for FLAG in %s line %d: %s\\\"),\\n\\t\\t\\t fname, lnum, items[1]);\\n\\t\\tif (aff->af_rare != 0\\n\\t\\t\\t|| aff->af_keepcase != 0\\n\\t\\t\\t|| aff->af_bad != 0\\n\\t\\t\\t|| aff->af_needaffix != 0\\n\\t\\t\\t|| aff->af_circumfix != 0\\n\\t\\t\\t|| aff->af_needcomp != 0\\n\\t\\t\\t|| aff->af_comproot != 0\\n\\t\\t\\t|| aff->af_nosuggest != 0\\n\\t\\t\\t|| compflags != NULL\\n\\t\\t\\t|| aff->af_suff.ht_used > 0\\n\\t\\t\\t|| aff->af_pref.ht_used > 0)\\n\\t\\t smsg(_(\\\"FLAG after using flags in %s line %d: %s\\\"),\\n\\t\\t\\t fname, lnum, items[1]);\\n\\t }\\n\\t else if (spell_info_item(items[0]))\\n\\t {\\n\\t\\t p = (char_u *)getroom(spin,\\n\\t\\t\\t (spin->si_info == NULL ? 0 : STRLEN(spin->si_info))\\n\\t\\t\\t + STRLEN(items[0])\\n\\t\\t\\t + STRLEN(items[1]) + 3, FALSE);\\n\\t\\t if (p != NULL)\\n\\t\\t {\\n\\t\\t\\tif (spin->si_info != NULL)\\n\\t\\t\\t{\\n\\t\\t\\t STRCPY(p, spin->si_info);\\n\\t\\t\\t STRCAT(p, \\\"\\\\n\\\");\\n\\t\\t\\t}\\n\\t\\t\\tSTRCAT(p, items[0]);\\n\\t\\t\\tSTRCAT(p, \\\" \\\");\\n\\t\\t\\tSTRCAT(p, items[1]);\\n\\t\\t\\tspin->si_info = p;\\n\\t\\t }\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"MIDWORD\\\", 2)\\n\\t\\t\\t\\t\\t\\t\\t && midword == NULL)\\n\\t {\\n\\t\\tmidword = getroom_save(spin, items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"TRY\\\", 2))\\n\\t {\\n\\t\\t// ignored, we look in the tree for what chars may appear\\n\\t }\\n\\t // TODO: remove \\\"RAR\\\" later\\n\\t else if ((is_aff_rule(items, itemcnt, \\\"RAR\\\", 2)\\n\\t\\t\\t|| is_aff_rule(items, itemcnt, \\\"RARE\\\", 2))\\n\\t\\t\\t\\t\\t\\t\\t && aff->af_rare == 0)\\n\\t {\\n\\t\\taff->af_rare = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t }\\n\\t // TODO: remove \\\"KEP\\\" later\\n\\t else if ((is_aff_rule(items, itemcnt, \\\"KEP\\\", 2)\\n\\t\\t\\t|| is_aff_rule(items, itemcnt, \\\"KEEPCASE\\\", 2))\\n\\t\\t\\t\\t\\t\\t && aff->af_keepcase == 0)\\n\\t {\\n\\t\\taff->af_keepcase = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if ((is_aff_rule(items, itemcnt, \\\"BAD\\\", 2)\\n\\t\\t\\t|| is_aff_rule(items, itemcnt, \\\"FORBIDDENWORD\\\", 2))\\n\\t\\t\\t\\t\\t\\t\\t && aff->af_bad == 0)\\n\\t {\\n\\t\\taff->af_bad = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"NEEDAFFIX\\\", 2)\\n\\t\\t\\t\\t\\t\\t && aff->af_needaffix == 0)\\n\\t {\\n\\t\\taff->af_needaffix = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"CIRCUMFIX\\\", 2)\\n\\t\\t\\t\\t\\t\\t && aff->af_circumfix == 0)\\n\\t {\\n\\t\\taff->af_circumfix = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"NOSUGGEST\\\", 2)\\n\\t\\t\\t\\t\\t\\t && aff->af_nosuggest == 0)\\n\\t {\\n\\t\\taff->af_nosuggest = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if ((is_aff_rule(items, itemcnt, \\\"NEEDCOMPOUND\\\", 2)\\n\\t\\t\\t|| is_aff_rule(items, itemcnt, \\\"ONLYINCOMPOUND\\\", 2))\\n\\t\\t\\t\\t\\t\\t && aff->af_needcomp == 0)\\n\\t {\\n\\t\\taff->af_needcomp = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"COMPOUNDROOT\\\", 2)\\n\\t\\t\\t\\t\\t\\t && aff->af_comproot == 0)\\n\\t {\\n\\t\\taff->af_comproot = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"COMPOUNDFORBIDFLAG\\\", 2)\\n\\t\\t\\t\\t\\t\\t && aff->af_compforbid == 0)\\n\\t {\\n\\t\\taff->af_compforbid = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t\\tif (aff->af_pref.ht_used > 0)\\n\\t\\t smsg(_(\\\"Defining COMPOUNDFORBIDFLAG after PFX item may give wrong results in %s line %d\\\"),\\n\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"COMPOUNDPERMITFLAG\\\", 2)\\n\\t\\t\\t\\t\\t\\t && aff->af_comppermit == 0)\\n\\t {\\n\\t\\taff->af_comppermit = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t\\tif (aff->af_pref.ht_used > 0)\\n\\t\\t smsg(_(\\\"Defining COMPOUNDPERMITFLAG after PFX item may give wrong results in %s line %d\\\"),\\n\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"COMPOUNDFLAG\\\", 2)\\n\\t\\t\\t\\t\\t\\t\\t && compflags == NULL)\\n\\t {\\n\\t\\t// Turn flag \\\"c\\\" into COMPOUNDRULE compatible string \\\"c+\\\",\\n\\t\\t// \\\"Na\\\" into \\\"Na+\\\", \\\"1234\\\" into \\\"1234+\\\".\\n\\t\\tp = getroom(spin, STRLEN(items[1]) + 2, FALSE);\\n\\t\\tif (p != NULL)\\n\\t\\t{\\n\\t\\t STRCPY(p, items[1]);\\n\\t\\t STRCAT(p, \\\"+\\\");\\n\\t\\t compflags = p;\\n\\t\\t}\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"COMPOUNDRULES\\\", 2))\\n\\t {\\n\\t\\t// We don't use the count, but do check that it's a number and\\n\\t\\t// not COMPOUNDRULE mistyped.\\n\\t\\tif (atoi((char *)items[1]) == 0)\\n\\t\\t smsg(_(\\\"Wrong COMPOUNDRULES value in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"COMPOUNDRULE\\\", 2))\\n\\t {\\n\\t\\t// Don't use the first rule if it is a number.\\n\\t\\tif (compflags != NULL || *skipdigits(items[1]) != NUL)\\n\\t\\t{\\n\\t\\t // Concatenate this string to previously defined ones,\\n\\t\\t // using a slash to separate them.\\n\\t\\t l = (int)STRLEN(items[1]) + 1;\\n\\t\\t if (compflags != NULL)\\n\\t\\t\\tl += (int)STRLEN(compflags) + 1;\\n\\t\\t p = getroom(spin, l, FALSE);\\n\\t\\t if (p != NULL)\\n\\t\\t {\\n\\t\\t\\tif (compflags != NULL)\\n\\t\\t\\t{\\n\\t\\t\\t STRCPY(p, compflags);\\n\\t\\t\\t STRCAT(p, \\\"/\\\");\\n\\t\\t\\t}\\n\\t\\t\\tSTRCAT(p, items[1]);\\n\\t\\t\\tcompflags = p;\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"COMPOUNDWORDMAX\\\", 2)\\n\\t\\t\\t\\t\\t\\t\\t && compmax == 0)\\n\\t {\\n\\t\\tcompmax = atoi((char *)items[1]);\\n\\t\\tif (compmax == 0)\\n\\t\\t smsg(_(\\\"Wrong COMPOUNDWORDMAX value in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"COMPOUNDMIN\\\", 2)\\n\\t\\t\\t\\t\\t\\t\\t && compminlen == 0)\\n\\t {\\n\\t\\tcompminlen = atoi((char *)items[1]);\\n\\t\\tif (compminlen == 0)\\n\\t\\t smsg(_(\\\"Wrong COMPOUNDMIN value in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"COMPOUNDSYLMAX\\\", 2)\\n\\t\\t\\t\\t\\t\\t\\t && compsylmax == 0)\\n\\t {\\n\\t\\tcompsylmax = atoi((char *)items[1]);\\n\\t\\tif (compsylmax == 0)\\n\\t\\t smsg(_(\\\"Wrong COMPOUNDSYLMAX value in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"CHECKCOMPOUNDDUP\\\", 1))\\n\\t {\\n\\t\\tcompoptions |= COMP_CHECKDUP;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"CHECKCOMPOUNDREP\\\", 1))\\n\\t {\\n\\t\\tcompoptions |= COMP_CHECKREP;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"CHECKCOMPOUNDCASE\\\", 1))\\n\\t {\\n\\t\\tcompoptions |= COMP_CHECKCASE;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"CHECKCOMPOUNDTRIPLE\\\", 1))\\n\\t {\\n\\t\\tcompoptions |= COMP_CHECKTRIPLE;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"CHECKCOMPOUNDPATTERN\\\", 2))\\n\\t {\\n\\t\\tif (atoi((char *)items[1]) == 0)\\n\\t\\t smsg(_(\\\"Wrong CHECKCOMPOUNDPATTERN value in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"CHECKCOMPOUNDPATTERN\\\", 3))\\n\\t {\\n\\t\\tgarray_T *gap = &spin->si_comppat;\\n\\t\\tint\\t i;\",\n \"\\t\\t// Only add the couple if it isn't already there.\\n\\t\\tfor (i = 0; i < gap->ga_len - 1; i += 2)\\n\\t\\t if (STRCMP(((char_u **)(gap->ga_data))[i], items[1]) == 0\\n\\t\\t\\t && STRCMP(((char_u **)(gap->ga_data))[i + 1],\\n\\t\\t\\t\\t\\t\\t\\t items[2]) == 0)\\n\\t\\t\\tbreak;\\n\\t\\tif (i >= gap->ga_len && ga_grow(gap, 2) == OK)\\n\\t\\t{\\n\\t\\t ((char_u **)(gap->ga_data))[gap->ga_len++]\\n\\t\\t\\t\\t\\t = getroom_save(spin, items[1]);\\n\\t\\t ((char_u **)(gap->ga_data))[gap->ga_len++]\\n\\t\\t\\t\\t\\t = getroom_save(spin, items[2]);\\n\\t\\t}\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"SYLLABLE\\\", 2)\\n\\t\\t\\t\\t\\t\\t\\t && syllable == NULL)\\n\\t {\\n\\t\\tsyllable = getroom_save(spin, items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"NOBREAK\\\", 1))\\n\\t {\\n\\t\\tspin->si_nobreak = TRUE;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"NOSPLITSUGS\\\", 1))\\n\\t {\\n\\t\\tspin->si_nosplitsugs = TRUE;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"NOCOMPOUNDSUGS\\\", 1))\\n\\t {\\n\\t\\tspin->si_nocompoundsugs = TRUE;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"NOSUGFILE\\\", 1))\\n\\t {\\n\\t\\tspin->si_nosugfile = TRUE;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"PFXPOSTPONE\\\", 1))\\n\\t {\\n\\t\\taff->af_pfxpostpone = TRUE;\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"IGNOREEXTRA\\\", 1))\\n\\t {\\n\\t\\taff->af_ignoreextra = TRUE;\\n\\t }\\n\\t else if ((STRCMP(items[0], \\\"PFX\\\") == 0\\n\\t\\t\\t\\t\\t || STRCMP(items[0], \\\"SFX\\\") == 0)\\n\\t\\t && aff_todo == 0\\n\\t\\t && itemcnt >= 4)\\n\\t {\\n\\t\\tint\\tlasti = 4;\\n\\t\\tchar_u\\tkey[AH_KEY_LEN];\",\n \"\\t\\tif (*items[0] == 'P')\\n\\t\\t tp = &aff->af_pref;\\n\\t\\telse\\n\\t\\t tp = &aff->af_suff;\",\n \"\\t\\t// Myspell allows the same affix name to be used multiple\\n\\t\\t// times. The affix files that do this have an undocumented\\n\\t\\t// \\\"S\\\" flag on all but the last block, thus we check for that\\n\\t\\t// and store it in ah_follows.\\n\\t\\tvim_strncpy(key, items[1], AH_KEY_LEN - 1);\\n\\t\\thi = hash_find(tp, key);\\n\\t\\tif (!HASHITEM_EMPTY(hi))\\n\\t\\t{\\n\\t\\t cur_aff = HI2AH(hi);\\n\\t\\t if (cur_aff->ah_combine != (*items[2] == 'Y'))\\n\\t\\t\\tsmsg(_(\\\"Different combining flag in continued affix block in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[1]);\\n\\t\\t if (!cur_aff->ah_follows)\\n\\t\\t\\tsmsg(_(\\\"Duplicate affix in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[1]);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t // New affix letter.\\n\\t\\t cur_aff = (affheader_T *)getroom(spin,\\n\\t\\t\\t\\t\\t\\t sizeof(affheader_T), TRUE);\\n\\t\\t if (cur_aff == NULL)\\n\\t\\t\\tbreak;\\n\\t\\t cur_aff->ah_flag = affitem2flag(aff->af_flagtype, items[1],\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t\\t if (cur_aff->ah_flag == 0 || STRLEN(items[1]) >= AH_KEY_LEN)\\n\\t\\t\\tbreak;\\n\\t\\t if (cur_aff->ah_flag == aff->af_bad\\n\\t\\t\\t || cur_aff->ah_flag == aff->af_rare\\n\\t\\t\\t || cur_aff->ah_flag == aff->af_keepcase\\n\\t\\t\\t || cur_aff->ah_flag == aff->af_needaffix\\n\\t\\t\\t || cur_aff->ah_flag == aff->af_circumfix\\n\\t\\t\\t || cur_aff->ah_flag == aff->af_nosuggest\\n\\t\\t\\t || cur_aff->ah_flag == aff->af_needcomp\\n\\t\\t\\t || cur_aff->ah_flag == aff->af_comproot)\\n\\t\\t\\tsmsg(_(\\\"Affix also used for BAD/RARE/KEEPCASE/NEEDAFFIX/NEEDCOMPOUND/NOSUGGEST in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[1]);\\n\\t\\t STRCPY(cur_aff->ah_key, items[1]);\\n\\t\\t hash_add(tp, cur_aff->ah_key);\",\n \"\\t\\t cur_aff->ah_combine = (*items[2] == 'Y');\\n\\t\\t}\",\n \"\\t\\t// Check for the \\\"S\\\" flag, which apparently means that another\\n\\t\\t// block with the same affix name is following.\\n\\t\\tif (itemcnt > lasti && STRCMP(items[lasti], \\\"S\\\") == 0)\\n\\t\\t{\\n\\t\\t ++lasti;\\n\\t\\t cur_aff->ah_follows = TRUE;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t cur_aff->ah_follows = FALSE;\",\n \"\\t\\t// Myspell allows extra text after the item, but that might\\n\\t\\t// mean mistakes go unnoticed. Require a comment-starter.\\n\\t\\tif (itemcnt > lasti && *items[lasti] != '#')\\n\\t\\t smsg(_(e_afftrailing), fname, lnum, items[lasti]);\",\n \"\\t\\tif (STRCMP(items[2], \\\"Y\\\") != 0 && STRCMP(items[2], \\\"N\\\") != 0)\\n\\t\\t smsg(_(\\\"Expected Y or N in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[2]);\",\n \"\\t\\tif (*items[0] == 'P' && aff->af_pfxpostpone)\\n\\t\\t{\\n\\t\\t if (cur_aff->ah_newID == 0)\\n\\t\\t {\\n\\t\\t\\t// Use a new number in the .spl file later, to be able\\n\\t\\t\\t// to handle multiple .aff files.\\n\\t\\t\\tcheck_renumber(spin);\\n\\t\\t\\tcur_aff->ah_newID = ++spin->si_newprefID;\",\n \"\\t\\t\\t// We only really use ah_newID if the prefix is\\n\\t\\t\\t// postponed. We know that only after handling all\\n\\t\\t\\t// the items.\\n\\t\\t\\tdid_postpone_prefix = FALSE;\\n\\t\\t }\\n\\t\\t else\\n\\t\\t\\t// Did use the ID in a previous block.\\n\\t\\t\\tdid_postpone_prefix = TRUE;\\n\\t\\t}\",\n \"\\t\\taff_todo = atoi((char *)items[3]);\\n\\t }\\n\\t else if ((STRCMP(items[0], \\\"PFX\\\") == 0\\n\\t\\t\\t\\t\\t || STRCMP(items[0], \\\"SFX\\\") == 0)\\n\\t\\t && aff_todo > 0\\n\\t\\t && STRCMP(cur_aff->ah_key, items[1]) == 0\\n\\t\\t && itemcnt >= 5)\\n\\t {\\n\\t\\taffentry_T\\t*aff_entry;\\n\\t\\tint\\t\\tupper = FALSE;\\n\\t\\tint\\t\\tlasti = 5;\",\n \"\\t\\t// Myspell allows extra text after the item, but that might\\n\\t\\t// mean mistakes go unnoticed. Require a comment-starter,\\n\\t\\t// unless IGNOREEXTRA is used. Hunspell uses a \\\"-\\\" item.\\n\\t\\tif (itemcnt > lasti\\n\\t\\t\\t&& !aff->af_ignoreextra\\n\\t\\t\\t&& *items[lasti] != '#'\\n\\t\\t\\t&& (STRCMP(items[lasti], \\\"-\\\") != 0\\n\\t\\t\\t\\t\\t\\t || itemcnt != lasti + 1))\\n\\t\\t smsg(_(e_afftrailing), fname, lnum, items[lasti]);\",\n \"\\t\\t// New item for an affix letter.\\n\\t\\t--aff_todo;\\n\\t\\taff_entry = (affentry_T *)getroom(spin,\\n\\t\\t\\t\\t\\t\\t sizeof(affentry_T), TRUE);\\n\\t\\tif (aff_entry == NULL)\\n\\t\\t break;\",\n \"\\t\\tif (STRCMP(items[2], \\\"0\\\") != 0)\\n\\t\\t aff_entry->ae_chop = getroom_save(spin, items[2]);\\n\\t\\tif (STRCMP(items[3], \\\"0\\\") != 0)\\n\\t\\t{\\n\\t\\t aff_entry->ae_add = getroom_save(spin, items[3]);\",\n \"\\t\\t // Recognize flags on the affix: abcd/XYZ\\n\\t\\t aff_entry->ae_flags = vim_strchr(aff_entry->ae_add, '/');\\n\\t\\t if (aff_entry->ae_flags != NULL)\\n\\t\\t {\\n\\t\\t\\t*aff_entry->ae_flags++ = NUL;\\n\\t\\t\\taff_process_flags(aff, aff_entry);\\n\\t\\t }\\n\\t\\t}\",\n \"\\t\\t// Don't use an affix entry with non-ASCII characters when\\n\\t\\t// \\\"spin->si_ascii\\\" is TRUE.\\n\\t\\tif (!spin->si_ascii || !(has_non_ascii(aff_entry->ae_chop)\\n\\t\\t\\t\\t\\t || has_non_ascii(aff_entry->ae_add)))\\n\\t\\t{\\n\\t\\t aff_entry->ae_next = cur_aff->ah_first;\\n\\t\\t cur_aff->ah_first = aff_entry;\",\n \"\\t\\t if (STRCMP(items[4], \\\".\\\") != 0)\\n\\t\\t {\\n\\t\\t\\tchar_u\\tbuf[MAXLINELEN];\",\n \"\\t\\t\\taff_entry->ae_cond = getroom_save(spin, items[4]);\\n\\t\\t\\tif (*items[0] == 'P')\\n\\t\\t\\t sprintf((char *)buf, \\\"^%s\\\", items[4]);\\n\\t\\t\\telse\\n\\t\\t\\t sprintf((char *)buf, \\\"%s$\\\", items[4]);\\n\\t\\t\\taff_entry->ae_prog = vim_regcomp(buf,\\n\\t\\t\\t\\t\\t RE_MAGIC + RE_STRING + RE_STRICT);\\n\\t\\t\\tif (aff_entry->ae_prog == NULL)\\n\\t\\t\\t smsg(_(\\\"Broken condition in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[4]);\\n\\t\\t }\",\n \"\\t\\t // For postponed prefixes we need an entry in si_prefcond\\n\\t\\t // for the condition. Use an existing one if possible.\\n\\t\\t // Can't be done for an affix with flags, ignoring\\n\\t\\t // COMPOUNDFORBIDFLAG and COMPOUNDPERMITFLAG.\\n\\t\\t if (*items[0] == 'P' && aff->af_pfxpostpone\\n\\t\\t\\t\\t\\t && aff_entry->ae_flags == NULL)\\n\\t\\t {\\n\\t\\t\\t// When the chop string is one lower-case letter and\\n\\t\\t\\t// the add string ends in the upper-case letter we set\\n\\t\\t\\t// the \\\"upper\\\" flag, clear \\\"ae_chop\\\" and remove the\\n\\t\\t\\t// letters from \\\"ae_add\\\". The condition must either\\n\\t\\t\\t// be empty or start with the same letter.\\n\\t\\t\\tif (aff_entry->ae_chop != NULL\\n\\t\\t\\t\\t&& aff_entry->ae_add != NULL\\n\\t\\t\\t\\t&& aff_entry->ae_chop[(*mb_ptr2len)(\\n\\t\\t\\t\\t\\t\\t aff_entry->ae_chop)] == NUL)\\n\\t\\t\\t{\\n\\t\\t\\t int\\t\\tc, c_up;\",\n \"\\t\\t\\t c = PTR2CHAR(aff_entry->ae_chop);\\n\\t\\t\\t c_up = SPELL_TOUPPER(c);\\n\\t\\t\\t if (c_up != c\\n\\t\\t\\t\\t && (aff_entry->ae_cond == NULL\\n\\t\\t\\t\\t\\t|| PTR2CHAR(aff_entry->ae_cond) == c))\\n\\t\\t\\t {\\n\\t\\t\\t\\tp = aff_entry->ae_add\\n\\t\\t\\t\\t\\t\\t + STRLEN(aff_entry->ae_add);\\n\\t\\t\\t\\tMB_PTR_BACK(aff_entry->ae_add, p);\\n\\t\\t\\t\\tif (PTR2CHAR(p) == c_up)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t upper = TRUE;\\n\\t\\t\\t\\t aff_entry->ae_chop = NULL;\\n\\t\\t\\t\\t *p = NUL;\",\n \"\\t\\t\\t\\t // The condition is matched with the\\n\\t\\t\\t\\t // actual word, thus must check for the\\n\\t\\t\\t\\t // upper-case letter.\\n\\t\\t\\t\\t if (aff_entry->ae_cond != NULL)\\n\\t\\t\\t\\t {\\n\\t\\t\\t\\t\\tchar_u\\tbuf[MAXLINELEN];\",\n \"\\t\\t\\t\\t\\tif (has_mbyte)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t onecap_copy(items[4], buf, TRUE);\\n\\t\\t\\t\\t\\t aff_entry->ae_cond = getroom_save(\\n\\t\\t\\t\\t\\t\\t\\t\\t spin, buf);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t *aff_entry->ae_cond = c_up;\\n\\t\\t\\t\\t\\tif (aff_entry->ae_cond != NULL)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t sprintf((char *)buf, \\\"^%s\\\",\\n\\t\\t\\t\\t\\t\\t\\t aff_entry->ae_cond);\\n\\t\\t\\t\\t\\t vim_regfree(aff_entry->ae_prog);\\n\\t\\t\\t\\t\\t aff_entry->ae_prog = vim_regcomp(\\n\\t\\t\\t\\t\\t\\t buf, RE_MAGIC + RE_STRING);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t}\\n\\t\\t\\t }\\n\\t\\t\\t}\",\n \"\\t\\t\\tif (aff_entry->ae_chop == NULL\\n\\t\\t\\t\\t\\t && aff_entry->ae_flags == NULL)\\n\\t\\t\\t{\\n\\t\\t\\t int\\t\\tidx;\\n\\t\\t\\t char_u\\t**pp;\\n\\t\\t\\t int\\t\\tn;\",\n \"\\t\\t\\t // Find a previously used condition.\\n\\t\\t\\t for (idx = spin->si_prefcond.ga_len - 1; idx >= 0;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t--idx)\\n\\t\\t\\t {\\n\\t\\t\\t\\tp = ((char_u **)spin->si_prefcond.ga_data)[idx];\\n\\t\\t\\t\\tif (str_equal(p, aff_entry->ae_cond))\\n\\t\\t\\t\\t break;\\n\\t\\t\\t }\\n\\t\\t\\t if (idx < 0 && ga_grow(&spin->si_prefcond, 1) == OK)\\n\\t\\t\\t {\\n\\t\\t\\t\\t// Not found, add a new condition.\\n\\t\\t\\t\\tidx = spin->si_prefcond.ga_len++;\\n\\t\\t\\t\\tpp = ((char_u **)spin->si_prefcond.ga_data)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ idx;\\n\\t\\t\\t\\tif (aff_entry->ae_cond == NULL)\\n\\t\\t\\t\\t *pp = NULL;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t *pp = getroom_save(spin,\\n\\t\\t\\t\\t\\t\\t\\t aff_entry->ae_cond);\\n\\t\\t\\t }\",\n \"\\t\\t\\t // Add the prefix to the prefix tree.\\n\\t\\t\\t if (aff_entry->ae_add == NULL)\\n\\t\\t\\t\\tp = (char_u *)\\\"\\\";\\n\\t\\t\\t else\\n\\t\\t\\t\\tp = aff_entry->ae_add;\",\n \"\\t\\t\\t // PFX_FLAGS is a negative number, so that\\n\\t\\t\\t // tree_add_word() knows this is the prefix tree.\\n\\t\\t\\t n = PFX_FLAGS;\\n\\t\\t\\t if (!cur_aff->ah_combine)\\n\\t\\t\\t\\tn |= WFP_NC;\\n\\t\\t\\t if (upper)\\n\\t\\t\\t\\tn |= WFP_UP;\\n\\t\\t\\t if (aff_entry->ae_comppermit)\\n\\t\\t\\t\\tn |= WFP_COMPPERMIT;\\n\\t\\t\\t if (aff_entry->ae_compforbid)\\n\\t\\t\\t\\tn |= WFP_COMPFORBID;\\n\\t\\t\\t tree_add_word(spin, p, spin->si_prefroot, n,\\n\\t\\t\\t\\t\\t\\t idx, cur_aff->ah_newID);\\n\\t\\t\\t did_postpone_prefix = TRUE;\\n\\t\\t\\t}\",\n \"\\t\\t\\t// Didn't actually use ah_newID, backup si_newprefID.\\n\\t\\t\\tif (aff_todo == 0 && !did_postpone_prefix)\\n\\t\\t\\t{\\n\\t\\t\\t --spin->si_newprefID;\\n\\t\\t\\t cur_aff->ah_newID = 0;\\n\\t\\t\\t}\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"FOL\\\", 2) && fol == NULL)\\n\\t {\\n\\t\\tfol = vim_strsave(items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"LOW\\\", 2) && low == NULL)\\n\\t {\\n\\t\\tlow = vim_strsave(items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"UPP\\\", 2) && upp == NULL)\\n\\t {\\n\\t\\tupp = vim_strsave(items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"REP\\\", 2)\\n\\t\\t || is_aff_rule(items, itemcnt, \\\"REPSAL\\\", 2))\\n\\t {\\n\\t\\t// Ignore REP/REPSAL count\\n\\t\\tif (!isdigit(*items[1]))\\n\\t\\t smsg(_(\\\"Expected REP(SAL) count in %s line %d\\\"),\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t }\\n\\t else if ((STRCMP(items[0], \\\"REP\\\") == 0\\n\\t\\t\\t|| STRCMP(items[0], \\\"REPSAL\\\") == 0)\\n\\t\\t && itemcnt >= 3)\\n\\t {\\n\\t\\t// REP/REPSAL item\\n\\t\\t// Myspell ignores extra arguments, we require it starts with\\n\\t\\t// # to detect mistakes.\\n\\t\\tif (itemcnt > 3 && items[3][0] != '#')\\n\\t\\t smsg(_(e_afftrailing), fname, lnum, items[3]);\\n\\t\\tif (items[0][3] == 'S' ? do_repsal : do_rep)\\n\\t\\t{\\n\\t\\t // Replace underscore with space (can't include a space\\n\\t\\t // directly).\\n\\t\\t for (p = items[1]; *p != NUL; MB_PTR_ADV(p))\\n\\t\\t\\tif (*p == '_')\\n\\t\\t\\t *p = ' ';\\n\\t\\t for (p = items[2]; *p != NUL; MB_PTR_ADV(p))\\n\\t\\t\\tif (*p == '_')\\n\\t\\t\\t *p = ' ';\\n\\t\\t add_fromto(spin, items[0][3] == 'S'\\n\\t\\t\\t\\t\\t ? &spin->si_repsal\\n\\t\\t\\t\\t\\t : &spin->si_rep, items[1], items[2]);\\n\\t\\t}\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"MAP\\\", 2))\\n\\t {\\n\\t\\t// MAP item or count\\n\\t\\tif (!found_map)\\n\\t\\t{\\n\\t\\t // First line contains the count.\\n\\t\\t found_map = TRUE;\\n\\t\\t if (!isdigit(*items[1]))\\n\\t\\t\\tsmsg(_(\\\"Expected MAP count in %s line %d\\\"),\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t\\t}\\n\\t\\telse if (do_mapline)\\n\\t\\t{\\n\\t\\t int\\t\\tc;\",\n \"\\t\\t // Check that every character appears only once.\\n\\t\\t for (p = items[1]; *p != NUL; )\\n\\t\\t {\\n\\t\\t\\tc = mb_ptr2char_adv(&p);\\n\\t\\t\\tif ((spin->si_map.ga_len > 0\\n\\t\\t\\t\\t && vim_strchr(spin->si_map.ga_data, c)\\n\\t\\t\\t\\t\\t\\t\\t\\t != NULL)\\n\\t\\t\\t\\t|| vim_strchr(p, c) != NULL)\\n\\t\\t\\t smsg(_(\\\"Duplicate character in MAP in %s line %d\\\"),\\n\\t\\t\\t\\t\\t\\t\\t\\t fname, lnum);\\n\\t\\t }\",\n \"\\t\\t // We simply concatenate all the MAP strings, separated by\\n\\t\\t // slashes.\\n\\t\\t ga_concat(&spin->si_map, items[1]);\\n\\t\\t ga_append(&spin->si_map, '/');\\n\\t\\t}\\n\\t }\\n\\t // Accept \\\"SAL from to\\\" and \\\"SAL from to #comment\\\".\\n\\t else if (is_aff_rule(items, itemcnt, \\\"SAL\\\", 3))\\n\\t {\\n\\t\\tif (do_sal)\\n\\t\\t{\\n\\t\\t // SAL item (sounds-a-like)\\n\\t\\t // Either one of the known keys or a from-to pair.\\n\\t\\t if (STRCMP(items[1], \\\"followup\\\") == 0)\\n\\t\\t\\tspin->si_followup = sal_to_bool(items[2]);\\n\\t\\t else if (STRCMP(items[1], \\\"collapse_result\\\") == 0)\\n\\t\\t\\tspin->si_collapse = sal_to_bool(items[2]);\\n\\t\\t else if (STRCMP(items[1], \\\"remove_accents\\\") == 0)\\n\\t\\t\\tspin->si_rem_accents = sal_to_bool(items[2]);\\n\\t\\t else\\n\\t\\t\\t// when \\\"to\\\" is \\\"_\\\" it means empty\\n\\t\\t\\tadd_fromto(spin, &spin->si_sal, items[1],\\n\\t\\t\\t\\t STRCMP(items[2], \\\"_\\\") == 0 ? (char_u *)\\\"\\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t: items[2]);\\n\\t\\t}\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"SOFOFROM\\\", 2)\\n\\t\\t\\t\\t\\t\\t\\t && sofofrom == NULL)\\n\\t {\\n\\t\\tsofofrom = getroom_save(spin, items[1]);\\n\\t }\\n\\t else if (is_aff_rule(items, itemcnt, \\\"SOFOTO\\\", 2)\\n\\t\\t\\t\\t\\t\\t\\t && sofoto == NULL)\\n\\t {\\n\\t\\tsofoto = getroom_save(spin, items[1]);\\n\\t }\\n\\t else if (STRCMP(items[0], \\\"COMMON\\\") == 0)\\n\\t {\\n\\t\\tint\\ti;\",\n \"\\t\\tfor (i = 1; i < itemcnt; ++i)\\n\\t\\t{\\n\\t\\t if (HASHITEM_EMPTY(hash_find(&spin->si_commonwords,\\n\\t\\t\\t\\t\\t\\t\\t\\t items[i])))\\n\\t\\t {\\n\\t\\t\\tp = vim_strsave(items[i]);\\n\\t\\t\\tif (p == NULL)\\n\\t\\t\\t break;\\n\\t\\t\\thash_add(&spin->si_commonwords, p);\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t else\\n\\t\\tsmsg(_(\\\"Unrecognized or duplicate item in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, items[0]);\\n\\t}\\n }\",\n \" if (fol != NULL || low != NULL || upp != NULL)\\n {\\n\\tif (spin->si_clear_chartab)\\n\\t{\\n\\t // Clear the char type tables, don't want to use any of the\\n\\t // currently used spell properties.\\n\\t init_spell_chartab();\\n\\t spin->si_clear_chartab = FALSE;\\n\\t}\",\n \"\\t/*\\n\\t * Don't write a word table for an ASCII file, so that we don't check\\n\\t * for conflicts with a word table that matches 'encoding'.\\n\\t * Don't write one for utf-8 either, we use utf_*() and\\n\\t * mb_get_class(), the list of chars in the file will be incomplete.\\n\\t */\\n\\tif (!spin->si_ascii && !enc_utf8)\\n\\t{\\n\\t if (fol == NULL || low == NULL || upp == NULL)\\n\\t\\tsmsg(_(\\\"Missing FOL/LOW/UPP line in %s\\\"), fname);\\n\\t else\\n\\t\\t(void)set_spell_chartab(fol, low, upp);\\n\\t}\",\n \"\\tvim_free(fol);\\n\\tvim_free(low);\\n\\tvim_free(upp);\\n }\",\n \" // Use compound specifications of the .aff file for the spell info.\\n if (compmax != 0)\\n {\\n\\taff_check_number(spin->si_compmax, compmax, \\\"COMPOUNDWORDMAX\\\");\\n\\tspin->si_compmax = compmax;\\n }\",\n \" if (compminlen != 0)\\n {\\n\\taff_check_number(spin->si_compminlen, compminlen, \\\"COMPOUNDMIN\\\");\\n\\tspin->si_compminlen = compminlen;\\n }\",\n \" if (compsylmax != 0)\\n {\\n\\tif (syllable == NULL)\\n\\t smsg(_(\\\"COMPOUNDSYLMAX used without SYLLABLE\\\"));\\n\\taff_check_number(spin->si_compsylmax, compsylmax, \\\"COMPOUNDSYLMAX\\\");\\n\\tspin->si_compsylmax = compsylmax;\\n }\",\n \" if (compoptions != 0)\\n {\\n\\taff_check_number(spin->si_compoptions, compoptions, \\\"COMPOUND options\\\");\\n\\tspin->si_compoptions |= compoptions;\\n }\",\n \" if (compflags != NULL)\\n\\tprocess_compflags(spin, aff, compflags);\",\n \" // Check that we didn't use too many renumbered flags.\\n if (spin->si_newcompID < spin->si_newprefID)\\n {\\n\\tif (spin->si_newcompID == 127 || spin->si_newcompID == 255)\\n\\t msg(_(\\\"Too many postponed prefixes\\\"));\\n\\telse if (spin->si_newprefID == 0 || spin->si_newprefID == 127)\\n\\t msg(_(\\\"Too many compound flags\\\"));\\n\\telse\\n\\t msg(_(\\\"Too many postponed prefixes and/or compound flags\\\"));\\n }\",\n \" if (syllable != NULL)\\n {\\n\\taff_check_string(spin->si_syllable, syllable, \\\"SYLLABLE\\\");\\n\\tspin->si_syllable = syllable;\\n }\",\n \" if (sofofrom != NULL || sofoto != NULL)\\n {\\n\\tif (sofofrom == NULL || sofoto == NULL)\\n\\t smsg(_(\\\"Missing SOFO%s line in %s\\\"),\\n\\t\\t\\t\\t sofofrom == NULL ? \\\"FROM\\\" : \\\"TO\\\", fname);\\n\\telse if (spin->si_sal.ga_len > 0)\\n\\t smsg(_(\\\"Both SAL and SOFO lines in %s\\\"), fname);\\n\\telse\\n\\t{\\n\\t aff_check_string(spin->si_sofofr, sofofrom, \\\"SOFOFROM\\\");\\n\\t aff_check_string(spin->si_sofoto, sofoto, \\\"SOFOTO\\\");\\n\\t spin->si_sofofr = sofofrom;\\n\\t spin->si_sofoto = sofoto;\\n\\t}\\n }\",\n \" if (midword != NULL)\\n {\\n\\taff_check_string(spin->si_midword, midword, \\\"MIDWORD\\\");\\n\\tspin->si_midword = midword;\\n }\",\n \" vim_free(pc);\\n fclose(fd);\\n return aff;\\n}\",\n \"/*\\n * Return TRUE when items[0] equals \\\"rulename\\\", there are \\\"mincount\\\" items or\\n * a comment is following after item \\\"mincount\\\".\\n */\\n static int\\nis_aff_rule(\\n char_u\\t**items,\\n int\\t\\titemcnt,\\n char\\t*rulename,\\n int\\t\\tmincount)\\n{\\n return (STRCMP(items[0], rulename) == 0\\n\\t && (itemcnt == mincount\\n\\t\\t|| (itemcnt > mincount && items[mincount][0] == '#')));\\n}\",\n \"/*\\n * For affix \\\"entry\\\" move COMPOUNDFORBIDFLAG and COMPOUNDPERMITFLAG from\\n * ae_flags to ae_comppermit and ae_compforbid.\\n */\\n static void\\naff_process_flags(afffile_T *affile, affentry_T *entry)\\n{\\n char_u\\t*p;\\n char_u\\t*prevp;\\n unsigned\\tflag;\",\n \" if (entry->ae_flags != NULL\\n\\t\\t&& (affile->af_compforbid != 0 || affile->af_comppermit != 0))\\n {\\n\\tfor (p = entry->ae_flags; *p != NUL; )\\n\\t{\\n\\t prevp = p;\\n\\t flag = get_affitem(affile->af_flagtype, &p);\\n\\t if (flag == affile->af_comppermit || flag == affile->af_compforbid)\\n\\t {\\n\\t\\tSTRMOVE(prevp, p);\\n\\t\\tp = prevp;\\n\\t\\tif (flag == affile->af_comppermit)\\n\\t\\t entry->ae_comppermit = TRUE;\\n\\t\\telse\\n\\t\\t entry->ae_compforbid = TRUE;\\n\\t }\\n\\t if (affile->af_flagtype == AFT_NUM && *p == ',')\\n\\t\\t++p;\\n\\t}\\n\\tif (*entry->ae_flags == NUL)\\n\\t entry->ae_flags = NULL;\\t// nothing left\\n }\\n}\",\n \"/*\\n * Return TRUE if \\\"s\\\" is the name of an info item in the affix file.\\n */\\n static int\\nspell_info_item(char_u *s)\\n{\\n return STRCMP(s, \\\"NAME\\\") == 0\\n\\t|| STRCMP(s, \\\"HOME\\\") == 0\\n\\t|| STRCMP(s, \\\"VERSION\\\") == 0\\n\\t|| STRCMP(s, \\\"AUTHOR\\\") == 0\\n\\t|| STRCMP(s, \\\"EMAIL\\\") == 0\\n\\t|| STRCMP(s, \\\"COPYRIGHT\\\") == 0;\\n}\",\n \"/*\\n * Turn an affix flag name into a number, according to the FLAG type.\\n * returns zero for failure.\\n */\\n static unsigned\\naffitem2flag(\\n int\\t\\tflagtype,\\n char_u\\t*item,\\n char_u\\t*fname,\\n int\\t\\tlnum)\\n{\\n unsigned\\tres;\\n char_u\\t*p = item;\",\n \" res = get_affitem(flagtype, &p);\\n if (res == 0)\\n {\\n\\tif (flagtype == AFT_NUM)\\n\\t smsg(_(\\\"Flag is not a number in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t fname, lnum, item);\\n\\telse\\n\\t smsg(_(\\\"Illegal flag in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t fname, lnum, item);\\n }\\n if (*p != NUL)\\n {\\n\\tsmsg(_(e_affname), fname, lnum, item);\\n\\treturn 0;\\n }\",\n \" return res;\\n}\",\n \"/*\\n * Get one affix name from \\\"*pp\\\" and advance the pointer.\\n * Returns ZERO_FLAG for \\\"0\\\".\\n * Returns zero for an error, still advances the pointer then.\\n */\\n static unsigned\\nget_affitem(int flagtype, char_u **pp)\\n{\\n int\\t\\tres;\",\n \" if (flagtype == AFT_NUM)\\n {\\n\\tif (!VIM_ISDIGIT(**pp))\\n\\t{\\n\\t ++*pp;\\t// always advance, avoid getting stuck\\n\\t return 0;\\n\\t}\\n\\tres = getdigits(pp);\\n\\tif (res == 0)\\n\\t res = ZERO_FLAG;\\n }\\n else\\n {\\n\\tres = mb_ptr2char_adv(pp);\\n\\tif (flagtype == AFT_LONG || (flagtype == AFT_CAPLONG\\n\\t\\t\\t\\t\\t\\t && res >= 'A' && res <= 'Z'))\\n\\t{\\n\\t if (**pp == NUL)\\n\\t\\treturn 0;\\n\\t res = mb_ptr2char_adv(pp) + (res << 16);\\n\\t}\\n }\\n return res;\\n}\",\n \"/*\\n * Process the \\\"compflags\\\" string used in an affix file and append it to\\n * spin->si_compflags.\\n * The processing involves changing the affix names to ID numbers, so that\\n * they fit in one byte.\\n */\\n static void\\nprocess_compflags(\\n spellinfo_T\\t*spin,\\n afffile_T\\t*aff,\\n char_u\\t*compflags)\\n{\\n char_u\\t*p;\\n char_u\\t*prevp;\\n unsigned\\tflag;\\n compitem_T\\t*ci;\\n int\\t\\tid;\\n int\\t\\tlen;\\n char_u\\t*tp;\\n char_u\\tkey[AH_KEY_LEN];\\n hashitem_T\\t*hi;\",\n \" // Make room for the old and the new compflags, concatenated with a / in\\n // between. Processing it makes it shorter, but we don't know by how\\n // much, thus allocate the maximum.\\n len = (int)STRLEN(compflags) + 1;\\n if (spin->si_compflags != NULL)\\n\\tlen += (int)STRLEN(spin->si_compflags) + 1;\\n p = getroom(spin, len, FALSE);\\n if (p == NULL)\\n\\treturn;\\n if (spin->si_compflags != NULL)\\n {\\n\\tSTRCPY(p, spin->si_compflags);\\n\\tSTRCAT(p, \\\"/\\\");\\n }\\n spin->si_compflags = p;\\n tp = p + STRLEN(p);\",\n \" for (p = compflags; *p != NUL; )\\n {\\n\\tif (vim_strchr((char_u *)\\\"/?*+[]\\\", *p) != NULL)\\n\\t // Copy non-flag characters directly.\\n\\t *tp++ = *p++;\\n\\telse\\n\\t{\\n\\t // First get the flag number, also checks validity.\\n\\t prevp = p;\\n\\t flag = get_affitem(aff->af_flagtype, &p);\\n\\t if (flag != 0)\\n\\t {\\n\\t\\t// Find the flag in the hashtable. If it was used before, use\\n\\t\\t// the existing ID. Otherwise add a new entry.\\n\\t\\tvim_strncpy(key, prevp, p - prevp);\\n\\t\\thi = hash_find(&aff->af_comp, key);\\n\\t\\tif (!HASHITEM_EMPTY(hi))\\n\\t\\t id = HI2CI(hi)->ci_newID;\\n\\t\\telse\\n\\t\\t{\\n\\t\\t ci = (compitem_T *)getroom(spin, sizeof(compitem_T), TRUE);\\n\\t\\t if (ci == NULL)\\n\\t\\t\\tbreak;\\n\\t\\t STRCPY(ci->ci_key, key);\\n\\t\\t ci->ci_flag = flag;\\n\\t\\t // Avoid using a flag ID that has a special meaning in a\\n\\t\\t // regexp (also inside []).\\n\\t\\t do\\n\\t\\t {\\n\\t\\t\\tcheck_renumber(spin);\\n\\t\\t\\tid = spin->si_newcompID--;\\n\\t\\t } while (vim_strchr((char_u *)\\\"/?*+[]\\\\\\\\-^\\\", id) != NULL);\\n\\t\\t ci->ci_newID = id;\\n\\t\\t hash_add(&aff->af_comp, ci->ci_key);\\n\\t\\t}\\n\\t\\t*tp++ = id;\\n\\t }\\n\\t if (aff->af_flagtype == AFT_NUM && *p == ',')\\n\\t\\t++p;\\n\\t}\\n }\",\n \" *tp = NUL;\\n}\",\n \"/*\\n * Check that the new IDs for postponed affixes and compounding don't overrun\\n * each other. We have almost 255 available, but start at 0-127 to avoid\\n * using two bytes for utf-8. When the 0-127 range is used up go to 128-255.\\n * When that is used up an error message is given.\\n */\\n static void\\ncheck_renumber(spellinfo_T *spin)\\n{\\n if (spin->si_newprefID == spin->si_newcompID && spin->si_newcompID < 128)\\n {\\n\\tspin->si_newprefID = 127;\\n\\tspin->si_newcompID = 255;\\n }\\n}\",\n \"/*\\n * Return TRUE if flag \\\"flag\\\" appears in affix list \\\"afflist\\\".\\n */\\n static int\\nflag_in_afflist(int flagtype, char_u *afflist, unsigned flag)\\n{\\n char_u\\t*p;\\n unsigned\\tn;\",\n \" switch (flagtype)\\n {\\n\\tcase AFT_CHAR:\\n\\t return vim_strchr(afflist, flag) != NULL;\",\n \"\\tcase AFT_CAPLONG:\\n\\tcase AFT_LONG:\\n\\t for (p = afflist; *p != NUL; )\\n\\t {\\n\\t\\tn = mb_ptr2char_adv(&p);\\n\\t\\tif ((flagtype == AFT_LONG || (n >= 'A' && n <= 'Z'))\\n\\t\\t\\t\\t\\t\\t\\t\\t && *p != NUL)\\n\\t\\t n = mb_ptr2char_adv(&p) + (n << 16);\\n\\t\\tif (n == flag)\\n\\t\\t return TRUE;\\n\\t }\\n\\t break;\",\n \"\\tcase AFT_NUM:\\n\\t for (p = afflist; *p != NUL; )\\n\\t {\\n\\t\\tn = getdigits(&p);\\n\\t\\tif (n == 0)\\n\\t\\t n = ZERO_FLAG;\\n\\t\\tif (n == flag)\\n\\t\\t return TRUE;\\n\\t\\tif (*p != NUL)\\t// skip over comma\\n\\t\\t ++p;\\n\\t }\\n\\t break;\\n }\\n return FALSE;\\n}\",\n \"/*\\n * Give a warning when \\\"spinval\\\" and \\\"affval\\\" numbers are set and not the same.\\n */\\n static void\\naff_check_number(int spinval, int affval, char *name)\\n{\\n if (spinval != 0 && spinval != affval)\\n\\tsmsg(_(\\\"%s value differs from what is used in another .aff file\\\"), name);\\n}\",\n \"/*\\n * Give a warning when \\\"spinval\\\" and \\\"affval\\\" strings are set and not the same.\\n */\\n static void\\naff_check_string(char_u *spinval, char_u *affval, char *name)\\n{\\n if (spinval != NULL && STRCMP(spinval, affval) != 0)\\n\\tsmsg(_(\\\"%s value differs from what is used in another .aff file\\\"), name);\\n}\",\n \"/*\\n * Return TRUE if strings \\\"s1\\\" and \\\"s2\\\" are equal. Also consider both being\\n * NULL as equal.\\n */\\n static int\\nstr_equal(char_u *s1, char_u *s2)\\n{\\n if (s1 == NULL || s2 == NULL)\\n\\treturn s1 == s2;\\n return STRCMP(s1, s2) == 0;\\n}\",\n \"/*\\n * Add a from-to item to \\\"gap\\\". Used for REP and SAL items.\\n * They are stored case-folded.\\n */\\n static void\\nadd_fromto(\\n spellinfo_T\\t*spin,\\n garray_T\\t*gap,\\n char_u\\t*from,\\n char_u\\t*to)\\n{\\n fromto_T\\t*ftp;\\n char_u\\tword[MAXWLEN];\",\n \" if (ga_grow(gap, 1) == OK)\\n {\\n\\tftp = ((fromto_T *)gap->ga_data) + gap->ga_len;\\n\\t(void)spell_casefold(curwin, from, (int)STRLEN(from), word, MAXWLEN);\\n\\tftp->ft_from = getroom_save(spin, word);\\n\\t(void)spell_casefold(curwin, to, (int)STRLEN(to), word, MAXWLEN);\\n\\tftp->ft_to = getroom_save(spin, word);\\n\\t++gap->ga_len;\\n }\\n}\",\n \"/*\\n * Convert a boolean argument in a SAL line to TRUE or FALSE;\\n */\\n static int\\nsal_to_bool(char_u *s)\\n{\\n return STRCMP(s, \\\"1\\\") == 0 || STRCMP(s, \\\"true\\\") == 0;\\n}\",\n \"/*\\n * Free the structure filled by spell_read_aff().\\n */\\n static void\\nspell_free_aff(afffile_T *aff)\\n{\\n hashtab_T\\t*ht;\\n hashitem_T\\t*hi;\\n int\\t\\ttodo;\\n affheader_T\\t*ah;\\n affentry_T\\t*ae;\",\n \" vim_free(aff->af_enc);\",\n \" // All this trouble to free the \\\"ae_prog\\\" items...\\n for (ht = &aff->af_pref; ; ht = &aff->af_suff)\\n {\\n\\ttodo = (int)ht->ht_used;\\n\\tfor (hi = ht->ht_array; todo > 0; ++hi)\\n\\t{\\n\\t if (!HASHITEM_EMPTY(hi))\\n\\t {\\n\\t\\t--todo;\\n\\t\\tah = HI2AH(hi);\\n\\t\\tfor (ae = ah->ah_first; ae != NULL; ae = ae->ae_next)\\n\\t\\t vim_regfree(ae->ae_prog);\\n\\t }\\n\\t}\\n\\tif (ht == &aff->af_suff)\\n\\t break;\\n }\",\n \" hash_clear(&aff->af_pref);\\n hash_clear(&aff->af_suff);\\n hash_clear(&aff->af_comp);\\n}\",\n \"/*\\n * Read dictionary file \\\"fname\\\".\\n * Returns OK or FAIL;\\n */\\n static int\\nspell_read_dic(spellinfo_T *spin, char_u *fname, afffile_T *affile)\\n{\\n hashtab_T\\tht;\\n char_u\\tline[MAXLINELEN];\\n char_u\\t*p;\\n char_u\\t*afflist;\\n char_u\\tstore_afflist[MAXWLEN];\\n int\\t\\tpfxlen;\\n int\\t\\tneed_affix;\\n char_u\\t*dw;\\n char_u\\t*pc;\\n char_u\\t*w;\\n int\\t\\tl;\\n hash_T\\thash;\\n hashitem_T\\t*hi;\\n FILE\\t*fd;\\n int\\t\\tlnum = 1;\\n int\\t\\tnon_ascii = 0;\\n int\\t\\tretval = OK;\\n char_u\\tmessage[MAXLINELEN + MAXWLEN];\\n int\\t\\tflags;\\n int\\t\\tduplicate = 0;\\n time_T\\tlast_msg_time = 0;\",\n \" /*\\n * Open the file.\\n */\\n fd = mch_fopen((char *)fname, \\\"r\\\");\\n if (fd == NULL)\\n {\\n\\tsemsg(_(e_cant_open_file_str), fname);\\n\\treturn FAIL;\\n }\",\n \" // The hashtable is only used to detect duplicated words.\\n hash_init(&ht);\",\n \" vim_snprintf((char *)IObuff, IOSIZE,\\n\\t\\t\\t\\t _(\\\"Reading dictionary file %s...\\\"), fname);\\n spell_message(spin, IObuff);\",\n \" // start with a message for the first line\\n spin->si_msg_count = 999999;\",\n \" // Read and ignore the first line: word count.\\n if (vim_fgets(line, MAXLINELEN, fd) || !vim_isdigit(*skipwhite(line)))\\n\\tsemsg(_(e_no_word_count_in_str), fname);\",\n \" /*\\n * Read all the lines in the file one by one.\\n * The words are converted to 'encoding' here, before being added to\\n * the hashtable.\\n */\\n while (!vim_fgets(line, MAXLINELEN, fd) && !got_int)\\n {\\n\\tline_breakcheck();\\n\\t++lnum;\\n\\tif (line[0] == '#' || line[0] == '/')\\n\\t continue;\\t// comment line\",\n \"\\t// Remove CR, LF and white space from the end. White space halfway\\n\\t// the word is kept to allow e.g., \\\"et al.\\\".\\n\\tl = (int)STRLEN(line);\\n\\twhile (l > 0 && line[l - 1] <= ' ')\\n\\t --l;\\n\\tif (l == 0)\\n\\t continue;\\t// empty line\\n\\tline[l] = NUL;\",\n \"\\t// Convert from \\\"SET\\\" to 'encoding' when needed.\\n\\tif (spin->si_conv.vc_type != CONV_NONE)\\n\\t{\\n\\t pc = string_convert(&spin->si_conv, line, NULL);\\n\\t if (pc == NULL)\\n\\t {\\n\\t\\tsmsg(_(\\\"Conversion failure for word in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, line);\\n\\t\\tcontinue;\\n\\t }\\n\\t w = pc;\\n\\t}\\n\\telse\\n\\t{\\n\\t pc = NULL;\\n\\t w = line;\\n\\t}\",\n \"\\t// Truncate the word at the \\\"/\\\", set \\\"afflist\\\" to what follows.\\n\\t// Replace \\\"\\\\/\\\" by \\\"/\\\" and \\\"\\\\\\\\\\\" by \\\"\\\\\\\".\\n\\tafflist = NULL;\\n\\tfor (p = w; *p != NUL; MB_PTR_ADV(p))\\n\\t{\\n\\t if (*p == '\\\\\\\\' && (p[1] == '\\\\\\\\' || p[1] == '/'))\\n\\t\\tSTRMOVE(p, p + 1);\\n\\t else if (*p == '/')\\n\\t {\\n\\t\\t*p = NUL;\\n\\t\\tafflist = p + 1;\\n\\t\\tbreak;\\n\\t }\\n\\t}\",\n \"\\t// Skip non-ASCII words when \\\"spin->si_ascii\\\" is TRUE.\\n\\tif (spin->si_ascii && has_non_ascii(w))\\n\\t{\\n\\t ++non_ascii;\\n\\t vim_free(pc);\\n\\t continue;\\n\\t}\",\n \"\\t// This takes time, print a message every 10000 words, but not more\\n\\t// often than once per second.\\n\\tif (spin->si_verbose && spin->si_msg_count > 10000)\\n\\t{\\n\\t spin->si_msg_count = 0;\\n\\t if (vim_time() > last_msg_time)\\n\\t {\\n\\t\\tlast_msg_time = vim_time();\\n\\t\\tvim_snprintf((char *)message, sizeof(message),\\n\\t\\t\\t_(\\\"line %6d, word %6ld - %s\\\"),\\n\\t\\t\\t lnum, spin->si_foldwcount + spin->si_keepwcount, w);\\n\\t\\tmsg_start();\\n\\t\\tmsg_outtrans_long_attr(message, 0);\\n\\t\\tmsg_clr_eos();\\n\\t\\tmsg_didout = FALSE;\\n\\t\\tmsg_col = 0;\\n\\t\\tout_flush();\\n\\t }\\n\\t}\",\n \"\\t// Store the word in the hashtable to be able to find duplicates.\\n\\tdw = getroom_save(spin, w);\\n\\tif (dw == NULL)\\n\\t{\\n\\t retval = FAIL;\\n\\t vim_free(pc);\\n\\t break;\\n\\t}\",\n \"\\thash = hash_hash(dw);\\n\\thi = hash_lookup(&ht, dw, hash);\\n\\tif (!HASHITEM_EMPTY(hi))\\n\\t{\\n\\t if (p_verbose > 0)\\n\\t\\tsmsg(_(\\\"Duplicate word in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t fname, lnum, dw);\\n\\t else if (duplicate == 0)\\n\\t\\tsmsg(_(\\\"First duplicate word in %s line %d: %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t fname, lnum, dw);\\n\\t ++duplicate;\\n\\t}\\n\\telse\\n\\t hash_add_item(&ht, hi, dw, hash);\",\n \"\\tflags = 0;\\n\\tstore_afflist[0] = NUL;\\n\\tpfxlen = 0;\\n\\tneed_affix = FALSE;\\n\\tif (afflist != NULL)\\n\\t{\\n\\t // Extract flags from the affix list.\\n\\t flags |= get_affix_flags(affile, afflist);\",\n \"\\t if (affile->af_needaffix != 0 && flag_in_afflist(\\n\\t\\t\\t affile->af_flagtype, afflist, affile->af_needaffix))\\n\\t\\tneed_affix = TRUE;\",\n \"\\t if (affile->af_pfxpostpone)\\n\\t\\t// Need to store the list of prefix IDs with the word.\\n\\t\\tpfxlen = get_pfxlist(affile, afflist, store_afflist);\",\n \"\\t if (spin->si_compflags != NULL)\\n\\t\\t// Need to store the list of compound flags with the word.\\n\\t\\t// Concatenate them to the list of prefix IDs.\\n\\t\\tget_compflags(affile, afflist, store_afflist + pfxlen);\\n\\t}\",\n \"\\t// Add the word to the word tree(s).\\n\\tif (store_word(spin, dw, flags, spin->si_region,\\n\\t\\t\\t\\t\\t store_afflist, need_affix) == FAIL)\\n\\t retval = FAIL;\",\n \"\\tif (afflist != NULL)\\n\\t{\\n\\t // Find all matching suffixes and add the resulting words.\\n\\t // Additionally do matching prefixes that combine.\\n\\t if (store_aff_word(spin, dw, afflist, affile,\\n\\t\\t\\t &affile->af_suff, &affile->af_pref,\\n\\t\\t\\t CONDIT_SUF, flags, store_afflist, pfxlen) == FAIL)\\n\\t\\tretval = FAIL;\",\n \"\\t // Find all matching prefixes and add the resulting words.\\n\\t if (store_aff_word(spin, dw, afflist, affile,\\n\\t\\t\\t &affile->af_pref, NULL,\\n\\t\\t\\t CONDIT_SUF, flags, store_afflist, pfxlen) == FAIL)\\n\\t\\tretval = FAIL;\\n\\t}\",\n \"\\tvim_free(pc);\\n }\",\n \" if (duplicate > 0)\\n\\tsmsg(_(\\\"%d duplicate word(s) in %s\\\"), duplicate, fname);\\n if (spin->si_ascii && non_ascii > 0)\\n\\tsmsg(_(\\\"Ignored %d word(s) with non-ASCII characters in %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t non_ascii, fname);\\n hash_clear(&ht);\",\n \" fclose(fd);\\n return retval;\\n}\",\n \"/*\\n * Check for affix flags in \\\"afflist\\\" that are turned into word flags.\\n * Return WF_ flags.\\n */\\n static int\\nget_affix_flags(afffile_T *affile, char_u *afflist)\\n{\\n int\\t\\tflags = 0;\",\n \" if (affile->af_keepcase != 0 && flag_in_afflist(\\n\\t\\t\\t affile->af_flagtype, afflist, affile->af_keepcase))\\n\\tflags |= WF_KEEPCAP | WF_FIXCAP;\\n if (affile->af_rare != 0 && flag_in_afflist(\\n\\t\\t\\t affile->af_flagtype, afflist, affile->af_rare))\\n\\tflags |= WF_RARE;\\n if (affile->af_bad != 0 && flag_in_afflist(\\n\\t\\t\\t\\taffile->af_flagtype, afflist, affile->af_bad))\\n\\tflags |= WF_BANNED;\\n if (affile->af_needcomp != 0 && flag_in_afflist(\\n\\t\\t\\t affile->af_flagtype, afflist, affile->af_needcomp))\\n\\tflags |= WF_NEEDCOMP;\\n if (affile->af_comproot != 0 && flag_in_afflist(\\n\\t\\t\\t affile->af_flagtype, afflist, affile->af_comproot))\\n\\tflags |= WF_COMPROOT;\\n if (affile->af_nosuggest != 0 && flag_in_afflist(\\n\\t\\t\\t affile->af_flagtype, afflist, affile->af_nosuggest))\\n\\tflags |= WF_NOSUGGEST;\\n return flags;\\n}\",\n \"/*\\n * Get the list of prefix IDs from the affix list \\\"afflist\\\".\\n * Used for PFXPOSTPONE.\\n * Put the resulting flags in \\\"store_afflist[MAXWLEN]\\\" with a terminating NUL\\n * and return the number of affixes.\\n */\\n static int\\nget_pfxlist(\\n afffile_T\\t*affile,\\n char_u\\t*afflist,\\n char_u\\t*store_afflist)\\n{\\n char_u\\t*p;\\n char_u\\t*prevp;\\n int\\t\\tcnt = 0;\\n int\\t\\tid;\\n char_u\\tkey[AH_KEY_LEN];\\n hashitem_T\\t*hi;\",\n \" for (p = afflist; *p != NUL; )\\n {\\n\\tprevp = p;\\n\\tif (get_affitem(affile->af_flagtype, &p) != 0)\\n\\t{\\n\\t // A flag is a postponed prefix flag if it appears in \\\"af_pref\\\"\\n\\t // and its ID is not zero.\\n\\t vim_strncpy(key, prevp, p - prevp);\\n\\t hi = hash_find(&affile->af_pref, key);\\n\\t if (!HASHITEM_EMPTY(hi))\\n\\t {\\n\\t\\tid = HI2AH(hi)->ah_newID;\\n\\t\\tif (id != 0)\\n\\t\\t store_afflist[cnt++] = id;\\n\\t }\\n\\t}\\n\\tif (affile->af_flagtype == AFT_NUM && *p == ',')\\n\\t ++p;\\n }\",\n \" store_afflist[cnt] = NUL;\\n return cnt;\\n}\",\n \"/*\\n * Get the list of compound IDs from the affix list \\\"afflist\\\" that are used\\n * for compound words.\\n * Puts the flags in \\\"store_afflist[]\\\".\\n */\\n static void\\nget_compflags(\\n afffile_T\\t*affile,\\n char_u\\t*afflist,\\n char_u\\t*store_afflist)\\n{\\n char_u\\t*p;\\n char_u\\t*prevp;\\n int\\t\\tcnt = 0;\\n char_u\\tkey[AH_KEY_LEN];\\n hashitem_T\\t*hi;\",\n \" for (p = afflist; *p != NUL; )\\n {\\n\\tprevp = p;\\n\\tif (get_affitem(affile->af_flagtype, &p) != 0)\\n\\t{\\n\\t // A flag is a compound flag if it appears in \\\"af_comp\\\".\\n\\t vim_strncpy(key, prevp, p - prevp);\\n\\t hi = hash_find(&affile->af_comp, key);\\n\\t if (!HASHITEM_EMPTY(hi))\\n\\t\\tstore_afflist[cnt++] = HI2CI(hi)->ci_newID;\\n\\t}\\n\\tif (affile->af_flagtype == AFT_NUM && *p == ',')\\n\\t ++p;\\n }\",\n \" store_afflist[cnt] = NUL;\\n}\",\n \"/*\\n * Apply affixes to a word and store the resulting words.\\n * \\\"ht\\\" is the hashtable with affentry_T that need to be applied, either\\n * prefixes or suffixes.\\n * \\\"xht\\\", when not NULL, is the prefix hashtable, to be used additionally on\\n * the resulting words for combining affixes.\\n *\\n * Returns FAIL when out of memory.\\n */\\n static int\\nstore_aff_word(\\n spellinfo_T\\t*spin,\\t\\t// spell info\\n char_u\\t*word,\\t\\t// basic word start\\n char_u\\t*afflist,\\t// list of names of supported affixes\\n afffile_T\\t*affile,\\n hashtab_T\\t*ht,\\n hashtab_T\\t*xht,\\n int\\t\\tcondit,\\t\\t// CONDIT_SUF et al.\\n int\\t\\tflags,\\t\\t// flags for the word\\n char_u\\t*pfxlist,\\t// list of prefix IDs\\n int\\t\\tpfxlen)\\t\\t// nr of flags in \\\"pfxlist\\\" for prefixes, rest\\n\\t\\t\\t\\t// is compound flags\\n{\\n int\\t\\ttodo;\\n hashitem_T\\t*hi;\\n affheader_T\\t*ah;\\n affentry_T\\t*ae;\\n char_u\\tnewword[MAXWLEN];\\n int\\t\\tretval = OK;\\n int\\t\\ti, j;\\n char_u\\t*p;\\n int\\t\\tuse_flags;\\n char_u\\t*use_pfxlist;\\n int\\t\\tuse_pfxlen;\\n int\\t\\tneed_affix;\\n char_u\\tstore_afflist[MAXWLEN];\\n char_u\\tpfx_pfxlist[MAXWLEN];\\n size_t\\twordlen = STRLEN(word);\\n int\\t\\tuse_condit;\",\n \" todo = (int)ht->ht_used;\\n for (hi = ht->ht_array; todo > 0 && retval == OK; ++hi)\\n {\\n\\tif (!HASHITEM_EMPTY(hi))\\n\\t{\\n\\t --todo;\\n\\t ah = HI2AH(hi);\",\n \"\\t // Check that the affix combines, if required, and that the word\\n\\t // supports this affix.\\n\\t if (((condit & CONDIT_COMB) == 0 || ah->ah_combine)\\n\\t\\t && flag_in_afflist(affile->af_flagtype, afflist,\\n\\t\\t\\t\\t\\t\\t\\t\\t ah->ah_flag))\\n\\t {\\n\\t\\t// Loop over all affix entries with this name.\\n\\t\\tfor (ae = ah->ah_first; ae != NULL; ae = ae->ae_next)\\n\\t\\t{\\n\\t\\t // Check the condition. It's not logical to match case\\n\\t\\t // here, but it is required for compatibility with\\n\\t\\t // Myspell.\\n\\t\\t // Another requirement from Myspell is that the chop\\n\\t\\t // string is shorter than the word itself.\\n\\t\\t // For prefixes, when \\\"PFXPOSTPONE\\\" was used, only do\\n\\t\\t // prefixes with a chop string and/or flags.\\n\\t\\t // When a previously added affix had CIRCUMFIX this one\\n\\t\\t // must have it too, if it had not then this one must not\\n\\t\\t // have one either.\\n\\t\\t if ((xht != NULL || !affile->af_pfxpostpone\\n\\t\\t\\t\\t|| ae->ae_chop != NULL\\n\\t\\t\\t\\t|| ae->ae_flags != NULL)\\n\\t\\t\\t && (ae->ae_chop == NULL\\n\\t\\t\\t\\t|| STRLEN(ae->ae_chop) < wordlen)\\n\\t\\t\\t && (ae->ae_prog == NULL\\n\\t\\t\\t\\t|| vim_regexec_prog(&ae->ae_prog, FALSE,\\n\\t\\t\\t\\t\\t\\t\\t word, (colnr_T)0))\\n\\t\\t\\t && (((condit & CONDIT_CFIX) == 0)\\n\\t\\t\\t\\t== ((condit & CONDIT_AFF) == 0\\n\\t\\t\\t\\t || ae->ae_flags == NULL\\n\\t\\t\\t\\t || !flag_in_afflist(affile->af_flagtype,\\n\\t\\t\\t\\t\\tae->ae_flags, affile->af_circumfix))))\\n\\t\\t {\\n\\t\\t\\t// Match. Remove the chop and add the affix.\\n\\t\\t\\tif (xht == NULL)\\n\\t\\t\\t{\\n\\t\\t\\t // prefix: chop/add at the start of the word\\n\\t\\t\\t if (ae->ae_add == NULL)\\n\\t\\t\\t\\t*newword = NUL;\\n\\t\\t\\t else\\n\\t\\t\\t\\tvim_strncpy(newword, ae->ae_add, MAXWLEN - 1);\\n\\t\\t\\t p = word;\\n\\t\\t\\t if (ae->ae_chop != NULL)\\n\\t\\t\\t {\\n\\t\\t\\t\\t// Skip chop string.\\n\\t\\t\\t\\tif (has_mbyte)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t i = mb_charlen(ae->ae_chop);\\n\\t\\t\\t\\t for ( ; i > 0; --i)\\n\\t\\t\\t\\t\\tMB_PTR_ADV(p);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t p += STRLEN(ae->ae_chop);\\n\\t\\t\\t }\\n\\t\\t\\t STRCAT(newword, p);\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t // suffix: chop/add at the end of the word\\n\\t\\t\\t vim_strncpy(newword, word, MAXWLEN - 1);\\n\\t\\t\\t if (ae->ae_chop != NULL)\\n\\t\\t\\t {\\n\\t\\t\\t\\t// Remove chop string.\\n\\t\\t\\t\\tp = newword + STRLEN(newword);\\n\\t\\t\\t\\ti = (int)MB_CHARLEN(ae->ae_chop);\\n\\t\\t\\t\\tfor ( ; i > 0; --i)\\n\\t\\t\\t\\t MB_PTR_BACK(newword, p);\\n\\t\\t\\t\\t*p = NUL;\\n\\t\\t\\t }\\n\\t\\t\\t if (ae->ae_add != NULL)\\n\\t\\t\\t\\tSTRCAT(newword, ae->ae_add);\\n\\t\\t\\t}\",\n \"\\t\\t\\tuse_flags = flags;\\n\\t\\t\\tuse_pfxlist = pfxlist;\\n\\t\\t\\tuse_pfxlen = pfxlen;\\n\\t\\t\\tneed_affix = FALSE;\\n\\t\\t\\tuse_condit = condit | CONDIT_COMB | CONDIT_AFF;\\n\\t\\t\\tif (ae->ae_flags != NULL)\\n\\t\\t\\t{\\n\\t\\t\\t // Extract flags from the affix list.\\n\\t\\t\\t use_flags |= get_affix_flags(affile, ae->ae_flags);\",\n \"\\t\\t\\t if (affile->af_needaffix != 0 && flag_in_afflist(\\n\\t\\t\\t\\t\\taffile->af_flagtype, ae->ae_flags,\\n\\t\\t\\t\\t\\t\\t\\taffile->af_needaffix))\\n\\t\\t\\t\\tneed_affix = TRUE;\",\n \"\\t\\t\\t // When there is a CIRCUMFIX flag the other affix\\n\\t\\t\\t // must also have it and we don't add the word\\n\\t\\t\\t // with one affix.\\n\\t\\t\\t if (affile->af_circumfix != 0 && flag_in_afflist(\\n\\t\\t\\t\\t\\taffile->af_flagtype, ae->ae_flags,\\n\\t\\t\\t\\t\\t\\t\\taffile->af_circumfix))\\n\\t\\t\\t {\\n\\t\\t\\t\\tuse_condit |= CONDIT_CFIX;\\n\\t\\t\\t\\tif ((condit & CONDIT_CFIX) == 0)\\n\\t\\t\\t\\t need_affix = TRUE;\\n\\t\\t\\t }\",\n \"\\t\\t\\t if (affile->af_pfxpostpone\\n\\t\\t\\t\\t\\t\\t|| spin->si_compflags != NULL)\\n\\t\\t\\t {\\n\\t\\t\\t\\tif (affile->af_pfxpostpone)\\n\\t\\t\\t\\t // Get prefix IDS from the affix list.\\n\\t\\t\\t\\t use_pfxlen = get_pfxlist(affile,\\n\\t\\t\\t\\t\\t\\t ae->ae_flags, store_afflist);\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t use_pfxlen = 0;\\n\\t\\t\\t\\tuse_pfxlist = store_afflist;\",\n \"\\t\\t\\t\\t// Combine the prefix IDs. Avoid adding the\\n\\t\\t\\t\\t// same ID twice.\\n\\t\\t\\t\\tfor (i = 0; i < pfxlen; ++i)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t for (j = 0; j < use_pfxlen; ++j)\\n\\t\\t\\t\\t\\tif (pfxlist[i] == use_pfxlist[j])\\n\\t\\t\\t\\t\\t break;\\n\\t\\t\\t\\t if (j == use_pfxlen)\\n\\t\\t\\t\\t\\tuse_pfxlist[use_pfxlen++] = pfxlist[i];\\n\\t\\t\\t\\t}\",\n \"\\t\\t\\t\\tif (spin->si_compflags != NULL)\\n\\t\\t\\t\\t // Get compound IDS from the affix list.\\n\\t\\t\\t\\t get_compflags(affile, ae->ae_flags,\\n\\t\\t\\t\\t\\t\\t use_pfxlist + use_pfxlen);\",\n \"\\t\\t\\t\\t// Combine the list of compound flags.\\n\\t\\t\\t\\t// Concatenate them to the prefix IDs list.\\n\\t\\t\\t\\t// Avoid adding the same ID twice.\\n\\t\\t\\t\\tfor (i = pfxlen; pfxlist[i] != NUL; ++i)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t for (j = use_pfxlen;\\n\\t\\t\\t\\t\\t\\t use_pfxlist[j] != NUL; ++j)\\n\\t\\t\\t\\t\\tif (pfxlist[i] == use_pfxlist[j])\\n\\t\\t\\t\\t\\t break;\\n\\t\\t\\t\\t if (use_pfxlist[j] == NUL)\\n\\t\\t\\t\\t {\\n\\t\\t\\t\\t\\tuse_pfxlist[j++] = pfxlist[i];\\n\\t\\t\\t\\t\\tuse_pfxlist[j] = NUL;\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t}\\n\\t\\t\\t }\\n\\t\\t\\t}\",\n \"\\t\\t\\t// Obey a \\\"COMPOUNDFORBIDFLAG\\\" of the affix: don't\\n\\t\\t\\t// use the compound flags.\\n\\t\\t\\tif (use_pfxlist != NULL && ae->ae_compforbid)\\n\\t\\t\\t{\\n\\t\\t\\t vim_strncpy(pfx_pfxlist, use_pfxlist, use_pfxlen);\\n\\t\\t\\t use_pfxlist = pfx_pfxlist;\\n\\t\\t\\t}\",\n \"\\t\\t\\t// When there are postponed prefixes...\\n\\t\\t\\tif (spin->si_prefroot != NULL\\n\\t\\t\\t\\t&& spin->si_prefroot->wn_sibling != NULL)\\n\\t\\t\\t{\\n\\t\\t\\t // ... add a flag to indicate an affix was used.\\n\\t\\t\\t use_flags |= WF_HAS_AFF;\",\n \"\\t\\t\\t // ... don't use a prefix list if combining\\n\\t\\t\\t // affixes is not allowed. But do use the\\n\\t\\t\\t // compound flags after them.\\n\\t\\t\\t if (!ah->ah_combine && use_pfxlist != NULL)\\n\\t\\t\\t\\tuse_pfxlist += use_pfxlen;\\n\\t\\t\\t}\",\n \"\\t\\t\\t// When compounding is supported and there is no\\n\\t\\t\\t// \\\"COMPOUNDPERMITFLAG\\\" then forbid compounding on the\\n\\t\\t\\t// side where the affix is applied.\\n\\t\\t\\tif (spin->si_compflags != NULL && !ae->ae_comppermit)\\n\\t\\t\\t{\\n\\t\\t\\t if (xht != NULL)\\n\\t\\t\\t\\tuse_flags |= WF_NOCOMPAFT;\\n\\t\\t\\t else\\n\\t\\t\\t\\tuse_flags |= WF_NOCOMPBEF;\\n\\t\\t\\t}\",\n \"\\t\\t\\t// Store the modified word.\\n\\t\\t\\tif (store_word(spin, newword, use_flags,\\n\\t\\t\\t\\t\\t\\t spin->si_region, use_pfxlist,\\n\\t\\t\\t\\t\\t\\t\\t need_affix) == FAIL)\\n\\t\\t\\t retval = FAIL;\",\n \"\\t\\t\\t// When added a prefix or a first suffix and the affix\\n\\t\\t\\t// has flags may add a(nother) suffix. RECURSIVE!\\n\\t\\t\\tif ((condit & CONDIT_SUF) && ae->ae_flags != NULL)\\n\\t\\t\\t if (store_aff_word(spin, newword, ae->ae_flags,\\n\\t\\t\\t\\t\\taffile, &affile->af_suff, xht,\\n\\t\\t\\t\\t\\t use_condit & (xht == NULL\\n\\t\\t\\t\\t\\t\\t\\t? ~0 : ~CONDIT_SUF),\\n\\t\\t\\t\\t use_flags, use_pfxlist, pfxlen) == FAIL)\\n\\t\\t\\t\\tretval = FAIL;\",\n \"\\t\\t\\t// When added a suffix and combining is allowed also\\n\\t\\t\\t// try adding a prefix additionally. Both for the\\n\\t\\t\\t// word flags and for the affix flags. RECURSIVE!\\n\\t\\t\\tif (xht != NULL && ah->ah_combine)\\n\\t\\t\\t{\\n\\t\\t\\t if (store_aff_word(spin, newword,\\n\\t\\t\\t\\t\\tafflist, affile,\\n\\t\\t\\t\\t\\txht, NULL, use_condit,\\n\\t\\t\\t\\t\\tuse_flags, use_pfxlist,\\n\\t\\t\\t\\t\\tpfxlen) == FAIL\\n\\t\\t\\t\\t || (ae->ae_flags != NULL\\n\\t\\t\\t\\t\\t&& store_aff_word(spin, newword,\\n\\t\\t\\t\\t\\t ae->ae_flags, affile,\\n\\t\\t\\t\\t\\t xht, NULL, use_condit,\\n\\t\\t\\t\\t\\t use_flags, use_pfxlist,\\n\\t\\t\\t\\t\\t pfxlen) == FAIL))\\n\\t\\t\\t\\tretval = FAIL;\\n\\t\\t\\t}\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t}\\n }\",\n \" return retval;\\n}\",\n \"/*\\n * Read a file with a list of words.\\n */\\n static int\\nspell_read_wordfile(spellinfo_T *spin, char_u *fname)\\n{\\n FILE\\t*fd;\\n long\\tlnum = 0;\\n char_u\\trline[MAXLINELEN];\\n char_u\\t*line;\\n char_u\\t*pc = NULL;\\n char_u\\t*p;\\n int\\t\\tl;\\n int\\t\\tretval = OK;\\n int\\t\\tdid_word = FALSE;\\n int\\t\\tnon_ascii = 0;\\n int\\t\\tflags;\\n int\\t\\tregionmask;\",\n \" /*\\n * Open the file.\\n */\\n fd = mch_fopen((char *)fname, \\\"r\\\");\\n if (fd == NULL)\\n {\\n\\tsemsg(_(e_cant_open_file_str), fname);\\n\\treturn FAIL;\\n }\",\n \" vim_snprintf((char *)IObuff, IOSIZE, _(\\\"Reading word file %s...\\\"), fname);\\n spell_message(spin, IObuff);\",\n \" /*\\n * Read all the lines in the file one by one.\\n */\\n while (!vim_fgets(rline, MAXLINELEN, fd) && !got_int)\\n {\\n\\tline_breakcheck();\\n\\t++lnum;\",\n \"\\t// Skip comment lines.\\n\\tif (*rline == '#')\\n\\t continue;\",\n \"\\t// Remove CR, LF and white space from the end.\\n\\tl = (int)STRLEN(rline);\\n\\twhile (l > 0 && rline[l - 1] <= ' ')\\n\\t --l;\\n\\tif (l == 0)\\n\\t continue;\\t// empty or blank line\\n\\trline[l] = NUL;\",\n \"\\t// Convert from \\\"/encoding={encoding}\\\" to 'encoding' when needed.\\n\\tvim_free(pc);\\n\\tif (spin->si_conv.vc_type != CONV_NONE)\\n\\t{\\n\\t pc = string_convert(&spin->si_conv, rline, NULL);\\n\\t if (pc == NULL)\\n\\t {\\n\\t\\tsmsg(_(\\\"Conversion failure for word in %s line %ld: %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t fname, lnum, rline);\\n\\t\\tcontinue;\\n\\t }\\n\\t line = pc;\\n\\t}\\n\\telse\\n\\t{\\n\\t pc = NULL;\\n\\t line = rline;\\n\\t}\",\n \"\\tif (*line == '/')\\n\\t{\\n\\t ++line;\\n\\t if (STRNCMP(line, \\\"encoding=\\\", 9) == 0)\\n\\t {\\n\\t\\tif (spin->si_conv.vc_type != CONV_NONE)\\n\\t\\t smsg(_(\\\"Duplicate /encoding= line ignored in %s line %ld: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, line - 1);\\n\\t\\telse if (did_word)\\n\\t\\t smsg(_(\\\"/encoding= line after word ignored in %s line %ld: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, line - 1);\\n\\t\\telse\\n\\t\\t{\\n\\t\\t char_u\\t*enc;\",\n \"\\t\\t // Setup for conversion to 'encoding'.\\n\\t\\t line += 9;\\n\\t\\t enc = enc_canonize(line);\\n\\t\\t if (enc != NULL && !spin->si_ascii\\n\\t\\t\\t && convert_setup(&spin->si_conv, enc,\\n\\t\\t\\t\\t\\t\\t\\t p_enc) == FAIL)\\n\\t\\t\\tsmsg(_(\\\"Conversion in %s not supported: from %s to %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t fname, line, p_enc);\\n\\t\\t vim_free(enc);\\n\\t\\t spin->si_conv.vc_fail = TRUE;\\n\\t\\t}\\n\\t\\tcontinue;\\n\\t }\",\n \"\\t if (STRNCMP(line, \\\"regions=\\\", 8) == 0)\\n\\t {\\n\\t\\tif (spin->si_region_count > 1)\\n\\t\\t smsg(_(\\\"Duplicate /regions= line ignored in %s line %ld: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, line);\\n\\t\\telse\\n\\t\\t{\\n\\t\\t line += 8;\\n\\t\\t if (STRLEN(line) > MAXREGIONS * 2)\\n\\t\\t\\tsmsg(_(\\\"Too many regions in %s line %ld: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, line);\\n\\t\\t else\\n\\t\\t {\\n\\t\\t\\tspin->si_region_count = (int)STRLEN(line) / 2;\\n\\t\\t\\tSTRCPY(spin->si_region_name, line);\",\n \"\\t\\t\\t// Adjust the mask for a word valid in all regions.\\n\\t\\t\\tspin->si_region = (1 << spin->si_region_count) - 1;\\n\\t\\t }\\n\\t\\t}\\n\\t\\tcontinue;\\n\\t }\",\n \"\\t smsg(_(\\\"/ line ignored in %s line %ld: %s\\\"),\\n\\t\\t\\t\\t\\t\\t fname, lnum, line - 1);\\n\\t continue;\\n\\t}\",\n \"\\tflags = 0;\\n\\tregionmask = spin->si_region;\",\n \"\\t// Check for flags and region after a slash.\\n\\tp = vim_strchr(line, '/');\\n\\tif (p != NULL)\\n\\t{\\n\\t *p++ = NUL;\\n\\t while (*p != NUL)\\n\\t {\\n\\t\\tif (*p == '=')\\t\\t// keep-case word\\n\\t\\t flags |= WF_KEEPCAP | WF_FIXCAP;\\n\\t\\telse if (*p == '!')\\t// Bad, bad, wicked word.\\n\\t\\t flags |= WF_BANNED;\\n\\t\\telse if (*p == '?')\\t// Rare word.\\n\\t\\t flags |= WF_RARE;\\n\\t\\telse if (VIM_ISDIGIT(*p)) // region number(s)\\n\\t\\t{\\n\\t\\t if ((flags & WF_REGION) == 0) // first one\\n\\t\\t\\tregionmask = 0;\\n\\t\\t flags |= WF_REGION;\",\n \"\\t\\t l = *p - '0';\\n\\t\\t if (l == 0 || l > spin->si_region_count)\\n\\t\\t {\\n\\t\\t\\tsmsg(_(\\\"Invalid region nr in %s line %ld: %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t fname, lnum, p);\\n\\t\\t\\tbreak;\\n\\t\\t }\\n\\t\\t regionmask |= 1 << (l - 1);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t smsg(_(\\\"Unrecognized flags in %s line %ld: %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t fname, lnum, p);\\n\\t\\t break;\\n\\t\\t}\\n\\t\\t++p;\\n\\t }\\n\\t}\",\n \"\\t// Skip non-ASCII words when \\\"spin->si_ascii\\\" is TRUE.\\n\\tif (spin->si_ascii && has_non_ascii(line))\\n\\t{\\n\\t ++non_ascii;\\n\\t continue;\\n\\t}\",\n \"\\t// Normal word: store it.\\n\\tif (store_word(spin, line, flags, regionmask, NULL, FALSE) == FAIL)\\n\\t{\\n\\t retval = FAIL;\\n\\t break;\\n\\t}\\n\\tdid_word = TRUE;\\n }\",\n \" vim_free(pc);\\n fclose(fd);\",\n \" if (spin->si_ascii && non_ascii > 0)\\n {\\n\\tvim_snprintf((char *)IObuff, IOSIZE,\\n\\t\\t _(\\\"Ignored %d words with non-ASCII characters\\\"), non_ascii);\\n\\tspell_message(spin, IObuff);\\n }\",\n \" return retval;\\n}\",\n \"/*\\n * Get part of an sblock_T, \\\"len\\\" bytes long.\\n * This avoids calling free() for every little struct we use (and keeping\\n * track of them).\\n * The memory is cleared to all zeros.\\n * Returns NULL when out of memory.\\n */\\n static void *\\ngetroom(\\n spellinfo_T *spin,\\n size_t\\tlen,\\t\\t// length needed\\n int\\t\\talign)\\t\\t// align for pointer\\n{\\n char_u\\t*p;\\n sblock_T\\t*bl = spin->si_blocks;\",\n \" if (align && bl != NULL)\\n\\t// Round size up for alignment. On some systems structures need to be\\n\\t// aligned to the size of a pointer (e.g., SPARC).\\n\\tbl->sb_used = (bl->sb_used + sizeof(char *) - 1)\\n\\t\\t\\t\\t\\t\\t & ~(sizeof(char *) - 1);\",\n \" if (bl == NULL || bl->sb_used + len > SBLOCKSIZE)\\n {\\n\\tif (len >= SBLOCKSIZE)\\n\\t bl = NULL;\\n\\telse\\n\\t // Allocate a block of memory. It is not freed until much later.\\n\\t bl = alloc_clear(sizeof(sblock_T) + SBLOCKSIZE);\\n\\tif (bl == NULL)\\n\\t{\\n\\t if (!spin->si_did_emsg)\\n\\t {\\n\\t\\temsg(_(e_insufficient_memory_word_list_will_be_incomplete));\\n\\t\\tspin->si_did_emsg = TRUE;\\n\\t }\\n\\t return NULL;\\n\\t}\\n\\tbl->sb_next = spin->si_blocks;\\n\\tspin->si_blocks = bl;\\n\\tbl->sb_used = 0;\\n\\t++spin->si_blocks_cnt;\\n }\",\n \" p = bl->sb_data + bl->sb_used;\\n bl->sb_used += (int)len;\",\n \" return p;\\n}\",\n \"/*\\n * Make a copy of a string into memory allocated with getroom().\\n * Returns NULL when out of memory.\\n */\\n static char_u *\\ngetroom_save(spellinfo_T *spin, char_u *s)\\n{\\n char_u\\t*sc;\",\n \" sc = (char_u *)getroom(spin, STRLEN(s) + 1, FALSE);\\n if (sc != NULL)\\n\\tSTRCPY(sc, s);\\n return sc;\\n}\",\n \"\\n/*\\n * Free the list of allocated sblock_T.\\n */\\n static void\\nfree_blocks(sblock_T *bl)\\n{\\n sblock_T\\t*next;\",\n \" while (bl != NULL)\\n {\\n\\tnext = bl->sb_next;\\n\\tvim_free(bl);\\n\\tbl = next;\\n }\\n}\",\n \"/*\\n * Allocate the root of a word tree.\\n * Returns NULL when out of memory.\\n */\\n static wordnode_T *\\nwordtree_alloc(spellinfo_T *spin)\\n{\\n return (wordnode_T *)getroom(spin, sizeof(wordnode_T), TRUE);\\n}\",\n \"/*\\n * Store a word in the tree(s).\\n * Always store it in the case-folded tree. For a keep-case word this is\\n * useful when the word can also be used with all caps (no WF_FIXCAP flag) and\\n * used to find suggestions.\\n * For a keep-case word also store it in the keep-case tree.\\n * When \\\"pfxlist\\\" is not NULL store the word for each postponed prefix ID and\\n * compound flag.\\n */\\n static int\\nstore_word(\\n spellinfo_T\\t*spin,\\n char_u\\t*word,\\n int\\t\\tflags,\\t\\t// extra flags, WF_BANNED\\n int\\t\\tregion,\\t\\t// supported region(s)\\n char_u\\t*pfxlist,\\t// list of prefix IDs or NULL\\n int\\t\\tneed_affix)\\t// only store word with affix ID\\n{\\n int\\t\\tlen = (int)STRLEN(word);\\n int\\t\\tct = captype(word, word + len);\\n char_u\\tfoldword[MAXWLEN];\\n int\\t\\tres = OK;\\n char_u\\t*p;\\n\",\n \" // Avoid adding illegal bytes to the word tree.\\n if (enc_utf8 && !utf_valid_string(word, NULL))\\n\\treturn FAIL;\\n\",\n \" (void)spell_casefold(curwin, word, len, foldword, MAXWLEN);\\n for (p = pfxlist; res == OK; ++p)\\n {\\n\\tif (!need_affix || (p != NULL && *p != NUL))\\n\\t res = tree_add_word(spin, foldword, spin->si_foldroot, ct | flags,\\n\\t\\t\\t\\t\\t\\t region, p == NULL ? 0 : *p);\\n\\tif (p == NULL || *p == NUL)\\n\\t break;\\n }\\n ++spin->si_foldwcount;\",\n \" if (res == OK && (ct == WF_KEEPCAP || (flags & WF_KEEPCAP)))\\n {\\n\\tfor (p = pfxlist; res == OK; ++p)\\n\\t{\\n\\t if (!need_affix || (p != NULL && *p != NUL))\\n\\t\\tres = tree_add_word(spin, word, spin->si_keeproot, flags,\\n\\t\\t\\t\\t\\t\\t region, p == NULL ? 0 : *p);\\n\\t if (p == NULL || *p == NUL)\\n\\t\\tbreak;\\n\\t}\\n\\t++spin->si_keepwcount;\\n }\\n return res;\\n}\",\n \"/*\\n * Add word \\\"word\\\" to a word tree at \\\"root\\\".\\n * When \\\"flags\\\" < 0 we are adding to the prefix tree where \\\"flags\\\" is used for\\n * \\\"rare\\\" and \\\"region\\\" is the condition nr.\\n * Returns FAIL when out of memory.\\n */\\n static int\\ntree_add_word(\\n spellinfo_T\\t*spin,\\n char_u\\t*word,\\n wordnode_T\\t*root,\\n int\\t\\tflags,\\n int\\t\\tregion,\\n int\\t\\taffixID)\\n{\\n wordnode_T\\t*node = root;\\n wordnode_T\\t*np;\\n wordnode_T\\t*copyp, **copyprev;\\n wordnode_T\\t**prev = NULL;\\n int\\t\\ti;\",\n \" // Add each byte of the word to the tree, including the NUL at the end.\\n for (i = 0; ; ++i)\\n {\\n\\t// When there is more than one reference to this node we need to make\\n\\t// a copy, so that we can modify it. Copy the whole list of siblings\\n\\t// (we don't optimize for a partly shared list of siblings).\\n\\tif (node != NULL && node->wn_refs > 1)\\n\\t{\\n\\t --node->wn_refs;\\n\\t copyprev = prev;\\n\\t FOR_ALL_NODE_SIBLINGS(node, copyp)\\n\\t {\\n\\t\\t// Allocate a new node and copy the info.\\n\\t\\tnp = get_wordnode(spin);\\n\\t\\tif (np == NULL)\\n\\t\\t return FAIL;\\n\\t\\tnp->wn_child = copyp->wn_child;\\n\\t\\tif (np->wn_child != NULL)\\n\\t\\t ++np->wn_child->wn_refs;\\t// child gets extra ref\\n\\t\\tnp->wn_byte = copyp->wn_byte;\\n\\t\\tif (np->wn_byte == NUL)\\n\\t\\t{\\n\\t\\t np->wn_flags = copyp->wn_flags;\\n\\t\\t np->wn_region = copyp->wn_region;\\n\\t\\t np->wn_affixID = copyp->wn_affixID;\\n\\t\\t}\",\n \"\\t\\t// Link the new node in the list, there will be one ref.\\n\\t\\tnp->wn_refs = 1;\\n\\t\\tif (copyprev != NULL)\\n\\t\\t *copyprev = np;\\n\\t\\tcopyprev = &np->wn_sibling;\",\n \"\\t\\t// Let \\\"node\\\" point to the head of the copied list.\\n\\t\\tif (copyp == node)\\n\\t\\t node = np;\\n\\t }\\n\\t}\",\n \"\\t// Look for the sibling that has the same character. They are sorted\\n\\t// on byte value, thus stop searching when a sibling is found with a\\n\\t// higher byte value. For zero bytes (end of word) the sorting is\\n\\t// done on flags and then on affixID.\\n\\twhile (node != NULL\\n\\t\\t&& (node->wn_byte < word[i]\\n\\t\\t || (node->wn_byte == NUL\\n\\t\\t\\t&& (flags < 0\\n\\t\\t\\t ? node->wn_affixID < (unsigned)affixID\\n\\t\\t\\t : (node->wn_flags < (unsigned)(flags & WN_MASK)\\n\\t\\t\\t\\t|| (node->wn_flags == (flags & WN_MASK)\\n\\t\\t\\t\\t && (spin->si_sugtree\\n\\t\\t\\t\\t\\t? (node->wn_region & 0xffff) < region\\n\\t\\t\\t\\t\\t: node->wn_affixID\\n\\t\\t\\t\\t\\t\\t < (unsigned)affixID)))))))\\n\\t{\\n\\t prev = &node->wn_sibling;\\n\\t node = *prev;\\n\\t}\\n\\tif (node == NULL\\n\\t\\t|| node->wn_byte != word[i]\\n\\t\\t|| (word[i] == NUL\\n\\t\\t && (flags < 0\\n\\t\\t\\t|| spin->si_sugtree\\n\\t\\t\\t|| node->wn_flags != (flags & WN_MASK)\\n\\t\\t\\t|| node->wn_affixID != affixID)))\\n\\t{\\n\\t // Allocate a new node.\\n\\t np = get_wordnode(spin);\\n\\t if (np == NULL)\\n\\t\\treturn FAIL;\\n\\t np->wn_byte = word[i];\",\n \"\\t // If \\\"node\\\" is NULL this is a new child or the end of the sibling\\n\\t // list: ref count is one. Otherwise use ref count of sibling and\\n\\t // make ref count of sibling one (matters when inserting in front\\n\\t // of the list of siblings).\\n\\t if (node == NULL)\\n\\t\\tnp->wn_refs = 1;\\n\\t else\\n\\t {\\n\\t\\tnp->wn_refs = node->wn_refs;\\n\\t\\tnode->wn_refs = 1;\\n\\t }\\n\\t if (prev != NULL)\\n\\t\\t*prev = np;\\n\\t np->wn_sibling = node;\\n\\t node = np;\\n\\t}\",\n \"\\tif (word[i] == NUL)\\n\\t{\\n\\t node->wn_flags = flags;\\n\\t node->wn_region |= region;\\n\\t node->wn_affixID = affixID;\\n\\t break;\\n\\t}\\n\\tprev = &node->wn_child;\\n\\tnode = *prev;\\n }\\n#ifdef SPELL_PRINTTREE\\n smsg(\\\"Added \\\\\\\"%s\\\\\\\"\\\", word);\\n spell_print_tree(root->wn_sibling);\\n#endif\",\n \" // count nr of words added since last message\\n ++spin->si_msg_count;\",\n \" if (spin->si_compress_cnt > 1)\\n {\\n\\tif (--spin->si_compress_cnt == 1)\\n\\t // Did enough words to lower the block count limit.\\n\\t spin->si_blocks_cnt += compress_inc;\\n }\",\n \" /*\\n * When we have allocated lots of memory we need to compress the word tree\\n * to free up some room. But compression is slow, and we might actually\\n * need that room, thus only compress in the following situations:\\n * 1. When not compressed before (si_compress_cnt == 0): when using\\n * \\\"compress_start\\\" blocks.\\n * 2. When compressed before and used \\\"compress_inc\\\" blocks before\\n * adding \\\"compress_added\\\" words (si_compress_cnt > 1).\\n * 3. When compressed before, added \\\"compress_added\\\" words\\n * (si_compress_cnt == 1) and the number of free nodes drops below the\\n * maximum word length.\\n */\\n#ifndef SPELL_COMPRESS_ALLWAYS\\n if (spin->si_compress_cnt == 1\\n\\t ? spin->si_free_count < MAXWLEN\\n\\t : spin->si_blocks_cnt >= compress_start)\\n#endif\\n {\\n\\t// Decrement the block counter. The effect is that we compress again\\n\\t// when the freed up room has been used and another \\\"compress_inc\\\"\\n\\t// blocks have been allocated. Unless \\\"compress_added\\\" words have\\n\\t// been added, then the limit is put back again.\\n\\tspin->si_blocks_cnt -= compress_inc;\\n\\tspin->si_compress_cnt = compress_added;\",\n \"\\tif (spin->si_verbose)\\n\\t{\\n\\t msg_start();\\n\\t msg_puts(_(msg_compressing));\\n\\t msg_clr_eos();\\n\\t msg_didout = FALSE;\\n\\t msg_col = 0;\\n\\t out_flush();\\n\\t}\",\n \"\\t// Compress both trees. Either they both have many nodes, which makes\\n\\t// compression useful, or one of them is small, which means\\n\\t// compression goes fast. But when filling the soundfold word tree\\n\\t// there is no keep-case tree.\\n\\twordtree_compress(spin, spin->si_foldroot, \\\"case-folded\\\");\\n\\tif (affixID >= 0)\\n\\t wordtree_compress(spin, spin->si_keeproot, \\\"keep-case\\\");\\n }\",\n \" return OK;\\n}\",\n \"/*\\n * Get a wordnode_T, either from the list of previously freed nodes or\\n * allocate a new one.\\n * Returns NULL when out of memory.\\n */\\n static wordnode_T *\\nget_wordnode(spellinfo_T *spin)\\n{\\n wordnode_T *n;\",\n \" if (spin->si_first_free == NULL)\\n\\tn = (wordnode_T *)getroom(spin, sizeof(wordnode_T), TRUE);\\n else\\n {\\n\\tn = spin->si_first_free;\\n\\tspin->si_first_free = n->wn_child;\\n\\tCLEAR_POINTER(n);\\n\\t--spin->si_free_count;\\n }\\n#ifdef SPELL_PRINTTREE\\n if (n != NULL)\\n\\tn->wn_nr = ++spin->si_wordnode_nr;\\n#endif\\n return n;\\n}\",\n \"/*\\n * Decrement the reference count on a node (which is the head of a list of\\n * siblings). If the reference count becomes zero free the node and its\\n * siblings.\\n * Returns the number of nodes actually freed.\\n */\\n static int\\nderef_wordnode(spellinfo_T *spin, wordnode_T *node)\\n{\\n wordnode_T\\t*np;\\n int\\t\\tcnt = 0;\",\n \" if (--node->wn_refs == 0)\\n {\\n\\tFOR_ALL_NODE_SIBLINGS(node, np)\\n\\t{\\n\\t if (np->wn_child != NULL)\\n\\t\\tcnt += deref_wordnode(spin, np->wn_child);\\n\\t free_wordnode(spin, np);\\n\\t ++cnt;\\n\\t}\\n\\t++cnt;\\t // length field\\n }\\n return cnt;\\n}\",\n \"/*\\n * Free a wordnode_T for re-use later.\\n * Only the \\\"wn_child\\\" field becomes invalid.\\n */\\n static void\\nfree_wordnode(spellinfo_T *spin, wordnode_T *n)\\n{\\n n->wn_child = spin->si_first_free;\\n spin->si_first_free = n;\\n ++spin->si_free_count;\\n}\",\n \"/*\\n * Compress a tree: find tails that are identical and can be shared.\\n */\\n static void\\nwordtree_compress(spellinfo_T *spin, wordnode_T *root, char *name)\\n{\\n hashtab_T\\t ht;\\n long\\t n;\\n long\\t tot = 0;\\n long\\t perc;\",\n \" // Skip the root itself, it's not actually used. The first sibling is the\\n // start of the tree.\\n if (root->wn_sibling != NULL)\\n {\\n\\thash_init(&ht);\\n\\tn = node_compress(spin, root->wn_sibling, &ht, &tot);\",\n \"#ifndef SPELL_PRINTTREE\\n\\tif (spin->si_verbose || p_verbose > 2)\\n#endif\\n\\t{\\n\\t if (tot > 1000000)\\n\\t\\tperc = (tot - n) / (tot / 100);\\n\\t else if (tot == 0)\\n\\t\\tperc = 0;\\n\\t else\\n\\t\\tperc = (tot - n) * 100 / tot;\\n\\t vim_snprintf((char *)IObuff, IOSIZE,\\n\\t\\t _(\\\"Compressed %s: %ld of %ld nodes; %ld (%ld%%) remaining\\\"),\\n\\t\\t\\t\\t\\t\\t name, n, tot, tot - n, perc);\\n\\t spell_message(spin, IObuff);\\n\\t}\\n#ifdef SPELL_PRINTTREE\\n\\tspell_print_tree(root->wn_sibling);\\n#endif\\n\\thash_clear(&ht);\\n }\\n}\",\n \"/*\\n * Compress a node, its siblings and its children, depth first.\\n * Returns the number of compressed nodes.\\n */\\n static long\\nnode_compress(\\n spellinfo_T\\t*spin,\\n wordnode_T\\t*node,\\n hashtab_T\\t*ht,\\n long\\t*tot)\\t // total count of nodes before compressing,\\n\\t\\t\\t // incremented while going through the tree\\n{\\n wordnode_T\\t*np;\\n wordnode_T\\t*tp;\\n wordnode_T\\t*child;\\n hash_T\\thash;\\n hashitem_T\\t*hi;\\n long\\tlen = 0;\\n unsigned\\tnr, n;\\n long\\tcompressed = 0;\",\n \" /*\\n * Go through the list of siblings. Compress each child and then try\\n * finding an identical child to replace it.\\n * Note that with \\\"child\\\" we mean not just the node that is pointed to,\\n * but the whole list of siblings of which the child node is the first.\\n */\\n for (np = node; np != NULL && !got_int; np = np->wn_sibling)\\n {\\n\\t++len;\\n\\tif ((child = np->wn_child) != NULL)\\n\\t{\\n\\t // Compress the child first. This fills hashkey.\\n\\t compressed += node_compress(spin, child, ht, tot);\",\n \"\\t // Try to find an identical child.\\n\\t hash = hash_hash(child->wn_u1.hashkey);\\n\\t hi = hash_lookup(ht, child->wn_u1.hashkey, hash);\\n\\t if (!HASHITEM_EMPTY(hi))\\n\\t {\\n\\t\\t// There are children we encountered before with a hash value\\n\\t\\t// identical to the current child. Now check if there is one\\n\\t\\t// that is really identical.\\n\\t\\tfor (tp = HI2WN(hi); tp != NULL; tp = tp->wn_u2.next)\\n\\t\\t if (node_equal(child, tp))\\n\\t\\t {\\n\\t\\t\\t// Found one! Now use that child in place of the\\n\\t\\t\\t// current one. This means the current child and all\\n\\t\\t\\t// its siblings is unlinked from the tree.\\n\\t\\t\\t++tp->wn_refs;\\n\\t\\t\\tcompressed += deref_wordnode(spin, child);\\n\\t\\t\\tnp->wn_child = tp;\\n\\t\\t\\tbreak;\\n\\t\\t }\\n\\t\\tif (tp == NULL)\\n\\t\\t{\\n\\t\\t // No other child with this hash value equals the child of\\n\\t\\t // the node, add it to the linked list after the first\\n\\t\\t // item.\\n\\t\\t tp = HI2WN(hi);\\n\\t\\t child->wn_u2.next = tp->wn_u2.next;\\n\\t\\t tp->wn_u2.next = child;\\n\\t\\t}\\n\\t }\\n\\t else\\n\\t\\t// No other child has this hash value, add it to the\\n\\t\\t// hashtable.\\n\\t\\thash_add_item(ht, hi, child->wn_u1.hashkey, hash);\\n\\t}\\n }\\n *tot += len + 1;\\t// add one for the node that stores the length\",\n \" /*\\n * Make a hash key for the node and its siblings, so that we can quickly\\n * find a lookalike node. This must be done after compressing the sibling\\n * list, otherwise the hash key would become invalid by the compression.\\n */\\n node->wn_u1.hashkey[0] = len;\\n nr = 0;\\n FOR_ALL_NODE_SIBLINGS(node, np)\\n {\\n\\tif (np->wn_byte == NUL)\\n\\t // end node: use wn_flags, wn_region and wn_affixID\\n\\t n = np->wn_flags + (np->wn_region << 8) + (np->wn_affixID << 16);\\n\\telse\\n\\t // byte node: use the byte value and the child pointer\\n\\t n = (unsigned)(np->wn_byte + ((long_u)np->wn_child << 8));\\n\\tnr = nr * 101 + n;\\n }\",\n \" // Avoid NUL bytes, it terminates the hash key.\\n n = nr & 0xff;\\n node->wn_u1.hashkey[1] = n == 0 ? 1 : n;\\n n = (nr >> 8) & 0xff;\\n node->wn_u1.hashkey[2] = n == 0 ? 1 : n;\\n n = (nr >> 16) & 0xff;\\n node->wn_u1.hashkey[3] = n == 0 ? 1 : n;\\n n = (nr >> 24) & 0xff;\\n node->wn_u1.hashkey[4] = n == 0 ? 1 : n;\\n node->wn_u1.hashkey[5] = NUL;\",\n \" // Check for CTRL-C pressed now and then.\\n veryfast_breakcheck();\",\n \" return compressed;\\n}\",\n \"/*\\n * Return TRUE when two nodes have identical siblings and children.\\n */\\n static int\\nnode_equal(wordnode_T *n1, wordnode_T *n2)\\n{\\n wordnode_T\\t*p1;\\n wordnode_T\\t*p2;\",\n \" for (p1 = n1, p2 = n2; p1 != NULL && p2 != NULL;\\n\\t\\t\\t\\t p1 = p1->wn_sibling, p2 = p2->wn_sibling)\\n\\tif (p1->wn_byte != p2->wn_byte\\n\\t\\t|| (p1->wn_byte == NUL\\n\\t\\t ? (p1->wn_flags != p2->wn_flags\\n\\t\\t\\t|| p1->wn_region != p2->wn_region\\n\\t\\t\\t|| p1->wn_affixID != p2->wn_affixID)\\n\\t\\t : (p1->wn_child != p2->wn_child)))\\n\\t break;\",\n \" return p1 == NULL && p2 == NULL;\\n}\",\n \"static int rep_compare(const void *s1, const void *s2);\",\n \"/*\\n * Function given to qsort() to sort the REP items on \\\"from\\\" string.\\n */\\n static int\\nrep_compare(const void *s1, const void *s2)\\n{\\n fromto_T\\t*p1 = (fromto_T *)s1;\\n fromto_T\\t*p2 = (fromto_T *)s2;\",\n \" return STRCMP(p1->ft_from, p2->ft_from);\\n}\",\n \"/*\\n * Write the Vim .spl file \\\"fname\\\".\\n * Return FAIL or OK;\\n */\\n static int\\nwrite_vim_spell(spellinfo_T *spin, char_u *fname)\\n{\\n FILE\\t*fd;\\n int\\t\\tregionmask;\\n int\\t\\tround;\\n wordnode_T\\t*tree;\\n int\\t\\tnodecount;\\n int\\t\\ti;\\n int\\t\\tl;\\n garray_T\\t*gap;\\n fromto_T\\t*ftp;\\n char_u\\t*p;\\n int\\t\\trr;\\n int\\t\\tretval = OK;\\n size_t\\tfwv = 1; // collect return value of fwrite() to avoid\\n\\t\\t\\t // warnings from picky compiler\",\n \" fd = mch_fopen((char *)fname, \\\"w\\\");\\n if (fd == NULL)\\n {\\n\\tsemsg(_(e_cant_open_file_str), fname);\\n\\treturn FAIL;\\n }\",\n \" // <HEADER>: <fileID> <versionnr>\\n\\t\\t\\t\\t\\t\\t\\t // <fileID>\\n fwv &= fwrite(VIMSPELLMAGIC, VIMSPELLMAGICL, (size_t)1, fd);\\n if (fwv != (size_t)1)\\n\\t// Catch first write error, don't try writing more.\\n\\tgoto theend;\",\n \" putc(VIMSPELLVERSION, fd);\\t\\t\\t\\t // <versionnr>\",\n \" /*\\n * <SECTIONS>: <section> ... <sectionend>\\n */\",\n \" // SN_INFO: <infotext>\\n if (spin->si_info != NULL)\\n {\\n\\tputc(SN_INFO, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\",\n \"\\ti = (int)STRLEN(spin->si_info);\\n\\tput_bytes(fd, (long_u)i, 4);\\t\\t\\t// <sectionlen>\\n\\tfwv &= fwrite(spin->si_info, (size_t)i, (size_t)1, fd); // <infotext>\\n }\",\n \" // SN_REGION: <regionname> ...\\n // Write the region names only if there is more than one.\\n if (spin->si_region_count > 1)\\n {\\n\\tputc(SN_REGION, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(SNF_REQUIRED, fd);\\t\\t\\t\\t// <sectionflags>\\n\\tl = spin->si_region_count * 2;\\n\\tput_bytes(fd, (long_u)l, 4);\\t\\t\\t// <sectionlen>\\n\\tfwv &= fwrite(spin->si_region_name, (size_t)l, (size_t)1, fd);\\n\\t\\t\\t\\t\\t\\t\\t// <regionname> ...\\n\\tregionmask = (1 << spin->si_region_count) - 1;\\n }\\n else\\n\\tregionmask = 0;\",\n \" // SN_CHARFLAGS: <charflagslen> <charflags> <folcharslen> <folchars>\\n //\\n // The table with character flags and the table for case folding.\\n // This makes sure the same characters are recognized as word characters\\n // when generating and when using a spell file.\\n // Skip this for ASCII, the table may conflict with the one used for\\n // 'encoding'.\\n // Also skip this for an .add.spl file, the main spell file must contain\\n // the table (avoids that it conflicts). File is shorter too.\\n if (!spin->si_ascii && !spin->si_add)\\n {\\n\\tchar_u\\tfolchars[128 * 8];\\n\\tint\\tflags;\",\n \"\\tputc(SN_CHARFLAGS, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(SNF_REQUIRED, fd);\\t\\t\\t\\t// <sectionflags>\",\n \"\\t// Form the <folchars> string first, we need to know its length.\\n\\tl = 0;\\n\\tfor (i = 128; i < 256; ++i)\\n\\t{\\n\\t if (has_mbyte)\\n\\t\\tl += mb_char2bytes(spelltab.st_fold[i], folchars + l);\\n\\t else\\n\\t\\tfolchars[l++] = spelltab.st_fold[i];\\n\\t}\\n\\tput_bytes(fd, (long_u)(1 + 128 + 2 + l), 4);\\t// <sectionlen>\",\n \"\\tfputc(128, fd);\\t\\t\\t\\t\\t// <charflagslen>\\n\\tfor (i = 128; i < 256; ++i)\\n\\t{\\n\\t flags = 0;\\n\\t if (spelltab.st_isw[i])\\n\\t\\tflags |= CF_WORD;\\n\\t if (spelltab.st_isu[i])\\n\\t\\tflags |= CF_UPPER;\\n\\t fputc(flags, fd);\\t\\t\\t\\t// <charflags>\\n\\t}\",\n \"\\tput_bytes(fd, (long_u)l, 2);\\t\\t\\t// <folcharslen>\\n\\tfwv &= fwrite(folchars, (size_t)l, (size_t)1, fd); // <folchars>\\n }\",\n \" // SN_MIDWORD: <midword>\\n if (spin->si_midword != NULL)\\n {\\n\\tputc(SN_MIDWORD, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(SNF_REQUIRED, fd);\\t\\t\\t\\t// <sectionflags>\",\n \"\\ti = (int)STRLEN(spin->si_midword);\\n\\tput_bytes(fd, (long_u)i, 4);\\t\\t\\t// <sectionlen>\\n\\tfwv &= fwrite(spin->si_midword, (size_t)i, (size_t)1, fd);\\n\\t\\t\\t\\t\\t\\t\\t// <midword>\\n }\",\n \" // SN_PREFCOND: <prefcondcnt> <prefcond> ...\\n if (spin->si_prefcond.ga_len > 0)\\n {\\n\\tputc(SN_PREFCOND, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(SNF_REQUIRED, fd);\\t\\t\\t\\t// <sectionflags>\",\n \"\\tl = write_spell_prefcond(NULL, &spin->si_prefcond, &fwv);\\n\\tput_bytes(fd, (long_u)l, 4);\\t\\t\\t// <sectionlen>\",\n \"\\twrite_spell_prefcond(fd, &spin->si_prefcond, &fwv);\\n }\",\n \" // SN_REP: <repcount> <rep> ...\\n // SN_SAL: <salflags> <salcount> <sal> ...\\n // SN_REPSAL: <repcount> <rep> ...\",\n \" // round 1: SN_REP section\\n // round 2: SN_SAL section (unless SN_SOFO is used)\\n // round 3: SN_REPSAL section\\n for (round = 1; round <= 3; ++round)\\n {\\n\\tif (round == 1)\\n\\t gap = &spin->si_rep;\\n\\telse if (round == 2)\\n\\t{\\n\\t // Don't write SN_SAL when using a SN_SOFO section\\n\\t if (spin->si_sofofr != NULL && spin->si_sofoto != NULL)\\n\\t\\tcontinue;\\n\\t gap = &spin->si_sal;\\n\\t}\\n\\telse\\n\\t gap = &spin->si_repsal;\",\n \"\\t// Don't write the section if there are no items.\\n\\tif (gap->ga_len == 0)\\n\\t continue;\",\n \"\\t// Sort the REP/REPSAL items.\\n\\tif (round != 2)\\n\\t qsort(gap->ga_data, (size_t)gap->ga_len,\\n\\t\\t\\t\\t\\t sizeof(fromto_T), rep_compare);\",\n \"\\ti = round == 1 ? SN_REP : (round == 2 ? SN_SAL : SN_REPSAL);\\n\\tputc(i, fd);\\t\\t\\t\\t\\t// <sectionID>\",\n \"\\t// This is for making suggestions, section is not required.\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\",\n \"\\t// Compute the length of what follows.\\n\\tl = 2;\\t // count <repcount> or <salcount>\\n\\tfor (i = 0; i < gap->ga_len; ++i)\\n\\t{\\n\\t ftp = &((fromto_T *)gap->ga_data)[i];\\n\\t l += 1 + (int)STRLEN(ftp->ft_from); // count <*fromlen> and <*from>\\n\\t l += 1 + (int)STRLEN(ftp->ft_to); // count <*tolen> and <*to>\\n\\t}\\n\\tif (round == 2)\\n\\t ++l;\\t// count <salflags>\\n\\tput_bytes(fd, (long_u)l, 4);\\t\\t\\t// <sectionlen>\",\n \"\\tif (round == 2)\\n\\t{\\n\\t i = 0;\\n\\t if (spin->si_followup)\\n\\t\\ti |= SAL_F0LLOWUP;\\n\\t if (spin->si_collapse)\\n\\t\\ti |= SAL_COLLAPSE;\\n\\t if (spin->si_rem_accents)\\n\\t\\ti |= SAL_REM_ACCENTS;\\n\\t putc(i, fd);\\t\\t\\t// <salflags>\\n\\t}\",\n \"\\tput_bytes(fd, (long_u)gap->ga_len, 2);\\t// <repcount> or <salcount>\\n\\tfor (i = 0; i < gap->ga_len; ++i)\\n\\t{\\n\\t // <rep> : <repfromlen> <repfrom> <reptolen> <repto>\\n\\t // <sal> : <salfromlen> <salfrom> <saltolen> <salto>\\n\\t ftp = &((fromto_T *)gap->ga_data)[i];\\n\\t for (rr = 1; rr <= 2; ++rr)\\n\\t {\\n\\t\\tp = rr == 1 ? ftp->ft_from : ftp->ft_to;\\n\\t\\tl = (int)STRLEN(p);\\n\\t\\tputc(l, fd);\\n\\t\\tif (l > 0)\\n\\t\\t fwv &= fwrite(p, l, (size_t)1, fd);\\n\\t }\\n\\t}\",\n \" }\",\n \" // SN_SOFO: <sofofromlen> <sofofrom> <sofotolen> <sofoto>\\n // This is for making suggestions, section is not required.\\n if (spin->si_sofofr != NULL && spin->si_sofoto != NULL)\\n {\\n\\tputc(SN_SOFO, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\",\n \"\\tl = (int)STRLEN(spin->si_sofofr);\\n\\tput_bytes(fd, (long_u)(l + STRLEN(spin->si_sofoto) + 4), 4);\\n\\t\\t\\t\\t\\t\\t\\t// <sectionlen>\",\n \"\\tput_bytes(fd, (long_u)l, 2);\\t\\t\\t// <sofofromlen>\\n\\tfwv &= fwrite(spin->si_sofofr, l, (size_t)1, fd); // <sofofrom>\",\n \"\\tl = (int)STRLEN(spin->si_sofoto);\\n\\tput_bytes(fd, (long_u)l, 2);\\t\\t\\t// <sofotolen>\\n\\tfwv &= fwrite(spin->si_sofoto, l, (size_t)1, fd); // <sofoto>\\n }\",\n \" // SN_WORDS: <word> ...\\n // This is for making suggestions, section is not required.\\n if (spin->si_commonwords.ht_used > 0)\\n {\\n\\tputc(SN_WORDS, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\",\n \"\\t// round 1: count the bytes\\n\\t// round 2: write the bytes\\n\\tfor (round = 1; round <= 2; ++round)\\n\\t{\\n\\t int\\t\\ttodo;\\n\\t int\\t\\tlen = 0;\\n\\t hashitem_T\\t*hi;\",\n \"\\t todo = (int)spin->si_commonwords.ht_used;\\n\\t for (hi = spin->si_commonwords.ht_array; todo > 0; ++hi)\\n\\t\\tif (!HASHITEM_EMPTY(hi))\\n\\t\\t{\\n\\t\\t l = (int)STRLEN(hi->hi_key) + 1;\\n\\t\\t len += l;\\n\\t\\t if (round == 2)\\t\\t\\t// <word>\\n\\t\\t\\tfwv &= fwrite(hi->hi_key, (size_t)l, (size_t)1, fd);\\n\\t\\t --todo;\\n\\t\\t}\\n\\t if (round == 1)\\n\\t\\tput_bytes(fd, (long_u)len, 4);\\t\\t// <sectionlen>\\n\\t}\\n }\",\n \" // SN_MAP: <mapstr>\\n // This is for making suggestions, section is not required.\\n if (spin->si_map.ga_len > 0)\\n {\\n\\tputc(SN_MAP, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\\n\\tl = spin->si_map.ga_len;\\n\\tput_bytes(fd, (long_u)l, 4);\\t\\t\\t// <sectionlen>\\n\\tfwv &= fwrite(spin->si_map.ga_data, (size_t)l, (size_t)1, fd);\\n\\t\\t\\t\\t\\t\\t\\t// <mapstr>\\n }\",\n \" // SN_SUGFILE: <timestamp>\\n // This is used to notify that a .sug file may be available and at the\\n // same time allows for checking that a .sug file that is found matches\\n // with this .spl file. That's because the word numbers must be exactly\\n // right.\\n if (!spin->si_nosugfile\\n\\t && (spin->si_sal.ga_len > 0\\n\\t\\t || (spin->si_sofofr != NULL && spin->si_sofoto != NULL)))\\n {\\n\\tputc(SN_SUGFILE, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\\n\\tput_bytes(fd, (long_u)8, 4);\\t\\t\\t// <sectionlen>\",\n \"\\t// Set si_sugtime and write it to the file.\\n\\tspin->si_sugtime = time(NULL);\\n\\tput_time(fd, spin->si_sugtime);\\t\\t\\t// <timestamp>\\n }\",\n \" // SN_NOSPLITSUGS: nothing\\n // This is used to notify that no suggestions with word splits are to be\\n // made.\\n if (spin->si_nosplitsugs)\\n {\\n\\tputc(SN_NOSPLITSUGS, fd);\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\\n\\tput_bytes(fd, (long_u)0, 4);\\t\\t\\t// <sectionlen>\\n }\",\n \" // SN_NOCOMPUNDSUGS: nothing\\n // This is used to notify that no suggestions with compounds are to be\\n // made.\\n if (spin->si_nocompoundsugs)\\n {\\n\\tputc(SN_NOCOMPOUNDSUGS, fd);\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\\n\\tput_bytes(fd, (long_u)0, 4);\\t\\t\\t// <sectionlen>\\n }\",\n \" // SN_COMPOUND: compound info.\\n // We don't mark it required, when not supported all compound words will\\n // be bad words.\\n if (spin->si_compflags != NULL)\\n {\\n\\tputc(SN_COMPOUND, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\",\n \"\\tl = (int)STRLEN(spin->si_compflags);\\n\\tfor (i = 0; i < spin->si_comppat.ga_len; ++i)\\n\\t l += (int)STRLEN(((char_u **)(spin->si_comppat.ga_data))[i]) + 1;\\n\\tput_bytes(fd, (long_u)(l + 7), 4);\\t\\t// <sectionlen>\",\n \"\\tputc(spin->si_compmax, fd);\\t\\t\\t// <compmax>\\n\\tputc(spin->si_compminlen, fd);\\t\\t\\t// <compminlen>\\n\\tputc(spin->si_compsylmax, fd);\\t\\t\\t// <compsylmax>\\n\\tputc(0, fd);\\t\\t// for Vim 7.0b compatibility\\n\\tputc(spin->si_compoptions, fd);\\t\\t\\t// <compoptions>\\n\\tput_bytes(fd, (long_u)spin->si_comppat.ga_len, 2);\\n\\t\\t\\t\\t\\t\\t\\t// <comppatcount>\\n\\tfor (i = 0; i < spin->si_comppat.ga_len; ++i)\\n\\t{\\n\\t p = ((char_u **)(spin->si_comppat.ga_data))[i];\\n\\t putc((int)STRLEN(p), fd);\\t\\t\\t// <comppatlen>\\n\\t fwv &= fwrite(p, (size_t)STRLEN(p), (size_t)1, fd);\\n\\t\\t\\t\\t\\t\\t\\t// <comppattext>\\n\\t}\\n\\t\\t\\t\\t\\t\\t\\t// <compflags>\\n\\tfwv &= fwrite(spin->si_compflags, (size_t)STRLEN(spin->si_compflags),\\n\\t\\t\\t\\t\\t\\t\\t (size_t)1, fd);\\n }\",\n \" // SN_NOBREAK: NOBREAK flag\\n if (spin->si_nobreak)\\n {\\n\\tputc(SN_NOBREAK, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\",\n \"\\t// It's empty, the presence of the section flags the feature.\\n\\tput_bytes(fd, (long_u)0, 4);\\t\\t\\t// <sectionlen>\\n }\",\n \" // SN_SYLLABLE: syllable info.\\n // We don't mark it required, when not supported syllables will not be\\n // counted.\\n if (spin->si_syllable != NULL)\\n {\\n\\tputc(SN_SYLLABLE, fd);\\t\\t\\t\\t// <sectionID>\\n\\tputc(0, fd);\\t\\t\\t\\t\\t// <sectionflags>\",\n \"\\tl = (int)STRLEN(spin->si_syllable);\\n\\tput_bytes(fd, (long_u)l, 4);\\t\\t\\t// <sectionlen>\\n\\tfwv &= fwrite(spin->si_syllable, (size_t)l, (size_t)1, fd);\\n\\t\\t\\t\\t\\t\\t\\t// <syllable>\\n }\",\n \" // end of <SECTIONS>\\n putc(SN_END, fd);\\t\\t\\t\\t\\t// <sectionend>\",\n \"\\n /*\\n * <LWORDTREE> <KWORDTREE> <PREFIXTREE>\\n */\\n spin->si_memtot = 0;\\n for (round = 1; round <= 3; ++round)\\n {\\n\\tif (round == 1)\\n\\t tree = spin->si_foldroot->wn_sibling;\\n\\telse if (round == 2)\\n\\t tree = spin->si_keeproot->wn_sibling;\\n\\telse\\n\\t tree = spin->si_prefroot->wn_sibling;\",\n \"\\t// Clear the index and wnode fields in the tree.\\n\\tclear_node(tree);\",\n \"\\t// Count the number of nodes. Needed to be able to allocate the\\n\\t// memory when reading the nodes. Also fills in index for shared\\n\\t// nodes.\\n\\tnodecount = put_node(NULL, tree, 0, regionmask, round == 3);\",\n \"\\t// number of nodes in 4 bytes\\n\\tput_bytes(fd, (long_u)nodecount, 4);\\t// <nodecount>\\n\\tspin->si_memtot += nodecount + nodecount * sizeof(int);\",\n \"\\t// Write the nodes.\\n\\t(void)put_node(fd, tree, 0, regionmask, round == 3);\\n }\",\n \" // Write another byte to check for errors (file system full).\\n if (putc(0, fd) == EOF)\\n\\tretval = FAIL;\\ntheend:\\n if (fclose(fd) == EOF)\\n\\tretval = FAIL;\",\n \" if (fwv != (size_t)1)\\n\\tretval = FAIL;\\n if (retval == FAIL)\\n\\temsg(_(e_error_while_writing));\",\n \" return retval;\\n}\",\n \"/*\\n * Clear the index and wnode fields of \\\"node\\\", it siblings and its\\n * children. This is needed because they are a union with other items to save\\n * space.\\n */\\n static void\\nclear_node(wordnode_T *node)\\n{\\n wordnode_T\\t*np;\",\n \" if (node != NULL)\\n\\tFOR_ALL_NODE_SIBLINGS(node, np)\\n\\t{\\n\\t np->wn_u1.index = 0;\\n\\t np->wn_u2.wnode = NULL;\",\n \"\\t if (np->wn_byte != NUL)\\n\\t\\tclear_node(np->wn_child);\\n\\t}\\n}\",\n \"\\n/*\\n * Dump a word tree at node \\\"node\\\".\\n *\\n * This first writes the list of possible bytes (siblings). Then for each\\n * byte recursively write the children.\\n *\\n * NOTE: The code here must match the code in read_tree_node(), since\\n * assumptions are made about the indexes (so that we don't have to write them\\n * in the file).\\n *\\n * Returns the number of nodes used.\\n */\\n static int\\nput_node(\\n FILE\\t*fd,\\t\\t// NULL when only counting\\n wordnode_T\\t*node,\\n int\\t\\tidx,\\n int\\t\\tregionmask,\\n int\\t\\tprefixtree)\\t// TRUE for PREFIXTREE\\n{\\n int\\t\\tnewindex = idx;\\n int\\t\\tsiblingcount = 0;\\n wordnode_T\\t*np;\\n int\\t\\tflags;\",\n \" // If \\\"node\\\" is zero the tree is empty.\\n if (node == NULL)\\n\\treturn 0;\",\n \" // Store the index where this node is written.\\n node->wn_u1.index = idx;\",\n \" // Count the number of siblings.\\n FOR_ALL_NODE_SIBLINGS(node, np)\\n\\t++siblingcount;\",\n \" // Write the sibling count.\\n if (fd != NULL)\\n\\tputc(siblingcount, fd);\\t\\t\\t\\t// <siblingcount>\",\n \" // Write each sibling byte and optionally extra info.\\n FOR_ALL_NODE_SIBLINGS(node, np)\\n {\\n\\tif (np->wn_byte == 0)\\n\\t{\\n\\t if (fd != NULL)\\n\\t {\\n\\t\\t// For a NUL byte (end of word) write the flags etc.\\n\\t\\tif (prefixtree)\\n\\t\\t{\\n\\t\\t // In PREFIXTREE write the required affixID and the\\n\\t\\t // associated condition nr (stored in wn_region). The\\n\\t\\t // byte value is misused to store the \\\"rare\\\" and \\\"not\\n\\t\\t // combining\\\" flags\\n\\t\\t if (np->wn_flags == (short_u)PFX_FLAGS)\\n\\t\\t\\tputc(BY_NOFLAGS, fd);\\t\\t// <byte>\\n\\t\\t else\\n\\t\\t {\\n\\t\\t\\tputc(BY_FLAGS, fd);\\t\\t// <byte>\\n\\t\\t\\tputc(np->wn_flags, fd);\\t\\t// <pflags>\\n\\t\\t }\\n\\t\\t putc(np->wn_affixID, fd);\\t\\t// <affixID>\\n\\t\\t put_bytes(fd, (long_u)np->wn_region, 2); // <prefcondnr>\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t // For word trees we write the flag/region items.\\n\\t\\t flags = np->wn_flags;\\n\\t\\t if (regionmask != 0 && np->wn_region != regionmask)\\n\\t\\t\\tflags |= WF_REGION;\\n\\t\\t if (np->wn_affixID != 0)\\n\\t\\t\\tflags |= WF_AFX;\\n\\t\\t if (flags == 0)\\n\\t\\t {\\n\\t\\t\\t// word without flags or region\\n\\t\\t\\tputc(BY_NOFLAGS, fd);\\t\\t\\t// <byte>\\n\\t\\t }\\n\\t\\t else\\n\\t\\t {\\n\\t\\t\\tif (np->wn_flags >= 0x100)\\n\\t\\t\\t{\\n\\t\\t\\t putc(BY_FLAGS2, fd);\\t\\t// <byte>\\n\\t\\t\\t putc(flags, fd);\\t\\t\\t// <flags>\\n\\t\\t\\t putc((unsigned)flags >> 8, fd);\\t// <flags2>\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t putc(BY_FLAGS, fd);\\t\\t\\t// <byte>\\n\\t\\t\\t putc(flags, fd);\\t\\t\\t// <flags>\\n\\t\\t\\t}\\n\\t\\t\\tif (flags & WF_REGION)\\n\\t\\t\\t putc(np->wn_region, fd);\\t\\t// <region>\\n\\t\\t\\tif (flags & WF_AFX)\\n\\t\\t\\t putc(np->wn_affixID, fd);\\t\\t// <affixID>\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t}\\n\\telse\\n\\t{\\n\\t if (np->wn_child->wn_u1.index != 0\\n\\t\\t\\t\\t\\t && np->wn_child->wn_u2.wnode != node)\\n\\t {\\n\\t\\t// The child is written elsewhere, write the reference.\\n\\t\\tif (fd != NULL)\\n\\t\\t{\\n\\t\\t putc(BY_INDEX, fd);\\t\\t\\t// <byte>\\n\\t\\t\\t\\t\\t\\t\\t// <nodeidx>\\n\\t\\t put_bytes(fd, (long_u)np->wn_child->wn_u1.index, 3);\\n\\t\\t}\\n\\t }\\n\\t else if (np->wn_child->wn_u2.wnode == NULL)\\n\\t\\t// We will write the child below and give it an index.\\n\\t\\tnp->wn_child->wn_u2.wnode = node;\",\n \"\\t if (fd != NULL)\\n\\t\\tif (putc(np->wn_byte, fd) == EOF) // <byte> or <xbyte>\\n\\t\\t{\\n\\t\\t emsg(_(e_error_while_writing));\\n\\t\\t return 0;\\n\\t\\t}\\n\\t}\\n }\",\n \" // Space used in the array when reading: one for each sibling and one for\\n // the count.\\n newindex += siblingcount + 1;\",\n \" // Recursively dump the children of each sibling.\\n FOR_ALL_NODE_SIBLINGS(node, np)\\n\\tif (np->wn_byte != 0 && np->wn_child->wn_u2.wnode == node)\\n\\t newindex = put_node(fd, np->wn_child, newindex, regionmask,\\n\\t\\t\\t\\t\\t\\t\\t\\t prefixtree);\",\n \" return newindex;\\n}\",\n \"\\n/*\\n * \\\":mkspell [-ascii] outfile infile ...\\\"\\n * \\\":mkspell [-ascii] addfile\\\"\\n */\\n void\\nex_mkspell(exarg_T *eap)\\n{\\n int\\t\\tfcount;\\n char_u\\t**fnames;\\n char_u\\t*arg = eap->arg;\\n int\\t\\tascii = FALSE;\",\n \" if (STRNCMP(arg, \\\"-ascii\\\", 6) == 0)\\n {\\n\\tascii = TRUE;\\n\\targ = skipwhite(arg + 6);\\n }\",\n \" // Expand all the remaining arguments (e.g., $VIMRUNTIME).\\n if (get_arglist_exp(arg, &fcount, &fnames, FALSE) == OK)\\n {\\n\\tmkspell(fcount, fnames, ascii, eap->forceit, FALSE);\\n\\tFreeWild(fcount, fnames);\\n }\\n}\",\n \"/*\\n * Create the .sug file.\\n * Uses the soundfold info in \\\"spin\\\".\\n * Writes the file with the name \\\"wfname\\\", with \\\".spl\\\" changed to \\\".sug\\\".\\n */\\n static void\\nspell_make_sugfile(spellinfo_T *spin, char_u *wfname)\\n{\\n char_u\\t*fname = NULL;\\n int\\t\\tlen;\\n slang_T\\t*slang;\\n int\\t\\tfree_slang = FALSE;\",\n \" /*\\n * Read back the .spl file that was written. This fills the required\\n * info for soundfolding. This also uses less memory than the\\n * pointer-linked version of the trie. And it avoids having two versions\\n * of the code for the soundfolding stuff.\\n * It might have been done already by spell_reload_one().\\n */\\n FOR_ALL_SPELL_LANGS(slang)\\n\\tif (fullpathcmp(wfname, slang->sl_fname, FALSE, TRUE) == FPC_SAME)\\n\\t break;\\n if (slang == NULL)\\n {\\n\\tspell_message(spin, (char_u *)_(\\\"Reading back spell file...\\\"));\\n\\tslang = spell_load_file(wfname, NULL, NULL, FALSE);\\n\\tif (slang == NULL)\\n\\t return;\\n\\tfree_slang = TRUE;\\n }\",\n \" /*\\n * Clear the info in \\\"spin\\\" that is used.\\n */\\n spin->si_blocks = NULL;\\n spin->si_blocks_cnt = 0;\\n spin->si_compress_cnt = 0;\\t // will stay at 0 all the time\\n spin->si_free_count = 0;\\n spin->si_first_free = NULL;\\n spin->si_foldwcount = 0;\",\n \" /*\\n * Go through the trie of good words, soundfold each word and add it to\\n * the soundfold trie.\\n */\\n spell_message(spin, (char_u *)_(\\\"Performing soundfolding...\\\"));\\n if (sug_filltree(spin, slang) == FAIL)\\n\\tgoto theend;\",\n \" /*\\n * Create the table which links each soundfold word with a list of the\\n * good words it may come from. Creates buffer \\\"spin->si_spellbuf\\\".\\n * This also removes the wordnr from the NUL byte entries to make\\n * compression possible.\\n */\\n if (sug_maketable(spin) == FAIL)\\n\\tgoto theend;\",\n \" smsg(_(\\\"Number of words after soundfolding: %ld\\\"),\\n\\t\\t\\t\\t (long)spin->si_spellbuf->b_ml.ml_line_count);\",\n \" /*\\n * Compress the soundfold trie.\\n */\\n spell_message(spin, (char_u *)_(msg_compressing));\\n wordtree_compress(spin, spin->si_foldroot, \\\"case-folded\\\");\",\n \" /*\\n * Write the .sug file.\\n * Make the file name by changing \\\".spl\\\" to \\\".sug\\\".\\n */\\n fname = alloc(MAXPATHL);\\n if (fname == NULL)\\n\\tgoto theend;\\n vim_strncpy(fname, wfname, MAXPATHL - 1);\\n len = (int)STRLEN(fname);\\n fname[len - 2] = 'u';\\n fname[len - 1] = 'g';\\n sug_write(spin, fname);\",\n \"theend:\\n vim_free(fname);\\n if (free_slang)\\n\\tslang_free(slang);\\n free_blocks(spin->si_blocks);\\n close_spellbuf(spin->si_spellbuf);\\n}\",\n \"/*\\n * Build the soundfold trie for language \\\"slang\\\".\\n */\\n static int\\nsug_filltree(spellinfo_T *spin, slang_T *slang)\\n{\\n char_u\\t*byts;\\n idx_T\\t*idxs;\\n int\\t\\tdepth;\\n idx_T\\tarridx[MAXWLEN];\\n int\\t\\tcuri[MAXWLEN];\\n char_u\\ttword[MAXWLEN];\\n char_u\\ttsalword[MAXWLEN];\\n int\\t\\tc;\\n idx_T\\tn;\\n unsigned\\twords_done = 0;\\n int\\t\\twordcount[MAXWLEN];\",\n \" // We use si_foldroot for the soundfolded trie.\\n spin->si_foldroot = wordtree_alloc(spin);\\n if (spin->si_foldroot == NULL)\\n\\treturn FAIL;\",\n \" // let tree_add_word() know we're adding to the soundfolded tree\\n spin->si_sugtree = TRUE;\",\n \" /*\\n * Go through the whole case-folded tree, soundfold each word and put it\\n * in the trie.\\n */\\n byts = slang->sl_fbyts;\\n idxs = slang->sl_fidxs;\",\n \" arridx[0] = 0;\\n curi[0] = 1;\\n wordcount[0] = 0;\",\n \" depth = 0;\\n while (depth >= 0 && !got_int)\\n {\\n\\tif (curi[depth] > byts[arridx[depth]])\\n\\t{\\n\\t // Done all bytes at this node, go up one level.\\n\\t idxs[arridx[depth]] = wordcount[depth];\\n\\t if (depth > 0)\\n\\t\\twordcount[depth - 1] += wordcount[depth];\",\n \"\\t --depth;\\n\\t line_breakcheck();\\n\\t}\\n\\telse\\n\\t{\",\n \"\\t // Do one more byte at this node.\\n\\t n = arridx[depth] + curi[depth];\\n\\t ++curi[depth];\",\n \"\\t c = byts[n];\\n\\t if (c == 0)\\n\\t {\\n\\t\\t// Sound-fold the word.\\n\\t\\ttword[depth] = NUL;\\n\\t\\tspell_soundfold(slang, tword, TRUE, tsalword);\",\n \"\\t\\t// We use the \\\"flags\\\" field for the MSB of the wordnr,\\n\\t\\t// \\\"region\\\" for the LSB of the wordnr.\\n\\t\\tif (tree_add_word(spin, tsalword, spin->si_foldroot,\\n\\t\\t\\t\\twords_done >> 16, words_done & 0xffff,\\n\\t\\t\\t\\t\\t\\t\\t 0) == FAIL)\\n\\t\\t return FAIL;\",\n \"\\t\\t++words_done;\\n\\t\\t++wordcount[depth];\",\n \"\\t\\t// Reset the block count each time to avoid compression\\n\\t\\t// kicking in.\\n\\t\\tspin->si_blocks_cnt = 0;\",\n \"\\t\\t// Skip over any other NUL bytes (same word with different\\n\\t\\t// flags). But don't go over the end.\\n\\t\\twhile (n + 1 < slang->sl_fbyts_len && byts[n + 1] == 0)\\n\\t\\t{\\n\\t\\t ++n;\\n\\t\\t ++curi[depth];\\n\\t\\t}\\n\\t }\\n\\t else\\n\\t {\\n\\t\\t// Normal char, go one level deeper.\\n\\t\\ttword[depth++] = c;\\n\\t\\tarridx[depth] = idxs[n];\\n\\t\\tcuri[depth] = 1;\\n\\t\\twordcount[depth] = 0;\\n\\t }\\n\\t}\\n }\",\n \" smsg(_(\\\"Total number of words: %d\\\"), words_done);\",\n \" return OK;\\n}\",\n \"/*\\n * Make the table that links each word in the soundfold trie to the words it\\n * can be produced from.\\n * This is not unlike lines in a file, thus use a memfile to be able to access\\n * the table efficiently.\\n * Returns FAIL when out of memory.\\n */\\n static int\\nsug_maketable(spellinfo_T *spin)\\n{\\n garray_T\\tga;\\n int\\t\\tres = OK;\",\n \" // Allocate a buffer, open a memline for it and create the swap file\\n // (uses a temp file, not a .swp file).\\n spin->si_spellbuf = open_spellbuf();\\n if (spin->si_spellbuf == NULL)\\n\\treturn FAIL;\",\n \" // Use a buffer to store the line info, avoids allocating many small\\n // pieces of memory.\\n ga_init2(&ga, 1, 100);\",\n \" // recursively go through the tree\\n if (sug_filltable(spin, spin->si_foldroot->wn_sibling, 0, &ga) == -1)\\n\\tres = FAIL;\",\n \" ga_clear(&ga);\\n return res;\\n}\",\n \"/*\\n * Fill the table for one node and its children.\\n * Returns the wordnr at the start of the node.\\n * Returns -1 when out of memory.\\n */\\n static int\\nsug_filltable(\\n spellinfo_T\\t*spin,\\n wordnode_T\\t*node,\\n int\\t\\tstartwordnr,\\n garray_T\\t*gap)\\t // place to store line of numbers\\n{\\n wordnode_T\\t*p, *np;\\n int\\t\\twordnr = startwordnr;\\n int\\t\\tnr;\\n int\\t\\tprev_nr;\",\n \" FOR_ALL_NODE_SIBLINGS(node, p)\\n {\\n\\tif (p->wn_byte == NUL)\\n\\t{\\n\\t gap->ga_len = 0;\\n\\t prev_nr = 0;\\n\\t for (np = p; np != NULL && np->wn_byte == NUL; np = np->wn_sibling)\\n\\t {\\n\\t\\tif (ga_grow(gap, 10) == FAIL)\\n\\t\\t return -1;\",\n \"\\t\\tnr = (np->wn_flags << 16) + (np->wn_region & 0xffff);\\n\\t\\t// Compute the offset from the previous nr and store the\\n\\t\\t// offset in a way that it takes a minimum number of bytes.\\n\\t\\t// It's a bit like utf-8, but without the need to mark\\n\\t\\t// following bytes.\\n\\t\\tnr -= prev_nr;\\n\\t\\tprev_nr += nr;\\n\\t\\tgap->ga_len += offset2bytes(nr,\\n\\t\\t\\t\\t\\t (char_u *)gap->ga_data + gap->ga_len);\\n\\t }\",\n \"\\t // add the NUL byte\\n\\t ((char_u *)gap->ga_data)[gap->ga_len++] = NUL;\",\n \"\\t if (ml_append_buf(spin->si_spellbuf, (linenr_T)wordnr,\\n\\t\\t\\t\\t gap->ga_data, gap->ga_len, TRUE) == FAIL)\\n\\t\\treturn -1;\\n\\t ++wordnr;\",\n \"\\t // Remove extra NUL entries, we no longer need them. We don't\\n\\t // bother freeing the nodes, they won't be reused anyway.\\n\\t while (p->wn_sibling != NULL && p->wn_sibling->wn_byte == NUL)\\n\\t\\tp->wn_sibling = p->wn_sibling->wn_sibling;\",\n \"\\t // Clear the flags on the remaining NUL node, so that compression\\n\\t // works a lot better.\\n\\t p->wn_flags = 0;\\n\\t p->wn_region = 0;\\n\\t}\\n\\telse\\n\\t{\\n\\t wordnr = sug_filltable(spin, p->wn_child, wordnr, gap);\\n\\t if (wordnr == -1)\\n\\t\\treturn -1;\\n\\t}\\n }\\n return wordnr;\\n}\",\n \"/*\\n * Convert an offset into a minimal number of bytes.\\n * Similar to utf_char2byters, but use 8 bits in followup bytes and avoid NUL\\n * bytes.\\n */\\n static int\\noffset2bytes(int nr, char_u *buf)\\n{\\n int\\t rem;\\n int\\t b1, b2, b3, b4;\",\n \" // Split the number in parts of base 255. We need to avoid NUL bytes.\\n b1 = nr % 255 + 1;\\n rem = nr / 255;\\n b2 = rem % 255 + 1;\\n rem = rem / 255;\\n b3 = rem % 255 + 1;\\n b4 = rem / 255 + 1;\",\n \" if (b4 > 1 || b3 > 0x1f)\\t// 4 bytes\\n {\\n\\tbuf[0] = 0xe0 + b4;\\n\\tbuf[1] = b3;\\n\\tbuf[2] = b2;\\n\\tbuf[3] = b1;\\n\\treturn 4;\\n }\\n if (b3 > 1 || b2 > 0x3f )\\t// 3 bytes\\n {\\n\\tbuf[0] = 0xc0 + b3;\\n\\tbuf[1] = b2;\\n\\tbuf[2] = b1;\\n\\treturn 3;\\n }\\n if (b2 > 1 || b1 > 0x7f )\\t// 2 bytes\\n {\\n\\tbuf[0] = 0x80 + b2;\\n\\tbuf[1] = b1;\\n\\treturn 2;\\n }\\n\\t\\t\\t\\t// 1 byte\\n buf[0] = b1;\\n return 1;\\n}\",\n \"/*\\n * Write the .sug file in \\\"fname\\\".\\n */\\n static void\\nsug_write(spellinfo_T *spin, char_u *fname)\\n{\\n FILE\\t*fd;\\n wordnode_T\\t*tree;\\n int\\t\\tnodecount;\\n int\\t\\twcount;\\n char_u\\t*line;\\n linenr_T\\tlnum;\\n int\\t\\tlen;\",\n \" // Create the file. Note that an existing file is silently overwritten!\\n fd = mch_fopen((char *)fname, \\\"w\\\");\\n if (fd == NULL)\\n {\\n\\tsemsg(_(e_cant_open_file_str), fname);\\n\\treturn;\\n }\",\n \" vim_snprintf((char *)IObuff, IOSIZE,\\n\\t\\t\\t\\t _(\\\"Writing suggestion file %s...\\\"), fname);\\n spell_message(spin, IObuff);\",\n \" /*\\n * <SUGHEADER>: <fileID> <versionnr> <timestamp>\\n */\\n if (fwrite(VIMSUGMAGIC, VIMSUGMAGICL, (size_t)1, fd) != 1) // <fileID>\\n {\\n\\temsg(_(e_error_while_writing));\\n\\tgoto theend;\\n }\\n putc(VIMSUGVERSION, fd);\\t\\t\\t\\t// <versionnr>\",\n \" // Write si_sugtime to the file.\\n put_time(fd, spin->si_sugtime);\\t\\t\\t// <timestamp>\",\n \" /*\\n * <SUGWORDTREE>\\n */\\n spin->si_memtot = 0;\\n tree = spin->si_foldroot->wn_sibling;\",\n \" // Clear the index and wnode fields in the tree.\\n clear_node(tree);\",\n \" // Count the number of nodes. Needed to be able to allocate the\\n // memory when reading the nodes. Also fills in index for shared\\n // nodes.\\n nodecount = put_node(NULL, tree, 0, 0, FALSE);\",\n \" // number of nodes in 4 bytes\\n put_bytes(fd, (long_u)nodecount, 4);\\t// <nodecount>\\n spin->si_memtot += nodecount + nodecount * sizeof(int);\",\n \" // Write the nodes.\\n (void)put_node(fd, tree, 0, 0, FALSE);\",\n \" /*\\n * <SUGTABLE>: <sugwcount> <sugline> ...\\n */\\n wcount = spin->si_spellbuf->b_ml.ml_line_count;\\n put_bytes(fd, (long_u)wcount, 4);\\t// <sugwcount>\",\n \" for (lnum = 1; lnum <= (linenr_T)wcount; ++lnum)\\n {\\n\\t// <sugline>: <sugnr> ... NUL\\n\\tline = ml_get_buf(spin->si_spellbuf, lnum, FALSE);\\n\\tlen = (int)STRLEN(line) + 1;\\n\\tif (fwrite(line, (size_t)len, (size_t)1, fd) == 0)\\n\\t{\\n\\t emsg(_(e_error_while_writing));\\n\\t goto theend;\\n\\t}\\n\\tspin->si_memtot += len;\\n }\",\n \" // Write another byte to check for errors.\\n if (putc(0, fd) == EOF)\\n\\temsg(_(e_error_while_writing));\",\n \" vim_snprintf((char *)IObuff, IOSIZE,\\n\\t\\t _(\\\"Estimated runtime memory use: %d bytes\\\"), spin->si_memtot);\\n spell_message(spin, IObuff);\",\n \"theend:\\n // close the file\\n fclose(fd);\\n}\",\n \"\\n/*\\n * Create a Vim spell file from one or more word lists.\\n * \\\"fnames[0]\\\" is the output file name.\\n * \\\"fnames[fcount - 1]\\\" is the last input file name.\\n * Exception: when \\\"fnames[0]\\\" ends in \\\".add\\\" it's used as the input file name\\n * and \\\".spl\\\" is appended to make the output file name.\\n */\\n void\\nmkspell(\\n int\\t\\tfcount,\\n char_u\\t**fnames,\\n int\\t\\tascii,\\t\\t // -ascii argument given\\n int\\t\\tover_write,\\t // overwrite existing output file\\n int\\t\\tadded_word)\\t // invoked through \\\"zg\\\"\\n{\\n char_u\\t*fname = NULL;\\n char_u\\t*wfname;\\n char_u\\t**innames;\\n int\\t\\tincount;\\n afffile_T\\t*(afile[MAXREGIONS]);\\n int\\t\\ti;\\n int\\t\\tlen;\\n stat_T\\tst;\\n int\\t\\terror = FALSE;\\n spellinfo_T spin;\",\n \" CLEAR_FIELD(spin);\\n spin.si_verbose = !added_word;\\n spin.si_ascii = ascii;\\n spin.si_followup = TRUE;\\n spin.si_rem_accents = TRUE;\\n ga_init2(&spin.si_rep, sizeof(fromto_T), 20);\\n ga_init2(&spin.si_repsal, sizeof(fromto_T), 20);\\n ga_init2(&spin.si_sal, sizeof(fromto_T), 20);\\n ga_init2(&spin.si_map, sizeof(char_u), 100);\\n ga_init2(&spin.si_comppat, sizeof(char_u *), 20);\\n ga_init2(&spin.si_prefcond, sizeof(char_u *), 50);\\n hash_init(&spin.si_commonwords);\\n spin.si_newcompID = 127;\\t// start compound ID at first maximum\",\n \" // default: fnames[0] is output file, following are input files\\n // When \\\"fcount\\\" is 1 there is only one file.\\n innames = &fnames[fcount == 1 ? 0 : 1];\\n incount = fcount - 1;\",\n \" wfname = alloc(MAXPATHL);\\n if (wfname == NULL)\\n\\treturn;\",\n \" if (fcount >= 1)\\n {\\n\\tlen = (int)STRLEN(fnames[0]);\\n\\tif (fcount == 1 && len > 4 && STRCMP(fnames[0] + len - 4, \\\".add\\\") == 0)\\n\\t{\\n\\t // For \\\":mkspell path/en.latin1.add\\\" output file is\\n\\t // \\\"path/en.latin1.add.spl\\\".\\n\\t incount = 1;\\n\\t vim_snprintf((char *)wfname, MAXPATHL, \\\"%s.spl\\\", fnames[0]);\\n\\t}\\n\\telse if (fcount == 1)\\n\\t{\\n\\t // For \\\":mkspell path/vim\\\" output file is \\\"path/vim.latin1.spl\\\".\\n\\t incount = 1;\\n\\t vim_snprintf((char *)wfname, MAXPATHL, SPL_FNAME_TMPL,\\n\\t\\t fnames[0], spin.si_ascii ? (char_u *)\\\"ascii\\\" : spell_enc());\\n\\t}\\n\\telse if (len > 4 && STRCMP(fnames[0] + len - 4, \\\".spl\\\") == 0)\\n\\t{\\n\\t // Name ends in \\\".spl\\\", use as the file name.\\n\\t vim_strncpy(wfname, fnames[0], MAXPATHL - 1);\\n\\t}\\n\\telse\\n\\t // Name should be language, make the file name from it.\\n\\t vim_snprintf((char *)wfname, MAXPATHL, SPL_FNAME_TMPL,\\n\\t\\t fnames[0], spin.si_ascii ? (char_u *)\\\"ascii\\\" : spell_enc());\",\n \"\\t// Check for .ascii.spl.\\n\\tif (strstr((char *)gettail(wfname), SPL_FNAME_ASCII) != NULL)\\n\\t spin.si_ascii = TRUE;\",\n \"\\t// Check for .add.spl.\\n\\tif (strstr((char *)gettail(wfname), SPL_FNAME_ADD) != NULL)\\n\\t spin.si_add = TRUE;\\n }\",\n \" if (incount <= 0)\\n\\temsg(_(e_invalid_argument));\\t// need at least output and input names\\n else if (vim_strchr(gettail(wfname), '_') != NULL)\\n\\temsg(_(e_output_file_name_must_not_have_region_name));\\n else if (incount > MAXREGIONS)\\n\\tsemsg(_(e_only_up_to_nr_regions_supported), MAXREGIONS);\\n else\\n {\\n\\t// Check for overwriting before doing things that may take a lot of\\n\\t// time.\\n\\tif (!over_write && mch_stat((char *)wfname, &st) >= 0)\\n\\t{\\n\\t emsg(_(e_file_exists));\\n\\t goto theend;\\n\\t}\\n\\tif (mch_isdir(wfname))\\n\\t{\\n\\t semsg(_(e_str_is_directory), wfname);\\n\\t goto theend;\\n\\t}\",\n \"\\tfname = alloc(MAXPATHL);\\n\\tif (fname == NULL)\\n\\t goto theend;\",\n \"\\t/*\\n\\t * Init the aff and dic pointers.\\n\\t * Get the region names if there are more than 2 arguments.\\n\\t */\\n\\tfor (i = 0; i < incount; ++i)\\n\\t{\\n\\t afile[i] = NULL;\",\n \"\\t if (incount > 1)\\n\\t {\\n\\t\\tlen = (int)STRLEN(innames[i]);\\n\\t\\tif (STRLEN(gettail(innames[i])) < 5\\n\\t\\t\\t\\t\\t\\t|| innames[i][len - 3] != '_')\\n\\t\\t{\\n\\t\\t semsg(_(e_invalid_region_in_str), innames[i]);\\n\\t\\t goto theend;\\n\\t\\t}\\n\\t\\tspin.si_region_name[i * 2] = TOLOWER_ASC(innames[i][len - 2]);\\n\\t\\tspin.si_region_name[i * 2 + 1] =\\n\\t\\t\\t\\t\\t TOLOWER_ASC(innames[i][len - 1]);\\n\\t }\\n\\t}\\n\\tspin.si_region_count = incount;\",\n \"\\tspin.si_foldroot = wordtree_alloc(&spin);\\n\\tspin.si_keeproot = wordtree_alloc(&spin);\\n\\tspin.si_prefroot = wordtree_alloc(&spin);\\n\\tif (spin.si_foldroot == NULL\\n\\t\\t|| spin.si_keeproot == NULL\\n\\t\\t|| spin.si_prefroot == NULL)\\n\\t{\\n\\t free_blocks(spin.si_blocks);\\n\\t goto theend;\\n\\t}\",\n \"\\t// When not producing a .add.spl file clear the character table when\\n\\t// we encounter one in the .aff file. This means we dump the current\\n\\t// one in the .spl file if the .aff file doesn't define one. That's\\n\\t// better than guessing the contents, the table will match a\\n\\t// previously loaded spell file.\\n\\tif (!spin.si_add)\\n\\t spin.si_clear_chartab = TRUE;\",\n \"\\t/*\\n\\t * Read all the .aff and .dic files.\\n\\t * Text is converted to 'encoding'.\\n\\t * Words are stored in the case-folded and keep-case trees.\\n\\t */\\n\\tfor (i = 0; i < incount && !error; ++i)\\n\\t{\\n\\t spin.si_conv.vc_type = CONV_NONE;\\n\\t spin.si_region = 1 << i;\",\n \"\\t vim_snprintf((char *)fname, MAXPATHL, \\\"%s.aff\\\", innames[i]);\\n\\t if (mch_stat((char *)fname, &st) >= 0)\\n\\t {\\n\\t\\t// Read the .aff file. Will init \\\"spin->si_conv\\\" based on the\\n\\t\\t// \\\"SET\\\" line.\\n\\t\\tafile[i] = spell_read_aff(&spin, fname);\\n\\t\\tif (afile[i] == NULL)\\n\\t\\t error = TRUE;\\n\\t\\telse\\n\\t\\t{\\n\\t\\t // Read the .dic file and store the words in the trees.\\n\\t\\t vim_snprintf((char *)fname, MAXPATHL, \\\"%s.dic\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t innames[i]);\\n\\t\\t if (spell_read_dic(&spin, fname, afile[i]) == FAIL)\\n\\t\\t\\terror = TRUE;\\n\\t\\t}\\n\\t }\\n\\t else\\n\\t {\\n\\t\\t// No .aff file, try reading the file as a word list. Store\\n\\t\\t// the words in the trees.\\n\\t\\tif (spell_read_wordfile(&spin, innames[i]) == FAIL)\\n\\t\\t error = TRUE;\\n\\t }\",\n \"\\t // Free any conversion stuff.\\n\\t convert_setup(&spin.si_conv, NULL, NULL);\\n\\t}\",\n \"\\tif (spin.si_compflags != NULL && spin.si_nobreak)\\n\\t msg(_(\\\"Warning: both compounding and NOBREAK specified\\\"));\",\n \"\\tif (!error && !got_int)\\n\\t{\\n\\t /*\\n\\t * Combine tails in the tree.\\n\\t */\\n\\t spell_message(&spin, (char_u *)_(msg_compressing));\\n\\t wordtree_compress(&spin, spin.si_foldroot, \\\"case-folded\\\");\\n\\t wordtree_compress(&spin, spin.si_keeproot, \\\"keep-case\\\");\\n\\t wordtree_compress(&spin, spin.si_prefroot, \\\"prefixes\\\");\\n\\t}\",\n \"\\tif (!error && !got_int)\\n\\t{\\n\\t /*\\n\\t * Write the info in the spell file.\\n\\t */\\n\\t vim_snprintf((char *)IObuff, IOSIZE,\\n\\t\\t\\t\\t _(\\\"Writing spell file %s...\\\"), wfname);\\n\\t spell_message(&spin, IObuff);\",\n \"\\t error = write_vim_spell(&spin, wfname) == FAIL;\",\n \"\\t spell_message(&spin, (char_u *)_(\\\"Done!\\\"));\\n\\t vim_snprintf((char *)IObuff, IOSIZE,\\n\\t\\t _(\\\"Estimated runtime memory use: %d bytes\\\"), spin.si_memtot);\\n\\t spell_message(&spin, IObuff);\",\n \"\\t /*\\n\\t * If the file is loaded need to reload it.\\n\\t */\\n\\t if (!error)\\n\\t\\tspell_reload_one(wfname, added_word);\\n\\t}\",\n \"\\t// Free the allocated memory.\\n\\tga_clear(&spin.si_rep);\\n\\tga_clear(&spin.si_repsal);\\n\\tga_clear(&spin.si_sal);\\n\\tga_clear(&spin.si_map);\\n\\tga_clear(&spin.si_comppat);\\n\\tga_clear(&spin.si_prefcond);\\n\\thash_clear_all(&spin.si_commonwords, 0);\",\n \"\\t// Free the .aff file structures.\\n\\tfor (i = 0; i < incount; ++i)\\n\\t if (afile[i] != NULL)\\n\\t\\tspell_free_aff(afile[i]);\",\n \"\\t// Free all the bits and pieces at once.\\n\\tfree_blocks(spin.si_blocks);\",\n \"\\t/*\\n\\t * If there is soundfolding info and no NOSUGFILE item create the\\n\\t * .sug file with the soundfolded word trie.\\n\\t */\\n\\tif (spin.si_sugtime != 0 && !error && !got_int)\\n\\t spell_make_sugfile(&spin, wfname);\",\n \" }\",\n \"theend:\\n vim_free(fname);\\n vim_free(wfname);\\n}\",\n \"/*\\n * Display a message for spell file processing when 'verbose' is set or using\\n * \\\":mkspell\\\". \\\"str\\\" can be IObuff.\\n */\\n static void\\nspell_message(spellinfo_T *spin, char_u *str)\\n{\\n if (spin->si_verbose || p_verbose > 2)\\n {\\n\\tif (!spin->si_verbose)\\n\\t verbose_enter();\\n\\tmsg((char *)str);\\n\\tout_flush();\\n\\tif (!spin->si_verbose)\\n\\t verbose_leave();\\n }\\n}\",\n \"/*\\n * \\\":[count]spellgood {word}\\\"\\n * \\\":[count]spellwrong {word}\\\"\\n * \\\":[count]spellundo {word}\\\"\\n * \\\":[count]spellrare {word}\\\"\\n */\\n void\\nex_spell(exarg_T *eap)\\n{\\n spell_add_word(eap->arg, (int)STRLEN(eap->arg),\\n\\t\\teap->cmdidx == CMD_spellwrong ? SPELL_ADD_BAD :\\n\\t\\teap->cmdidx == CMD_spellrare ? SPELL_ADD_RARE : SPELL_ADD_GOOD,\\n\\t\\t\\t\\t eap->forceit ? 0 : (int)eap->line2,\\n\\t\\t\\t\\t eap->cmdidx == CMD_spellundo);\\n}\",\n \"/*\\n * Add \\\"word[len]\\\" to 'spellfile' as a good, rare or bad word.\\n */\\n void\\nspell_add_word(\\n char_u\\t*word,\\n int\\t\\tlen,\\n int\\t\\twhat,\\t // SPELL_ADD_ values\\n int\\t\\tidx,\\t // \\\"zG\\\" and \\\"zW\\\": zero, otherwise index in\\n\\t\\t\\t // 'spellfile'\\n int\\t\\tundo)\\t // TRUE for \\\"zug\\\", \\\"zuG\\\", \\\"zuw\\\" and \\\"zuW\\\"\\n{\\n FILE\\t*fd = NULL;\\n buf_T\\t*buf = NULL;\\n int\\t\\tnew_spf = FALSE;\\n char_u\\t*fname;\\n char_u\\t*fnamebuf = NULL;\\n char_u\\tline[MAXWLEN * 2];\\n long\\tfpos, fpos_next = 0;\\n int\\t\\ti;\\n char_u\\t*spf;\\n\",\n \" if (enc_utf8 && !utf_valid_string(word, NULL))\\n {\\n\\temsg(_(e_illegal_character_in_word));\\n\\treturn;\\n }\\n\",\n \" if (idx == 0)\\t // use internal wordlist\\n {\\n\\tif (int_wordlist == NULL)\\n\\t{\\n\\t int_wordlist = vim_tempname('s', FALSE);\\n\\t if (int_wordlist == NULL)\\n\\t\\treturn;\\n\\t}\\n\\tfname = int_wordlist;\\n }\\n else\\n {\\n\\t// If 'spellfile' isn't set figure out a good default value.\\n\\tif (*curwin->w_s->b_p_spf == NUL)\\n\\t{\\n\\t init_spellfile();\\n\\t new_spf = TRUE;\\n\\t}\",\n \"\\tif (*curwin->w_s->b_p_spf == NUL)\\n\\t{\\n\\t semsg(_(e_option_str_is_not_set), \\\"spellfile\\\");\\n\\t return;\\n\\t}\\n\\tfnamebuf = alloc(MAXPATHL);\\n\\tif (fnamebuf == NULL)\\n\\t return;\",\n \"\\tfor (spf = curwin->w_s->b_p_spf, i = 1; *spf != NUL; ++i)\\n\\t{\\n\\t copy_option_part(&spf, fnamebuf, MAXPATHL, \\\",\\\");\\n\\t if (i == idx)\\n\\t\\tbreak;\\n\\t if (*spf == NUL)\\n\\t {\\n\\t\\tsemsg(_(e_spellfile_does_not_have_nr_entries), idx);\\n\\t\\tvim_free(fnamebuf);\\n\\t\\treturn;\\n\\t }\\n\\t}\",\n \"\\t// Check that the user isn't editing the .add file somewhere.\\n\\tbuf = buflist_findname_exp(fnamebuf);\\n\\tif (buf != NULL && buf->b_ml.ml_mfp == NULL)\\n\\t buf = NULL;\\n\\tif (buf != NULL && bufIsChanged(buf))\\n\\t{\\n\\t emsg(_(e_file_is_loaded_in_another_buffer));\\n\\t vim_free(fnamebuf);\\n\\t return;\\n\\t}\",\n \"\\tfname = fnamebuf;\\n }\",\n \" if (what == SPELL_ADD_BAD || undo)\\n {\\n\\t// When the word appears as good word we need to remove that one,\\n\\t// since its flags sort before the one with WF_BANNED.\\n\\tfd = mch_fopen((char *)fname, \\\"r\\\");\\n\\tif (fd != NULL)\\n\\t{\\n\\t while (!vim_fgets(line, MAXWLEN * 2, fd))\\n\\t {\\n\\t\\tfpos = fpos_next;\\n\\t\\tfpos_next = ftell(fd);\\n\\t\\tif (fpos_next < 0)\\n\\t\\t break; // should never happen\\n\\t\\tif (STRNCMP(word, line, len) == 0\\n\\t\\t\\t&& (line[len] == '/' || line[len] < ' '))\\n\\t\\t{\\n\\t\\t // Found duplicate word. Remove it by writing a '#' at\\n\\t\\t // the start of the line. Mixing reading and writing\\n\\t\\t // doesn't work for all systems, close the file first.\\n\\t\\t fclose(fd);\\n\\t\\t fd = mch_fopen((char *)fname, \\\"r+\\\");\\n\\t\\t if (fd == NULL)\\n\\t\\t\\tbreak;\\n\\t\\t if (fseek(fd, fpos, SEEK_SET) == 0)\\n\\t\\t {\\n\\t\\t\\tfputc('#', fd);\\n\\t\\t\\tif (undo)\\n\\t\\t\\t{\\n\\t\\t\\t home_replace(NULL, fname, NameBuff, MAXPATHL, TRUE);\\n\\t\\t\\t smsg(_(\\\"Word '%.*s' removed from %s\\\"),\\n\\t\\t\\t\\t\\t\\t\\t len, word, NameBuff);\\n\\t\\t\\t}\\n\\t\\t }\\n\\t\\t if (fseek(fd, fpos_next, SEEK_SET) != 0)\\n\\t\\t {\\n\\t\\t\\tPERROR(_(\\\"Seek error in spellfile\\\"));\\n\\t\\t\\tbreak;\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t if (fd != NULL)\\n\\t\\tfclose(fd);\\n\\t}\\n }\",\n \" if (!undo)\\n {\\n\\tfd = mch_fopen((char *)fname, \\\"a\\\");\\n\\tif (fd == NULL && new_spf)\\n\\t{\\n\\t char_u *p;\",\n \"\\t // We just initialized the 'spellfile' option and can't open the\\n\\t // file. We may need to create the \\\"spell\\\" directory first. We\\n\\t // already checked the runtime directory is writable in\\n\\t // init_spellfile().\\n\\t if (!dir_of_file_exists(fname) && (p = gettail_sep(fname)) != fname)\\n\\t {\\n\\t\\tint c = *p;\",\n \"\\t\\t// The directory doesn't exist. Try creating it and opening\\n\\t\\t// the file again.\\n\\t\\t*p = NUL;\\n\\t\\tvim_mkdir(fname, 0755);\\n\\t\\t*p = c;\\n\\t\\tfd = mch_fopen((char *)fname, \\\"a\\\");\\n\\t }\\n\\t}\",\n \"\\tif (fd == NULL)\\n\\t semsg(_(e_cant_open_file_str), fname);\\n\\telse\\n\\t{\\n\\t if (what == SPELL_ADD_BAD)\\n\\t\\tfprintf(fd, \\\"%.*s/!\\\\n\\\", len, word);\\n\\t else if (what == SPELL_ADD_RARE)\\n\\t\\tfprintf(fd, \\\"%.*s/?\\\\n\\\", len, word);\\n\\t else\\n\\t\\tfprintf(fd, \\\"%.*s\\\\n\\\", len, word);\\n\\t fclose(fd);\",\n \"\\t home_replace(NULL, fname, NameBuff, MAXPATHL, TRUE);\\n\\t smsg(_(\\\"Word '%.*s' added to %s\\\"), len, word, NameBuff);\\n\\t}\\n }\",\n \" if (fd != NULL)\\n {\\n\\t// Update the .add.spl file.\\n\\tmkspell(1, &fname, FALSE, TRUE, TRUE);\",\n \"\\t// If the .add file is edited somewhere, reload it.\\n\\tif (buf != NULL)\\n\\t buf_reload(buf, buf->b_orig_mode, FALSE);\",\n \"\\tredraw_all_later(SOME_VALID);\\n }\\n vim_free(fnamebuf);\\n}\",\n \"/*\\n * Initialize 'spellfile' for the current buffer.\\n */\\n static void\\ninit_spellfile(void)\\n{\\n char_u\\t*buf;\\n int\\t\\tl;\\n char_u\\t*fname;\\n char_u\\t*rtp;\\n char_u\\t*lend;\\n int\\t\\taspath = FALSE;\\n char_u\\t*lstart = curbuf->b_s.b_p_spl;\",\n \" if (*curwin->w_s->b_p_spl != NUL && curwin->w_s->b_langp.ga_len > 0)\\n {\\n\\tbuf = alloc(MAXPATHL);\\n\\tif (buf == NULL)\\n\\t return;\",\n \"\\t// Find the end of the language name. Exclude the region. If there\\n\\t// is a path separator remember the start of the tail.\\n\\tfor (lend = curwin->w_s->b_p_spl; *lend != NUL\\n\\t\\t\\t&& vim_strchr((char_u *)\\\",._\\\", *lend) == NULL; ++lend)\\n\\t if (vim_ispathsep(*lend))\\n\\t {\\n\\t\\taspath = TRUE;\\n\\t\\tlstart = lend + 1;\\n\\t }\",\n \"\\t// Loop over all entries in 'runtimepath'. Use the first one where we\\n\\t// are allowed to write.\\n\\trtp = p_rtp;\\n\\twhile (*rtp != NUL)\\n\\t{\\n\\t if (aspath)\\n\\t\\t// Use directory of an entry with path, e.g., for\\n\\t\\t// \\\"/dir/lg.utf-8.spl\\\" use \\\"/dir\\\".\\n\\t\\tvim_strncpy(buf, curbuf->b_s.b_p_spl,\\n\\t\\t\\t\\t\\t lstart - curbuf->b_s.b_p_spl - 1);\\n\\t else\\n\\t\\t// Copy the path from 'runtimepath' to buf[].\\n\\t\\tcopy_option_part(&rtp, buf, MAXPATHL, \\\",\\\");\\n\\t if (filewritable(buf) == 2)\\n\\t {\\n\\t\\t// Use the first language name from 'spelllang' and the\\n\\t\\t// encoding used in the first loaded .spl file.\\n\\t\\tif (aspath)\\n\\t\\t vim_strncpy(buf, curbuf->b_s.b_p_spl,\\n\\t\\t\\t\\t\\t\\t lend - curbuf->b_s.b_p_spl);\\n\\t\\telse\\n\\t\\t{\\n\\t\\t // Create the \\\"spell\\\" directory if it doesn't exist yet.\\n\\t\\t l = (int)STRLEN(buf);\\n\\t\\t vim_snprintf((char *)buf + l, MAXPATHL - l, \\\"/spell\\\");\\n\\t\\t if (filewritable(buf) != 2)\\n\\t\\t\\tvim_mkdir(buf, 0755);\",\n \"\\t\\t l = (int)STRLEN(buf);\\n\\t\\t vim_snprintf((char *)buf + l, MAXPATHL - l,\\n\\t\\t\\t\\t \\\"/%.*s\\\", (int)(lend - lstart), lstart);\\n\\t\\t}\\n\\t\\tl = (int)STRLEN(buf);\\n\\t\\tfname = LANGP_ENTRY(curwin->w_s->b_langp, 0)\\n\\t\\t\\t\\t\\t\\t\\t ->lp_slang->sl_fname;\\n\\t\\tvim_snprintf((char *)buf + l, MAXPATHL - l, \\\".%s.add\\\",\\n\\t\\t\\tfname != NULL\\n\\t\\t\\t && strstr((char *)gettail(fname), \\\".ascii.\\\") != NULL\\n\\t\\t\\t\\t ? (char_u *)\\\"ascii\\\" : spell_enc());\\n\\t\\tset_option_value_give_err((char_u *)\\\"spellfile\\\",\\n\\t\\t\\t\\t\\t\\t\\t 0L, buf, OPT_LOCAL);\\n\\t\\tbreak;\\n\\t }\\n\\t aspath = FALSE;\\n\\t}\",\n \"\\tvim_free(buf);\\n }\\n}\",\n \"\",\n \"/*\\n * Set the spell character tables from strings in the affix file.\\n */\\n static int\\nset_spell_chartab(char_u *fol, char_u *low, char_u *upp)\\n{\\n // We build the new tables here first, so that we can compare with the\\n // previous one.\\n spelltab_T\\tnew_st;\\n char_u\\t*pf = fol, *pl = low, *pu = upp;\\n int\\t\\tf, l, u;\",\n \" clear_spell_chartab(&new_st);\",\n \" while (*pf != NUL)\\n {\\n\\tif (*pl == NUL || *pu == NUL)\\n\\t{\\n\\t emsg(_(e_format_error_in_affix_file_fol_low_or_upp));\\n\\t return FAIL;\\n\\t}\\n\\tf = mb_ptr2char_adv(&pf);\\n\\tl = mb_ptr2char_adv(&pl);\\n\\tu = mb_ptr2char_adv(&pu);\",\n \"\\t// Every character that appears is a word character.\\n\\tif (f < 256)\\n\\t new_st.st_isw[f] = TRUE;\\n\\tif (l < 256)\\n\\t new_st.st_isw[l] = TRUE;\\n\\tif (u < 256)\\n\\t new_st.st_isw[u] = TRUE;\",\n \"\\t// if \\\"LOW\\\" and \\\"FOL\\\" are not the same the \\\"LOW\\\" char needs\\n\\t// case-folding\\n\\tif (l < 256 && l != f)\\n\\t{\\n\\t if (f >= 256)\\n\\t {\\n\\t\\temsg(_(e_character_in_fol_low_or_upp_is_out_of_range));\\n\\t\\treturn FAIL;\\n\\t }\\n\\t new_st.st_fold[l] = f;\\n\\t}\",\n \"\\t// if \\\"UPP\\\" and \\\"FOL\\\" are not the same the \\\"UPP\\\" char needs\\n\\t// case-folding, it's upper case and the \\\"UPP\\\" is the upper case of\\n\\t// \\\"FOL\\\" .\\n\\tif (u < 256 && u != f)\\n\\t{\\n\\t if (f >= 256)\\n\\t {\\n\\t\\temsg(_(e_character_in_fol_low_or_upp_is_out_of_range));\\n\\t\\treturn FAIL;\\n\\t }\\n\\t new_st.st_fold[u] = f;\\n\\t new_st.st_isu[u] = TRUE;\\n\\t new_st.st_upper[f] = u;\\n\\t}\\n }\",\n \" if (*pl != NUL || *pu != NUL)\\n {\\n\\temsg(_(e_format_error_in_affix_file_fol_low_or_upp));\\n\\treturn FAIL;\\n }\",\n \" return set_spell_finish(&new_st);\\n}\",\n \"/*\\n * Set the spell character tables from strings in the .spl file.\\n */\\n static void\\nset_spell_charflags(\\n char_u\\t*flags,\\n int\\t\\tcnt,\\t // length of \\\"flags\\\"\\n char_u\\t*fol)\\n{\\n // We build the new tables here first, so that we can compare with the\\n // previous one.\\n spelltab_T\\tnew_st;\\n int\\t\\ti;\\n char_u\\t*p = fol;\\n int\\t\\tc;\",\n \" clear_spell_chartab(&new_st);\",\n \" for (i = 0; i < 128; ++i)\\n {\\n\\tif (i < cnt)\\n\\t{\\n\\t new_st.st_isw[i + 128] = (flags[i] & CF_WORD) != 0;\\n\\t new_st.st_isu[i + 128] = (flags[i] & CF_UPPER) != 0;\\n\\t}\",\n \"\\tif (*p != NUL)\\n\\t{\\n\\t c = mb_ptr2char_adv(&p);\\n\\t new_st.st_fold[i + 128] = c;\\n\\t if (i + 128 != c && new_st.st_isu[i + 128] && c < 256)\\n\\t\\tnew_st.st_upper[c] = i + 128;\\n\\t}\\n }\",\n \" (void)set_spell_finish(&new_st);\\n}\",\n \" static int\\nset_spell_finish(spelltab_T *new_st)\\n{\\n int\\t\\ti;\",\n \" if (did_set_spelltab)\\n {\\n\\t// check that it's the same table\\n\\tfor (i = 0; i < 256; ++i)\\n\\t{\\n\\t if (spelltab.st_isw[i] != new_st->st_isw[i]\\n\\t\\t || spelltab.st_isu[i] != new_st->st_isu[i]\\n\\t\\t || spelltab.st_fold[i] != new_st->st_fold[i]\\n\\t\\t || spelltab.st_upper[i] != new_st->st_upper[i])\\n\\t {\\n\\t\\temsg(_(e_word_characters_differ_between_spell_files));\\n\\t\\treturn FAIL;\\n\\t }\\n\\t}\\n }\\n else\\n {\\n\\t// copy the new spelltab into the one being used\\n\\tspelltab = *new_st;\\n\\tdid_set_spelltab = TRUE;\\n }\",\n \" return OK;\\n}\",\n \"/*\\n * Write the table with prefix conditions to the .spl file.\\n * When \\\"fd\\\" is NULL only count the length of what is written and return it.\\n */\\n static int\\nwrite_spell_prefcond(FILE *fd, garray_T *gap, size_t *fwv)\\n{\\n int\\t\\ti;\\n char_u\\t*p;\\n int\\t\\tlen;\\n int\\t\\ttotlen;\",\n \" if (fd != NULL)\\n\\tput_bytes(fd, (long_u)gap->ga_len, 2);\\t // <prefcondcnt>\",\n \" totlen = 2 + gap->ga_len; // length of <prefcondcnt> and <condlen> bytes\",\n \" for (i = 0; i < gap->ga_len; ++i)\\n {\\n\\t// <prefcond> : <condlen> <condstr>\\n\\tp = ((char_u **)gap->ga_data)[i];\\n\\tif (p != NULL)\\n\\t{\\n\\t len = (int)STRLEN(p);\\n\\t if (fd != NULL)\\n\\t {\\n\\t\\tfputc(len, fd);\\n\\t\\t*fwv &= fwrite(p, (size_t)len, (size_t)1, fd);\\n\\t }\\n\\t totlen += len;\\n\\t}\\n\\telse if (fd != NULL)\\n\\t fputc(0, fd);\\n }\",\n \" return totlen;\\n}\",\n \"/*\\n * Use map string \\\"map\\\" for languages \\\"lp\\\".\\n */\\n static void\\nset_map_str(slang_T *lp, char_u *map)\\n{\\n char_u\\t*p;\\n int\\t\\theadc = 0;\\n int\\t\\tc;\\n int\\t\\ti;\",\n \" if (*map == NUL)\\n {\\n\\tlp->sl_has_map = FALSE;\\n\\treturn;\\n }\\n lp->sl_has_map = TRUE;\",\n \" // Init the array and hash tables empty.\\n for (i = 0; i < 256; ++i)\\n\\tlp->sl_map_array[i] = 0;\\n hash_init(&lp->sl_map_hash);\",\n \" /*\\n * The similar characters are stored separated with slashes:\\n * \\\"aaa/bbb/ccc/\\\". Fill sl_map_array[c] with the character before c and\\n * before the same slash. For characters above 255 sl_map_hash is used.\\n */\\n for (p = map; *p != NUL; )\\n {\\n\\tc = mb_cptr2char_adv(&p);\\n\\tif (c == '/')\\n\\t headc = 0;\\n\\telse\\n\\t{\\n\\t if (headc == 0)\\n\\t\\t headc = c;\",\n \"\\t // Characters above 255 don't fit in sl_map_array[], put them in\\n\\t // the hash table. Each entry is the char, a NUL the headchar and\\n\\t // a NUL.\\n\\t if (c >= 256)\\n\\t {\\n\\t\\tint\\t cl = mb_char2len(c);\\n\\t\\tint\\t headcl = mb_char2len(headc);\\n\\t\\tchar_u\\t *b;\\n\\t\\thash_T\\t hash;\\n\\t\\thashitem_T *hi;\",\n \"\\t\\tb = alloc(cl + headcl + 2);\\n\\t\\tif (b == NULL)\\n\\t\\t return;\\n\\t\\tmb_char2bytes(c, b);\\n\\t\\tb[cl] = NUL;\\n\\t\\tmb_char2bytes(headc, b + cl + 1);\\n\\t\\tb[cl + 1 + headcl] = NUL;\\n\\t\\thash = hash_hash(b);\\n\\t\\thi = hash_lookup(&lp->sl_map_hash, b, hash);\\n\\t\\tif (HASHITEM_EMPTY(hi))\\n\\t\\t hash_add_item(&lp->sl_map_hash, hi, b, hash);\\n\\t\\telse\\n\\t\\t{\\n\\t\\t // This should have been checked when generating the .spl\\n\\t\\t // file.\\n\\t\\t emsg(_(e_duplicate_char_in_map_entry));\\n\\t\\t vim_free(b);\\n\\t\\t}\\n\\t }\\n\\t else\\n\\t\\tlp->sl_map_array[c] = headc;\\n\\t}\\n }\\n}\",\n \"#endif // FEAT_SPELL\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [3275, 4230, 6192, 782, 748], \"buggy_code_start_loc\": [3275, 4229, 4392, 782, 748], \"filenames\": [\"src/errors.h\", \"src/mbyte.c\", \"src/spellfile.c\", \"src/testdir/test_spell_utf8.vim\", \"src/version.c\"], \"fixing_code_end_loc\": [3280, 4230, 6203, 788, 751], \"fixing_code_start_loc\": [3276, 4229, 4393, 783, 749], \"message\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:vim:vim:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"CF072C31-D320-47CE-B39B-F45447D70BD9\", \"versionEndExcluding\": \"8.2.4919\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:debian:debian_linux:9.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"DEECE5FC-CACF-4496-A3E7-164736409252\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:debian:debian_linux:10.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"07B237A9-69A3-4A9C-9DA0-4E06BD37AE73\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:34:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"A930E247-0B43-43CB-98FF-6CE7B8189835\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:35:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"80E516C0-98A4-4ADE-B69F-66A772E2BAAA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:apple:macos:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"71E032AD-F827-4944-9699-BB1E6D4233FC\", \"versionEndExcluding\": \"13.0\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\"}, {\"lang\": \"es\", \"value\": \"Un Desbordamiento del b\\u00fafer de pila en vim_strncpy find_word en el repositorio de GitHub vim/vim versiones anteriores a 8.2.4919. Esta vulnerabilidad es capaz de bloquear el software, Omitir el Mecanismo de Protecci\\u00f3n, Modificar la Memoria y una posible ejecuci\\u00f3n remota\"}], \"evaluatorComment\": null, \"id\": \"CVE-2022-1621\", \"lastModified\": \"2023-05-03T12:15:21.913\", \"metrics\": {\"cvssMetricV2\": [{\"acInsufInfo\": false, \"baseSeverity\": \"MEDIUM\", \"cvssData\": {\"accessComplexity\": \"MEDIUM\", \"accessVector\": \"NETWORK\", \"authentication\": \"NONE\", \"availabilityImpact\": \"PARTIAL\", \"baseScore\": 6.8, \"confidentialityImpact\": \"PARTIAL\", \"integrityImpact\": \"PARTIAL\", \"vectorString\": \"AV:N/AC:M/Au:N/C:P/I:P/A:P\", \"version\": \"2.0\"}, \"exploitabilityScore\": 8.6, \"impactScore\": 6.4, \"obtainAllPrivilege\": false, \"obtainOtherPrivilege\": false, \"obtainUserPrivilege\": false, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\", \"userInteractionRequired\": true}], \"cvssMetricV30\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.3, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"LOW\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.0/AV:L/AC:L/PR:N/UI:R/S:U/C:L/I:H/A:H\", \"version\": \"3.0\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.5, \"source\": \"security@huntr.dev\", \"type\": \"Secondary\"}], \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.8, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.1/AV:L/AC:L/PR:N/UI:R/S:U/C:H/I:H/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.9, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2022-05-10T14:15:08.460\", \"references\": [{\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/28\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/41\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Exploit\", \"Third Party Advisory\"], \"url\": \"https://huntr.dev/bounties/520ce714-bfd2-4646-9458-f52cd22bb2fb\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/05/msg00022.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/11/msg00032.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/HIP7KG7TVS5YF3QREAY2GOGUT3YUBZAI/\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://security.gentoo.org/glsa/202208-32\"}, {\"source\": \"security@huntr.dev\", \"tags\": null, \"url\": \"https://security.gentoo.org/glsa/202305-16\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://support.apple.com/kb/HT213488\"}], \"sourceIdentifier\": \"security@huntr.dev\", \"vendorComments\": null, \"vulnStatus\": \"Modified\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-122\"}], \"source\": \"security@huntr.dev\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-787\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, \"type\": \"CWE-122\"}"},"index":{"kind":"number","value":464,"string":"464"}}},{"rowIdx":2894,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["\" Test for spell checking with 'encoding' set to utf-8","source check.vim\nCheckFeature spell","scriptencoding utf-8","func TearDown()\n set nospell\n call delete('Xtest.aff')\n call delete('Xtest.dic')\n call delete('Xtest.utf-8.add')\n call delete('Xtest.utf-8.add.spl')\n call delete('Xtest.utf-8.spl')\n call delete('Xtest.utf-8.sug')\nendfunc","let g:test_data_aff1 = [\n \\\"SET ISO8859-1\",\n \\\"TRY esianrtolcdugmphbyfvkwjkqxz-ëéèêïîäàâöüû'ESIANRTOLCDUGMPHBYFVKWJKQXZ\",\n \\\"\",\n \\\"FOL àáâãäåæçèéêëìíîïðñòóôõöøùúûüýþßÿ\",\n \\\"LOW àáâãäåæçèéêëìíîïðñòóôõöøùúûüýþßÿ\",\n \\\"UPP ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖØÙÚÛÜÝÞßÿ\",\n \\\"\",\n \\\"SOFOFROM abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\\xC0\\xC1\\xC2\\xC3\\xC4\\xC5\\xC6\\xC7\\xC8\\xC9\\xCA\\xCB\\xCC\\xCD\\xCE\\xCF\\xD0\\xD1\\xD2\\xD3\\xD4\\xD5\\xD6\\xD8\\xD9\\xDA\\xDB\\xDC\\xDD\\xDE\\xBF\",\n \\\"SOFOTO ebctefghejklnnepkrstevvkesebctefghejklnnepkrstevvkeseeeeeeeceeeeeeeedneeeeeeeeeeepseeeeeeeeceeeeeeeedneeeeeeeeeeep?\",\n \\\"\",\n \\\"MIDWORD\\t'-\",\n \\\"\",\n \\\"KEP =\",\n \\\"RAR ?\",\n \\\"BAD !\",\n \\\"\",\n \\\"PFX I N 1\",\n \\\"PFX I 0 in .\",\n \\\"\",\n \\\"PFX O Y 1\",\n \\\"PFX O 0 out .\",\n \\\"\",\n \\\"SFX S Y 2\",\n \\\"SFX S 0 s [^s]\",\n \\\"SFX S 0 es s\",\n \\\"\",\n \\\"SFX N N 3\",\n \\\"SFX N 0 en [^n]\",\n \\\"SFX N 0 nen n\",\n \\\"SFX N 0 n .\",\n \\\"\",\n \\\"REP 3\",\n \\\"REP g ch\",\n \\\"REP ch g\",\n \\\"REP svp s.v.p.\",\n \\\"\",\n \\\"MAP 9\",\n \\\"MAP a\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\",\n \\\"MAP e\\xE8\\xE9\\xEA\\xEB\",\n \\\"MAP i\\xEC\\xED\\xEE\\xEF\",\n \\\"MAP o\\xF2\\xF3\\xF4\\xF5\\xF6\",\n \\\"MAP u\\xF9\\xFA\\xFB\\xFC\",\n \\\"MAP n\\xF1\",\n \\\"MAP c\\xE7\",\n \\\"MAP y\\xFF\\xFD\",\n \\\"MAP s\\xDF\"\n \\ ]\nlet g:test_data_dic1 = [\n \\\"123456\",\n \\\"test/NO\",\n \\\"# comment\",\n \\\"wrong\",\n \\\"Comment\",\n \\\"OK\",\n \\\"uk\",\n \\\"put/ISO\",\n \\\"the end\",\n \\\"deol\",\n \\\"d\\xE9\\xF4r\",\n \\ ]\nlet g:test_data_aff2 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FOL \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"LOW \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"UPP \\xC0\\xC1\\xC2\\xC3\\xC4\\xC5\\xC6\\xC7\\xC8\\xC9\\xCA\\xCB\\xCC\\xCD\\xCE\\xCF\\xD0\\xD1\\xD2\\xD3\\xD4\\xD5\\xD6\\xD8\\xD9\\xDA\\xDB\\xDC\\xDD\\xDE\\xDF\\xFF\",\n \\\"\",\n \\\"PFXPOSTPONE\",\n \\\"\",\n \\\"MIDWORD\\t'-\",\n \\\"\",\n \\\"KEP =\",\n \\\"RAR ?\",\n \\\"BAD !\",\n \\\"\",\n \\\"PFX I N 1\",\n \\\"PFX I 0 in .\",\n \\\"\",\n \\\"PFX O Y 1\",\n \\\"PFX O 0 out [a-z]\",\n \\\"\",\n \\\"SFX S Y 2\",\n \\\"SFX S 0 s [^s]\",\n \\\"SFX S 0 es s\",\n \\\"\",\n \\\"SFX N N 3\",\n \\\"SFX N 0 en [^n]\",\n \\\"SFX N 0 nen n\",\n \\\"SFX N 0 n .\",\n \\\"\",\n \\\"REP 3\",\n \\\"REP g ch\",\n \\\"REP ch g\",\n \\\"REP svp s.v.p.\",\n \\\"\",\n \\\"MAP 9\",\n \\\"MAP a\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\",\n \\\"MAP e\\xE8\\xE9\\xEA\\xEB\",\n \\\"MAP i\\xEC\\xED\\xEE\\xEF\",\n \\\"MAP o\\xF2\\xF3\\xF4\\xF5\\xF6\",\n \\\"MAP u\\xF9\\xFA\\xFB\\xFC\",\n \\\"MAP n\\xF1\",\n \\\"MAP c\\xE7\",\n \\\"MAP y\\xFF\\xFD\",\n \\\"MAP s\\xDF\",\n \\ ]\nlet g:test_data_aff3 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"COMPOUNDMIN 3\",\n \\\"COMPOUNDRULE m*\",\n \\\"NEEDCOMPOUND x\",\n \\ ]\nlet g:test_data_dic3 = [\n \\\"1234\",\n \\\"foo/m\",\n \\\"bar/mx\",\n \\\"m\\xEF/m\",\n \\\"la/mx\",\n \\ ]\nlet g:test_data_aff4 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FOL \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"LOW \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"UPP \\xC0\\xC1\\xC2\\xC3\\xC4\\xC5\\xC6\\xC7\\xC8\\xC9\\xCA\\xCB\\xCC\\xCD\\xCE\\xCF\\xD0\\xD1\\xD2\\xD3\\xD4\\xD5\\xD6\\xD8\\xD9\\xDA\\xDB\\xDC\\xDD\\xDE\\xDF\\xFF\",\n \\\"\",\n \\\"COMPOUNDRULE m+\",\n \\\"COMPOUNDRULE sm*e\",\n \\\"COMPOUNDRULE sm+\",\n \\\"COMPOUNDMIN 3\",\n \\\"COMPOUNDWORDMAX 3\",\n \\\"COMPOUNDFORBIDFLAG t\",\n \\\"\",\n \\\"COMPOUNDSYLMAX 5\",\n \\\"SYLLABLE a\\xE1e\\xE9i\\xEDo\\xF3\\xF6\\xF5u\\xFA\\xFC\\xFBy/aa/au/ea/ee/ei/ie/oa/oe/oo/ou/uu/ui\",\n \\\"\",\n \\\"MAP 9\",\n \\\"MAP a\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\",\n \\\"MAP e\\xE8\\xE9\\xEA\\xEB\",\n \\\"MAP i\\xEC\\xED\\xEE\\xEF\",\n \\\"MAP o\\xF2\\xF3\\xF4\\xF5\\xF6\",\n \\\"MAP u\\xF9\\xFA\\xFB\\xFC\",\n \\\"MAP n\\xF1\",\n \\\"MAP c\\xE7\",\n \\\"MAP y\\xFF\\xFD\",\n \\\"MAP s\\xDF\",\n \\\"\",\n \\\"NEEDAFFIX x\",\n \\\"\",\n \\\"PFXPOSTPONE\",\n \\\"\",\n \\\"MIDWORD '-\",\n \\\"\",\n \\\"SFX q N 1\",\n \\\"SFX q 0 -ok .\",\n \\\"\",\n \\\"SFX a Y 2\",\n \\\"SFX a 0 s .\",\n \\\"SFX a 0 ize/t .\",\n \\\"\",\n \\\"PFX p N 1\",\n \\\"PFX p 0 pre .\",\n \\\"\",\n \\\"PFX P N 1\",\n \\\"PFX P 0 nou .\",\n \\ ]\nlet g:test_data_dic4 = [\n \\\"1234\",\n \\\"word/mP\",\n \\\"util/am\",\n \\\"pro/xq\",\n \\\"tomato/m\",\n \\\"bork/mp\",\n \\\"start/s\",\n \\\"end/e\",\n \\ ]\nlet g:test_data_aff5 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FLAG long\",\n \\\"\",\n \\\"NEEDAFFIX !!\",\n \\\"\",\n \\\"COMPOUNDRULE ssmm*ee\",\n \\\"\",\n \\\"NEEDCOMPOUND xx\",\n \\\"COMPOUNDPERMITFLAG pp\",\n \\\"\",\n \\\"SFX 13 Y 1\",\n \\\"SFX 13 0 bork .\",\n \\\"\",\n \\\"SFX a1 Y 1\",\n \\\"SFX a1 0 a1 .\",\n \\\"\",\n \\\"SFX a\\xE9 Y 1\",\n \\\"SFX a\\xE9 0 a\\xE9 .\",\n \\\"\",\n \\\"PFX zz Y 1\",\n \\\"PFX zz 0 pre/pp .\",\n \\\"\",\n \\\"PFX yy Y 1\",\n \\\"PFX yy 0 nou .\",\n \\ ]\nlet g:test_data_dic5 = [\n \\\"1234\",\n \\\"foo/a1a\\xE9!!\",\n \\\"bar/zz13ee\",\n \\\"start/ss\",\n \\\"end/eeyy\",\n \\\"middle/mmxx\",\n \\ ]\nlet g:test_data_aff6 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FLAG caplong\",\n \\\"\",\n \\\"NEEDAFFIX A!\",\n \\\"\",\n \\\"COMPOUNDRULE sMm*Ee\",\n \\\"\",\n \\\"NEEDCOMPOUND Xx\",\n \\\"\",\n \\\"COMPOUNDPERMITFLAG p\",\n \\\"\",\n \\\"SFX N3 Y 1\",\n \\\"SFX N3 0 bork .\",\n \\\"\",\n \\\"SFX A1 Y 1\",\n \\\"SFX A1 0 a1 .\",\n \\\"\",\n \\\"SFX A\\xE9 Y 1\",\n \\\"SFX A\\xE9 0 a\\xE9 .\",\n \\\"\",\n \\\"PFX Zz Y 1\",\n \\\"PFX Zz 0 pre/p .\",\n \\ ]\nlet g:test_data_dic6 = [\n \\\"1234\",\n \\\"mee/A1A\\xE9A!\",\n \\\"bar/ZzN3Ee\",\n \\\"lead/s\",\n \\\"end/Ee\",\n \\\"middle/MmXx\",\n \\ ]\nlet g:test_data_aff7 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FLAG num\",\n \\\"\",\n \\\"NEEDAFFIX 9999\",\n \\\"\",\n \\\"COMPOUNDRULE 2,77*123\",\n \\\"\",\n \\\"NEEDCOMPOUND 1\",\n \\\"COMPOUNDPERMITFLAG 432\",\n \\\"\",\n \\\"SFX 61003 Y 1\",\n \\\"SFX 61003 0 meat .\",\n \\\"\",\n \\\"SFX 0 Y 1\",\n \\\"SFX 0 0 zero .\",\n \\\"\",\n \\\"SFX 391 Y 1\",\n \\\"SFX 391 0 a1 .\",\n \\\"\",\n \\\"SFX 111 Y 1\",\n \\\"SFX 111 0 a\\xE9 .\",\n \\\"\",\n \\\"PFX 17 Y 1\",\n \\\"PFX 17 0 pre/432 .\",\n \\ ]\nlet g:test_data_dic7 = [\n \\\"1234\",\n \\\"mee/0,391,111,9999\",\n \\\"bar/17,61003,123\",\n \\\"lead/2\",\n \\\"tail/123\",\n \\\"middle/77,1\",\n \\ ]\nlet g:test_data_aff8 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"NOSPLITSUGS\",\n \\ ]\nlet g:test_data_dic8 = [\n \\\"1234\",\n \\\"foo\",\n \\\"bar\",\n \\\"faabar\",\n \\ ]\nlet g:test_data_aff9 = [\n \\ ]\nlet g:test_data_dic9 = [\n \\\"1234\",\n \\\"foo\",\n \\\"bar\",\n \\ ]\nlet g:test_data_aff10 = [\n \\\"COMPOUNDRULE se\",\n \\\"COMPOUNDPERMITFLAG p\",\n \\\"\",\n \\\"SFX A Y 1\",\n \\\"SFX A 0 able/Mp .\",\n \\\"\",\n \\\"SFX M Y 1\",\n \\\"SFX M 0 s .\",\n \\ ]\nlet g:test_data_dic10 = [\n \\\"1234\",\n \\\"drink/As\",\n \\\"table/e\",\n \\ ]\nlet g:test_data_aff_sal = [\n \\\"SET ISO8859-1\",\n \\\"TRY esianrtolcdugmphbyfvkwjkqxz-\\xEB\\xE9\\xE8\\xEA\\xEF\\xEE\\xE4\\xE0\\xE2\\xF6\\xFC\\xFB'ESIANRTOLCDUGMPHBYFVKWJKQXZ\",\n \\\"\",\n \\\"FOL \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"LOW \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"UPP \\xC0\\xC1\\xC2\\xC3\\xC4\\xC5\\xC6\\xC7\\xC8\\xC9\\xCA\\xCB\\xCC\\xCD\\xCE\\xCF\\xD0\\xD1\\xD2\\xD3\\xD4\\xD5\\xD6\\xD8\\xD9\\xDA\\xDB\\xDC\\xDD\\xDE\\xDF\\xFF\",\n \\\"\",\n \\\"MIDWORD\\t'-\",\n \\\"\",\n \\\"KEP =\",\n \\\"RAR ?\",\n \\\"BAD !\",\n \\\"\",\n \\\"PFX I N 1\",\n \\\"PFX I 0 in .\",\n \\\"\",\n \\\"PFX O Y 1\",\n \\\"PFX O 0 out .\",\n \\\"\",\n \\\"SFX S Y 2\",\n \\\"SFX S 0 s [^s]\",\n \\\"SFX S 0 es s\",\n \\\"\",\n \\\"SFX N N 3\",\n \\\"SFX N 0 en [^n]\",\n \\\"SFX N 0 nen n\",\n \\\"SFX N 0 n .\",\n \\\"\",\n \\\"REP 3\",\n \\\"REP g ch\",\n \\\"REP ch g\",\n \\\"REP svp s.v.p.\",\n \\\"\",\n \\\"MAP 9\",\n \\\"MAP a\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\",\n \\\"MAP e\\xE8\\xE9\\xEA\\xEB\",\n \\\"MAP i\\xEC\\xED\\xEE\\xEF\",\n \\\"MAP o\\xF2\\xF3\\xF4\\xF5\\xF6\",\n \\\"MAP u\\xF9\\xFA\\xFB\\xFC\",\n \\\"MAP n\\xF1\",\n \\\"MAP c\\xE7\",\n \\\"MAP y\\xFF\\xFD\",\n \\\"MAP s\\xDF\",\n \\\"\",\n \\\"SAL AH(AEIOUY)-^ *H\",\n \\\"SAL AR(AEIOUY)-^ *R\",\n \\\"SAL A(HR)^ *\",\n \\\"SAL A^ *\",\n \\\"SAL AH(AEIOUY)- H\",\n \\\"SAL AR(AEIOUY)- R\",\n \\\"SAL A(HR) _\",\n \\\"SAL \\xC0^ *\",\n \\\"SAL \\xC5^ *\",\n \\\"SAL BB- _\",\n \\\"SAL B B\",\n \\\"SAL CQ- _\",\n \\\"SAL CIA X\",\n \\\"SAL CH X\",\n \\\"SAL C(EIY)- S\",\n \\\"SAL CK K\",\n \\\"SAL COUGH^ KF\",\n \\\"SAL CC< C\",\n \\\"SAL C K\",\n \\\"SAL DG(EIY) K\",\n \\\"SAL DD- _\",\n \\\"SAL D T\",\n \\\"SAL \\xC9< E\",\n \\\"SAL EH(AEIOUY)-^ *H\",\n \\\"SAL ER(AEIOUY)-^ *R\",\n \\\"SAL E(HR)^ *\",\n \\\"SAL ENOUGH^$ *NF\",\n \\\"SAL E^ *\",\n \\\"SAL EH(AEIOUY)- H\",\n \\\"SAL ER(AEIOUY)- R\",\n \\\"SAL E(HR) _\",\n \\\"SAL FF- _\",\n \\\"SAL F F\",\n \\\"SAL GN^ N\",\n \\\"SAL GN$ N\",\n \\\"SAL GNS$ NS\",\n \\\"SAL GNED$ N\",\n \\\"SAL GH(AEIOUY)- K\",\n \\\"SAL GH _\",\n \\\"SAL GG9 K\",\n \\\"SAL G K\",\n \\\"SAL H H\",\n \\\"SAL IH(AEIOUY)-^ *H\",\n \\\"SAL IR(AEIOUY)-^ *R\",\n \\\"SAL I(HR)^ *\",\n \\\"SAL I^ *\",\n \\\"SAL ING6 N\",\n \\\"SAL IH(AEIOUY)- H\",\n \\\"SAL IR(AEIOUY)- R\",\n \\\"SAL I(HR) _\",\n \\\"SAL J K\",\n \\\"SAL KN^ N\",\n \\\"SAL KK- _\",\n \\\"SAL K K\",\n \\\"SAL LAUGH^ LF\",\n \\\"SAL LL- _\",\n \\\"SAL L L\",\n \\\"SAL MB$ M\",\n \\\"SAL MM M\",\n \\\"SAL M M\",\n \\\"SAL NN- _\",\n \\\"SAL N N\",\n \\\"SAL OH(AEIOUY)-^ *H\",\n \\\"SAL OR(AEIOUY)-^ *R\",\n \\\"SAL O(HR)^ *\",\n \\\"SAL O^ *\",\n \\\"SAL OH(AEIOUY)- H\",\n \\\"SAL OR(AEIOUY)- R\",\n \\\"SAL O(HR) _\",\n \\\"SAL PH F\",\n \\\"SAL PN^ N\",\n \\\"SAL PP- _\",\n \\\"SAL P P\",\n \\\"SAL Q K\",\n \\\"SAL RH^ R\",\n \\\"SAL ROUGH^ RF\",\n \\\"SAL RR- _\",\n \\\"SAL R R\",\n \\\"SAL SCH(EOU)- SK\",\n \\\"SAL SC(IEY)- S\",\n \\\"SAL SH X\",\n \\\"SAL SI(AO)- X\",\n \\\"SAL SS- _\",\n \\\"SAL S S\",\n \\\"SAL TI(AO)- X\",\n \\\"SAL TH @\",\n \\\"SAL TCH-- _\",\n \\\"SAL TOUGH^ TF\",\n \\\"SAL TT- _\",\n \\\"SAL T T\",\n \\\"SAL UH(AEIOUY)-^ *H\",\n \\\"SAL UR(AEIOUY)-^ *R\",\n \\\"SAL U(HR)^ *\",\n \\\"SAL U^ *\",\n \\\"SAL UH(AEIOUY)- H\",\n \\\"SAL UR(AEIOUY)- R\",\n \\\"SAL U(HR) _\",\n \\\"SAL V^ W\",\n \\\"SAL V F\",\n \\\"SAL WR^ R\",\n \\\"SAL WH^ W\",\n \\\"SAL W(AEIOU)- W\",\n \\\"SAL X^ S\",\n \\\"SAL X KS\",\n \\\"SAL Y(AEIOU)- Y\",\n \\\"SAL ZZ- _\",\n \\\"SAL Z S\",\n \\ ]","func LoadAffAndDic(aff_contents, dic_contents)\n set enc=utf-8\n set spellfile=\n call writefile(a:aff_contents, \"Xtest.aff\")\n call writefile(a:dic_contents, \"Xtest.dic\")\n \" Generate a .spl file from a .dic and .aff file.\n mkspell! Xtest Xtest\n \" use that spell file\n set spl=Xtest.utf-8.spl spell\nendfunc","func ListWords()\n spelldump\n %yank\n quit\n return split(@\", \"\\n\")\nendfunc","func TestGoodBadBase()\n exe '1;/^good:'\n normal 0f:]s\n let prevbad = ''\n let result = []\n while 1\n let [bad, a] = spellbadword()\n if bad == '' || bad == prevbad || bad == 'badend'\n break\n endif\n let prevbad = bad\n let lst = bad->spellsuggest(3)\n normal mm"," call add(result, [bad, lst])\n normal `m]s\n endwhile\n return result\nendfunc","func RunGoodBad(good, bad, expected_words, expected_bad_words)\n %bwipe!\n call setline(1, ['', \"good: \", a:good, a:bad, \" badend \"])\n let words = ListWords()\n call assert_equal(a:expected_words, words[1:-1])\n let bad_words = TestGoodBadBase()\n call assert_equal(a:expected_bad_words, bad_words)\n %bwipe!\nendfunc","func Test_spell_basic()\n call LoadAffAndDic(g:test_data_aff1, g:test_data_dic1)\n call RunGoodBad(\"wrong OK puts. Test the end\",\n \\ \"bad: inputs comment ok Ok. test d\\u00E9\\u00F4l end the\",\n \\[\"Comment\", \"deol\", \"d\\u00E9\\u00F4r\", \"input\", \"OK\", \"output\", \"outputs\", \"outtest\", \"put\", \"puts\",\n \\ \"test\", \"testen\", \"testn\", \"the end\", \"uk\", \"wrong\"],\n \\[\n \\ [\"bad\", [\"put\", \"uk\", \"OK\"]],\n \\ [\"inputs\", [\"input\", \"puts\", \"outputs\"]],\n \\ [\"comment\", [\"Comment\", \"outtest\", \"the end\"]],\n \\ [\"ok\", [\"OK\", \"uk\", \"put\"]],\n \\ [\"Ok\", [\"OK\", \"Uk\", \"Put\"]],\n \\ [\"test\", [\"Test\", \"testn\", \"testen\"]],\n \\ [\"d\\u00E9\\u00F4l\", [\"deol\", \"d\\u00E9\\u00F4r\", \"test\"]],\n \\ [\"end\", [\"put\", \"uk\", \"test\"]],\n \\ [\"the\", [\"put\", \"uk\", \"test\"]],\n \\ ]\n \\ )"," call assert_equal(\"gebletegek\", soundfold('goobledygoook'))\n call assert_equal(\"kepereneven\", 'kóopërÿnôven'->soundfold())\n call assert_equal(\"everles gesvets etele\", soundfold('oeverloos gezwets edale'))\nendfunc","\" Postponed prefixes\nfunc Test_spell_prefixes()\n call LoadAffAndDic(g:test_data_aff2, g:test_data_dic1)\n call RunGoodBad(\"puts\",\n \\ \"bad: inputs comment ok Ok end the. test d\\u00E9\\u00F4l\",\n \\ [\"Comment\", \"deol\", \"d\\u00E9\\u00F4r\", \"OK\", \"put\", \"input\", \"output\", \"puts\", \"outputs\", \"test\", \"outtest\", \"testen\", \"testn\", \"the end\", \"uk\", \"wrong\"],\n \\ [\n \\ [\"bad\", [\"put\", \"uk\", \"OK\"]],\n \\ [\"inputs\", [\"input\", \"puts\", \"outputs\"]],\n \\ [\"comment\", [\"Comment\"]],\n \\ [\"ok\", [\"OK\", \"uk\", \"put\"]],\n \\ [\"Ok\", [\"OK\", \"Uk\", \"Put\"]],\n \\ [\"end\", [\"put\", \"uk\", \"deol\"]],\n \\ [\"the\", [\"put\", \"uk\", \"test\"]],\n \\ [\"test\", [\"Test\", \"testn\", \"testen\"]],\n \\ [\"d\\u00E9\\u00F4l\", [\"deol\", \"d\\u00E9\\u00F4r\", \"test\"]],\n \\ ])\nendfunc","\"Compound words\nfunc Test_spell_compound()\n call LoadAffAndDic(g:test_data_aff3, g:test_data_dic3)\n call RunGoodBad(\"foo m\\u00EF foobar foofoobar barfoo barbarfoo\",\n \\ \"bad: bar la foom\\u00EF barm\\u00EF m\\u00EFfoo m\\u00EFbar m\\u00EFm\\u00EF lala m\\u00EFla lam\\u00EF foola labar\",\n \\ [\"foo\", \"m\\u00EF\"],\n \\ [\n \\ [\"bad\", [\"foo\", \"m\\u00EF\"]],\n \\ [\"bar\", [\"barfoo\", \"foobar\", \"foo\"]],\n \\ [\"la\", [\"m\\u00EF\", \"foo\"]],\n \\ [\"foom\\u00EF\", [\"foo m\\u00EF\", \"foo\", \"foofoo\"]],\n \\ [\"barm\\u00EF\", [\"barfoo\", \"m\\u00EF\", \"barbar\"]],\n \\ [\"m\\u00EFfoo\", [\"m\\u00EF foo\", \"foo\", \"foofoo\"]],\n \\ [\"m\\u00EFbar\", [\"foobar\", \"barbar\", \"m\\u00EF\"]],\n \\ [\"m\\u00EFm\\u00EF\", [\"m\\u00EF m\\u00EF\", \"m\\u00EF\"]],\n \\ [\"lala\", []],\n \\ [\"m\\u00EFla\", [\"m\\u00EF\", \"m\\u00EF m\\u00EF\"]],\n \\ [\"lam\\u00EF\", [\"m\\u00EF\", \"m\\u00EF m\\u00EF\"]],\n \\ [\"foola\", [\"foo\", \"foobar\", \"foofoo\"]],\n \\ [\"labar\", [\"barbar\", \"foobar\"]],\n \\ ])"," call LoadAffAndDic(g:test_data_aff4, g:test_data_dic4)\n call RunGoodBad(\"word util bork prebork start end wordutil wordutils pro-ok bork borkbork borkborkbork borkborkborkbork borkborkborkborkbork tomato tomatotomato startend startword startwordword startwordend startwordwordend startwordwordwordend prebork preborkbork preborkborkbork nouword\",\n \\ \"bad: wordutilize pro borkborkborkborkborkbork tomatotomatotomato endstart endend startstart wordend wordstart preborkprebork preborkpreborkbork startwordwordwordwordend borkpreborkpreborkbork utilsbork startnouword\",\n \\ [\"bork\", \"prebork\", \"end\", \"pro-ok\", \"start\", \"tomato\", \"util\", \"utilize\", \"utils\", \"word\", \"nouword\"],\n \\ [\n \\ [\"bad\", [\"end\", \"bork\", \"word\"]],\n \\ [\"wordutilize\", [\"word utilize\", \"wordutils\", \"wordutil\"]],\n \\ [\"pro\", [\"bork\", \"word\", \"end\"]],\n \\ [\"borkborkborkborkborkbork\", [\"bork borkborkborkborkbork\", \"borkbork borkborkborkbork\", \"borkborkbork borkborkbork\"]],\n \\ [\"tomatotomatotomato\", [\"tomato tomatotomato\", \"tomatotomato tomato\", \"tomato tomato tomato\"]],\n \\ [\"endstart\", [\"end start\", \"start\"]],\n \\ [\"endend\", [\"end end\", \"end\"]],\n \\ [\"startstart\", [\"start start\"]],\n \\ [\"wordend\", [\"word end\", \"word\", \"wordword\"]],\n \\ [\"wordstart\", [\"word start\", \"bork start\"]],\n \\ [\"preborkprebork\", [\"prebork prebork\", \"preborkbork\", \"preborkborkbork\"]],\n \\ [\"preborkpreborkbork\", [\"prebork preborkbork\", \"preborkborkbork\", \"preborkborkborkbork\"]],\n \\ [\"startwordwordwordwordend\", [\"startwordwordwordword end\", \"startwordwordwordword\", \"start wordwordwordword end\"]],\n \\ [\"borkpreborkpreborkbork\", [\"bork preborkpreborkbork\", \"bork prebork preborkbork\", \"bork preborkprebork bork\"]],\n \\ [\"utilsbork\", [\"utilbork\", \"utils bork\", \"util bork\"]],\n \\ [\"startnouword\", [\"start nouword\", \"startword\", \"startborkword\"]],\n \\ ])","endfunc","\" Test affix flags with two characters\nfunc Test_spell_affix()\n call LoadAffAndDic(g:test_data_aff5, g:test_data_dic5)\n call RunGoodBad(\"fooa1 fooa\\u00E9 bar prebar barbork prebarbork startprebar start end startend startmiddleend nouend\",\n \\ \"bad: foo fooa2 prabar probarbirk middle startmiddle middleend endstart startprobar startnouend\",\n \\ [\"bar\", \"barbork\", \"end\", \"fooa1\", \"fooa\\u00E9\", \"nouend\", \"prebar\", \"prebarbork\", \"start\"],\n \\ [\n \\ [\"bad\", [\"bar\", \"end\", \"fooa1\"]],\n \\ [\"foo\", [\"fooa1\", \"fooa\\u00E9\", \"bar\"]],\n \\ [\"fooa2\", [\"fooa1\", \"fooa\\u00E9\", \"bar\"]],\n \\ [\"prabar\", [\"prebar\", \"bar\", \"bar bar\"]],\n \\ [\"probarbirk\", [\"prebarbork\"]],\n \\ [\"middle\", []],\n \\ [\"startmiddle\", [\"startmiddleend\", \"startmiddlebar\"]],\n \\ [\"middleend\", []],\n \\ [\"endstart\", [\"end start\", \"start\"]],\n \\ [\"startprobar\", [\"startprebar\", \"start prebar\", \"startbar\"]],\n \\ [\"startnouend\", [\"start nouend\", \"startend\"]],\n \\ ])"," call LoadAffAndDic(g:test_data_aff6, g:test_data_dic6)\n call RunGoodBad(\"meea1 meea\\u00E9 bar prebar barbork prebarbork leadprebar lead end leadend leadmiddleend\",\n \\ \"bad: mee meea2 prabar probarbirk middle leadmiddle middleend endlead leadprobar\",\n \\ [\"bar\", \"barbork\", \"end\", \"lead\", \"meea1\", \"meea\\u00E9\", \"prebar\", \"prebarbork\"],\n \\ [\n \\ [\"bad\", [\"bar\", \"end\", \"lead\"]],\n \\ [\"mee\", [\"meea1\", \"meea\\u00E9\", \"bar\"]],\n \\ [\"meea2\", [\"meea1\", \"meea\\u00E9\", \"lead\"]],\n \\ [\"prabar\", [\"prebar\", \"bar\", \"leadbar\"]],\n \\ [\"probarbirk\", [\"prebarbork\"]],\n \\ [\"middle\", []],\n \\ [\"leadmiddle\", [\"leadmiddleend\", \"leadmiddlebar\"]],\n \\ [\"middleend\", []],\n \\ [\"endlead\", [\"end lead\", \"lead\", \"end end\"]],\n \\ [\"leadprobar\", [\"leadprebar\", \"lead prebar\", \"leadbar\"]],\n \\ ])"," call LoadAffAndDic(g:test_data_aff7, g:test_data_dic7)\n call RunGoodBad(\"meea1 meezero meea\\u00E9 bar prebar barmeat prebarmeat leadprebar lead tail leadtail leadmiddletail\",\n \\ \"bad: mee meea2 prabar probarmaat middle leadmiddle middletail taillead leadprobar\",\n \\ [\"bar\", \"barmeat\", \"lead\", \"meea1\", \"meea\\u00E9\", \"meezero\", \"prebar\", \"prebarmeat\", \"tail\"],\n \\ [\n \\ [\"bad\", [\"bar\", \"lead\", \"tail\"]],\n \\ [\"mee\", [\"meea1\", \"meea\\u00E9\", \"bar\"]],\n \\ [\"meea2\", [\"meea1\", \"meea\\u00E9\", \"lead\"]],\n \\ [\"prabar\", [\"prebar\", \"bar\", \"leadbar\"]],\n \\ [\"probarmaat\", [\"prebarmeat\"]],\n \\ [\"middle\", []],\n \\ [\"leadmiddle\", [\"leadmiddlebar\"]],\n \\ [\"middletail\", []],\n \\ [\"taillead\", [\"tail lead\", \"tail\"]],\n \\ [\"leadprobar\", [\"leadprebar\", \"lead prebar\", \"leadbar\"]],\n \\ ])\nendfunc","func Test_spell_NOSLITSUGS()\n call LoadAffAndDic(g:test_data_aff8, g:test_data_dic8)\n call RunGoodBad(\"foo bar faabar\", \"bad: foobar barfoo\",\n \\ [\"bar\", \"faabar\", \"foo\"],\n \\ [\n \\ [\"bad\", [\"bar\", \"foo\"]],\n \\ [\"foobar\", [\"faabar\", \"foo bar\", \"bar\"]],\n \\ [\"barfoo\", [\"bar foo\", \"bar\", \"foo\"]],\n \\ ])\nendfunc","\" Numbers\nfunc Test_spell_Numbers()\n call LoadAffAndDic(g:test_data_aff9, g:test_data_dic9)\n call RunGoodBad(\"0b1011 0777 1234 0x01ff\", \"\",\n \\ [\"bar\", \"foo\"],\n \\ [\n \\ ])\nendfunc","\" Affix flags\nfunc Test_spell_affix_flags()\n call LoadAffAndDic(g:test_data_aff10, g:test_data_dic10)\n call RunGoodBad(\"drink drinkable drinkables drinktable drinkabletable\",\n\t\\ \"bad: drinks drinkstable drinkablestable\",\n \\ [\"drink\", \"drinkable\", \"drinkables\", \"table\"],\n \\ [['bad', []],\n\t\\ ['drinks', ['drink']],\n\t\\ ['drinkstable', ['drinktable', 'drinkable', 'drink table']],\n \\ ['drinkablestable', ['drinkabletable', 'drinkables table', 'drinkable table']],\n\t\\ ])\nendfunc","function FirstSpellWord()\n call feedkeys(\"/^start:\\n\", 'tx')\n normal ]smm\n let [str, a] = spellbadword()\n return str\nendfunc","function SecondSpellWord()\n normal `m]s\n let [str, a] = spellbadword()\n return str\nendfunc","\" Test with SAL instead of SOFO items; test automatic reloading\nfunc Test_spell_sal_and_addition()\n set spellfile=\n call writefile(g:test_data_dic1, \"Xtest.dic\")\n call writefile(g:test_data_aff_sal, \"Xtest.aff\")\n mkspell! Xtest Xtest\n set spl=Xtest.utf-8.spl spell\n call assert_equal('kbltykk', soundfold('goobledygoook'))\n call assert_equal('kprnfn', soundfold('kóopërÿnôven'))\n call assert_equal('*fls kswts tl', soundfold('oeverloos gezwets edale'))"," \"also use an addition file\n call writefile([\"/regions=usgbnz\", \"elequint/2\", \"elekwint/3\"], \"Xtest.utf-8.add\")\n mkspell! Xtest.utf-8.add.spl Xtest.utf-8.add"," bwipe!\n call setline(1, [\"start: elequint test elekwint test elekwent asdf\"])"," set spellfile=Xtest.utf-8.add\n call assert_equal(\"elekwent\", FirstSpellWord())"," set spl=Xtest_us.utf-8.spl\n call assert_equal(\"elequint\", FirstSpellWord())\n call assert_equal(\"elekwint\", SecondSpellWord())"," set spl=Xtest_gb.utf-8.spl\n call assert_equal(\"elekwint\", FirstSpellWord())\n call assert_equal(\"elekwent\", SecondSpellWord())"," set spl=Xtest_nz.utf-8.spl\n call assert_equal(\"elequint\", FirstSpellWord())\n call assert_equal(\"elekwent\", SecondSpellWord())"," set spl=Xtest_ca.utf-8.spl\n call assert_equal(\"elequint\", FirstSpellWord())\n call assert_equal(\"elekwint\", SecondSpellWord())\nendfunc","func Test_spellfile_value()\n set spellfile=Xdir/Xtest.utf-8.add\n set spellfile=Xdir/Xtest.utf-8.add,Xtest_other.add\nendfunc","func Test_no_crash_with_weird_text()\n new\n let lines =<< trim END\n r<sfile>\n ","\n \n END\n call setline(1, lines)\n exe \"%norm \\<C-v>ez=>\\<C-v>wzG\""," bwipe!\nendfunc\n","","\n\" vim: shiftwidth=2 sts=2 expandtab"],"string":"[\n \"\\\" Test for spell checking with 'encoding' set to utf-8\",\n \"source check.vim\\nCheckFeature spell\",\n \"scriptencoding utf-8\",\n \"func TearDown()\\n set nospell\\n call delete('Xtest.aff')\\n call delete('Xtest.dic')\\n call delete('Xtest.utf-8.add')\\n call delete('Xtest.utf-8.add.spl')\\n call delete('Xtest.utf-8.spl')\\n call delete('Xtest.utf-8.sug')\\nendfunc\",\n \"let g:test_data_aff1 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"TRY esianrtolcdugmphbyfvkwjkqxz-ëéèêïîäàâöüû'ESIANRTOLCDUGMPHBYFVKWJKQXZ\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FOL àáâãäåæçèéêëìíîïðñòóôõöøùúûüýþßÿ\\\",\\n \\\\\\\"LOW àáâãäåæçèéêëìíîïðñòóôõöøùúûüýþßÿ\\\",\\n \\\\\\\"UPP ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖØÙÚÛÜÝÞßÿ\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SOFOFROM abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\\xC0\\\\xC1\\\\xC2\\\\xC3\\\\xC4\\\\xC5\\\\xC6\\\\xC7\\\\xC8\\\\xC9\\\\xCA\\\\xCB\\\\xCC\\\\xCD\\\\xCE\\\\xCF\\\\xD0\\\\xD1\\\\xD2\\\\xD3\\\\xD4\\\\xD5\\\\xD6\\\\xD8\\\\xD9\\\\xDA\\\\xDB\\\\xDC\\\\xDD\\\\xDE\\\\xBF\\\",\\n \\\\\\\"SOFOTO ebctefghejklnnepkrstevvkesebctefghejklnnepkrstevvkeseeeeeeeceeeeeeeedneeeeeeeeeeepseeeeeeeeceeeeeeeedneeeeeeeeeeep?\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MIDWORD\\\\t'-\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"KEP =\\\",\\n \\\\\\\"RAR ?\\\",\\n \\\\\\\"BAD !\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX I N 1\\\",\\n \\\\\\\"PFX I 0 in .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX O Y 1\\\",\\n \\\\\\\"PFX O 0 out .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX S Y 2\\\",\\n \\\\\\\"SFX S 0 s [^s]\\\",\\n \\\\\\\"SFX S 0 es s\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX N N 3\\\",\\n \\\\\\\"SFX N 0 en [^n]\\\",\\n \\\\\\\"SFX N 0 nen n\\\",\\n \\\\\\\"SFX N 0 n .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"REP 3\\\",\\n \\\\\\\"REP g ch\\\",\\n \\\\\\\"REP ch g\\\",\\n \\\\\\\"REP svp s.v.p.\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MAP 9\\\",\\n \\\\\\\"MAP a\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\",\\n \\\\\\\"MAP e\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\",\\n \\\\\\\"MAP i\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\",\\n \\\\\\\"MAP o\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\",\\n \\\\\\\"MAP u\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\",\\n \\\\\\\"MAP n\\\\xF1\\\",\\n \\\\\\\"MAP c\\\\xE7\\\",\\n \\\\\\\"MAP y\\\\xFF\\\\xFD\\\",\\n \\\\\\\"MAP s\\\\xDF\\\"\\n \\\\ ]\\nlet g:test_data_dic1 = [\\n \\\\\\\"123456\\\",\\n \\\\\\\"test/NO\\\",\\n \\\\\\\"# comment\\\",\\n \\\\\\\"wrong\\\",\\n \\\\\\\"Comment\\\",\\n \\\\\\\"OK\\\",\\n \\\\\\\"uk\\\",\\n \\\\\\\"put/ISO\\\",\\n \\\\\\\"the end\\\",\\n \\\\\\\"deol\\\",\\n \\\\\\\"d\\\\xE9\\\\xF4r\\\",\\n \\\\ ]\\nlet g:test_data_aff2 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FOL \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"LOW \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"UPP \\\\xC0\\\\xC1\\\\xC2\\\\xC3\\\\xC4\\\\xC5\\\\xC6\\\\xC7\\\\xC8\\\\xC9\\\\xCA\\\\xCB\\\\xCC\\\\xCD\\\\xCE\\\\xCF\\\\xD0\\\\xD1\\\\xD2\\\\xD3\\\\xD4\\\\xD5\\\\xD6\\\\xD8\\\\xD9\\\\xDA\\\\xDB\\\\xDC\\\\xDD\\\\xDE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFXPOSTPONE\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MIDWORD\\\\t'-\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"KEP =\\\",\\n \\\\\\\"RAR ?\\\",\\n \\\\\\\"BAD !\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX I N 1\\\",\\n \\\\\\\"PFX I 0 in .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX O Y 1\\\",\\n \\\\\\\"PFX O 0 out [a-z]\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX S Y 2\\\",\\n \\\\\\\"SFX S 0 s [^s]\\\",\\n \\\\\\\"SFX S 0 es s\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX N N 3\\\",\\n \\\\\\\"SFX N 0 en [^n]\\\",\\n \\\\\\\"SFX N 0 nen n\\\",\\n \\\\\\\"SFX N 0 n .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"REP 3\\\",\\n \\\\\\\"REP g ch\\\",\\n \\\\\\\"REP ch g\\\",\\n \\\\\\\"REP svp s.v.p.\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MAP 9\\\",\\n \\\\\\\"MAP a\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\",\\n \\\\\\\"MAP e\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\",\\n \\\\\\\"MAP i\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\",\\n \\\\\\\"MAP o\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\",\\n \\\\\\\"MAP u\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\",\\n \\\\\\\"MAP n\\\\xF1\\\",\\n \\\\\\\"MAP c\\\\xE7\\\",\\n \\\\\\\"MAP y\\\\xFF\\\\xFD\\\",\\n \\\\\\\"MAP s\\\\xDF\\\",\\n \\\\ ]\\nlet g:test_data_aff3 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDMIN 3\\\",\\n \\\\\\\"COMPOUNDRULE m*\\\",\\n \\\\\\\"NEEDCOMPOUND x\\\",\\n \\\\ ]\\nlet g:test_data_dic3 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"foo/m\\\",\\n \\\\\\\"bar/mx\\\",\\n \\\\\\\"m\\\\xEF/m\\\",\\n \\\\\\\"la/mx\\\",\\n \\\\ ]\\nlet g:test_data_aff4 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FOL \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"LOW \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"UPP \\\\xC0\\\\xC1\\\\xC2\\\\xC3\\\\xC4\\\\xC5\\\\xC6\\\\xC7\\\\xC8\\\\xC9\\\\xCA\\\\xCB\\\\xCC\\\\xCD\\\\xCE\\\\xCF\\\\xD0\\\\xD1\\\\xD2\\\\xD3\\\\xD4\\\\xD5\\\\xD6\\\\xD8\\\\xD9\\\\xDA\\\\xDB\\\\xDC\\\\xDD\\\\xDE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDRULE m+\\\",\\n \\\\\\\"COMPOUNDRULE sm*e\\\",\\n \\\\\\\"COMPOUNDRULE sm+\\\",\\n \\\\\\\"COMPOUNDMIN 3\\\",\\n \\\\\\\"COMPOUNDWORDMAX 3\\\",\\n \\\\\\\"COMPOUNDFORBIDFLAG t\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDSYLMAX 5\\\",\\n \\\\\\\"SYLLABLE a\\\\xE1e\\\\xE9i\\\\xEDo\\\\xF3\\\\xF6\\\\xF5u\\\\xFA\\\\xFC\\\\xFBy/aa/au/ea/ee/ei/ie/oa/oe/oo/ou/uu/ui\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MAP 9\\\",\\n \\\\\\\"MAP a\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\",\\n \\\\\\\"MAP e\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\",\\n \\\\\\\"MAP i\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\",\\n \\\\\\\"MAP o\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\",\\n \\\\\\\"MAP u\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\",\\n \\\\\\\"MAP n\\\\xF1\\\",\\n \\\\\\\"MAP c\\\\xE7\\\",\\n \\\\\\\"MAP y\\\\xFF\\\\xFD\\\",\\n \\\\\\\"MAP s\\\\xDF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDAFFIX x\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFXPOSTPONE\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MIDWORD '-\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX q N 1\\\",\\n \\\\\\\"SFX q 0 -ok .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX a Y 2\\\",\\n \\\\\\\"SFX a 0 s .\\\",\\n \\\\\\\"SFX a 0 ize/t .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX p N 1\\\",\\n \\\\\\\"PFX p 0 pre .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX P N 1\\\",\\n \\\\\\\"PFX P 0 nou .\\\",\\n \\\\ ]\\nlet g:test_data_dic4 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"word/mP\\\",\\n \\\\\\\"util/am\\\",\\n \\\\\\\"pro/xq\\\",\\n \\\\\\\"tomato/m\\\",\\n \\\\\\\"bork/mp\\\",\\n \\\\\\\"start/s\\\",\\n \\\\\\\"end/e\\\",\\n \\\\ ]\\nlet g:test_data_aff5 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FLAG long\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDAFFIX !!\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDRULE ssmm*ee\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDCOMPOUND xx\\\",\\n \\\\\\\"COMPOUNDPERMITFLAG pp\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 13 Y 1\\\",\\n \\\\\\\"SFX 13 0 bork .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX a1 Y 1\\\",\\n \\\\\\\"SFX a1 0 a1 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX a\\\\xE9 Y 1\\\",\\n \\\\\\\"SFX a\\\\xE9 0 a\\\\xE9 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX zz Y 1\\\",\\n \\\\\\\"PFX zz 0 pre/pp .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX yy Y 1\\\",\\n \\\\\\\"PFX yy 0 nou .\\\",\\n \\\\ ]\\nlet g:test_data_dic5 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"foo/a1a\\\\xE9!!\\\",\\n \\\\\\\"bar/zz13ee\\\",\\n \\\\\\\"start/ss\\\",\\n \\\\\\\"end/eeyy\\\",\\n \\\\\\\"middle/mmxx\\\",\\n \\\\ ]\\nlet g:test_data_aff6 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FLAG caplong\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDAFFIX A!\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDRULE sMm*Ee\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDCOMPOUND Xx\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDPERMITFLAG p\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX N3 Y 1\\\",\\n \\\\\\\"SFX N3 0 bork .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX A1 Y 1\\\",\\n \\\\\\\"SFX A1 0 a1 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX A\\\\xE9 Y 1\\\",\\n \\\\\\\"SFX A\\\\xE9 0 a\\\\xE9 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX Zz Y 1\\\",\\n \\\\\\\"PFX Zz 0 pre/p .\\\",\\n \\\\ ]\\nlet g:test_data_dic6 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"mee/A1A\\\\xE9A!\\\",\\n \\\\\\\"bar/ZzN3Ee\\\",\\n \\\\\\\"lead/s\\\",\\n \\\\\\\"end/Ee\\\",\\n \\\\\\\"middle/MmXx\\\",\\n \\\\ ]\\nlet g:test_data_aff7 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FLAG num\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDAFFIX 9999\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDRULE 2,77*123\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDCOMPOUND 1\\\",\\n \\\\\\\"COMPOUNDPERMITFLAG 432\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 61003 Y 1\\\",\\n \\\\\\\"SFX 61003 0 meat .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 0 Y 1\\\",\\n \\\\\\\"SFX 0 0 zero .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 391 Y 1\\\",\\n \\\\\\\"SFX 391 0 a1 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 111 Y 1\\\",\\n \\\\\\\"SFX 111 0 a\\\\xE9 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX 17 Y 1\\\",\\n \\\\\\\"PFX 17 0 pre/432 .\\\",\\n \\\\ ]\\nlet g:test_data_dic7 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"mee/0,391,111,9999\\\",\\n \\\\\\\"bar/17,61003,123\\\",\\n \\\\\\\"lead/2\\\",\\n \\\\\\\"tail/123\\\",\\n \\\\\\\"middle/77,1\\\",\\n \\\\ ]\\nlet g:test_data_aff8 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NOSPLITSUGS\\\",\\n \\\\ ]\\nlet g:test_data_dic8 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"foo\\\",\\n \\\\\\\"bar\\\",\\n \\\\\\\"faabar\\\",\\n \\\\ ]\\nlet g:test_data_aff9 = [\\n \\\\ ]\\nlet g:test_data_dic9 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"foo\\\",\\n \\\\\\\"bar\\\",\\n \\\\ ]\\nlet g:test_data_aff10 = [\\n \\\\\\\"COMPOUNDRULE se\\\",\\n \\\\\\\"COMPOUNDPERMITFLAG p\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX A Y 1\\\",\\n \\\\\\\"SFX A 0 able/Mp .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX M Y 1\\\",\\n \\\\\\\"SFX M 0 s .\\\",\\n \\\\ ]\\nlet g:test_data_dic10 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"drink/As\\\",\\n \\\\\\\"table/e\\\",\\n \\\\ ]\\nlet g:test_data_aff_sal = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"TRY esianrtolcdugmphbyfvkwjkqxz-\\\\xEB\\\\xE9\\\\xE8\\\\xEA\\\\xEF\\\\xEE\\\\xE4\\\\xE0\\\\xE2\\\\xF6\\\\xFC\\\\xFB'ESIANRTOLCDUGMPHBYFVKWJKQXZ\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FOL \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"LOW \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"UPP \\\\xC0\\\\xC1\\\\xC2\\\\xC3\\\\xC4\\\\xC5\\\\xC6\\\\xC7\\\\xC8\\\\xC9\\\\xCA\\\\xCB\\\\xCC\\\\xCD\\\\xCE\\\\xCF\\\\xD0\\\\xD1\\\\xD2\\\\xD3\\\\xD4\\\\xD5\\\\xD6\\\\xD8\\\\xD9\\\\xDA\\\\xDB\\\\xDC\\\\xDD\\\\xDE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MIDWORD\\\\t'-\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"KEP =\\\",\\n \\\\\\\"RAR ?\\\",\\n \\\\\\\"BAD !\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX I N 1\\\",\\n \\\\\\\"PFX I 0 in .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX O Y 1\\\",\\n \\\\\\\"PFX O 0 out .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX S Y 2\\\",\\n \\\\\\\"SFX S 0 s [^s]\\\",\\n \\\\\\\"SFX S 0 es s\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX N N 3\\\",\\n \\\\\\\"SFX N 0 en [^n]\\\",\\n \\\\\\\"SFX N 0 nen n\\\",\\n \\\\\\\"SFX N 0 n .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"REP 3\\\",\\n \\\\\\\"REP g ch\\\",\\n \\\\\\\"REP ch g\\\",\\n \\\\\\\"REP svp s.v.p.\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MAP 9\\\",\\n \\\\\\\"MAP a\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\",\\n \\\\\\\"MAP e\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\",\\n \\\\\\\"MAP i\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\",\\n \\\\\\\"MAP o\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\",\\n \\\\\\\"MAP u\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\",\\n \\\\\\\"MAP n\\\\xF1\\\",\\n \\\\\\\"MAP c\\\\xE7\\\",\\n \\\\\\\"MAP y\\\\xFF\\\\xFD\\\",\\n \\\\\\\"MAP s\\\\xDF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SAL AH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL AR(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL A(HR)^ *\\\",\\n \\\\\\\"SAL A^ *\\\",\\n \\\\\\\"SAL AH(AEIOUY)- H\\\",\\n \\\\\\\"SAL AR(AEIOUY)- R\\\",\\n \\\\\\\"SAL A(HR) _\\\",\\n \\\\\\\"SAL \\\\xC0^ *\\\",\\n \\\\\\\"SAL \\\\xC5^ *\\\",\\n \\\\\\\"SAL BB- _\\\",\\n \\\\\\\"SAL B B\\\",\\n \\\\\\\"SAL CQ- _\\\",\\n \\\\\\\"SAL CIA X\\\",\\n \\\\\\\"SAL CH X\\\",\\n \\\\\\\"SAL C(EIY)- S\\\",\\n \\\\\\\"SAL CK K\\\",\\n \\\\\\\"SAL COUGH^ KF\\\",\\n \\\\\\\"SAL CC< C\\\",\\n \\\\\\\"SAL C K\\\",\\n \\\\\\\"SAL DG(EIY) K\\\",\\n \\\\\\\"SAL DD- _\\\",\\n \\\\\\\"SAL D T\\\",\\n \\\\\\\"SAL \\\\xC9< E\\\",\\n \\\\\\\"SAL EH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL ER(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL E(HR)^ *\\\",\\n \\\\\\\"SAL ENOUGH^$ *NF\\\",\\n \\\\\\\"SAL E^ *\\\",\\n \\\\\\\"SAL EH(AEIOUY)- H\\\",\\n \\\\\\\"SAL ER(AEIOUY)- R\\\",\\n \\\\\\\"SAL E(HR) _\\\",\\n \\\\\\\"SAL FF- _\\\",\\n \\\\\\\"SAL F F\\\",\\n \\\\\\\"SAL GN^ N\\\",\\n \\\\\\\"SAL GN$ N\\\",\\n \\\\\\\"SAL GNS$ NS\\\",\\n \\\\\\\"SAL GNED$ N\\\",\\n \\\\\\\"SAL GH(AEIOUY)- K\\\",\\n \\\\\\\"SAL GH _\\\",\\n \\\\\\\"SAL GG9 K\\\",\\n \\\\\\\"SAL G K\\\",\\n \\\\\\\"SAL H H\\\",\\n \\\\\\\"SAL IH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL IR(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL I(HR)^ *\\\",\\n \\\\\\\"SAL I^ *\\\",\\n \\\\\\\"SAL ING6 N\\\",\\n \\\\\\\"SAL IH(AEIOUY)- H\\\",\\n \\\\\\\"SAL IR(AEIOUY)- R\\\",\\n \\\\\\\"SAL I(HR) _\\\",\\n \\\\\\\"SAL J K\\\",\\n \\\\\\\"SAL KN^ N\\\",\\n \\\\\\\"SAL KK- _\\\",\\n \\\\\\\"SAL K K\\\",\\n \\\\\\\"SAL LAUGH^ LF\\\",\\n \\\\\\\"SAL LL- _\\\",\\n \\\\\\\"SAL L L\\\",\\n \\\\\\\"SAL MB$ M\\\",\\n \\\\\\\"SAL MM M\\\",\\n \\\\\\\"SAL M M\\\",\\n \\\\\\\"SAL NN- _\\\",\\n \\\\\\\"SAL N N\\\",\\n \\\\\\\"SAL OH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL OR(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL O(HR)^ *\\\",\\n \\\\\\\"SAL O^ *\\\",\\n \\\\\\\"SAL OH(AEIOUY)- H\\\",\\n \\\\\\\"SAL OR(AEIOUY)- R\\\",\\n \\\\\\\"SAL O(HR) _\\\",\\n \\\\\\\"SAL PH F\\\",\\n \\\\\\\"SAL PN^ N\\\",\\n \\\\\\\"SAL PP- _\\\",\\n \\\\\\\"SAL P P\\\",\\n \\\\\\\"SAL Q K\\\",\\n \\\\\\\"SAL RH^ R\\\",\\n \\\\\\\"SAL ROUGH^ RF\\\",\\n \\\\\\\"SAL RR- _\\\",\\n \\\\\\\"SAL R R\\\",\\n \\\\\\\"SAL SCH(EOU)- SK\\\",\\n \\\\\\\"SAL SC(IEY)- S\\\",\\n \\\\\\\"SAL SH X\\\",\\n \\\\\\\"SAL SI(AO)- X\\\",\\n \\\\\\\"SAL SS- _\\\",\\n \\\\\\\"SAL S S\\\",\\n \\\\\\\"SAL TI(AO)- X\\\",\\n \\\\\\\"SAL TH @\\\",\\n \\\\\\\"SAL TCH-- _\\\",\\n \\\\\\\"SAL TOUGH^ TF\\\",\\n \\\\\\\"SAL TT- _\\\",\\n \\\\\\\"SAL T T\\\",\\n \\\\\\\"SAL UH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL UR(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL U(HR)^ *\\\",\\n \\\\\\\"SAL U^ *\\\",\\n \\\\\\\"SAL UH(AEIOUY)- H\\\",\\n \\\\\\\"SAL UR(AEIOUY)- R\\\",\\n \\\\\\\"SAL U(HR) _\\\",\\n \\\\\\\"SAL V^ W\\\",\\n \\\\\\\"SAL V F\\\",\\n \\\\\\\"SAL WR^ R\\\",\\n \\\\\\\"SAL WH^ W\\\",\\n \\\\\\\"SAL W(AEIOU)- W\\\",\\n \\\\\\\"SAL X^ S\\\",\\n \\\\\\\"SAL X KS\\\",\\n \\\\\\\"SAL Y(AEIOU)- Y\\\",\\n \\\\\\\"SAL ZZ- _\\\",\\n \\\\\\\"SAL Z S\\\",\\n \\\\ ]\",\n \"func LoadAffAndDic(aff_contents, dic_contents)\\n set enc=utf-8\\n set spellfile=\\n call writefile(a:aff_contents, \\\"Xtest.aff\\\")\\n call writefile(a:dic_contents, \\\"Xtest.dic\\\")\\n \\\" Generate a .spl file from a .dic and .aff file.\\n mkspell! Xtest Xtest\\n \\\" use that spell file\\n set spl=Xtest.utf-8.spl spell\\nendfunc\",\n \"func ListWords()\\n spelldump\\n %yank\\n quit\\n return split(@\\\", \\\"\\\\n\\\")\\nendfunc\",\n \"func TestGoodBadBase()\\n exe '1;/^good:'\\n normal 0f:]s\\n let prevbad = ''\\n let result = []\\n while 1\\n let [bad, a] = spellbadword()\\n if bad == '' || bad == prevbad || bad == 'badend'\\n break\\n endif\\n let prevbad = bad\\n let lst = bad->spellsuggest(3)\\n normal mm\",\n \" call add(result, [bad, lst])\\n normal `m]s\\n endwhile\\n return result\\nendfunc\",\n \"func RunGoodBad(good, bad, expected_words, expected_bad_words)\\n %bwipe!\\n call setline(1, ['', \\\"good: \\\", a:good, a:bad, \\\" badend \\\"])\\n let words = ListWords()\\n call assert_equal(a:expected_words, words[1:-1])\\n let bad_words = TestGoodBadBase()\\n call assert_equal(a:expected_bad_words, bad_words)\\n %bwipe!\\nendfunc\",\n \"func Test_spell_basic()\\n call LoadAffAndDic(g:test_data_aff1, g:test_data_dic1)\\n call RunGoodBad(\\\"wrong OK puts. Test the end\\\",\\n \\\\ \\\"bad: inputs comment ok Ok. test d\\\\u00E9\\\\u00F4l end the\\\",\\n \\\\[\\\"Comment\\\", \\\"deol\\\", \\\"d\\\\u00E9\\\\u00F4r\\\", \\\"input\\\", \\\"OK\\\", \\\"output\\\", \\\"outputs\\\", \\\"outtest\\\", \\\"put\\\", \\\"puts\\\",\\n \\\\ \\\"test\\\", \\\"testen\\\", \\\"testn\\\", \\\"the end\\\", \\\"uk\\\", \\\"wrong\\\"],\\n \\\\[\\n \\\\ [\\\"bad\\\", [\\\"put\\\", \\\"uk\\\", \\\"OK\\\"]],\\n \\\\ [\\\"inputs\\\", [\\\"input\\\", \\\"puts\\\", \\\"outputs\\\"]],\\n \\\\ [\\\"comment\\\", [\\\"Comment\\\", \\\"outtest\\\", \\\"the end\\\"]],\\n \\\\ [\\\"ok\\\", [\\\"OK\\\", \\\"uk\\\", \\\"put\\\"]],\\n \\\\ [\\\"Ok\\\", [\\\"OK\\\", \\\"Uk\\\", \\\"Put\\\"]],\\n \\\\ [\\\"test\\\", [\\\"Test\\\", \\\"testn\\\", \\\"testen\\\"]],\\n \\\\ [\\\"d\\\\u00E9\\\\u00F4l\\\", [\\\"deol\\\", \\\"d\\\\u00E9\\\\u00F4r\\\", \\\"test\\\"]],\\n \\\\ [\\\"end\\\", [\\\"put\\\", \\\"uk\\\", \\\"test\\\"]],\\n \\\\ [\\\"the\\\", [\\\"put\\\", \\\"uk\\\", \\\"test\\\"]],\\n \\\\ ]\\n \\\\ )\",\n \" call assert_equal(\\\"gebletegek\\\", soundfold('goobledygoook'))\\n call assert_equal(\\\"kepereneven\\\", 'kóopërÿnôven'->soundfold())\\n call assert_equal(\\\"everles gesvets etele\\\", soundfold('oeverloos gezwets edale'))\\nendfunc\",\n \"\\\" Postponed prefixes\\nfunc Test_spell_prefixes()\\n call LoadAffAndDic(g:test_data_aff2, g:test_data_dic1)\\n call RunGoodBad(\\\"puts\\\",\\n \\\\ \\\"bad: inputs comment ok Ok end the. test d\\\\u00E9\\\\u00F4l\\\",\\n \\\\ [\\\"Comment\\\", \\\"deol\\\", \\\"d\\\\u00E9\\\\u00F4r\\\", \\\"OK\\\", \\\"put\\\", \\\"input\\\", \\\"output\\\", \\\"puts\\\", \\\"outputs\\\", \\\"test\\\", \\\"outtest\\\", \\\"testen\\\", \\\"testn\\\", \\\"the end\\\", \\\"uk\\\", \\\"wrong\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"put\\\", \\\"uk\\\", \\\"OK\\\"]],\\n \\\\ [\\\"inputs\\\", [\\\"input\\\", \\\"puts\\\", \\\"outputs\\\"]],\\n \\\\ [\\\"comment\\\", [\\\"Comment\\\"]],\\n \\\\ [\\\"ok\\\", [\\\"OK\\\", \\\"uk\\\", \\\"put\\\"]],\\n \\\\ [\\\"Ok\\\", [\\\"OK\\\", \\\"Uk\\\", \\\"Put\\\"]],\\n \\\\ [\\\"end\\\", [\\\"put\\\", \\\"uk\\\", \\\"deol\\\"]],\\n \\\\ [\\\"the\\\", [\\\"put\\\", \\\"uk\\\", \\\"test\\\"]],\\n \\\\ [\\\"test\\\", [\\\"Test\\\", \\\"testn\\\", \\\"testen\\\"]],\\n \\\\ [\\\"d\\\\u00E9\\\\u00F4l\\\", [\\\"deol\\\", \\\"d\\\\u00E9\\\\u00F4r\\\", \\\"test\\\"]],\\n \\\\ ])\\nendfunc\",\n \"\\\"Compound words\\nfunc Test_spell_compound()\\n call LoadAffAndDic(g:test_data_aff3, g:test_data_dic3)\\n call RunGoodBad(\\\"foo m\\\\u00EF foobar foofoobar barfoo barbarfoo\\\",\\n \\\\ \\\"bad: bar la foom\\\\u00EF barm\\\\u00EF m\\\\u00EFfoo m\\\\u00EFbar m\\\\u00EFm\\\\u00EF lala m\\\\u00EFla lam\\\\u00EF foola labar\\\",\\n \\\\ [\\\"foo\\\", \\\"m\\\\u00EF\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"foo\\\", \\\"m\\\\u00EF\\\"]],\\n \\\\ [\\\"bar\\\", [\\\"barfoo\\\", \\\"foobar\\\", \\\"foo\\\"]],\\n \\\\ [\\\"la\\\", [\\\"m\\\\u00EF\\\", \\\"foo\\\"]],\\n \\\\ [\\\"foom\\\\u00EF\\\", [\\\"foo m\\\\u00EF\\\", \\\"foo\\\", \\\"foofoo\\\"]],\\n \\\\ [\\\"barm\\\\u00EF\\\", [\\\"barfoo\\\", \\\"m\\\\u00EF\\\", \\\"barbar\\\"]],\\n \\\\ [\\\"m\\\\u00EFfoo\\\", [\\\"m\\\\u00EF foo\\\", \\\"foo\\\", \\\"foofoo\\\"]],\\n \\\\ [\\\"m\\\\u00EFbar\\\", [\\\"foobar\\\", \\\"barbar\\\", \\\"m\\\\u00EF\\\"]],\\n \\\\ [\\\"m\\\\u00EFm\\\\u00EF\\\", [\\\"m\\\\u00EF m\\\\u00EF\\\", \\\"m\\\\u00EF\\\"]],\\n \\\\ [\\\"lala\\\", []],\\n \\\\ [\\\"m\\\\u00EFla\\\", [\\\"m\\\\u00EF\\\", \\\"m\\\\u00EF m\\\\u00EF\\\"]],\\n \\\\ [\\\"lam\\\\u00EF\\\", [\\\"m\\\\u00EF\\\", \\\"m\\\\u00EF m\\\\u00EF\\\"]],\\n \\\\ [\\\"foola\\\", [\\\"foo\\\", \\\"foobar\\\", \\\"foofoo\\\"]],\\n \\\\ [\\\"labar\\\", [\\\"barbar\\\", \\\"foobar\\\"]],\\n \\\\ ])\",\n \" call LoadAffAndDic(g:test_data_aff4, g:test_data_dic4)\\n call RunGoodBad(\\\"word util bork prebork start end wordutil wordutils pro-ok bork borkbork borkborkbork borkborkborkbork borkborkborkborkbork tomato tomatotomato startend startword startwordword startwordend startwordwordend startwordwordwordend prebork preborkbork preborkborkbork nouword\\\",\\n \\\\ \\\"bad: wordutilize pro borkborkborkborkborkbork tomatotomatotomato endstart endend startstart wordend wordstart preborkprebork preborkpreborkbork startwordwordwordwordend borkpreborkpreborkbork utilsbork startnouword\\\",\\n \\\\ [\\\"bork\\\", \\\"prebork\\\", \\\"end\\\", \\\"pro-ok\\\", \\\"start\\\", \\\"tomato\\\", \\\"util\\\", \\\"utilize\\\", \\\"utils\\\", \\\"word\\\", \\\"nouword\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"end\\\", \\\"bork\\\", \\\"word\\\"]],\\n \\\\ [\\\"wordutilize\\\", [\\\"word utilize\\\", \\\"wordutils\\\", \\\"wordutil\\\"]],\\n \\\\ [\\\"pro\\\", [\\\"bork\\\", \\\"word\\\", \\\"end\\\"]],\\n \\\\ [\\\"borkborkborkborkborkbork\\\", [\\\"bork borkborkborkborkbork\\\", \\\"borkbork borkborkborkbork\\\", \\\"borkborkbork borkborkbork\\\"]],\\n \\\\ [\\\"tomatotomatotomato\\\", [\\\"tomato tomatotomato\\\", \\\"tomatotomato tomato\\\", \\\"tomato tomato tomato\\\"]],\\n \\\\ [\\\"endstart\\\", [\\\"end start\\\", \\\"start\\\"]],\\n \\\\ [\\\"endend\\\", [\\\"end end\\\", \\\"end\\\"]],\\n \\\\ [\\\"startstart\\\", [\\\"start start\\\"]],\\n \\\\ [\\\"wordend\\\", [\\\"word end\\\", \\\"word\\\", \\\"wordword\\\"]],\\n \\\\ [\\\"wordstart\\\", [\\\"word start\\\", \\\"bork start\\\"]],\\n \\\\ [\\\"preborkprebork\\\", [\\\"prebork prebork\\\", \\\"preborkbork\\\", \\\"preborkborkbork\\\"]],\\n \\\\ [\\\"preborkpreborkbork\\\", [\\\"prebork preborkbork\\\", \\\"preborkborkbork\\\", \\\"preborkborkborkbork\\\"]],\\n \\\\ [\\\"startwordwordwordwordend\\\", [\\\"startwordwordwordword end\\\", \\\"startwordwordwordword\\\", \\\"start wordwordwordword end\\\"]],\\n \\\\ [\\\"borkpreborkpreborkbork\\\", [\\\"bork preborkpreborkbork\\\", \\\"bork prebork preborkbork\\\", \\\"bork preborkprebork bork\\\"]],\\n \\\\ [\\\"utilsbork\\\", [\\\"utilbork\\\", \\\"utils bork\\\", \\\"util bork\\\"]],\\n \\\\ [\\\"startnouword\\\", [\\\"start nouword\\\", \\\"startword\\\", \\\"startborkword\\\"]],\\n \\\\ ])\",\n \"endfunc\",\n \"\\\" Test affix flags with two characters\\nfunc Test_spell_affix()\\n call LoadAffAndDic(g:test_data_aff5, g:test_data_dic5)\\n call RunGoodBad(\\\"fooa1 fooa\\\\u00E9 bar prebar barbork prebarbork startprebar start end startend startmiddleend nouend\\\",\\n \\\\ \\\"bad: foo fooa2 prabar probarbirk middle startmiddle middleend endstart startprobar startnouend\\\",\\n \\\\ [\\\"bar\\\", \\\"barbork\\\", \\\"end\\\", \\\"fooa1\\\", \\\"fooa\\\\u00E9\\\", \\\"nouend\\\", \\\"prebar\\\", \\\"prebarbork\\\", \\\"start\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"bar\\\", \\\"end\\\", \\\"fooa1\\\"]],\\n \\\\ [\\\"foo\\\", [\\\"fooa1\\\", \\\"fooa\\\\u00E9\\\", \\\"bar\\\"]],\\n \\\\ [\\\"fooa2\\\", [\\\"fooa1\\\", \\\"fooa\\\\u00E9\\\", \\\"bar\\\"]],\\n \\\\ [\\\"prabar\\\", [\\\"prebar\\\", \\\"bar\\\", \\\"bar bar\\\"]],\\n \\\\ [\\\"probarbirk\\\", [\\\"prebarbork\\\"]],\\n \\\\ [\\\"middle\\\", []],\\n \\\\ [\\\"startmiddle\\\", [\\\"startmiddleend\\\", \\\"startmiddlebar\\\"]],\\n \\\\ [\\\"middleend\\\", []],\\n \\\\ [\\\"endstart\\\", [\\\"end start\\\", \\\"start\\\"]],\\n \\\\ [\\\"startprobar\\\", [\\\"startprebar\\\", \\\"start prebar\\\", \\\"startbar\\\"]],\\n \\\\ [\\\"startnouend\\\", [\\\"start nouend\\\", \\\"startend\\\"]],\\n \\\\ ])\",\n \" call LoadAffAndDic(g:test_data_aff6, g:test_data_dic6)\\n call RunGoodBad(\\\"meea1 meea\\\\u00E9 bar prebar barbork prebarbork leadprebar lead end leadend leadmiddleend\\\",\\n \\\\ \\\"bad: mee meea2 prabar probarbirk middle leadmiddle middleend endlead leadprobar\\\",\\n \\\\ [\\\"bar\\\", \\\"barbork\\\", \\\"end\\\", \\\"lead\\\", \\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"prebar\\\", \\\"prebarbork\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"bar\\\", \\\"end\\\", \\\"lead\\\"]],\\n \\\\ [\\\"mee\\\", [\\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"bar\\\"]],\\n \\\\ [\\\"meea2\\\", [\\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"lead\\\"]],\\n \\\\ [\\\"prabar\\\", [\\\"prebar\\\", \\\"bar\\\", \\\"leadbar\\\"]],\\n \\\\ [\\\"probarbirk\\\", [\\\"prebarbork\\\"]],\\n \\\\ [\\\"middle\\\", []],\\n \\\\ [\\\"leadmiddle\\\", [\\\"leadmiddleend\\\", \\\"leadmiddlebar\\\"]],\\n \\\\ [\\\"middleend\\\", []],\\n \\\\ [\\\"endlead\\\", [\\\"end lead\\\", \\\"lead\\\", \\\"end end\\\"]],\\n \\\\ [\\\"leadprobar\\\", [\\\"leadprebar\\\", \\\"lead prebar\\\", \\\"leadbar\\\"]],\\n \\\\ ])\",\n \" call LoadAffAndDic(g:test_data_aff7, g:test_data_dic7)\\n call RunGoodBad(\\\"meea1 meezero meea\\\\u00E9 bar prebar barmeat prebarmeat leadprebar lead tail leadtail leadmiddletail\\\",\\n \\\\ \\\"bad: mee meea2 prabar probarmaat middle leadmiddle middletail taillead leadprobar\\\",\\n \\\\ [\\\"bar\\\", \\\"barmeat\\\", \\\"lead\\\", \\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"meezero\\\", \\\"prebar\\\", \\\"prebarmeat\\\", \\\"tail\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"bar\\\", \\\"lead\\\", \\\"tail\\\"]],\\n \\\\ [\\\"mee\\\", [\\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"bar\\\"]],\\n \\\\ [\\\"meea2\\\", [\\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"lead\\\"]],\\n \\\\ [\\\"prabar\\\", [\\\"prebar\\\", \\\"bar\\\", \\\"leadbar\\\"]],\\n \\\\ [\\\"probarmaat\\\", [\\\"prebarmeat\\\"]],\\n \\\\ [\\\"middle\\\", []],\\n \\\\ [\\\"leadmiddle\\\", [\\\"leadmiddlebar\\\"]],\\n \\\\ [\\\"middletail\\\", []],\\n \\\\ [\\\"taillead\\\", [\\\"tail lead\\\", \\\"tail\\\"]],\\n \\\\ [\\\"leadprobar\\\", [\\\"leadprebar\\\", \\\"lead prebar\\\", \\\"leadbar\\\"]],\\n \\\\ ])\\nendfunc\",\n \"func Test_spell_NOSLITSUGS()\\n call LoadAffAndDic(g:test_data_aff8, g:test_data_dic8)\\n call RunGoodBad(\\\"foo bar faabar\\\", \\\"bad: foobar barfoo\\\",\\n \\\\ [\\\"bar\\\", \\\"faabar\\\", \\\"foo\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"bar\\\", \\\"foo\\\"]],\\n \\\\ [\\\"foobar\\\", [\\\"faabar\\\", \\\"foo bar\\\", \\\"bar\\\"]],\\n \\\\ [\\\"barfoo\\\", [\\\"bar foo\\\", \\\"bar\\\", \\\"foo\\\"]],\\n \\\\ ])\\nendfunc\",\n \"\\\" Numbers\\nfunc Test_spell_Numbers()\\n call LoadAffAndDic(g:test_data_aff9, g:test_data_dic9)\\n call RunGoodBad(\\\"0b1011 0777 1234 0x01ff\\\", \\\"\\\",\\n \\\\ [\\\"bar\\\", \\\"foo\\\"],\\n \\\\ [\\n \\\\ ])\\nendfunc\",\n \"\\\" Affix flags\\nfunc Test_spell_affix_flags()\\n call LoadAffAndDic(g:test_data_aff10, g:test_data_dic10)\\n call RunGoodBad(\\\"drink drinkable drinkables drinktable drinkabletable\\\",\\n\\t\\\\ \\\"bad: drinks drinkstable drinkablestable\\\",\\n \\\\ [\\\"drink\\\", \\\"drinkable\\\", \\\"drinkables\\\", \\\"table\\\"],\\n \\\\ [['bad', []],\\n\\t\\\\ ['drinks', ['drink']],\\n\\t\\\\ ['drinkstable', ['drinktable', 'drinkable', 'drink table']],\\n \\\\ ['drinkablestable', ['drinkabletable', 'drinkables table', 'drinkable table']],\\n\\t\\\\ ])\\nendfunc\",\n \"function FirstSpellWord()\\n call feedkeys(\\\"/^start:\\\\n\\\", 'tx')\\n normal ]smm\\n let [str, a] = spellbadword()\\n return str\\nendfunc\",\n \"function SecondSpellWord()\\n normal `m]s\\n let [str, a] = spellbadword()\\n return str\\nendfunc\",\n \"\\\" Test with SAL instead of SOFO items; test automatic reloading\\nfunc Test_spell_sal_and_addition()\\n set spellfile=\\n call writefile(g:test_data_dic1, \\\"Xtest.dic\\\")\\n call writefile(g:test_data_aff_sal, \\\"Xtest.aff\\\")\\n mkspell! Xtest Xtest\\n set spl=Xtest.utf-8.spl spell\\n call assert_equal('kbltykk', soundfold('goobledygoook'))\\n call assert_equal('kprnfn', soundfold('kóopërÿnôven'))\\n call assert_equal('*fls kswts tl', soundfold('oeverloos gezwets edale'))\",\n \" \\\"also use an addition file\\n call writefile([\\\"/regions=usgbnz\\\", \\\"elequint/2\\\", \\\"elekwint/3\\\"], \\\"Xtest.utf-8.add\\\")\\n mkspell! Xtest.utf-8.add.spl Xtest.utf-8.add\",\n \" bwipe!\\n call setline(1, [\\\"start: elequint test elekwint test elekwent asdf\\\"])\",\n \" set spellfile=Xtest.utf-8.add\\n call assert_equal(\\\"elekwent\\\", FirstSpellWord())\",\n \" set spl=Xtest_us.utf-8.spl\\n call assert_equal(\\\"elequint\\\", FirstSpellWord())\\n call assert_equal(\\\"elekwint\\\", SecondSpellWord())\",\n \" set spl=Xtest_gb.utf-8.spl\\n call assert_equal(\\\"elekwint\\\", FirstSpellWord())\\n call assert_equal(\\\"elekwent\\\", SecondSpellWord())\",\n \" set spl=Xtest_nz.utf-8.spl\\n call assert_equal(\\\"elequint\\\", FirstSpellWord())\\n call assert_equal(\\\"elekwent\\\", SecondSpellWord())\",\n \" set spl=Xtest_ca.utf-8.spl\\n call assert_equal(\\\"elequint\\\", FirstSpellWord())\\n call assert_equal(\\\"elekwint\\\", SecondSpellWord())\\nendfunc\",\n \"func Test_spellfile_value()\\n set spellfile=Xdir/Xtest.utf-8.add\\n set spellfile=Xdir/Xtest.utf-8.add,Xtest_other.add\\nendfunc\",\n \"func Test_no_crash_with_weird_text()\\n new\\n let lines =<< trim END\\n r<sfile>\\n \",\n \"\\n \\n END\\n call setline(1, lines)\\n exe \\\"%norm \\\\<C-v>ez=>\\\\<C-v>wzG\\\"\",\n \" bwipe!\\nendfunc\\n\",\n \"\",\n \"\\n\\\" vim: shiftwidth=2 sts=2 expandtab\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 0,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [3275, 4230, 6192, 782, 748], \"buggy_code_start_loc\": [3275, 4229, 4392, 782, 748], \"filenames\": [\"src/errors.h\", \"src/mbyte.c\", \"src/spellfile.c\", \"src/testdir/test_spell_utf8.vim\", \"src/version.c\"], \"fixing_code_end_loc\": [3280, 4230, 6203, 788, 751], \"fixing_code_start_loc\": [3276, 4229, 4393, 783, 749], \"message\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:vim:vim:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"CF072C31-D320-47CE-B39B-F45447D70BD9\", \"versionEndExcluding\": \"8.2.4919\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:debian:debian_linux:9.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"DEECE5FC-CACF-4496-A3E7-164736409252\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:debian:debian_linux:10.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"07B237A9-69A3-4A9C-9DA0-4E06BD37AE73\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:34:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"A930E247-0B43-43CB-98FF-6CE7B8189835\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:35:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"80E516C0-98A4-4ADE-B69F-66A772E2BAAA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:apple:macos:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"71E032AD-F827-4944-9699-BB1E6D4233FC\", \"versionEndExcluding\": \"13.0\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\"}, {\"lang\": \"es\", \"value\": \"Un Desbordamiento del b\\u00fafer de pila en vim_strncpy find_word en el repositorio de GitHub vim/vim versiones anteriores a 8.2.4919. Esta vulnerabilidad es capaz de bloquear el software, Omitir el Mecanismo de Protecci\\u00f3n, Modificar la Memoria y una posible ejecuci\\u00f3n remota\"}], \"evaluatorComment\": null, \"id\": \"CVE-2022-1621\", \"lastModified\": \"2023-05-03T12:15:21.913\", \"metrics\": {\"cvssMetricV2\": [{\"acInsufInfo\": false, \"baseSeverity\": \"MEDIUM\", \"cvssData\": {\"accessComplexity\": \"MEDIUM\", \"accessVector\": \"NETWORK\", \"authentication\": \"NONE\", \"availabilityImpact\": \"PARTIAL\", \"baseScore\": 6.8, \"confidentialityImpact\": \"PARTIAL\", \"integrityImpact\": \"PARTIAL\", \"vectorString\": \"AV:N/AC:M/Au:N/C:P/I:P/A:P\", \"version\": \"2.0\"}, \"exploitabilityScore\": 8.6, \"impactScore\": 6.4, \"obtainAllPrivilege\": false, \"obtainOtherPrivilege\": false, \"obtainUserPrivilege\": false, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\", \"userInteractionRequired\": true}], \"cvssMetricV30\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.3, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"LOW\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.0/AV:L/AC:L/PR:N/UI:R/S:U/C:L/I:H/A:H\", \"version\": \"3.0\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.5, \"source\": \"security@huntr.dev\", \"type\": \"Secondary\"}], \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.8, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.1/AV:L/AC:L/PR:N/UI:R/S:U/C:H/I:H/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.9, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2022-05-10T14:15:08.460\", \"references\": [{\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/28\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/41\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Exploit\", \"Third Party Advisory\"], \"url\": \"https://huntr.dev/bounties/520ce714-bfd2-4646-9458-f52cd22bb2fb\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/05/msg00022.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/11/msg00032.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/HIP7KG7TVS5YF3QREAY2GOGUT3YUBZAI/\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://security.gentoo.org/glsa/202208-32\"}, {\"source\": \"security@huntr.dev\", \"tags\": null, \"url\": \"https://security.gentoo.org/glsa/202305-16\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://support.apple.com/kb/HT213488\"}], \"sourceIdentifier\": \"security@huntr.dev\", \"vendorComments\": null, \"vulnStatus\": \"Modified\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-122\"}], \"source\": \"security@huntr.dev\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-787\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, \"type\": \"CWE-122\"}"},"index":{"kind":"number","value":464,"string":"464"}}},{"rowIdx":2895,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["\" Test for spell checking with 'encoding' set to utf-8","source check.vim\nCheckFeature spell","scriptencoding utf-8","func TearDown()\n set nospell\n call delete('Xtest.aff')\n call delete('Xtest.dic')\n call delete('Xtest.utf-8.add')\n call delete('Xtest.utf-8.add.spl')\n call delete('Xtest.utf-8.spl')\n call delete('Xtest.utf-8.sug')\nendfunc","let g:test_data_aff1 = [\n \\\"SET ISO8859-1\",\n \\\"TRY esianrtolcdugmphbyfvkwjkqxz-ëéèêïîäàâöüû'ESIANRTOLCDUGMPHBYFVKWJKQXZ\",\n \\\"\",\n \\\"FOL àáâãäåæçèéêëìíîïðñòóôõöøùúûüýþßÿ\",\n \\\"LOW àáâãäåæçèéêëìíîïðñòóôõöøùúûüýþßÿ\",\n \\\"UPP ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖØÙÚÛÜÝÞßÿ\",\n \\\"\",\n \\\"SOFOFROM abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\\xC0\\xC1\\xC2\\xC3\\xC4\\xC5\\xC6\\xC7\\xC8\\xC9\\xCA\\xCB\\xCC\\xCD\\xCE\\xCF\\xD0\\xD1\\xD2\\xD3\\xD4\\xD5\\xD6\\xD8\\xD9\\xDA\\xDB\\xDC\\xDD\\xDE\\xBF\",\n \\\"SOFOTO ebctefghejklnnepkrstevvkesebctefghejklnnepkrstevvkeseeeeeeeceeeeeeeedneeeeeeeeeeepseeeeeeeeceeeeeeeedneeeeeeeeeeep?\",\n \\\"\",\n \\\"MIDWORD\\t'-\",\n \\\"\",\n \\\"KEP =\",\n \\\"RAR ?\",\n \\\"BAD !\",\n \\\"\",\n \\\"PFX I N 1\",\n \\\"PFX I 0 in .\",\n \\\"\",\n \\\"PFX O Y 1\",\n \\\"PFX O 0 out .\",\n \\\"\",\n \\\"SFX S Y 2\",\n \\\"SFX S 0 s [^s]\",\n \\\"SFX S 0 es s\",\n \\\"\",\n \\\"SFX N N 3\",\n \\\"SFX N 0 en [^n]\",\n \\\"SFX N 0 nen n\",\n \\\"SFX N 0 n .\",\n \\\"\",\n \\\"REP 3\",\n \\\"REP g ch\",\n \\\"REP ch g\",\n \\\"REP svp s.v.p.\",\n \\\"\",\n \\\"MAP 9\",\n \\\"MAP a\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\",\n \\\"MAP e\\xE8\\xE9\\xEA\\xEB\",\n \\\"MAP i\\xEC\\xED\\xEE\\xEF\",\n \\\"MAP o\\xF2\\xF3\\xF4\\xF5\\xF6\",\n \\\"MAP u\\xF9\\xFA\\xFB\\xFC\",\n \\\"MAP n\\xF1\",\n \\\"MAP c\\xE7\",\n \\\"MAP y\\xFF\\xFD\",\n \\\"MAP s\\xDF\"\n \\ ]\nlet g:test_data_dic1 = [\n \\\"123456\",\n \\\"test/NO\",\n \\\"# comment\",\n \\\"wrong\",\n \\\"Comment\",\n \\\"OK\",\n \\\"uk\",\n \\\"put/ISO\",\n \\\"the end\",\n \\\"deol\",\n \\\"d\\xE9\\xF4r\",\n \\ ]\nlet g:test_data_aff2 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FOL \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"LOW \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"UPP \\xC0\\xC1\\xC2\\xC3\\xC4\\xC5\\xC6\\xC7\\xC8\\xC9\\xCA\\xCB\\xCC\\xCD\\xCE\\xCF\\xD0\\xD1\\xD2\\xD3\\xD4\\xD5\\xD6\\xD8\\xD9\\xDA\\xDB\\xDC\\xDD\\xDE\\xDF\\xFF\",\n \\\"\",\n \\\"PFXPOSTPONE\",\n \\\"\",\n \\\"MIDWORD\\t'-\",\n \\\"\",\n \\\"KEP =\",\n \\\"RAR ?\",\n \\\"BAD !\",\n \\\"\",\n \\\"PFX I N 1\",\n \\\"PFX I 0 in .\",\n \\\"\",\n \\\"PFX O Y 1\",\n \\\"PFX O 0 out [a-z]\",\n \\\"\",\n \\\"SFX S Y 2\",\n \\\"SFX S 0 s [^s]\",\n \\\"SFX S 0 es s\",\n \\\"\",\n \\\"SFX N N 3\",\n \\\"SFX N 0 en [^n]\",\n \\\"SFX N 0 nen n\",\n \\\"SFX N 0 n .\",\n \\\"\",\n \\\"REP 3\",\n \\\"REP g ch\",\n \\\"REP ch g\",\n \\\"REP svp s.v.p.\",\n \\\"\",\n \\\"MAP 9\",\n \\\"MAP a\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\",\n \\\"MAP e\\xE8\\xE9\\xEA\\xEB\",\n \\\"MAP i\\xEC\\xED\\xEE\\xEF\",\n \\\"MAP o\\xF2\\xF3\\xF4\\xF5\\xF6\",\n \\\"MAP u\\xF9\\xFA\\xFB\\xFC\",\n \\\"MAP n\\xF1\",\n \\\"MAP c\\xE7\",\n \\\"MAP y\\xFF\\xFD\",\n \\\"MAP s\\xDF\",\n \\ ]\nlet g:test_data_aff3 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"COMPOUNDMIN 3\",\n \\\"COMPOUNDRULE m*\",\n \\\"NEEDCOMPOUND x\",\n \\ ]\nlet g:test_data_dic3 = [\n \\\"1234\",\n \\\"foo/m\",\n \\\"bar/mx\",\n \\\"m\\xEF/m\",\n \\\"la/mx\",\n \\ ]\nlet g:test_data_aff4 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FOL \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"LOW \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"UPP \\xC0\\xC1\\xC2\\xC3\\xC4\\xC5\\xC6\\xC7\\xC8\\xC9\\xCA\\xCB\\xCC\\xCD\\xCE\\xCF\\xD0\\xD1\\xD2\\xD3\\xD4\\xD5\\xD6\\xD8\\xD9\\xDA\\xDB\\xDC\\xDD\\xDE\\xDF\\xFF\",\n \\\"\",\n \\\"COMPOUNDRULE m+\",\n \\\"COMPOUNDRULE sm*e\",\n \\\"COMPOUNDRULE sm+\",\n \\\"COMPOUNDMIN 3\",\n \\\"COMPOUNDWORDMAX 3\",\n \\\"COMPOUNDFORBIDFLAG t\",\n \\\"\",\n \\\"COMPOUNDSYLMAX 5\",\n \\\"SYLLABLE a\\xE1e\\xE9i\\xEDo\\xF3\\xF6\\xF5u\\xFA\\xFC\\xFBy/aa/au/ea/ee/ei/ie/oa/oe/oo/ou/uu/ui\",\n \\\"\",\n \\\"MAP 9\",\n \\\"MAP a\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\",\n \\\"MAP e\\xE8\\xE9\\xEA\\xEB\",\n \\\"MAP i\\xEC\\xED\\xEE\\xEF\",\n \\\"MAP o\\xF2\\xF3\\xF4\\xF5\\xF6\",\n \\\"MAP u\\xF9\\xFA\\xFB\\xFC\",\n \\\"MAP n\\xF1\",\n \\\"MAP c\\xE7\",\n \\\"MAP y\\xFF\\xFD\",\n \\\"MAP s\\xDF\",\n \\\"\",\n \\\"NEEDAFFIX x\",\n \\\"\",\n \\\"PFXPOSTPONE\",\n \\\"\",\n \\\"MIDWORD '-\",\n \\\"\",\n \\\"SFX q N 1\",\n \\\"SFX q 0 -ok .\",\n \\\"\",\n \\\"SFX a Y 2\",\n \\\"SFX a 0 s .\",\n \\\"SFX a 0 ize/t .\",\n \\\"\",\n \\\"PFX p N 1\",\n \\\"PFX p 0 pre .\",\n \\\"\",\n \\\"PFX P N 1\",\n \\\"PFX P 0 nou .\",\n \\ ]\nlet g:test_data_dic4 = [\n \\\"1234\",\n \\\"word/mP\",\n \\\"util/am\",\n \\\"pro/xq\",\n \\\"tomato/m\",\n \\\"bork/mp\",\n \\\"start/s\",\n \\\"end/e\",\n \\ ]\nlet g:test_data_aff5 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FLAG long\",\n \\\"\",\n \\\"NEEDAFFIX !!\",\n \\\"\",\n \\\"COMPOUNDRULE ssmm*ee\",\n \\\"\",\n \\\"NEEDCOMPOUND xx\",\n \\\"COMPOUNDPERMITFLAG pp\",\n \\\"\",\n \\\"SFX 13 Y 1\",\n \\\"SFX 13 0 bork .\",\n \\\"\",\n \\\"SFX a1 Y 1\",\n \\\"SFX a1 0 a1 .\",\n \\\"\",\n \\\"SFX a\\xE9 Y 1\",\n \\\"SFX a\\xE9 0 a\\xE9 .\",\n \\\"\",\n \\\"PFX zz Y 1\",\n \\\"PFX zz 0 pre/pp .\",\n \\\"\",\n \\\"PFX yy Y 1\",\n \\\"PFX yy 0 nou .\",\n \\ ]\nlet g:test_data_dic5 = [\n \\\"1234\",\n \\\"foo/a1a\\xE9!!\",\n \\\"bar/zz13ee\",\n \\\"start/ss\",\n \\\"end/eeyy\",\n \\\"middle/mmxx\",\n \\ ]\nlet g:test_data_aff6 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FLAG caplong\",\n \\\"\",\n \\\"NEEDAFFIX A!\",\n \\\"\",\n \\\"COMPOUNDRULE sMm*Ee\",\n \\\"\",\n \\\"NEEDCOMPOUND Xx\",\n \\\"\",\n \\\"COMPOUNDPERMITFLAG p\",\n \\\"\",\n \\\"SFX N3 Y 1\",\n \\\"SFX N3 0 bork .\",\n \\\"\",\n \\\"SFX A1 Y 1\",\n \\\"SFX A1 0 a1 .\",\n \\\"\",\n \\\"SFX A\\xE9 Y 1\",\n \\\"SFX A\\xE9 0 a\\xE9 .\",\n \\\"\",\n \\\"PFX Zz Y 1\",\n \\\"PFX Zz 0 pre/p .\",\n \\ ]\nlet g:test_data_dic6 = [\n \\\"1234\",\n \\\"mee/A1A\\xE9A!\",\n \\\"bar/ZzN3Ee\",\n \\\"lead/s\",\n \\\"end/Ee\",\n \\\"middle/MmXx\",\n \\ ]\nlet g:test_data_aff7 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"FLAG num\",\n \\\"\",\n \\\"NEEDAFFIX 9999\",\n \\\"\",\n \\\"COMPOUNDRULE 2,77*123\",\n \\\"\",\n \\\"NEEDCOMPOUND 1\",\n \\\"COMPOUNDPERMITFLAG 432\",\n \\\"\",\n \\\"SFX 61003 Y 1\",\n \\\"SFX 61003 0 meat .\",\n \\\"\",\n \\\"SFX 0 Y 1\",\n \\\"SFX 0 0 zero .\",\n \\\"\",\n \\\"SFX 391 Y 1\",\n \\\"SFX 391 0 a1 .\",\n \\\"\",\n \\\"SFX 111 Y 1\",\n \\\"SFX 111 0 a\\xE9 .\",\n \\\"\",\n \\\"PFX 17 Y 1\",\n \\\"PFX 17 0 pre/432 .\",\n \\ ]\nlet g:test_data_dic7 = [\n \\\"1234\",\n \\\"mee/0,391,111,9999\",\n \\\"bar/17,61003,123\",\n \\\"lead/2\",\n \\\"tail/123\",\n \\\"middle/77,1\",\n \\ ]\nlet g:test_data_aff8 = [\n \\\"SET ISO8859-1\",\n \\\"\",\n \\\"NOSPLITSUGS\",\n \\ ]\nlet g:test_data_dic8 = [\n \\\"1234\",\n \\\"foo\",\n \\\"bar\",\n \\\"faabar\",\n \\ ]\nlet g:test_data_aff9 = [\n \\ ]\nlet g:test_data_dic9 = [\n \\\"1234\",\n \\\"foo\",\n \\\"bar\",\n \\ ]\nlet g:test_data_aff10 = [\n \\\"COMPOUNDRULE se\",\n \\\"COMPOUNDPERMITFLAG p\",\n \\\"\",\n \\\"SFX A Y 1\",\n \\\"SFX A 0 able/Mp .\",\n \\\"\",\n \\\"SFX M Y 1\",\n \\\"SFX M 0 s .\",\n \\ ]\nlet g:test_data_dic10 = [\n \\\"1234\",\n \\\"drink/As\",\n \\\"table/e\",\n \\ ]\nlet g:test_data_aff_sal = [\n \\\"SET ISO8859-1\",\n \\\"TRY esianrtolcdugmphbyfvkwjkqxz-\\xEB\\xE9\\xE8\\xEA\\xEF\\xEE\\xE4\\xE0\\xE2\\xF6\\xFC\\xFB'ESIANRTOLCDUGMPHBYFVKWJKQXZ\",\n \\\"\",\n \\\"FOL \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"LOW \\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\\xE6\\xE7\\xE8\\xE9\\xEA\\xEB\\xEC\\xED\\xEE\\xEF\\xF0\\xF1\\xF2\\xF3\\xF4\\xF5\\xF6\\xF8\\xF9\\xFA\\xFB\\xFC\\xFD\\xFE\\xDF\\xFF\",\n \\\"UPP \\xC0\\xC1\\xC2\\xC3\\xC4\\xC5\\xC6\\xC7\\xC8\\xC9\\xCA\\xCB\\xCC\\xCD\\xCE\\xCF\\xD0\\xD1\\xD2\\xD3\\xD4\\xD5\\xD6\\xD8\\xD9\\xDA\\xDB\\xDC\\xDD\\xDE\\xDF\\xFF\",\n \\\"\",\n \\\"MIDWORD\\t'-\",\n \\\"\",\n \\\"KEP =\",\n \\\"RAR ?\",\n \\\"BAD !\",\n \\\"\",\n \\\"PFX I N 1\",\n \\\"PFX I 0 in .\",\n \\\"\",\n \\\"PFX O Y 1\",\n \\\"PFX O 0 out .\",\n \\\"\",\n \\\"SFX S Y 2\",\n \\\"SFX S 0 s [^s]\",\n \\\"SFX S 0 es s\",\n \\\"\",\n \\\"SFX N N 3\",\n \\\"SFX N 0 en [^n]\",\n \\\"SFX N 0 nen n\",\n \\\"SFX N 0 n .\",\n \\\"\",\n \\\"REP 3\",\n \\\"REP g ch\",\n \\\"REP ch g\",\n \\\"REP svp s.v.p.\",\n \\\"\",\n \\\"MAP 9\",\n \\\"MAP a\\xE0\\xE1\\xE2\\xE3\\xE4\\xE5\",\n \\\"MAP e\\xE8\\xE9\\xEA\\xEB\",\n \\\"MAP i\\xEC\\xED\\xEE\\xEF\",\n \\\"MAP o\\xF2\\xF3\\xF4\\xF5\\xF6\",\n \\\"MAP u\\xF9\\xFA\\xFB\\xFC\",\n \\\"MAP n\\xF1\",\n \\\"MAP c\\xE7\",\n \\\"MAP y\\xFF\\xFD\",\n \\\"MAP s\\xDF\",\n \\\"\",\n \\\"SAL AH(AEIOUY)-^ *H\",\n \\\"SAL AR(AEIOUY)-^ *R\",\n \\\"SAL A(HR)^ *\",\n \\\"SAL A^ *\",\n \\\"SAL AH(AEIOUY)- H\",\n \\\"SAL AR(AEIOUY)- R\",\n \\\"SAL A(HR) _\",\n \\\"SAL \\xC0^ *\",\n \\\"SAL \\xC5^ *\",\n \\\"SAL BB- _\",\n \\\"SAL B B\",\n \\\"SAL CQ- _\",\n \\\"SAL CIA X\",\n \\\"SAL CH X\",\n \\\"SAL C(EIY)- S\",\n \\\"SAL CK K\",\n \\\"SAL COUGH^ KF\",\n \\\"SAL CC< C\",\n \\\"SAL C K\",\n \\\"SAL DG(EIY) K\",\n \\\"SAL DD- _\",\n \\\"SAL D T\",\n \\\"SAL \\xC9< E\",\n \\\"SAL EH(AEIOUY)-^ *H\",\n \\\"SAL ER(AEIOUY)-^ *R\",\n \\\"SAL E(HR)^ *\",\n \\\"SAL ENOUGH^$ *NF\",\n \\\"SAL E^ *\",\n \\\"SAL EH(AEIOUY)- H\",\n \\\"SAL ER(AEIOUY)- R\",\n \\\"SAL E(HR) _\",\n \\\"SAL FF- _\",\n \\\"SAL F F\",\n \\\"SAL GN^ N\",\n \\\"SAL GN$ N\",\n \\\"SAL GNS$ NS\",\n \\\"SAL GNED$ N\",\n \\\"SAL GH(AEIOUY)- K\",\n \\\"SAL GH _\",\n \\\"SAL GG9 K\",\n \\\"SAL G K\",\n \\\"SAL H H\",\n \\\"SAL IH(AEIOUY)-^ *H\",\n \\\"SAL IR(AEIOUY)-^ *R\",\n \\\"SAL I(HR)^ *\",\n \\\"SAL I^ *\",\n \\\"SAL ING6 N\",\n \\\"SAL IH(AEIOUY)- H\",\n \\\"SAL IR(AEIOUY)- R\",\n \\\"SAL I(HR) _\",\n \\\"SAL J K\",\n \\\"SAL KN^ N\",\n \\\"SAL KK- _\",\n \\\"SAL K K\",\n \\\"SAL LAUGH^ LF\",\n \\\"SAL LL- _\",\n \\\"SAL L L\",\n \\\"SAL MB$ M\",\n \\\"SAL MM M\",\n \\\"SAL M M\",\n \\\"SAL NN- _\",\n \\\"SAL N N\",\n \\\"SAL OH(AEIOUY)-^ *H\",\n \\\"SAL OR(AEIOUY)-^ *R\",\n \\\"SAL O(HR)^ *\",\n \\\"SAL O^ *\",\n \\\"SAL OH(AEIOUY)- H\",\n \\\"SAL OR(AEIOUY)- R\",\n \\\"SAL O(HR) _\",\n \\\"SAL PH F\",\n \\\"SAL PN^ N\",\n \\\"SAL PP- _\",\n \\\"SAL P P\",\n \\\"SAL Q K\",\n \\\"SAL RH^ R\",\n \\\"SAL ROUGH^ RF\",\n \\\"SAL RR- _\",\n \\\"SAL R R\",\n \\\"SAL SCH(EOU)- SK\",\n \\\"SAL SC(IEY)- S\",\n \\\"SAL SH X\",\n \\\"SAL SI(AO)- X\",\n \\\"SAL SS- _\",\n \\\"SAL S S\",\n \\\"SAL TI(AO)- X\",\n \\\"SAL TH @\",\n \\\"SAL TCH-- _\",\n \\\"SAL TOUGH^ TF\",\n \\\"SAL TT- _\",\n \\\"SAL T T\",\n \\\"SAL UH(AEIOUY)-^ *H\",\n \\\"SAL UR(AEIOUY)-^ *R\",\n \\\"SAL U(HR)^ *\",\n \\\"SAL U^ *\",\n \\\"SAL UH(AEIOUY)- H\",\n \\\"SAL UR(AEIOUY)- R\",\n \\\"SAL U(HR) _\",\n \\\"SAL V^ W\",\n \\\"SAL V F\",\n \\\"SAL WR^ R\",\n \\\"SAL WH^ W\",\n \\\"SAL W(AEIOU)- W\",\n \\\"SAL X^ S\",\n \\\"SAL X KS\",\n \\\"SAL Y(AEIOU)- Y\",\n \\\"SAL ZZ- _\",\n \\\"SAL Z S\",\n \\ ]","func LoadAffAndDic(aff_contents, dic_contents)\n set enc=utf-8\n set spellfile=\n call writefile(a:aff_contents, \"Xtest.aff\")\n call writefile(a:dic_contents, \"Xtest.dic\")\n \" Generate a .spl file from a .dic and .aff file.\n mkspell! Xtest Xtest\n \" use that spell file\n set spl=Xtest.utf-8.spl spell\nendfunc","func ListWords()\n spelldump\n %yank\n quit\n return split(@\", \"\\n\")\nendfunc","func TestGoodBadBase()\n exe '1;/^good:'\n normal 0f:]s\n let prevbad = ''\n let result = []\n while 1\n let [bad, a] = spellbadword()\n if bad == '' || bad == prevbad || bad == 'badend'\n break\n endif\n let prevbad = bad\n let lst = bad->spellsuggest(3)\n normal mm"," call add(result, [bad, lst])\n normal `m]s\n endwhile\n return result\nendfunc","func RunGoodBad(good, bad, expected_words, expected_bad_words)\n %bwipe!\n call setline(1, ['', \"good: \", a:good, a:bad, \" badend \"])\n let words = ListWords()\n call assert_equal(a:expected_words, words[1:-1])\n let bad_words = TestGoodBadBase()\n call assert_equal(a:expected_bad_words, bad_words)\n %bwipe!\nendfunc","func Test_spell_basic()\n call LoadAffAndDic(g:test_data_aff1, g:test_data_dic1)\n call RunGoodBad(\"wrong OK puts. Test the end\",\n \\ \"bad: inputs comment ok Ok. test d\\u00E9\\u00F4l end the\",\n \\[\"Comment\", \"deol\", \"d\\u00E9\\u00F4r\", \"input\", \"OK\", \"output\", \"outputs\", \"outtest\", \"put\", \"puts\",\n \\ \"test\", \"testen\", \"testn\", \"the end\", \"uk\", \"wrong\"],\n \\[\n \\ [\"bad\", [\"put\", \"uk\", \"OK\"]],\n \\ [\"inputs\", [\"input\", \"puts\", \"outputs\"]],\n \\ [\"comment\", [\"Comment\", \"outtest\", \"the end\"]],\n \\ [\"ok\", [\"OK\", \"uk\", \"put\"]],\n \\ [\"Ok\", [\"OK\", \"Uk\", \"Put\"]],\n \\ [\"test\", [\"Test\", \"testn\", \"testen\"]],\n \\ [\"d\\u00E9\\u00F4l\", [\"deol\", \"d\\u00E9\\u00F4r\", \"test\"]],\n \\ [\"end\", [\"put\", \"uk\", \"test\"]],\n \\ [\"the\", [\"put\", \"uk\", \"test\"]],\n \\ ]\n \\ )"," call assert_equal(\"gebletegek\", soundfold('goobledygoook'))\n call assert_equal(\"kepereneven\", 'kóopërÿnôven'->soundfold())\n call assert_equal(\"everles gesvets etele\", soundfold('oeverloos gezwets edale'))\nendfunc","\" Postponed prefixes\nfunc Test_spell_prefixes()\n call LoadAffAndDic(g:test_data_aff2, g:test_data_dic1)\n call RunGoodBad(\"puts\",\n \\ \"bad: inputs comment ok Ok end the. test d\\u00E9\\u00F4l\",\n \\ [\"Comment\", \"deol\", \"d\\u00E9\\u00F4r\", \"OK\", \"put\", \"input\", \"output\", \"puts\", \"outputs\", \"test\", \"outtest\", \"testen\", \"testn\", \"the end\", \"uk\", \"wrong\"],\n \\ [\n \\ [\"bad\", [\"put\", \"uk\", \"OK\"]],\n \\ [\"inputs\", [\"input\", \"puts\", \"outputs\"]],\n \\ [\"comment\", [\"Comment\"]],\n \\ [\"ok\", [\"OK\", \"uk\", \"put\"]],\n \\ [\"Ok\", [\"OK\", \"Uk\", \"Put\"]],\n \\ [\"end\", [\"put\", \"uk\", \"deol\"]],\n \\ [\"the\", [\"put\", \"uk\", \"test\"]],\n \\ [\"test\", [\"Test\", \"testn\", \"testen\"]],\n \\ [\"d\\u00E9\\u00F4l\", [\"deol\", \"d\\u00E9\\u00F4r\", \"test\"]],\n \\ ])\nendfunc","\"Compound words\nfunc Test_spell_compound()\n call LoadAffAndDic(g:test_data_aff3, g:test_data_dic3)\n call RunGoodBad(\"foo m\\u00EF foobar foofoobar barfoo barbarfoo\",\n \\ \"bad: bar la foom\\u00EF barm\\u00EF m\\u00EFfoo m\\u00EFbar m\\u00EFm\\u00EF lala m\\u00EFla lam\\u00EF foola labar\",\n \\ [\"foo\", \"m\\u00EF\"],\n \\ [\n \\ [\"bad\", [\"foo\", \"m\\u00EF\"]],\n \\ [\"bar\", [\"barfoo\", \"foobar\", \"foo\"]],\n \\ [\"la\", [\"m\\u00EF\", \"foo\"]],\n \\ [\"foom\\u00EF\", [\"foo m\\u00EF\", \"foo\", \"foofoo\"]],\n \\ [\"barm\\u00EF\", [\"barfoo\", \"m\\u00EF\", \"barbar\"]],\n \\ [\"m\\u00EFfoo\", [\"m\\u00EF foo\", \"foo\", \"foofoo\"]],\n \\ [\"m\\u00EFbar\", [\"foobar\", \"barbar\", \"m\\u00EF\"]],\n \\ [\"m\\u00EFm\\u00EF\", [\"m\\u00EF m\\u00EF\", \"m\\u00EF\"]],\n \\ [\"lala\", []],\n \\ [\"m\\u00EFla\", [\"m\\u00EF\", \"m\\u00EF m\\u00EF\"]],\n \\ [\"lam\\u00EF\", [\"m\\u00EF\", \"m\\u00EF m\\u00EF\"]],\n \\ [\"foola\", [\"foo\", \"foobar\", \"foofoo\"]],\n \\ [\"labar\", [\"barbar\", \"foobar\"]],\n \\ ])"," call LoadAffAndDic(g:test_data_aff4, g:test_data_dic4)\n call RunGoodBad(\"word util bork prebork start end wordutil wordutils pro-ok bork borkbork borkborkbork borkborkborkbork borkborkborkborkbork tomato tomatotomato startend startword startwordword startwordend startwordwordend startwordwordwordend prebork preborkbork preborkborkbork nouword\",\n \\ \"bad: wordutilize pro borkborkborkborkborkbork tomatotomatotomato endstart endend startstart wordend wordstart preborkprebork preborkpreborkbork startwordwordwordwordend borkpreborkpreborkbork utilsbork startnouword\",\n \\ [\"bork\", \"prebork\", \"end\", \"pro-ok\", \"start\", \"tomato\", \"util\", \"utilize\", \"utils\", \"word\", \"nouword\"],\n \\ [\n \\ [\"bad\", [\"end\", \"bork\", \"word\"]],\n \\ [\"wordutilize\", [\"word utilize\", \"wordutils\", \"wordutil\"]],\n \\ [\"pro\", [\"bork\", \"word\", \"end\"]],\n \\ [\"borkborkborkborkborkbork\", [\"bork borkborkborkborkbork\", \"borkbork borkborkborkbork\", \"borkborkbork borkborkbork\"]],\n \\ [\"tomatotomatotomato\", [\"tomato tomatotomato\", \"tomatotomato tomato\", \"tomato tomato tomato\"]],\n \\ [\"endstart\", [\"end start\", \"start\"]],\n \\ [\"endend\", [\"end end\", \"end\"]],\n \\ [\"startstart\", [\"start start\"]],\n \\ [\"wordend\", [\"word end\", \"word\", \"wordword\"]],\n \\ [\"wordstart\", [\"word start\", \"bork start\"]],\n \\ [\"preborkprebork\", [\"prebork prebork\", \"preborkbork\", \"preborkborkbork\"]],\n \\ [\"preborkpreborkbork\", [\"prebork preborkbork\", \"preborkborkbork\", \"preborkborkborkbork\"]],\n \\ [\"startwordwordwordwordend\", [\"startwordwordwordword end\", \"startwordwordwordword\", \"start wordwordwordword end\"]],\n \\ [\"borkpreborkpreborkbork\", [\"bork preborkpreborkbork\", \"bork prebork preborkbork\", \"bork preborkprebork bork\"]],\n \\ [\"utilsbork\", [\"utilbork\", \"utils bork\", \"util bork\"]],\n \\ [\"startnouword\", [\"start nouword\", \"startword\", \"startborkword\"]],\n \\ ])","endfunc","\" Test affix flags with two characters\nfunc Test_spell_affix()\n call LoadAffAndDic(g:test_data_aff5, g:test_data_dic5)\n call RunGoodBad(\"fooa1 fooa\\u00E9 bar prebar barbork prebarbork startprebar start end startend startmiddleend nouend\",\n \\ \"bad: foo fooa2 prabar probarbirk middle startmiddle middleend endstart startprobar startnouend\",\n \\ [\"bar\", \"barbork\", \"end\", \"fooa1\", \"fooa\\u00E9\", \"nouend\", \"prebar\", \"prebarbork\", \"start\"],\n \\ [\n \\ [\"bad\", [\"bar\", \"end\", \"fooa1\"]],\n \\ [\"foo\", [\"fooa1\", \"fooa\\u00E9\", \"bar\"]],\n \\ [\"fooa2\", [\"fooa1\", \"fooa\\u00E9\", \"bar\"]],\n \\ [\"prabar\", [\"prebar\", \"bar\", \"bar bar\"]],\n \\ [\"probarbirk\", [\"prebarbork\"]],\n \\ [\"middle\", []],\n \\ [\"startmiddle\", [\"startmiddleend\", \"startmiddlebar\"]],\n \\ [\"middleend\", []],\n \\ [\"endstart\", [\"end start\", \"start\"]],\n \\ [\"startprobar\", [\"startprebar\", \"start prebar\", \"startbar\"]],\n \\ [\"startnouend\", [\"start nouend\", \"startend\"]],\n \\ ])"," call LoadAffAndDic(g:test_data_aff6, g:test_data_dic6)\n call RunGoodBad(\"meea1 meea\\u00E9 bar prebar barbork prebarbork leadprebar lead end leadend leadmiddleend\",\n \\ \"bad: mee meea2 prabar probarbirk middle leadmiddle middleend endlead leadprobar\",\n \\ [\"bar\", \"barbork\", \"end\", \"lead\", \"meea1\", \"meea\\u00E9\", \"prebar\", \"prebarbork\"],\n \\ [\n \\ [\"bad\", [\"bar\", \"end\", \"lead\"]],\n \\ [\"mee\", [\"meea1\", \"meea\\u00E9\", \"bar\"]],\n \\ [\"meea2\", [\"meea1\", \"meea\\u00E9\", \"lead\"]],\n \\ [\"prabar\", [\"prebar\", \"bar\", \"leadbar\"]],\n \\ [\"probarbirk\", [\"prebarbork\"]],\n \\ [\"middle\", []],\n \\ [\"leadmiddle\", [\"leadmiddleend\", \"leadmiddlebar\"]],\n \\ [\"middleend\", []],\n \\ [\"endlead\", [\"end lead\", \"lead\", \"end end\"]],\n \\ [\"leadprobar\", [\"leadprebar\", \"lead prebar\", \"leadbar\"]],\n \\ ])"," call LoadAffAndDic(g:test_data_aff7, g:test_data_dic7)\n call RunGoodBad(\"meea1 meezero meea\\u00E9 bar prebar barmeat prebarmeat leadprebar lead tail leadtail leadmiddletail\",\n \\ \"bad: mee meea2 prabar probarmaat middle leadmiddle middletail taillead leadprobar\",\n \\ [\"bar\", \"barmeat\", \"lead\", \"meea1\", \"meea\\u00E9\", \"meezero\", \"prebar\", \"prebarmeat\", \"tail\"],\n \\ [\n \\ [\"bad\", [\"bar\", \"lead\", \"tail\"]],\n \\ [\"mee\", [\"meea1\", \"meea\\u00E9\", \"bar\"]],\n \\ [\"meea2\", [\"meea1\", \"meea\\u00E9\", \"lead\"]],\n \\ [\"prabar\", [\"prebar\", \"bar\", \"leadbar\"]],\n \\ [\"probarmaat\", [\"prebarmeat\"]],\n \\ [\"middle\", []],\n \\ [\"leadmiddle\", [\"leadmiddlebar\"]],\n \\ [\"middletail\", []],\n \\ [\"taillead\", [\"tail lead\", \"tail\"]],\n \\ [\"leadprobar\", [\"leadprebar\", \"lead prebar\", \"leadbar\"]],\n \\ ])\nendfunc","func Test_spell_NOSLITSUGS()\n call LoadAffAndDic(g:test_data_aff8, g:test_data_dic8)\n call RunGoodBad(\"foo bar faabar\", \"bad: foobar barfoo\",\n \\ [\"bar\", \"faabar\", \"foo\"],\n \\ [\n \\ [\"bad\", [\"bar\", \"foo\"]],\n \\ [\"foobar\", [\"faabar\", \"foo bar\", \"bar\"]],\n \\ [\"barfoo\", [\"bar foo\", \"bar\", \"foo\"]],\n \\ ])\nendfunc","\" Numbers\nfunc Test_spell_Numbers()\n call LoadAffAndDic(g:test_data_aff9, g:test_data_dic9)\n call RunGoodBad(\"0b1011 0777 1234 0x01ff\", \"\",\n \\ [\"bar\", \"foo\"],\n \\ [\n \\ ])\nendfunc","\" Affix flags\nfunc Test_spell_affix_flags()\n call LoadAffAndDic(g:test_data_aff10, g:test_data_dic10)\n call RunGoodBad(\"drink drinkable drinkables drinktable drinkabletable\",\n\t\\ \"bad: drinks drinkstable drinkablestable\",\n \\ [\"drink\", \"drinkable\", \"drinkables\", \"table\"],\n \\ [['bad', []],\n\t\\ ['drinks', ['drink']],\n\t\\ ['drinkstable', ['drinktable', 'drinkable', 'drink table']],\n \\ ['drinkablestable', ['drinkabletable', 'drinkables table', 'drinkable table']],\n\t\\ ])\nendfunc","function FirstSpellWord()\n call feedkeys(\"/^start:\\n\", 'tx')\n normal ]smm\n let [str, a] = spellbadword()\n return str\nendfunc","function SecondSpellWord()\n normal `m]s\n let [str, a] = spellbadword()\n return str\nendfunc","\" Test with SAL instead of SOFO items; test automatic reloading\nfunc Test_spell_sal_and_addition()\n set spellfile=\n call writefile(g:test_data_dic1, \"Xtest.dic\")\n call writefile(g:test_data_aff_sal, \"Xtest.aff\")\n mkspell! Xtest Xtest\n set spl=Xtest.utf-8.spl spell\n call assert_equal('kbltykk', soundfold('goobledygoook'))\n call assert_equal('kprnfn', soundfold('kóopërÿnôven'))\n call assert_equal('*fls kswts tl', soundfold('oeverloos gezwets edale'))"," \"also use an addition file\n call writefile([\"/regions=usgbnz\", \"elequint/2\", \"elekwint/3\"], \"Xtest.utf-8.add\")\n mkspell! Xtest.utf-8.add.spl Xtest.utf-8.add"," bwipe!\n call setline(1, [\"start: elequint test elekwint test elekwent asdf\"])"," set spellfile=Xtest.utf-8.add\n call assert_equal(\"elekwent\", FirstSpellWord())"," set spl=Xtest_us.utf-8.spl\n call assert_equal(\"elequint\", FirstSpellWord())\n call assert_equal(\"elekwint\", SecondSpellWord())"," set spl=Xtest_gb.utf-8.spl\n call assert_equal(\"elekwint\", FirstSpellWord())\n call assert_equal(\"elekwent\", SecondSpellWord())"," set spl=Xtest_nz.utf-8.spl\n call assert_equal(\"elequint\", FirstSpellWord())\n call assert_equal(\"elekwent\", SecondSpellWord())"," set spl=Xtest_ca.utf-8.spl\n call assert_equal(\"elequint\", FirstSpellWord())\n call assert_equal(\"elekwint\", SecondSpellWord())\nendfunc","func Test_spellfile_value()\n set spellfile=Xdir/Xtest.utf-8.add\n set spellfile=Xdir/Xtest.utf-8.add,Xtest_other.add\nendfunc","func Test_no_crash_with_weird_text()\n new\n let lines =<< trim END\n r<sfile>\n ","\n \n END\n call setline(1, lines)\n exe \"%norm \\<C-v>ez=>\\<C-v>wzG\""," bwipe!\nendfunc\n","\" Invalid bytes may cause trouble when creating the word list.\nfunc Test_check_for_valid_word()\n call assert_fails(\"spellgood! 0\u0002\\xac\", 'E1280:')\nendfunc\n","\n\" vim: shiftwidth=2 sts=2 expandtab"],"string":"[\n \"\\\" Test for spell checking with 'encoding' set to utf-8\",\n \"source check.vim\\nCheckFeature spell\",\n \"scriptencoding utf-8\",\n \"func TearDown()\\n set nospell\\n call delete('Xtest.aff')\\n call delete('Xtest.dic')\\n call delete('Xtest.utf-8.add')\\n call delete('Xtest.utf-8.add.spl')\\n call delete('Xtest.utf-8.spl')\\n call delete('Xtest.utf-8.sug')\\nendfunc\",\n \"let g:test_data_aff1 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"TRY esianrtolcdugmphbyfvkwjkqxz-ëéèêïîäàâöüû'ESIANRTOLCDUGMPHBYFVKWJKQXZ\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FOL àáâãäåæçèéêëìíîïðñòóôõöøùúûüýþßÿ\\\",\\n \\\\\\\"LOW àáâãäåæçèéêëìíîïðñòóôõöøùúûüýþßÿ\\\",\\n \\\\\\\"UPP ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖØÙÚÛÜÝÞßÿ\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SOFOFROM abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\\xC0\\\\xC1\\\\xC2\\\\xC3\\\\xC4\\\\xC5\\\\xC6\\\\xC7\\\\xC8\\\\xC9\\\\xCA\\\\xCB\\\\xCC\\\\xCD\\\\xCE\\\\xCF\\\\xD0\\\\xD1\\\\xD2\\\\xD3\\\\xD4\\\\xD5\\\\xD6\\\\xD8\\\\xD9\\\\xDA\\\\xDB\\\\xDC\\\\xDD\\\\xDE\\\\xBF\\\",\\n \\\\\\\"SOFOTO ebctefghejklnnepkrstevvkesebctefghejklnnepkrstevvkeseeeeeeeceeeeeeeedneeeeeeeeeeepseeeeeeeeceeeeeeeedneeeeeeeeeeep?\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MIDWORD\\\\t'-\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"KEP =\\\",\\n \\\\\\\"RAR ?\\\",\\n \\\\\\\"BAD !\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX I N 1\\\",\\n \\\\\\\"PFX I 0 in .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX O Y 1\\\",\\n \\\\\\\"PFX O 0 out .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX S Y 2\\\",\\n \\\\\\\"SFX S 0 s [^s]\\\",\\n \\\\\\\"SFX S 0 es s\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX N N 3\\\",\\n \\\\\\\"SFX N 0 en [^n]\\\",\\n \\\\\\\"SFX N 0 nen n\\\",\\n \\\\\\\"SFX N 0 n .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"REP 3\\\",\\n \\\\\\\"REP g ch\\\",\\n \\\\\\\"REP ch g\\\",\\n \\\\\\\"REP svp s.v.p.\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MAP 9\\\",\\n \\\\\\\"MAP a\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\",\\n \\\\\\\"MAP e\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\",\\n \\\\\\\"MAP i\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\",\\n \\\\\\\"MAP o\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\",\\n \\\\\\\"MAP u\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\",\\n \\\\\\\"MAP n\\\\xF1\\\",\\n \\\\\\\"MAP c\\\\xE7\\\",\\n \\\\\\\"MAP y\\\\xFF\\\\xFD\\\",\\n \\\\\\\"MAP s\\\\xDF\\\"\\n \\\\ ]\\nlet g:test_data_dic1 = [\\n \\\\\\\"123456\\\",\\n \\\\\\\"test/NO\\\",\\n \\\\\\\"# comment\\\",\\n \\\\\\\"wrong\\\",\\n \\\\\\\"Comment\\\",\\n \\\\\\\"OK\\\",\\n \\\\\\\"uk\\\",\\n \\\\\\\"put/ISO\\\",\\n \\\\\\\"the end\\\",\\n \\\\\\\"deol\\\",\\n \\\\\\\"d\\\\xE9\\\\xF4r\\\",\\n \\\\ ]\\nlet g:test_data_aff2 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FOL \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"LOW \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"UPP \\\\xC0\\\\xC1\\\\xC2\\\\xC3\\\\xC4\\\\xC5\\\\xC6\\\\xC7\\\\xC8\\\\xC9\\\\xCA\\\\xCB\\\\xCC\\\\xCD\\\\xCE\\\\xCF\\\\xD0\\\\xD1\\\\xD2\\\\xD3\\\\xD4\\\\xD5\\\\xD6\\\\xD8\\\\xD9\\\\xDA\\\\xDB\\\\xDC\\\\xDD\\\\xDE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFXPOSTPONE\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MIDWORD\\\\t'-\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"KEP =\\\",\\n \\\\\\\"RAR ?\\\",\\n \\\\\\\"BAD !\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX I N 1\\\",\\n \\\\\\\"PFX I 0 in .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX O Y 1\\\",\\n \\\\\\\"PFX O 0 out [a-z]\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX S Y 2\\\",\\n \\\\\\\"SFX S 0 s [^s]\\\",\\n \\\\\\\"SFX S 0 es s\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX N N 3\\\",\\n \\\\\\\"SFX N 0 en [^n]\\\",\\n \\\\\\\"SFX N 0 nen n\\\",\\n \\\\\\\"SFX N 0 n .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"REP 3\\\",\\n \\\\\\\"REP g ch\\\",\\n \\\\\\\"REP ch g\\\",\\n \\\\\\\"REP svp s.v.p.\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MAP 9\\\",\\n \\\\\\\"MAP a\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\",\\n \\\\\\\"MAP e\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\",\\n \\\\\\\"MAP i\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\",\\n \\\\\\\"MAP o\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\",\\n \\\\\\\"MAP u\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\",\\n \\\\\\\"MAP n\\\\xF1\\\",\\n \\\\\\\"MAP c\\\\xE7\\\",\\n \\\\\\\"MAP y\\\\xFF\\\\xFD\\\",\\n \\\\\\\"MAP s\\\\xDF\\\",\\n \\\\ ]\\nlet g:test_data_aff3 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDMIN 3\\\",\\n \\\\\\\"COMPOUNDRULE m*\\\",\\n \\\\\\\"NEEDCOMPOUND x\\\",\\n \\\\ ]\\nlet g:test_data_dic3 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"foo/m\\\",\\n \\\\\\\"bar/mx\\\",\\n \\\\\\\"m\\\\xEF/m\\\",\\n \\\\\\\"la/mx\\\",\\n \\\\ ]\\nlet g:test_data_aff4 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FOL \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"LOW \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"UPP \\\\xC0\\\\xC1\\\\xC2\\\\xC3\\\\xC4\\\\xC5\\\\xC6\\\\xC7\\\\xC8\\\\xC9\\\\xCA\\\\xCB\\\\xCC\\\\xCD\\\\xCE\\\\xCF\\\\xD0\\\\xD1\\\\xD2\\\\xD3\\\\xD4\\\\xD5\\\\xD6\\\\xD8\\\\xD9\\\\xDA\\\\xDB\\\\xDC\\\\xDD\\\\xDE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDRULE m+\\\",\\n \\\\\\\"COMPOUNDRULE sm*e\\\",\\n \\\\\\\"COMPOUNDRULE sm+\\\",\\n \\\\\\\"COMPOUNDMIN 3\\\",\\n \\\\\\\"COMPOUNDWORDMAX 3\\\",\\n \\\\\\\"COMPOUNDFORBIDFLAG t\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDSYLMAX 5\\\",\\n \\\\\\\"SYLLABLE a\\\\xE1e\\\\xE9i\\\\xEDo\\\\xF3\\\\xF6\\\\xF5u\\\\xFA\\\\xFC\\\\xFBy/aa/au/ea/ee/ei/ie/oa/oe/oo/ou/uu/ui\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MAP 9\\\",\\n \\\\\\\"MAP a\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\",\\n \\\\\\\"MAP e\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\",\\n \\\\\\\"MAP i\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\",\\n \\\\\\\"MAP o\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\",\\n \\\\\\\"MAP u\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\",\\n \\\\\\\"MAP n\\\\xF1\\\",\\n \\\\\\\"MAP c\\\\xE7\\\",\\n \\\\\\\"MAP y\\\\xFF\\\\xFD\\\",\\n \\\\\\\"MAP s\\\\xDF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDAFFIX x\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFXPOSTPONE\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MIDWORD '-\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX q N 1\\\",\\n \\\\\\\"SFX q 0 -ok .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX a Y 2\\\",\\n \\\\\\\"SFX a 0 s .\\\",\\n \\\\\\\"SFX a 0 ize/t .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX p N 1\\\",\\n \\\\\\\"PFX p 0 pre .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX P N 1\\\",\\n \\\\\\\"PFX P 0 nou .\\\",\\n \\\\ ]\\nlet g:test_data_dic4 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"word/mP\\\",\\n \\\\\\\"util/am\\\",\\n \\\\\\\"pro/xq\\\",\\n \\\\\\\"tomato/m\\\",\\n \\\\\\\"bork/mp\\\",\\n \\\\\\\"start/s\\\",\\n \\\\\\\"end/e\\\",\\n \\\\ ]\\nlet g:test_data_aff5 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FLAG long\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDAFFIX !!\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDRULE ssmm*ee\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDCOMPOUND xx\\\",\\n \\\\\\\"COMPOUNDPERMITFLAG pp\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 13 Y 1\\\",\\n \\\\\\\"SFX 13 0 bork .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX a1 Y 1\\\",\\n \\\\\\\"SFX a1 0 a1 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX a\\\\xE9 Y 1\\\",\\n \\\\\\\"SFX a\\\\xE9 0 a\\\\xE9 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX zz Y 1\\\",\\n \\\\\\\"PFX zz 0 pre/pp .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX yy Y 1\\\",\\n \\\\\\\"PFX yy 0 nou .\\\",\\n \\\\ ]\\nlet g:test_data_dic5 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"foo/a1a\\\\xE9!!\\\",\\n \\\\\\\"bar/zz13ee\\\",\\n \\\\\\\"start/ss\\\",\\n \\\\\\\"end/eeyy\\\",\\n \\\\\\\"middle/mmxx\\\",\\n \\\\ ]\\nlet g:test_data_aff6 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FLAG caplong\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDAFFIX A!\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDRULE sMm*Ee\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDCOMPOUND Xx\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDPERMITFLAG p\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX N3 Y 1\\\",\\n \\\\\\\"SFX N3 0 bork .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX A1 Y 1\\\",\\n \\\\\\\"SFX A1 0 a1 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX A\\\\xE9 Y 1\\\",\\n \\\\\\\"SFX A\\\\xE9 0 a\\\\xE9 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX Zz Y 1\\\",\\n \\\\\\\"PFX Zz 0 pre/p .\\\",\\n \\\\ ]\\nlet g:test_data_dic6 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"mee/A1A\\\\xE9A!\\\",\\n \\\\\\\"bar/ZzN3Ee\\\",\\n \\\\\\\"lead/s\\\",\\n \\\\\\\"end/Ee\\\",\\n \\\\\\\"middle/MmXx\\\",\\n \\\\ ]\\nlet g:test_data_aff7 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FLAG num\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDAFFIX 9999\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"COMPOUNDRULE 2,77*123\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NEEDCOMPOUND 1\\\",\\n \\\\\\\"COMPOUNDPERMITFLAG 432\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 61003 Y 1\\\",\\n \\\\\\\"SFX 61003 0 meat .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 0 Y 1\\\",\\n \\\\\\\"SFX 0 0 zero .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 391 Y 1\\\",\\n \\\\\\\"SFX 391 0 a1 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX 111 Y 1\\\",\\n \\\\\\\"SFX 111 0 a\\\\xE9 .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX 17 Y 1\\\",\\n \\\\\\\"PFX 17 0 pre/432 .\\\",\\n \\\\ ]\\nlet g:test_data_dic7 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"mee/0,391,111,9999\\\",\\n \\\\\\\"bar/17,61003,123\\\",\\n \\\\\\\"lead/2\\\",\\n \\\\\\\"tail/123\\\",\\n \\\\\\\"middle/77,1\\\",\\n \\\\ ]\\nlet g:test_data_aff8 = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"NOSPLITSUGS\\\",\\n \\\\ ]\\nlet g:test_data_dic8 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"foo\\\",\\n \\\\\\\"bar\\\",\\n \\\\\\\"faabar\\\",\\n \\\\ ]\\nlet g:test_data_aff9 = [\\n \\\\ ]\\nlet g:test_data_dic9 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"foo\\\",\\n \\\\\\\"bar\\\",\\n \\\\ ]\\nlet g:test_data_aff10 = [\\n \\\\\\\"COMPOUNDRULE se\\\",\\n \\\\\\\"COMPOUNDPERMITFLAG p\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX A Y 1\\\",\\n \\\\\\\"SFX A 0 able/Mp .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX M Y 1\\\",\\n \\\\\\\"SFX M 0 s .\\\",\\n \\\\ ]\\nlet g:test_data_dic10 = [\\n \\\\\\\"1234\\\",\\n \\\\\\\"drink/As\\\",\\n \\\\\\\"table/e\\\",\\n \\\\ ]\\nlet g:test_data_aff_sal = [\\n \\\\\\\"SET ISO8859-1\\\",\\n \\\\\\\"TRY esianrtolcdugmphbyfvkwjkqxz-\\\\xEB\\\\xE9\\\\xE8\\\\xEA\\\\xEF\\\\xEE\\\\xE4\\\\xE0\\\\xE2\\\\xF6\\\\xFC\\\\xFB'ESIANRTOLCDUGMPHBYFVKWJKQXZ\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"FOL \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"LOW \\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\\xE6\\\\xE7\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\\xF0\\\\xF1\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\\xF8\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\\xFD\\\\xFE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"UPP \\\\xC0\\\\xC1\\\\xC2\\\\xC3\\\\xC4\\\\xC5\\\\xC6\\\\xC7\\\\xC8\\\\xC9\\\\xCA\\\\xCB\\\\xCC\\\\xCD\\\\xCE\\\\xCF\\\\xD0\\\\xD1\\\\xD2\\\\xD3\\\\xD4\\\\xD5\\\\xD6\\\\xD8\\\\xD9\\\\xDA\\\\xDB\\\\xDC\\\\xDD\\\\xDE\\\\xDF\\\\xFF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MIDWORD\\\\t'-\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"KEP =\\\",\\n \\\\\\\"RAR ?\\\",\\n \\\\\\\"BAD !\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX I N 1\\\",\\n \\\\\\\"PFX I 0 in .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"PFX O Y 1\\\",\\n \\\\\\\"PFX O 0 out .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX S Y 2\\\",\\n \\\\\\\"SFX S 0 s [^s]\\\",\\n \\\\\\\"SFX S 0 es s\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SFX N N 3\\\",\\n \\\\\\\"SFX N 0 en [^n]\\\",\\n \\\\\\\"SFX N 0 nen n\\\",\\n \\\\\\\"SFX N 0 n .\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"REP 3\\\",\\n \\\\\\\"REP g ch\\\",\\n \\\\\\\"REP ch g\\\",\\n \\\\\\\"REP svp s.v.p.\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"MAP 9\\\",\\n \\\\\\\"MAP a\\\\xE0\\\\xE1\\\\xE2\\\\xE3\\\\xE4\\\\xE5\\\",\\n \\\\\\\"MAP e\\\\xE8\\\\xE9\\\\xEA\\\\xEB\\\",\\n \\\\\\\"MAP i\\\\xEC\\\\xED\\\\xEE\\\\xEF\\\",\\n \\\\\\\"MAP o\\\\xF2\\\\xF3\\\\xF4\\\\xF5\\\\xF6\\\",\\n \\\\\\\"MAP u\\\\xF9\\\\xFA\\\\xFB\\\\xFC\\\",\\n \\\\\\\"MAP n\\\\xF1\\\",\\n \\\\\\\"MAP c\\\\xE7\\\",\\n \\\\\\\"MAP y\\\\xFF\\\\xFD\\\",\\n \\\\\\\"MAP s\\\\xDF\\\",\\n \\\\\\\"\\\",\\n \\\\\\\"SAL AH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL AR(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL A(HR)^ *\\\",\\n \\\\\\\"SAL A^ *\\\",\\n \\\\\\\"SAL AH(AEIOUY)- H\\\",\\n \\\\\\\"SAL AR(AEIOUY)- R\\\",\\n \\\\\\\"SAL A(HR) _\\\",\\n \\\\\\\"SAL \\\\xC0^ *\\\",\\n \\\\\\\"SAL \\\\xC5^ *\\\",\\n \\\\\\\"SAL BB- _\\\",\\n \\\\\\\"SAL B B\\\",\\n \\\\\\\"SAL CQ- _\\\",\\n \\\\\\\"SAL CIA X\\\",\\n \\\\\\\"SAL CH X\\\",\\n \\\\\\\"SAL C(EIY)- S\\\",\\n \\\\\\\"SAL CK K\\\",\\n \\\\\\\"SAL COUGH^ KF\\\",\\n \\\\\\\"SAL CC< C\\\",\\n \\\\\\\"SAL C K\\\",\\n \\\\\\\"SAL DG(EIY) K\\\",\\n \\\\\\\"SAL DD- _\\\",\\n \\\\\\\"SAL D T\\\",\\n \\\\\\\"SAL \\\\xC9< E\\\",\\n \\\\\\\"SAL EH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL ER(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL E(HR)^ *\\\",\\n \\\\\\\"SAL ENOUGH^$ *NF\\\",\\n \\\\\\\"SAL E^ *\\\",\\n \\\\\\\"SAL EH(AEIOUY)- H\\\",\\n \\\\\\\"SAL ER(AEIOUY)- R\\\",\\n \\\\\\\"SAL E(HR) _\\\",\\n \\\\\\\"SAL FF- _\\\",\\n \\\\\\\"SAL F F\\\",\\n \\\\\\\"SAL GN^ N\\\",\\n \\\\\\\"SAL GN$ N\\\",\\n \\\\\\\"SAL GNS$ NS\\\",\\n \\\\\\\"SAL GNED$ N\\\",\\n \\\\\\\"SAL GH(AEIOUY)- K\\\",\\n \\\\\\\"SAL GH _\\\",\\n \\\\\\\"SAL GG9 K\\\",\\n \\\\\\\"SAL G K\\\",\\n \\\\\\\"SAL H H\\\",\\n \\\\\\\"SAL IH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL IR(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL I(HR)^ *\\\",\\n \\\\\\\"SAL I^ *\\\",\\n \\\\\\\"SAL ING6 N\\\",\\n \\\\\\\"SAL IH(AEIOUY)- H\\\",\\n \\\\\\\"SAL IR(AEIOUY)- R\\\",\\n \\\\\\\"SAL I(HR) _\\\",\\n \\\\\\\"SAL J K\\\",\\n \\\\\\\"SAL KN^ N\\\",\\n \\\\\\\"SAL KK- _\\\",\\n \\\\\\\"SAL K K\\\",\\n \\\\\\\"SAL LAUGH^ LF\\\",\\n \\\\\\\"SAL LL- _\\\",\\n \\\\\\\"SAL L L\\\",\\n \\\\\\\"SAL MB$ M\\\",\\n \\\\\\\"SAL MM M\\\",\\n \\\\\\\"SAL M M\\\",\\n \\\\\\\"SAL NN- _\\\",\\n \\\\\\\"SAL N N\\\",\\n \\\\\\\"SAL OH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL OR(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL O(HR)^ *\\\",\\n \\\\\\\"SAL O^ *\\\",\\n \\\\\\\"SAL OH(AEIOUY)- H\\\",\\n \\\\\\\"SAL OR(AEIOUY)- R\\\",\\n \\\\\\\"SAL O(HR) _\\\",\\n \\\\\\\"SAL PH F\\\",\\n \\\\\\\"SAL PN^ N\\\",\\n \\\\\\\"SAL PP- _\\\",\\n \\\\\\\"SAL P P\\\",\\n \\\\\\\"SAL Q K\\\",\\n \\\\\\\"SAL RH^ R\\\",\\n \\\\\\\"SAL ROUGH^ RF\\\",\\n \\\\\\\"SAL RR- _\\\",\\n \\\\\\\"SAL R R\\\",\\n \\\\\\\"SAL SCH(EOU)- SK\\\",\\n \\\\\\\"SAL SC(IEY)- S\\\",\\n \\\\\\\"SAL SH X\\\",\\n \\\\\\\"SAL SI(AO)- X\\\",\\n \\\\\\\"SAL SS- _\\\",\\n \\\\\\\"SAL S S\\\",\\n \\\\\\\"SAL TI(AO)- X\\\",\\n \\\\\\\"SAL TH @\\\",\\n \\\\\\\"SAL TCH-- _\\\",\\n \\\\\\\"SAL TOUGH^ TF\\\",\\n \\\\\\\"SAL TT- _\\\",\\n \\\\\\\"SAL T T\\\",\\n \\\\\\\"SAL UH(AEIOUY)-^ *H\\\",\\n \\\\\\\"SAL UR(AEIOUY)-^ *R\\\",\\n \\\\\\\"SAL U(HR)^ *\\\",\\n \\\\\\\"SAL U^ *\\\",\\n \\\\\\\"SAL UH(AEIOUY)- H\\\",\\n \\\\\\\"SAL UR(AEIOUY)- R\\\",\\n \\\\\\\"SAL U(HR) _\\\",\\n \\\\\\\"SAL V^ W\\\",\\n \\\\\\\"SAL V F\\\",\\n \\\\\\\"SAL WR^ R\\\",\\n \\\\\\\"SAL WH^ W\\\",\\n \\\\\\\"SAL W(AEIOU)- W\\\",\\n \\\\\\\"SAL X^ S\\\",\\n \\\\\\\"SAL X KS\\\",\\n \\\\\\\"SAL Y(AEIOU)- Y\\\",\\n \\\\\\\"SAL ZZ- _\\\",\\n \\\\\\\"SAL Z S\\\",\\n \\\\ ]\",\n \"func LoadAffAndDic(aff_contents, dic_contents)\\n set enc=utf-8\\n set spellfile=\\n call writefile(a:aff_contents, \\\"Xtest.aff\\\")\\n call writefile(a:dic_contents, \\\"Xtest.dic\\\")\\n \\\" Generate a .spl file from a .dic and .aff file.\\n mkspell! Xtest Xtest\\n \\\" use that spell file\\n set spl=Xtest.utf-8.spl spell\\nendfunc\",\n \"func ListWords()\\n spelldump\\n %yank\\n quit\\n return split(@\\\", \\\"\\\\n\\\")\\nendfunc\",\n \"func TestGoodBadBase()\\n exe '1;/^good:'\\n normal 0f:]s\\n let prevbad = ''\\n let result = []\\n while 1\\n let [bad, a] = spellbadword()\\n if bad == '' || bad == prevbad || bad == 'badend'\\n break\\n endif\\n let prevbad = bad\\n let lst = bad->spellsuggest(3)\\n normal mm\",\n \" call add(result, [bad, lst])\\n normal `m]s\\n endwhile\\n return result\\nendfunc\",\n \"func RunGoodBad(good, bad, expected_words, expected_bad_words)\\n %bwipe!\\n call setline(1, ['', \\\"good: \\\", a:good, a:bad, \\\" badend \\\"])\\n let words = ListWords()\\n call assert_equal(a:expected_words, words[1:-1])\\n let bad_words = TestGoodBadBase()\\n call assert_equal(a:expected_bad_words, bad_words)\\n %bwipe!\\nendfunc\",\n \"func Test_spell_basic()\\n call LoadAffAndDic(g:test_data_aff1, g:test_data_dic1)\\n call RunGoodBad(\\\"wrong OK puts. Test the end\\\",\\n \\\\ \\\"bad: inputs comment ok Ok. test d\\\\u00E9\\\\u00F4l end the\\\",\\n \\\\[\\\"Comment\\\", \\\"deol\\\", \\\"d\\\\u00E9\\\\u00F4r\\\", \\\"input\\\", \\\"OK\\\", \\\"output\\\", \\\"outputs\\\", \\\"outtest\\\", \\\"put\\\", \\\"puts\\\",\\n \\\\ \\\"test\\\", \\\"testen\\\", \\\"testn\\\", \\\"the end\\\", \\\"uk\\\", \\\"wrong\\\"],\\n \\\\[\\n \\\\ [\\\"bad\\\", [\\\"put\\\", \\\"uk\\\", \\\"OK\\\"]],\\n \\\\ [\\\"inputs\\\", [\\\"input\\\", \\\"puts\\\", \\\"outputs\\\"]],\\n \\\\ [\\\"comment\\\", [\\\"Comment\\\", \\\"outtest\\\", \\\"the end\\\"]],\\n \\\\ [\\\"ok\\\", [\\\"OK\\\", \\\"uk\\\", \\\"put\\\"]],\\n \\\\ [\\\"Ok\\\", [\\\"OK\\\", \\\"Uk\\\", \\\"Put\\\"]],\\n \\\\ [\\\"test\\\", [\\\"Test\\\", \\\"testn\\\", \\\"testen\\\"]],\\n \\\\ [\\\"d\\\\u00E9\\\\u00F4l\\\", [\\\"deol\\\", \\\"d\\\\u00E9\\\\u00F4r\\\", \\\"test\\\"]],\\n \\\\ [\\\"end\\\", [\\\"put\\\", \\\"uk\\\", \\\"test\\\"]],\\n \\\\ [\\\"the\\\", [\\\"put\\\", \\\"uk\\\", \\\"test\\\"]],\\n \\\\ ]\\n \\\\ )\",\n \" call assert_equal(\\\"gebletegek\\\", soundfold('goobledygoook'))\\n call assert_equal(\\\"kepereneven\\\", 'kóopërÿnôven'->soundfold())\\n call assert_equal(\\\"everles gesvets etele\\\", soundfold('oeverloos gezwets edale'))\\nendfunc\",\n \"\\\" Postponed prefixes\\nfunc Test_spell_prefixes()\\n call LoadAffAndDic(g:test_data_aff2, g:test_data_dic1)\\n call RunGoodBad(\\\"puts\\\",\\n \\\\ \\\"bad: inputs comment ok Ok end the. test d\\\\u00E9\\\\u00F4l\\\",\\n \\\\ [\\\"Comment\\\", \\\"deol\\\", \\\"d\\\\u00E9\\\\u00F4r\\\", \\\"OK\\\", \\\"put\\\", \\\"input\\\", \\\"output\\\", \\\"puts\\\", \\\"outputs\\\", \\\"test\\\", \\\"outtest\\\", \\\"testen\\\", \\\"testn\\\", \\\"the end\\\", \\\"uk\\\", \\\"wrong\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"put\\\", \\\"uk\\\", \\\"OK\\\"]],\\n \\\\ [\\\"inputs\\\", [\\\"input\\\", \\\"puts\\\", \\\"outputs\\\"]],\\n \\\\ [\\\"comment\\\", [\\\"Comment\\\"]],\\n \\\\ [\\\"ok\\\", [\\\"OK\\\", \\\"uk\\\", \\\"put\\\"]],\\n \\\\ [\\\"Ok\\\", [\\\"OK\\\", \\\"Uk\\\", \\\"Put\\\"]],\\n \\\\ [\\\"end\\\", [\\\"put\\\", \\\"uk\\\", \\\"deol\\\"]],\\n \\\\ [\\\"the\\\", [\\\"put\\\", \\\"uk\\\", \\\"test\\\"]],\\n \\\\ [\\\"test\\\", [\\\"Test\\\", \\\"testn\\\", \\\"testen\\\"]],\\n \\\\ [\\\"d\\\\u00E9\\\\u00F4l\\\", [\\\"deol\\\", \\\"d\\\\u00E9\\\\u00F4r\\\", \\\"test\\\"]],\\n \\\\ ])\\nendfunc\",\n \"\\\"Compound words\\nfunc Test_spell_compound()\\n call LoadAffAndDic(g:test_data_aff3, g:test_data_dic3)\\n call RunGoodBad(\\\"foo m\\\\u00EF foobar foofoobar barfoo barbarfoo\\\",\\n \\\\ \\\"bad: bar la foom\\\\u00EF barm\\\\u00EF m\\\\u00EFfoo m\\\\u00EFbar m\\\\u00EFm\\\\u00EF lala m\\\\u00EFla lam\\\\u00EF foola labar\\\",\\n \\\\ [\\\"foo\\\", \\\"m\\\\u00EF\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"foo\\\", \\\"m\\\\u00EF\\\"]],\\n \\\\ [\\\"bar\\\", [\\\"barfoo\\\", \\\"foobar\\\", \\\"foo\\\"]],\\n \\\\ [\\\"la\\\", [\\\"m\\\\u00EF\\\", \\\"foo\\\"]],\\n \\\\ [\\\"foom\\\\u00EF\\\", [\\\"foo m\\\\u00EF\\\", \\\"foo\\\", \\\"foofoo\\\"]],\\n \\\\ [\\\"barm\\\\u00EF\\\", [\\\"barfoo\\\", \\\"m\\\\u00EF\\\", \\\"barbar\\\"]],\\n \\\\ [\\\"m\\\\u00EFfoo\\\", [\\\"m\\\\u00EF foo\\\", \\\"foo\\\", \\\"foofoo\\\"]],\\n \\\\ [\\\"m\\\\u00EFbar\\\", [\\\"foobar\\\", \\\"barbar\\\", \\\"m\\\\u00EF\\\"]],\\n \\\\ [\\\"m\\\\u00EFm\\\\u00EF\\\", [\\\"m\\\\u00EF m\\\\u00EF\\\", \\\"m\\\\u00EF\\\"]],\\n \\\\ [\\\"lala\\\", []],\\n \\\\ [\\\"m\\\\u00EFla\\\", [\\\"m\\\\u00EF\\\", \\\"m\\\\u00EF m\\\\u00EF\\\"]],\\n \\\\ [\\\"lam\\\\u00EF\\\", [\\\"m\\\\u00EF\\\", \\\"m\\\\u00EF m\\\\u00EF\\\"]],\\n \\\\ [\\\"foola\\\", [\\\"foo\\\", \\\"foobar\\\", \\\"foofoo\\\"]],\\n \\\\ [\\\"labar\\\", [\\\"barbar\\\", \\\"foobar\\\"]],\\n \\\\ ])\",\n \" call LoadAffAndDic(g:test_data_aff4, g:test_data_dic4)\\n call RunGoodBad(\\\"word util bork prebork start end wordutil wordutils pro-ok bork borkbork borkborkbork borkborkborkbork borkborkborkborkbork tomato tomatotomato startend startword startwordword startwordend startwordwordend startwordwordwordend prebork preborkbork preborkborkbork nouword\\\",\\n \\\\ \\\"bad: wordutilize pro borkborkborkborkborkbork tomatotomatotomato endstart endend startstart wordend wordstart preborkprebork preborkpreborkbork startwordwordwordwordend borkpreborkpreborkbork utilsbork startnouword\\\",\\n \\\\ [\\\"bork\\\", \\\"prebork\\\", \\\"end\\\", \\\"pro-ok\\\", \\\"start\\\", \\\"tomato\\\", \\\"util\\\", \\\"utilize\\\", \\\"utils\\\", \\\"word\\\", \\\"nouword\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"end\\\", \\\"bork\\\", \\\"word\\\"]],\\n \\\\ [\\\"wordutilize\\\", [\\\"word utilize\\\", \\\"wordutils\\\", \\\"wordutil\\\"]],\\n \\\\ [\\\"pro\\\", [\\\"bork\\\", \\\"word\\\", \\\"end\\\"]],\\n \\\\ [\\\"borkborkborkborkborkbork\\\", [\\\"bork borkborkborkborkbork\\\", \\\"borkbork borkborkborkbork\\\", \\\"borkborkbork borkborkbork\\\"]],\\n \\\\ [\\\"tomatotomatotomato\\\", [\\\"tomato tomatotomato\\\", \\\"tomatotomato tomato\\\", \\\"tomato tomato tomato\\\"]],\\n \\\\ [\\\"endstart\\\", [\\\"end start\\\", \\\"start\\\"]],\\n \\\\ [\\\"endend\\\", [\\\"end end\\\", \\\"end\\\"]],\\n \\\\ [\\\"startstart\\\", [\\\"start start\\\"]],\\n \\\\ [\\\"wordend\\\", [\\\"word end\\\", \\\"word\\\", \\\"wordword\\\"]],\\n \\\\ [\\\"wordstart\\\", [\\\"word start\\\", \\\"bork start\\\"]],\\n \\\\ [\\\"preborkprebork\\\", [\\\"prebork prebork\\\", \\\"preborkbork\\\", \\\"preborkborkbork\\\"]],\\n \\\\ [\\\"preborkpreborkbork\\\", [\\\"prebork preborkbork\\\", \\\"preborkborkbork\\\", \\\"preborkborkborkbork\\\"]],\\n \\\\ [\\\"startwordwordwordwordend\\\", [\\\"startwordwordwordword end\\\", \\\"startwordwordwordword\\\", \\\"start wordwordwordword end\\\"]],\\n \\\\ [\\\"borkpreborkpreborkbork\\\", [\\\"bork preborkpreborkbork\\\", \\\"bork prebork preborkbork\\\", \\\"bork preborkprebork bork\\\"]],\\n \\\\ [\\\"utilsbork\\\", [\\\"utilbork\\\", \\\"utils bork\\\", \\\"util bork\\\"]],\\n \\\\ [\\\"startnouword\\\", [\\\"start nouword\\\", \\\"startword\\\", \\\"startborkword\\\"]],\\n \\\\ ])\",\n \"endfunc\",\n \"\\\" Test affix flags with two characters\\nfunc Test_spell_affix()\\n call LoadAffAndDic(g:test_data_aff5, g:test_data_dic5)\\n call RunGoodBad(\\\"fooa1 fooa\\\\u00E9 bar prebar barbork prebarbork startprebar start end startend startmiddleend nouend\\\",\\n \\\\ \\\"bad: foo fooa2 prabar probarbirk middle startmiddle middleend endstart startprobar startnouend\\\",\\n \\\\ [\\\"bar\\\", \\\"barbork\\\", \\\"end\\\", \\\"fooa1\\\", \\\"fooa\\\\u00E9\\\", \\\"nouend\\\", \\\"prebar\\\", \\\"prebarbork\\\", \\\"start\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"bar\\\", \\\"end\\\", \\\"fooa1\\\"]],\\n \\\\ [\\\"foo\\\", [\\\"fooa1\\\", \\\"fooa\\\\u00E9\\\", \\\"bar\\\"]],\\n \\\\ [\\\"fooa2\\\", [\\\"fooa1\\\", \\\"fooa\\\\u00E9\\\", \\\"bar\\\"]],\\n \\\\ [\\\"prabar\\\", [\\\"prebar\\\", \\\"bar\\\", \\\"bar bar\\\"]],\\n \\\\ [\\\"probarbirk\\\", [\\\"prebarbork\\\"]],\\n \\\\ [\\\"middle\\\", []],\\n \\\\ [\\\"startmiddle\\\", [\\\"startmiddleend\\\", \\\"startmiddlebar\\\"]],\\n \\\\ [\\\"middleend\\\", []],\\n \\\\ [\\\"endstart\\\", [\\\"end start\\\", \\\"start\\\"]],\\n \\\\ [\\\"startprobar\\\", [\\\"startprebar\\\", \\\"start prebar\\\", \\\"startbar\\\"]],\\n \\\\ [\\\"startnouend\\\", [\\\"start nouend\\\", \\\"startend\\\"]],\\n \\\\ ])\",\n \" call LoadAffAndDic(g:test_data_aff6, g:test_data_dic6)\\n call RunGoodBad(\\\"meea1 meea\\\\u00E9 bar prebar barbork prebarbork leadprebar lead end leadend leadmiddleend\\\",\\n \\\\ \\\"bad: mee meea2 prabar probarbirk middle leadmiddle middleend endlead leadprobar\\\",\\n \\\\ [\\\"bar\\\", \\\"barbork\\\", \\\"end\\\", \\\"lead\\\", \\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"prebar\\\", \\\"prebarbork\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"bar\\\", \\\"end\\\", \\\"lead\\\"]],\\n \\\\ [\\\"mee\\\", [\\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"bar\\\"]],\\n \\\\ [\\\"meea2\\\", [\\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"lead\\\"]],\\n \\\\ [\\\"prabar\\\", [\\\"prebar\\\", \\\"bar\\\", \\\"leadbar\\\"]],\\n \\\\ [\\\"probarbirk\\\", [\\\"prebarbork\\\"]],\\n \\\\ [\\\"middle\\\", []],\\n \\\\ [\\\"leadmiddle\\\", [\\\"leadmiddleend\\\", \\\"leadmiddlebar\\\"]],\\n \\\\ [\\\"middleend\\\", []],\\n \\\\ [\\\"endlead\\\", [\\\"end lead\\\", \\\"lead\\\", \\\"end end\\\"]],\\n \\\\ [\\\"leadprobar\\\", [\\\"leadprebar\\\", \\\"lead prebar\\\", \\\"leadbar\\\"]],\\n \\\\ ])\",\n \" call LoadAffAndDic(g:test_data_aff7, g:test_data_dic7)\\n call RunGoodBad(\\\"meea1 meezero meea\\\\u00E9 bar prebar barmeat prebarmeat leadprebar lead tail leadtail leadmiddletail\\\",\\n \\\\ \\\"bad: mee meea2 prabar probarmaat middle leadmiddle middletail taillead leadprobar\\\",\\n \\\\ [\\\"bar\\\", \\\"barmeat\\\", \\\"lead\\\", \\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"meezero\\\", \\\"prebar\\\", \\\"prebarmeat\\\", \\\"tail\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"bar\\\", \\\"lead\\\", \\\"tail\\\"]],\\n \\\\ [\\\"mee\\\", [\\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"bar\\\"]],\\n \\\\ [\\\"meea2\\\", [\\\"meea1\\\", \\\"meea\\\\u00E9\\\", \\\"lead\\\"]],\\n \\\\ [\\\"prabar\\\", [\\\"prebar\\\", \\\"bar\\\", \\\"leadbar\\\"]],\\n \\\\ [\\\"probarmaat\\\", [\\\"prebarmeat\\\"]],\\n \\\\ [\\\"middle\\\", []],\\n \\\\ [\\\"leadmiddle\\\", [\\\"leadmiddlebar\\\"]],\\n \\\\ [\\\"middletail\\\", []],\\n \\\\ [\\\"taillead\\\", [\\\"tail lead\\\", \\\"tail\\\"]],\\n \\\\ [\\\"leadprobar\\\", [\\\"leadprebar\\\", \\\"lead prebar\\\", \\\"leadbar\\\"]],\\n \\\\ ])\\nendfunc\",\n \"func Test_spell_NOSLITSUGS()\\n call LoadAffAndDic(g:test_data_aff8, g:test_data_dic8)\\n call RunGoodBad(\\\"foo bar faabar\\\", \\\"bad: foobar barfoo\\\",\\n \\\\ [\\\"bar\\\", \\\"faabar\\\", \\\"foo\\\"],\\n \\\\ [\\n \\\\ [\\\"bad\\\", [\\\"bar\\\", \\\"foo\\\"]],\\n \\\\ [\\\"foobar\\\", [\\\"faabar\\\", \\\"foo bar\\\", \\\"bar\\\"]],\\n \\\\ [\\\"barfoo\\\", [\\\"bar foo\\\", \\\"bar\\\", \\\"foo\\\"]],\\n \\\\ ])\\nendfunc\",\n \"\\\" Numbers\\nfunc Test_spell_Numbers()\\n call LoadAffAndDic(g:test_data_aff9, g:test_data_dic9)\\n call RunGoodBad(\\\"0b1011 0777 1234 0x01ff\\\", \\\"\\\",\\n \\\\ [\\\"bar\\\", \\\"foo\\\"],\\n \\\\ [\\n \\\\ ])\\nendfunc\",\n \"\\\" Affix flags\\nfunc Test_spell_affix_flags()\\n call LoadAffAndDic(g:test_data_aff10, g:test_data_dic10)\\n call RunGoodBad(\\\"drink drinkable drinkables drinktable drinkabletable\\\",\\n\\t\\\\ \\\"bad: drinks drinkstable drinkablestable\\\",\\n \\\\ [\\\"drink\\\", \\\"drinkable\\\", \\\"drinkables\\\", \\\"table\\\"],\\n \\\\ [['bad', []],\\n\\t\\\\ ['drinks', ['drink']],\\n\\t\\\\ ['drinkstable', ['drinktable', 'drinkable', 'drink table']],\\n \\\\ ['drinkablestable', ['drinkabletable', 'drinkables table', 'drinkable table']],\\n\\t\\\\ ])\\nendfunc\",\n \"function FirstSpellWord()\\n call feedkeys(\\\"/^start:\\\\n\\\", 'tx')\\n normal ]smm\\n let [str, a] = spellbadword()\\n return str\\nendfunc\",\n \"function SecondSpellWord()\\n normal `m]s\\n let [str, a] = spellbadword()\\n return str\\nendfunc\",\n \"\\\" Test with SAL instead of SOFO items; test automatic reloading\\nfunc Test_spell_sal_and_addition()\\n set spellfile=\\n call writefile(g:test_data_dic1, \\\"Xtest.dic\\\")\\n call writefile(g:test_data_aff_sal, \\\"Xtest.aff\\\")\\n mkspell! Xtest Xtest\\n set spl=Xtest.utf-8.spl spell\\n call assert_equal('kbltykk', soundfold('goobledygoook'))\\n call assert_equal('kprnfn', soundfold('kóopërÿnôven'))\\n call assert_equal('*fls kswts tl', soundfold('oeverloos gezwets edale'))\",\n \" \\\"also use an addition file\\n call writefile([\\\"/regions=usgbnz\\\", \\\"elequint/2\\\", \\\"elekwint/3\\\"], \\\"Xtest.utf-8.add\\\")\\n mkspell! Xtest.utf-8.add.spl Xtest.utf-8.add\",\n \" bwipe!\\n call setline(1, [\\\"start: elequint test elekwint test elekwent asdf\\\"])\",\n \" set spellfile=Xtest.utf-8.add\\n call assert_equal(\\\"elekwent\\\", FirstSpellWord())\",\n \" set spl=Xtest_us.utf-8.spl\\n call assert_equal(\\\"elequint\\\", FirstSpellWord())\\n call assert_equal(\\\"elekwint\\\", SecondSpellWord())\",\n \" set spl=Xtest_gb.utf-8.spl\\n call assert_equal(\\\"elekwint\\\", FirstSpellWord())\\n call assert_equal(\\\"elekwent\\\", SecondSpellWord())\",\n \" set spl=Xtest_nz.utf-8.spl\\n call assert_equal(\\\"elequint\\\", FirstSpellWord())\\n call assert_equal(\\\"elekwent\\\", SecondSpellWord())\",\n \" set spl=Xtest_ca.utf-8.spl\\n call assert_equal(\\\"elequint\\\", FirstSpellWord())\\n call assert_equal(\\\"elekwint\\\", SecondSpellWord())\\nendfunc\",\n \"func Test_spellfile_value()\\n set spellfile=Xdir/Xtest.utf-8.add\\n set spellfile=Xdir/Xtest.utf-8.add,Xtest_other.add\\nendfunc\",\n \"func Test_no_crash_with_weird_text()\\n new\\n let lines =<< trim END\\n r<sfile>\\n \",\n \"\\n \\n END\\n call setline(1, lines)\\n exe \\\"%norm \\\\<C-v>ez=>\\\\<C-v>wzG\\\"\",\n \" bwipe!\\nendfunc\\n\",\n \"\\\" Invalid bytes may cause trouble when creating the word list.\\nfunc Test_check_for_valid_word()\\n call assert_fails(\\\"spellgood! 0\\u0002\\\\xac\\\", 'E1280:')\\nendfunc\\n\",\n \"\\n\\\" vim: shiftwidth=2 sts=2 expandtab\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [3275, 4230, 6192, 782, 748], \"buggy_code_start_loc\": [3275, 4229, 4392, 782, 748], \"filenames\": [\"src/errors.h\", \"src/mbyte.c\", \"src/spellfile.c\", \"src/testdir/test_spell_utf8.vim\", \"src/version.c\"], \"fixing_code_end_loc\": [3280, 4230, 6203, 788, 751], \"fixing_code_start_loc\": [3276, 4229, 4393, 783, 749], \"message\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:vim:vim:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"CF072C31-D320-47CE-B39B-F45447D70BD9\", \"versionEndExcluding\": \"8.2.4919\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:debian:debian_linux:9.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"DEECE5FC-CACF-4496-A3E7-164736409252\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:debian:debian_linux:10.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"07B237A9-69A3-4A9C-9DA0-4E06BD37AE73\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:34:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"A930E247-0B43-43CB-98FF-6CE7B8189835\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:35:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"80E516C0-98A4-4ADE-B69F-66A772E2BAAA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:apple:macos:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"71E032AD-F827-4944-9699-BB1E6D4233FC\", \"versionEndExcluding\": \"13.0\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\"}, {\"lang\": \"es\", \"value\": \"Un Desbordamiento del b\\u00fafer de pila en vim_strncpy find_word en el repositorio de GitHub vim/vim versiones anteriores a 8.2.4919. Esta vulnerabilidad es capaz de bloquear el software, Omitir el Mecanismo de Protecci\\u00f3n, Modificar la Memoria y una posible ejecuci\\u00f3n remota\"}], \"evaluatorComment\": null, \"id\": \"CVE-2022-1621\", \"lastModified\": \"2023-05-03T12:15:21.913\", \"metrics\": {\"cvssMetricV2\": [{\"acInsufInfo\": false, \"baseSeverity\": \"MEDIUM\", \"cvssData\": {\"accessComplexity\": \"MEDIUM\", \"accessVector\": \"NETWORK\", \"authentication\": \"NONE\", \"availabilityImpact\": \"PARTIAL\", \"baseScore\": 6.8, \"confidentialityImpact\": \"PARTIAL\", \"integrityImpact\": \"PARTIAL\", \"vectorString\": \"AV:N/AC:M/Au:N/C:P/I:P/A:P\", \"version\": \"2.0\"}, \"exploitabilityScore\": 8.6, \"impactScore\": 6.4, \"obtainAllPrivilege\": false, \"obtainOtherPrivilege\": false, \"obtainUserPrivilege\": false, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\", \"userInteractionRequired\": true}], \"cvssMetricV30\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.3, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"LOW\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.0/AV:L/AC:L/PR:N/UI:R/S:U/C:L/I:H/A:H\", \"version\": \"3.0\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.5, \"source\": \"security@huntr.dev\", \"type\": \"Secondary\"}], \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.8, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.1/AV:L/AC:L/PR:N/UI:R/S:U/C:H/I:H/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.9, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2022-05-10T14:15:08.460\", \"references\": [{\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/28\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/41\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Exploit\", \"Third Party Advisory\"], \"url\": \"https://huntr.dev/bounties/520ce714-bfd2-4646-9458-f52cd22bb2fb\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/05/msg00022.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/11/msg00032.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/HIP7KG7TVS5YF3QREAY2GOGUT3YUBZAI/\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://security.gentoo.org/glsa/202208-32\"}, {\"source\": \"security@huntr.dev\", \"tags\": null, \"url\": \"https://security.gentoo.org/glsa/202305-16\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://support.apple.com/kb/HT213488\"}], \"sourceIdentifier\": \"security@huntr.dev\", \"vendorComments\": null, \"vulnStatus\": \"Modified\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-122\"}], \"source\": \"security@huntr.dev\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-787\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, \"type\": \"CWE-122\"}"},"index":{"kind":"number","value":464,"string":"464"}}},{"rowIdx":2896,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\t\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the Vim source code.\n */","#include \"vim.h\"","/*\n * Vim originated from Stevie version 3.6 (Fish disk 217) by GRWalter (Fred)\n * It has been changed beyond recognition since then.\n *\n * Differences between version 7.4 and 8.x can be found with \":help version8\".\n * Differences between version 6.4 and 7.x can be found with \":help version7\".\n * Differences between version 5.8 and 6.x can be found with \":help version6\".\n * Differences between version 4.x and 5.x can be found with \":help version5\".\n * Differences between version 3.0 and 4.x can be found with \":help version4\".\n * All the remarks about older versions have been removed, they are not very\n * interesting.\n */","#include \"version.h\"","char\t\t*Version = VIM_VERSION_SHORT;\nstatic char\t*mediumVersion = VIM_VERSION_MEDIUM;","#if defined(HAVE_DATE_TIME) || defined(PROTO)\n# if (defined(VMS) && defined(VAXC)) || defined(PROTO)\nchar\tlongVersion[sizeof(VIM_VERSION_LONG_DATE) + sizeof(__DATE__)\n\t\t\t\t\t\t + sizeof(__TIME__) + 3];"," void\ninit_longVersion(void)\n{\n /*\n * Construct the long version string. Necessary because\n * VAX C can't concatenate strings in the preprocessor.\n */\n strcpy(longVersion, VIM_VERSION_LONG_DATE);\n#ifdef BUILD_DATE\n strcat(longVersion, BUILD_DATE);\n#else\n strcat(longVersion, __DATE__);\n strcat(longVersion, \" \");\n strcat(longVersion, __TIME__);\n#endif\n strcat(longVersion, \")\");\n}","# else\nchar\t*longVersion = NULL;"," void\ninit_longVersion(void)\n{\n if (longVersion == NULL)\n {\n#ifdef BUILD_DATE\n\tchar *date_time = BUILD_DATE;\n#else\n\tchar *date_time = __DATE__ \" \" __TIME__;\n#endif\n\tchar *msg = _(\"%s (%s, compiled %s)\");\n\tsize_t len = strlen(msg)\n\t\t + strlen(VIM_VERSION_LONG_ONLY)\n\t\t + strlen(VIM_VERSION_DATE_ONLY)\n\t\t + strlen(date_time);","\tlongVersion = alloc(len);\n\tif (longVersion == NULL)\n\t longVersion = VIM_VERSION_LONG;\n\telse\n\t vim_snprintf(longVersion, len, msg,\n\t\t VIM_VERSION_LONG_ONLY, VIM_VERSION_DATE_ONLY, date_time);\n }\n}\n# endif\n#else\nchar\t*longVersion = VIM_VERSION_LONG;"," void\ninit_longVersion(void)\n{\n // nothing to do\n}\n#endif","static char *(features[]) =\n{\n#ifdef HAVE_ACL\n\t\"+acl\",\n#else\n\t\"-acl\",\n#endif\n#ifdef AMIGA\t\t// only for Amiga systems\n# ifdef FEAT_ARP\n\t\"+ARP\",\n# else\n\t\"-ARP\",\n# endif\n#endif\n#ifdef FEAT_ARABIC\n\t\"+arabic\",\n#else\n\t\"-arabic\",\n#endif\n\t\"+autocmd\",\n#ifdef FEAT_AUTOCHDIR\n \"+autochdir\",\n#else\n \"-autochdir\",\n#endif\n#ifdef FEAT_AUTOSERVERNAME\n\t\"+autoservername\",\n#else\n\t\"-autoservername\",\n#endif\n#ifdef FEAT_BEVAL_GUI\n\t\"+balloon_eval\",\n#else\n\t\"-balloon_eval\",\n#endif\n#ifdef FEAT_BEVAL_TERM\n\t\"+balloon_eval_term\",\n#else\n\t\"-balloon_eval_term\",\n#endif\n#ifdef FEAT_BROWSE\n\t\"+browse\",\n#else\n\t\"-browse\",\n#endif\n#ifdef NO_BUILTIN_TCAPS\n\t\"-builtin_terms\",\n#endif\n#ifdef SOME_BUILTIN_TCAPS\n\t\"+builtin_terms\",\n#endif\n#ifdef ALL_BUILTIN_TCAPS\n\t\"++builtin_terms\",\n#endif\n#ifdef FEAT_BYTEOFF\n\t\"+byte_offset\",\n#else\n\t\"-byte_offset\",\n#endif\n#ifdef FEAT_JOB_CHANNEL\n\t\"+channel\",\n#else\n\t\"-channel\",\n#endif\n#ifdef FEAT_CINDENT\n\t\"+cindent\",\n#else\n\t\"-cindent\",\n#endif\n#ifdef FEAT_CLIENTSERVER\n\t\"+clientserver\",\n#else\n\t\"-clientserver\",\n#endif\n#ifdef FEAT_CLIPBOARD\n\t\"+clipboard\",\n#else\n\t\"-clipboard\",\n#endif\n\t\"+cmdline_compl\",\n\t\"+cmdline_hist\",\n#ifdef FEAT_CMDL_INFO\n\t\"+cmdline_info\",\n#else\n\t\"-cmdline_info\",\n#endif\n\t\"+comments\",\n#ifdef FEAT_CONCEAL\n\t\"+conceal\",\n#else\n\t\"-conceal\",\n#endif\n#ifdef FEAT_CRYPT\n\t\"+cryptv\",\n#else\n\t\"-cryptv\",\n#endif\n#ifdef FEAT_CSCOPE\n\t\"+cscope\",\n#else\n\t\"-cscope\",\n#endif\n\t\"+cursorbind\",\n#ifdef CURSOR_SHAPE\n\t\"+cursorshape\",\n#else\n\t\"-cursorshape\",\n#endif\n#if defined(FEAT_CON_DIALOG) && defined(FEAT_GUI_DIALOG)\n\t\"+dialog_con_gui\",\n#else\n# if defined(FEAT_CON_DIALOG)\n\t\"+dialog_con\",\n# else\n# if defined(FEAT_GUI_DIALOG)\n\t\"+dialog_gui\",\n# else\n\t\"-dialog\",\n# endif\n# endif\n#endif\n#ifdef FEAT_DIFF\n\t\"+diff\",\n#else\n\t\"-diff\",\n#endif\n#ifdef FEAT_DIGRAPHS\n\t\"+digraphs\",\n#else\n\t\"-digraphs\",\n#endif\n#ifdef FEAT_GUI_MSWIN\n# ifdef FEAT_DIRECTX\n\t\"+directx\",\n# else\n\t\"-directx\",\n# endif\n#endif\n#ifdef FEAT_DND\n\t\"+dnd\",\n#else\n\t\"-dnd\",\n#endif\n\t\"-ebcdic\",\n#ifdef FEAT_EMACS_TAGS\n\t\"+emacs_tags\",\n#else\n\t\"-emacs_tags\",\n#endif\n#ifdef FEAT_EVAL\n\t\"+eval\",\n#else\n\t\"-eval\",\n#endif\n\t\"+ex_extra\",\n#ifdef FEAT_SEARCH_EXTRA\n\t\"+extra_search\",\n#else\n\t\"-extra_search\",\n#endif\n\t\"-farsi\",\n#ifdef FEAT_SEARCHPATH\n\t\"+file_in_path\",\n#else\n\t\"-file_in_path\",\n#endif\n#ifdef FEAT_FIND_ID\n\t\"+find_in_path\",\n#else\n\t\"-find_in_path\",\n#endif\n#ifdef FEAT_FLOAT\n\t\"+float\",\n#else\n\t\"-float\",\n#endif\n#ifdef FEAT_FOLDING\n\t\"+folding\",\n#else\n\t\"-folding\",\n#endif\n#ifdef FEAT_FOOTER\n\t\"+footer\",\n#else\n\t\"-footer\",\n#endif\n\t // only interesting on Unix systems\n#if !defined(USE_SYSTEM) && defined(UNIX)\n\t\"+fork()\",\n#endif\n#ifdef FEAT_GETTEXT\n# ifdef DYNAMIC_GETTEXT\n\t\"+gettext/dyn\",\n# else\n\t\"+gettext\",\n# endif\n#else\n\t\"-gettext\",\n#endif\n\t\"-hangul_input\",\n#if (defined(HAVE_ICONV_H) && defined(USE_ICONV)) || defined(DYNAMIC_ICONV)\n# ifdef DYNAMIC_ICONV\n\t\"+iconv/dyn\",\n# else\n\t\"+iconv\",\n# endif\n#else\n\t\"-iconv\",\n#endif\n\t\"+insert_expand\",\n#ifdef FEAT_IPV6\n\t\"+ipv6\",\n#else\n\t\"-ipv6\",\n#endif\n#ifdef FEAT_JOB_CHANNEL\n\t\"+job\",\n#else\n\t\"-job\",\n#endif\n\t\"+jumplist\",\n#ifdef FEAT_KEYMAP\n\t\"+keymap\",\n#else\n\t\"-keymap\",\n#endif\n#ifdef FEAT_EVAL\n\t\"+lambda\",\n#else\n\t\"-lambda\",\n#endif\n#ifdef FEAT_LANGMAP\n\t\"+langmap\",\n#else\n\t\"-langmap\",\n#endif\n#ifdef FEAT_LIBCALL\n\t\"+libcall\",\n#else\n\t\"-libcall\",\n#endif\n#ifdef FEAT_LINEBREAK\n\t\"+linebreak\",\n#else\n\t\"-linebreak\",\n#endif\n#ifdef FEAT_LISP\n\t\"+lispindent\",\n#else\n\t\"-lispindent\",\n#endif\n\t\"+listcmds\",\n\t\"+localmap\",\n#ifdef FEAT_LUA\n# ifdef DYNAMIC_LUA\n\t\"+lua/dyn\",\n# else\n\t\"+lua\",\n# endif\n#else\n\t\"-lua\",\n#endif\n#ifdef FEAT_MENU\n\t\"+menu\",\n#else\n\t\"-menu\",\n#endif\n#ifdef FEAT_SESSION\n\t\"+mksession\",\n#else\n\t\"-mksession\",\n#endif\n\t\"+modify_fname\",\n\t\"+mouse\",\n#ifdef FEAT_MOUSESHAPE\n\t\"+mouseshape\",\n#else\n\t\"-mouseshape\",\n#endif","#if defined(UNIX) || defined(VMS)\n# ifdef FEAT_MOUSE_DEC\n\t\"+mouse_dec\",\n# else\n\t\"-mouse_dec\",\n# endif\n# ifdef FEAT_MOUSE_GPM\n# ifdef DYNAMIC_GPM\n\t\"+mouse_gpm/dyn\",\n# else\n\t\"+mouse_gpm\",\n# endif\n# else\n\t\"-mouse_gpm\",\n# endif\n# ifdef FEAT_MOUSE_JSB\n\t\"+mouse_jsbterm\",\n# else\n\t\"-mouse_jsbterm\",\n# endif\n# ifdef FEAT_MOUSE_NET\n\t\"+mouse_netterm\",\n# else\n\t\"-mouse_netterm\",\n# endif\n#endif","#ifdef __QNX__\n# ifdef FEAT_MOUSE_PTERM\n\t\"+mouse_pterm\",\n# else\n\t\"-mouse_pterm\",\n# endif\n#endif","#if defined(UNIX) || defined(VMS)\n\t\"+mouse_sgr\",\n# ifdef FEAT_SYSMOUSE\n\t\"+mouse_sysmouse\",\n# else\n\t\"-mouse_sysmouse\",\n# endif\n# ifdef FEAT_MOUSE_URXVT\n\t\"+mouse_urxvt\",\n# else\n\t\"-mouse_urxvt\",\n# endif\n\t\"+mouse_xterm\",\n#endif","#ifdef FEAT_MBYTE_IME\n# ifdef DYNAMIC_IME\n\t\"+multi_byte_ime/dyn\",\n# else\n\t\"+multi_byte_ime\",\n# endif\n#else\n\t\"+multi_byte\",\n#endif\n#ifdef FEAT_MULTI_LANG\n\t\"+multi_lang\",\n#else\n\t\"-multi_lang\",\n#endif\n#ifdef FEAT_MZSCHEME\n# ifdef DYNAMIC_MZSCHEME\n\t\"+mzscheme/dyn\",\n# else\n\t\"+mzscheme\",\n# endif\n#else\n\t\"-mzscheme\",\n#endif\n#ifdef FEAT_NETBEANS_INTG\n\t\"+netbeans_intg\",\n#else\n\t\"-netbeans_intg\",\n#endif\n\t\"+num64\",\n#ifdef FEAT_GUI_MSWIN\n# ifdef FEAT_OLE\n\t\"+ole\",\n# else\n\t\"-ole\",\n# endif\n#endif\n#ifdef FEAT_EVAL\n\t\"+packages\",\n#else\n\t\"-packages\",\n#endif\n#ifdef FEAT_PATH_EXTRA\n\t\"+path_extra\",\n#else\n\t\"-path_extra\",\n#endif\n#ifdef FEAT_PERL\n# ifdef DYNAMIC_PERL\n\t\"+perl/dyn\",\n# else\n\t\"+perl\",\n# endif\n#else\n\t\"-perl\",\n#endif\n#ifdef FEAT_PERSISTENT_UNDO\n\t\"+persistent_undo\",\n#else\n\t\"-persistent_undo\",\n#endif\n#ifdef FEAT_PROP_POPUP\n\t\"+popupwin\",\n#else\n\t\"-popupwin\",\n#endif\n#ifdef FEAT_PRINTER\n# ifdef FEAT_POSTSCRIPT\n\t\"+postscript\",\n# else\n\t\"-postscript\",\n# endif\n\t\"+printer\",\n#else\n\t\"-printer\",\n#endif\n#ifdef FEAT_PROFILE\n\t\"+profile\",\n#else\n\t\"-profile\",\n#endif\n#ifdef FEAT_PYTHON\n# ifdef DYNAMIC_PYTHON\n\t\"+python/dyn\",\n# else\n\t\"+python\",\n# endif\n#else\n\t\"-python\",\n#endif\n#ifdef FEAT_PYTHON3\n# ifdef DYNAMIC_PYTHON3\n\t\"+python3/dyn\",\n# else\n\t\"+python3\",\n# endif\n#else\n\t\"-python3\",\n#endif\n#ifdef FEAT_QUICKFIX\n\t\"+quickfix\",\n#else\n\t\"-quickfix\",\n#endif\n#ifdef FEAT_RELTIME\n\t\"+reltime\",\n#else\n\t\"-reltime\",\n#endif\n#ifdef FEAT_RIGHTLEFT\n\t\"+rightleft\",\n#else\n\t\"-rightleft\",\n#endif\n#ifdef FEAT_RUBY\n# ifdef DYNAMIC_RUBY\n\t\"+ruby/dyn\",\n# else\n\t\"+ruby\",\n# endif\n#else\n\t\"-ruby\",\n#endif\n\t\"+scrollbind\",\n#ifdef FEAT_SIGNS\n\t\"+signs\",\n#else\n\t\"-signs\",\n#endif\n#ifdef FEAT_SMARTINDENT\n\t\"+smartindent\",\n#else\n\t\"-smartindent\",\n#endif\n#ifdef FEAT_SODIUM\n# ifdef DYNAMIC_SODIUM\n\t\"+sodium/dyn\",\n# else\n\t\"+sodium\",\n# endif\n#else\n\t\"-sodium\",\n#endif\n#ifdef FEAT_SOUND\n\t\"+sound\",\n#else\n\t\"-sound\",\n#endif\n#ifdef FEAT_SPELL\n\t\"+spell\",\n#else\n\t\"-spell\",\n#endif\n#ifdef STARTUPTIME\n\t\"+startuptime\",\n#else\n\t\"-startuptime\",\n#endif\n#ifdef FEAT_STL_OPT\n\t\"+statusline\",\n#else\n\t\"-statusline\",\n#endif\n\t\"-sun_workshop\",\n#ifdef FEAT_SYN_HL\n\t\"+syntax\",\n#else\n\t\"-syntax\",\n#endif\n\t // only interesting on Unix systems\n#if defined(USE_SYSTEM) && defined(UNIX)\n\t\"+system()\",\n#endif\n\t\"+tag_binary\",\n\t\"-tag_old_static\",\n\t\"-tag_any_white\",\n#ifdef FEAT_TCL\n# ifdef DYNAMIC_TCL\n\t\"+tcl/dyn\",\n# else\n\t\"+tcl\",\n# endif\n#else\n\t\"-tcl\",\n#endif\n#ifdef FEAT_TERMGUICOLORS\n\t\"+termguicolors\",\n#else\n\t\"-termguicolors\",\n#endif\n#ifdef FEAT_TERMINAL\n\t\"+terminal\",\n#else\n\t\"-terminal\",\n#endif\n#if defined(UNIX)\n// only Unix can have terminfo instead of termcap\n# ifdef TERMINFO\n\t\"+terminfo\",\n# else\n\t\"-terminfo\",\n# endif\n#endif\n#ifdef FEAT_TERMRESPONSE\n\t\"+termresponse\",\n#else\n\t\"-termresponse\",\n#endif\n#ifdef FEAT_TEXTOBJ\n\t\"+textobjects\",\n#else\n\t\"-textobjects\",\n#endif\n#ifdef FEAT_PROP_POPUP\n\t\"+textprop\",\n#else\n\t\"-textprop\",\n#endif\n#if !defined(UNIX)\n// unix always includes termcap support\n# ifdef HAVE_TGETENT\n\t\"+tgetent\",\n# else\n\t\"-tgetent\",\n# endif\n#endif\n#ifdef FEAT_TIMERS\n\t\"+timers\",\n#else\n\t\"-timers\",\n#endif\n\t\"+title\",\n#ifdef FEAT_TOOLBAR\n\t\"+toolbar\",\n#else\n\t\"-toolbar\",\n#endif\n\t\"+user_commands\",\n#ifdef FEAT_VARTABS\n\t\"+vartabs\",\n#else\n\t\"-vartabs\",\n#endif\n\t\"+vertsplit\",\n\t\"+vim9script\",\n#ifdef FEAT_VIMINFO\n\t\"+viminfo\",\n#else\n\t\"-viminfo\",\n#endif\n\t\"+virtualedit\",\n\t\"+visual\",\n\t\"+visualextra\",\n\t\"+vreplace\",\n#ifdef MSWIN\n# ifdef FEAT_VTP\n\t\"+vtp\",\n# else\n\t\"-vtp\",\n# endif\n#endif\n#ifdef FEAT_WILDIGN\n\t\"+wildignore\",\n#else\n\t\"-wildignore\",\n#endif\n#ifdef FEAT_WILDMENU\n\t\"+wildmenu\",\n#else\n\t\"-wildmenu\",\n#endif\n\t\"+windows\",\n#ifdef FEAT_WRITEBACKUP\n\t\"+writebackup\",\n#else\n\t\"-writebackup\",\n#endif\n#if defined(UNIX) || defined(VMS)\n# ifdef FEAT_X11\n\t\"+X11\",\n# else\n\t\"-X11\",\n# endif\n#endif\n#ifdef FEAT_XFONTSET\n\t\"+xfontset\",\n#else\n\t\"-xfontset\",\n#endif\n#ifdef FEAT_XIM\n\t\"+xim\",\n#else\n\t\"-xim\",\n#endif\n#if defined(MSWIN)\n# ifdef FEAT_XPM_W32\n\t\"+xpm_w32\",\n# else\n\t\"-xpm_w32\",\n# endif\n#elif defined(HAVE_XPM)\n\t\"+xpm\",\n#else\n\t\"-xpm\",\n#endif\n#if defined(UNIX) || defined(VMS)\n# if defined(USE_XSMP_INTERACT)\n\t\"+xsmp_interact\",\n# elif defined(USE_XSMP)\n\t\"+xsmp\",\n# else\n\t\"-xsmp\",\n# endif\n# ifdef FEAT_XCLIPBOARD\n\t\"+xterm_clipboard\",\n# else\n\t\"-xterm_clipboard\",\n# endif\n#endif\n#ifdef FEAT_XTERM_SAVE\n\t\"+xterm_save\",\n#else\n\t\"-xterm_save\",\n#endif\n\tNULL\n};","static int included_patches[] =\n{ /* Add new patch number below this line */","","/**/\n 4918,\n/**/\n 4917,\n/**/\n 4916,\n/**/\n 4915,\n/**/\n 4914,\n/**/\n 4913,\n/**/\n 4912,\n/**/\n 4911,\n/**/\n 4910,\n/**/\n 4909,\n/**/\n 4908,\n/**/\n 4907,\n/**/\n 4906,\n/**/\n 4905,\n/**/\n 4904,\n/**/\n 4903,\n/**/\n 4902,\n/**/\n 4901,\n/**/\n 4900,\n/**/\n 4899,\n/**/\n 4898,\n/**/\n 4897,\n/**/\n 4896,\n/**/\n 4895,\n/**/\n 4894,\n/**/\n 4893,\n/**/\n 4892,\n/**/\n 4891,\n/**/\n 4890,\n/**/\n 4889,\n/**/\n 4888,\n/**/\n 4887,\n/**/\n 4886,\n/**/\n 4885,\n/**/\n 4884,\n/**/\n 4883,\n/**/\n 4882,\n/**/\n 4881,\n/**/\n 4880,\n/**/\n 4879,\n/**/\n 4878,\n/**/\n 4877,\n/**/\n 4876,\n/**/\n 4875,\n/**/\n 4874,\n/**/\n 4873,\n/**/\n 4872,\n/**/\n 4871,\n/**/\n 4870,\n/**/\n 4869,\n/**/\n 4868,\n/**/\n 4867,\n/**/\n 4866,\n/**/\n 4865,\n/**/\n 4864,\n/**/\n 4863,\n/**/\n 4862,\n/**/\n 4861,\n/**/\n 4860,\n/**/\n 4859,\n/**/\n 4858,\n/**/\n 4857,\n/**/\n 4856,\n/**/\n 4855,\n/**/\n 4854,\n/**/\n 4853,\n/**/\n 4852,\n/**/\n 4851,\n/**/\n 4850,\n/**/\n 4849,\n/**/\n 4848,\n/**/\n 4847,\n/**/\n 4846,\n/**/\n 4845,\n/**/\n 4844,\n/**/\n 4843,\n/**/\n 4842,\n/**/\n 4841,\n/**/\n 4840,\n/**/\n 4839,\n/**/\n 4838,\n/**/\n 4837,\n/**/\n 4836,\n/**/\n 4835,\n/**/\n 4834,\n/**/\n 4833,\n/**/\n 4832,\n/**/\n 4831,\n/**/\n 4830,\n/**/\n 4829,\n/**/\n 4828,\n/**/\n 4827,\n/**/\n 4826,\n/**/\n 4825,\n/**/\n 4824,\n/**/\n 4823,\n/**/\n 4822,\n/**/\n 4821,\n/**/\n 4820,\n/**/\n 4819,\n/**/\n 4818,\n/**/\n 4817,\n/**/\n 4816,\n/**/\n 4815,\n/**/\n 4814,\n/**/\n 4813,\n/**/\n 4812,\n/**/\n 4811,\n/**/\n 4810,\n/**/\n 4809,\n/**/\n 4808,\n/**/\n 4807,\n/**/\n 4806,\n/**/\n 4805,\n/**/\n 4804,\n/**/\n 4803,\n/**/\n 4802,\n/**/\n 4801,\n/**/\n 4800,\n/**/\n 4799,\n/**/\n 4798,\n/**/\n 4797,\n/**/\n 4796,\n/**/\n 4795,\n/**/\n 4794,\n/**/\n 4793,\n/**/\n 4792,\n/**/\n 4791,\n/**/\n 4790,\n/**/\n 4789,\n/**/\n 4788,\n/**/\n 4787,\n/**/\n 4786,\n/**/\n 4785,\n/**/\n 4784,\n/**/\n 4783,\n/**/\n 4782,\n/**/\n 4781,\n/**/\n 4780,\n/**/\n 4779,\n/**/\n 4778,\n/**/\n 4777,\n/**/\n 4776,\n/**/\n 4775,\n/**/\n 4774,\n/**/\n 4773,\n/**/\n 4772,\n/**/\n 4771,\n/**/\n 4770,\n/**/\n 4769,\n/**/\n 4768,\n/**/\n 4767,\n/**/\n 4766,\n/**/\n 4765,\n/**/\n 4764,\n/**/\n 4763,\n/**/\n 4762,\n/**/\n 4761,\n/**/\n 4760,\n/**/\n 4759,\n/**/\n 4758,\n/**/\n 4757,\n/**/\n 4756,\n/**/\n 4755,\n/**/\n 4754,\n/**/\n 4753,\n/**/\n 4752,\n/**/\n 4751,\n/**/\n 4750,\n/**/\n 4749,\n/**/\n 4748,\n/**/\n 4747,\n/**/\n 4746,\n/**/\n 4745,\n/**/\n 4744,\n/**/\n 4743,\n/**/\n 4742,\n/**/\n 4741,\n/**/\n 4740,\n/**/\n 4739,\n/**/\n 4738,\n/**/\n 4737,\n/**/\n 4736,\n/**/\n 4735,\n/**/\n 4734,\n/**/\n 4733,\n/**/\n 4732,\n/**/\n 4731,\n/**/\n 4730,\n/**/\n 4729,\n/**/\n 4728,\n/**/\n 4727,\n/**/\n 4726,\n/**/\n 4725,\n/**/\n 4724,\n/**/\n 4723,\n/**/\n 4722,\n/**/\n 4721,\n/**/\n 4720,\n/**/\n 4719,\n/**/\n 4718,\n/**/\n 4717,\n/**/\n 4716,\n/**/\n 4715,\n/**/\n 4714,\n/**/\n 4713,\n/**/\n 4712,\n/**/\n 4711,\n/**/\n 4710,\n/**/\n 4709,\n/**/\n 4708,\n/**/\n 4707,\n/**/\n 4706,\n/**/\n 4705,\n/**/\n 4704,\n/**/\n 4703,\n/**/\n 4702,\n/**/\n 4701,\n/**/\n 4700,\n/**/\n 4699,\n/**/\n 4698,\n/**/\n 4697,\n/**/\n 4696,\n/**/\n 4695,\n/**/\n 4694,\n/**/\n 4693,\n/**/\n 4692,\n/**/\n 4691,\n/**/\n 4690,\n/**/\n 4689,\n/**/\n 4688,\n/**/\n 4687,\n/**/\n 4686,\n/**/\n 4685,\n/**/\n 4684,\n/**/\n 4683,\n/**/\n 4682,\n/**/\n 4681,\n/**/\n 4680,\n/**/\n 4679,\n/**/\n 4678,\n/**/\n 4677,\n/**/\n 4676,\n/**/\n 4675,\n/**/\n 4674,\n/**/\n 4673,\n/**/\n 4672,\n/**/\n 4671,\n/**/\n 4670,\n/**/\n 4669,\n/**/\n 4668,\n/**/\n 4667,\n/**/\n 4666,\n/**/\n 4665,\n/**/\n 4664,\n/**/\n 4663,\n/**/\n 4662,\n/**/\n 4661,\n/**/\n 4660,\n/**/\n 4659,\n/**/\n 4658,\n/**/\n 4657,\n/**/\n 4656,\n/**/\n 4655,\n/**/\n 4654,\n/**/\n 4653,\n/**/\n 4652,\n/**/\n 4651,\n/**/\n 4650,\n/**/\n 4649,\n/**/\n 4648,\n/**/\n 4647,\n/**/\n 4646,\n/**/\n 4645,\n/**/\n 4644,\n/**/\n 4643,\n/**/\n 4642,\n/**/\n 4641,\n/**/\n 4640,\n/**/\n 4639,\n/**/\n 4638,\n/**/\n 4637,\n/**/\n 4636,\n/**/\n 4635,\n/**/\n 4634,\n/**/\n 4633,\n/**/\n 4632,\n/**/\n 4631,\n/**/\n 4630,\n/**/\n 4629,\n/**/\n 4628,\n/**/\n 4627,\n/**/\n 4626,\n/**/\n 4625,\n/**/\n 4624,\n/**/\n 4623,\n/**/\n 4622,\n/**/\n 4621,\n/**/\n 4620,\n/**/\n 4619,\n/**/\n 4618,\n/**/\n 4617,\n/**/\n 4616,\n/**/\n 4615,\n/**/\n 4614,\n/**/\n 4613,\n/**/\n 4612,\n/**/\n 4611,\n/**/\n 4610,\n/**/\n 4609,\n/**/\n 4608,\n/**/\n 4607,\n/**/\n 4606,\n/**/\n 4605,\n/**/\n 4604,\n/**/\n 4603,\n/**/\n 4602,\n/**/\n 4601,\n/**/\n 4600,\n/**/\n 4599,\n/**/\n 4598,\n/**/\n 4597,\n/**/\n 4596,\n/**/\n 4595,\n/**/\n 4594,\n/**/\n 4593,\n/**/\n 4592,\n/**/\n 4591,\n/**/\n 4590,\n/**/\n 4589,\n/**/\n 4588,\n/**/\n 4587,\n/**/\n 4586,\n/**/\n 4585,\n/**/\n 4584,\n/**/\n 4583,\n/**/\n 4582,\n/**/\n 4581,\n/**/\n 4580,\n/**/\n 4579,\n/**/\n 4578,\n/**/\n 4577,\n/**/\n 4576,\n/**/\n 4575,\n/**/\n 4574,\n/**/\n 4573,\n/**/\n 4572,\n/**/\n 4571,\n/**/\n 4570,\n/**/\n 4569,\n/**/\n 4568,\n/**/\n 4567,\n/**/\n 4566,\n/**/\n 4565,\n/**/\n 4564,\n/**/\n 4563,\n/**/\n 4562,\n/**/\n 4561,\n/**/\n 4560,\n/**/\n 4559,\n/**/\n 4558,\n/**/\n 4557,\n/**/\n 4556,\n/**/\n 4555,\n/**/\n 4554,\n/**/\n 4553,\n/**/\n 4552,\n/**/\n 4551,\n/**/\n 4550,\n/**/\n 4549,\n/**/\n 4548,\n/**/\n 4547,\n/**/\n 4546,\n/**/\n 4545,\n/**/\n 4544,\n/**/\n 4543,\n/**/\n 4542,\n/**/\n 4541,\n/**/\n 4540,\n/**/\n 4539,\n/**/\n 4538,\n/**/\n 4537,\n/**/\n 4536,\n/**/\n 4535,\n/**/\n 4534,\n/**/\n 4533,\n/**/\n 4532,\n/**/\n 4531,\n/**/\n 4530,\n/**/\n 4529,\n/**/\n 4528,\n/**/\n 4527,\n/**/\n 4526,\n/**/\n 4525,\n/**/\n 4524,\n/**/\n 4523,\n/**/\n 4522,\n/**/\n 4521,\n/**/\n 4520,\n/**/\n 4519,\n/**/\n 4518,\n/**/\n 4517,\n/**/\n 4516,\n/**/\n 4515,\n/**/\n 4514,\n/**/\n 4513,\n/**/\n 4512,\n/**/\n 4511,\n/**/\n 4510,\n/**/\n 4509,\n/**/\n 4508,\n/**/\n 4507,\n/**/\n 4506,\n/**/\n 4505,\n/**/\n 4504,\n/**/\n 4503,\n/**/\n 4502,\n/**/\n 4501,\n/**/\n 4500,\n/**/\n 4499,\n/**/\n 4498,\n/**/\n 4497,\n/**/\n 4496,\n/**/\n 4495,\n/**/\n 4494,\n/**/\n 4493,\n/**/\n 4492,\n/**/\n 4491,\n/**/\n 4490,\n/**/\n 4489,\n/**/\n 4488,\n/**/\n 4487,\n/**/\n 4486,\n/**/\n 4485,\n/**/\n 4484,\n/**/\n 4483,\n/**/\n 4482,\n/**/\n 4481,\n/**/\n 4480,\n/**/\n 4479,\n/**/\n 4478,\n/**/\n 4477,\n/**/\n 4476,\n/**/\n 4475,\n/**/\n 4474,\n/**/\n 4473,\n/**/\n 4472,\n/**/\n 4471,\n/**/\n 4470,\n/**/\n 4469,\n/**/\n 4468,\n/**/\n 4467,\n/**/\n 4466,\n/**/\n 4465,\n/**/\n 4464,\n/**/\n 4463,\n/**/\n 4462,\n/**/\n 4461,\n/**/\n 4460,\n/**/\n 4459,\n/**/\n 4458,\n/**/\n 4457,\n/**/\n 4456,\n/**/\n 4455,\n/**/\n 4454,\n/**/\n 4453,\n/**/\n 4452,\n/**/\n 4451,\n/**/\n 4450,\n/**/\n 4449,\n/**/\n 4448,\n/**/\n 4447,\n/**/\n 4446,\n/**/\n 4445,\n/**/\n 4444,\n/**/\n 4443,\n/**/\n 4442,\n/**/\n 4441,\n/**/\n 4440,\n/**/\n 4439,\n/**/\n 4438,\n/**/\n 4437,\n/**/\n 4436,\n/**/\n 4435,\n/**/\n 4434,\n/**/\n 4433,\n/**/\n 4432,\n/**/\n 4431,\n/**/\n 4430,\n/**/\n 4429,\n/**/\n 4428,\n/**/\n 4427,\n/**/\n 4426,\n/**/\n 4425,\n/**/\n 4424,\n/**/\n 4423,\n/**/\n 4422,\n/**/\n 4421,\n/**/\n 4420,\n/**/\n 4419,\n/**/\n 4418,\n/**/\n 4417,\n/**/\n 4416,\n/**/\n 4415,\n/**/\n 4414,\n/**/\n 4413,\n/**/\n 4412,\n/**/\n 4411,\n/**/\n 4410,\n/**/\n 4409,\n/**/\n 4408,\n/**/\n 4407,\n/**/\n 4406,\n/**/\n 4405,\n/**/\n 4404,\n/**/\n 4403,\n/**/\n 4402,\n/**/\n 4401,\n/**/\n 4400,\n/**/\n 4399,\n/**/\n 4398,\n/**/\n 4397,\n/**/\n 4396,\n/**/\n 4395,\n/**/\n 4394,\n/**/\n 4393,\n/**/\n 4392,\n/**/\n 4391,\n/**/\n 4390,\n/**/\n 4389,\n/**/\n 4388,\n/**/\n 4387,\n/**/\n 4386,\n/**/\n 4385,\n/**/\n 4384,\n/**/\n 4383,\n/**/\n 4382,\n/**/\n 4381,\n/**/\n 4380,\n/**/\n 4379,\n/**/\n 4378,\n/**/\n 4377,\n/**/\n 4376,\n/**/\n 4375,\n/**/\n 4374,\n/**/\n 4373,\n/**/\n 4372,\n/**/\n 4371,\n/**/\n 4370,\n/**/\n 4369,\n/**/\n 4368,\n/**/\n 4367,\n/**/\n 4366,\n/**/\n 4365,\n/**/\n 4364,\n/**/\n 4363,\n/**/\n 4362,\n/**/\n 4361,\n/**/\n 4360,\n/**/\n 4359,\n/**/\n 4358,\n/**/\n 4357,\n/**/\n 4356,\n/**/\n 4355,\n/**/\n 4354,\n/**/\n 4353,\n/**/\n 4352,\n/**/\n 4351,\n/**/\n 4350,\n/**/\n 4349,\n/**/\n 4348,\n/**/\n 4347,\n/**/\n 4346,\n/**/\n 4345,\n/**/\n 4344,\n/**/\n 4343,\n/**/\n 4342,\n/**/\n 4341,\n/**/\n 4340,\n/**/\n 4339,\n/**/\n 4338,\n/**/\n 4337,\n/**/\n 4336,\n/**/\n 4335,\n/**/\n 4334,\n/**/\n 4333,\n/**/\n 4332,\n/**/\n 4331,\n/**/\n 4330,\n/**/\n 4329,\n/**/\n 4328,\n/**/\n 4327,\n/**/\n 4326,\n/**/\n 4325,\n/**/\n 4324,\n/**/\n 4323,\n/**/\n 4322,\n/**/\n 4321,\n/**/\n 4320,\n/**/\n 4319,\n/**/\n 4318,\n/**/\n 4317,\n/**/\n 4316,\n/**/\n 4315,\n/**/\n 4314,\n/**/\n 4313,\n/**/\n 4312,\n/**/\n 4311,\n/**/\n 4310,\n/**/\n 4309,\n/**/\n 4308,\n/**/\n 4307,\n/**/\n 4306,\n/**/\n 4305,\n/**/\n 4304,\n/**/\n 4303,\n/**/\n 4302,\n/**/\n 4301,\n/**/\n 4300,\n/**/\n 4299,\n/**/\n 4298,\n/**/\n 4297,\n/**/\n 4296,\n/**/\n 4295,\n/**/\n 4294,\n/**/\n 4293,\n/**/\n 4292,\n/**/\n 4291,\n/**/\n 4290,\n/**/\n 4289,\n/**/\n 4288,\n/**/\n 4287,\n/**/\n 4286,\n/**/\n 4285,\n/**/\n 4284,\n/**/\n 4283,\n/**/\n 4282,\n/**/\n 4281,\n/**/\n 4280,\n/**/\n 4279,\n/**/\n 4278,\n/**/\n 4277,\n/**/\n 4276,\n/**/\n 4275,\n/**/\n 4274,\n/**/\n 4273,\n/**/\n 4272,\n/**/\n 4271,\n/**/\n 4270,\n/**/\n 4269,\n/**/\n 4268,\n/**/\n 4267,\n/**/\n 4266,\n/**/\n 4265,\n/**/\n 4264,\n/**/\n 4263,\n/**/\n 4262,\n/**/\n 4261,\n/**/\n 4260,\n/**/\n 4259,\n/**/\n 4258,\n/**/\n 4257,\n/**/\n 4256,\n/**/\n 4255,\n/**/\n 4254,\n/**/\n 4253,\n/**/\n 4252,\n/**/\n 4251,\n/**/\n 4250,\n/**/\n 4249,\n/**/\n 4248,\n/**/\n 4247,\n/**/\n 4246,\n/**/\n 4245,\n/**/\n 4244,\n/**/\n 4243,\n/**/\n 4242,\n/**/\n 4241,\n/**/\n 4240,\n/**/\n 4239,\n/**/\n 4238,\n/**/\n 4237,\n/**/\n 4236,\n/**/\n 4235,\n/**/\n 4234,\n/**/\n 4233,\n/**/\n 4232,\n/**/\n 4231,\n/**/\n 4230,\n/**/\n 4229,\n/**/\n 4228,\n/**/\n 4227,\n/**/\n 4226,\n/**/\n 4225,\n/**/\n 4224,\n/**/\n 4223,\n/**/\n 4222,\n/**/\n 4221,\n/**/\n 4220,\n/**/\n 4219,\n/**/\n 4218,\n/**/\n 4217,\n/**/\n 4216,\n/**/\n 4215,\n/**/\n 4214,\n/**/\n 4213,\n/**/\n 4212,\n/**/\n 4211,\n/**/\n 4210,\n/**/\n 4209,\n/**/\n 4208,\n/**/\n 4207,\n/**/\n 4206,\n/**/\n 4205,\n/**/\n 4204,\n/**/\n 4203,\n/**/\n 4202,\n/**/\n 4201,\n/**/\n 4200,\n/**/\n 4199,\n/**/\n 4198,\n/**/\n 4197,\n/**/\n 4196,\n/**/\n 4195,\n/**/\n 4194,\n/**/\n 4193,\n/**/\n 4192,\n/**/\n 4191,\n/**/\n 4190,\n/**/\n 4189,\n/**/\n 4188,\n/**/\n 4187,\n/**/\n 4186,\n/**/\n 4185,\n/**/\n 4184,\n/**/\n 4183,\n/**/\n 4182,\n/**/\n 4181,\n/**/\n 4180,\n/**/\n 4179,\n/**/\n 4178,\n/**/\n 4177,\n/**/\n 4176,\n/**/\n 4175,\n/**/\n 4174,\n/**/\n 4173,\n/**/\n 4172,\n/**/\n 4171,\n/**/\n 4170,\n/**/\n 4169,\n/**/\n 4168,\n/**/\n 4167,\n/**/\n 4166,\n/**/\n 4165,\n/**/\n 4164,\n/**/\n 4163,\n/**/\n 4162,\n/**/\n 4161,\n/**/\n 4160,\n/**/\n 4159,\n/**/\n 4158,\n/**/\n 4157,\n/**/\n 4156,\n/**/\n 4155,\n/**/\n 4154,\n/**/\n 4153,\n/**/\n 4152,\n/**/\n 4151,\n/**/\n 4150,\n/**/\n 4149,\n/**/\n 4148,\n/**/\n 4147,\n/**/\n 4146,\n/**/\n 4145,\n/**/\n 4144,\n/**/\n 4143,\n/**/\n 4142,\n/**/\n 4141,\n/**/\n 4140,\n/**/\n 4139,\n/**/\n 4138,\n/**/\n 4137,\n/**/\n 4136,\n/**/\n 4135,\n/**/\n 4134,\n/**/\n 4133,\n/**/\n 4132,\n/**/\n 4131,\n/**/\n 4130,\n/**/\n 4129,\n/**/\n 4128,\n/**/\n 4127,\n/**/\n 4126,\n/**/\n 4125,\n/**/\n 4124,\n/**/\n 4123,\n/**/\n 4122,\n/**/\n 4121,\n/**/\n 4120,\n/**/\n 4119,\n/**/\n 4118,\n/**/\n 4117,\n/**/\n 4116,\n/**/\n 4115,\n/**/\n 4114,\n/**/\n 4113,\n/**/\n 4112,\n/**/\n 4111,\n/**/\n 4110,\n/**/\n 4109,\n/**/\n 4108,\n/**/\n 4107,\n/**/\n 4106,\n/**/\n 4105,\n/**/\n 4104,\n/**/\n 4103,\n/**/\n 4102,\n/**/\n 4101,\n/**/\n 4100,\n/**/\n 4099,\n/**/\n 4098,\n/**/\n 4097,\n/**/\n 4096,\n/**/\n 4095,\n/**/\n 4094,\n/**/\n 4093,\n/**/\n 4092,\n/**/\n 4091,\n/**/\n 4090,\n/**/\n 4089,\n/**/\n 4088,\n/**/\n 4087,\n/**/\n 4086,\n/**/\n 4085,\n/**/\n 4084,\n/**/\n 4083,\n/**/\n 4082,\n/**/\n 4081,\n/**/\n 4080,\n/**/\n 4079,\n/**/\n 4078,\n/**/\n 4077,\n/**/\n 4076,\n/**/\n 4075,\n/**/\n 4074,\n/**/\n 4073,\n/**/\n 4072,\n/**/\n 4071,\n/**/\n 4070,\n/**/\n 4069,\n/**/\n 4068,\n/**/\n 4067,\n/**/\n 4066,\n/**/\n 4065,\n/**/\n 4064,\n/**/\n 4063,\n/**/\n 4062,\n/**/\n 4061,\n/**/\n 4060,\n/**/\n 4059,\n/**/\n 4058,\n/**/\n 4057,\n/**/\n 4056,\n/**/\n 4055,\n/**/\n 4054,\n/**/\n 4053,\n/**/\n 4052,\n/**/\n 4051,\n/**/\n 4050,\n/**/\n 4049,\n/**/\n 4048,\n/**/\n 4047,\n/**/\n 4046,\n/**/\n 4045,\n/**/\n 4044,\n/**/\n 4043,\n/**/\n 4042,\n/**/\n 4041,\n/**/\n 4040,\n/**/\n 4039,\n/**/\n 4038,\n/**/\n 4037,\n/**/\n 4036,\n/**/\n 4035,\n/**/\n 4034,\n/**/\n 4033,\n/**/\n 4032,\n/**/\n 4031,\n/**/\n 4030,\n/**/\n 4029,\n/**/\n 4028,\n/**/\n 4027,\n/**/\n 4026,\n/**/\n 4025,\n/**/\n 4024,\n/**/\n 4023,\n/**/\n 4022,\n/**/\n 4021,\n/**/\n 4020,\n/**/\n 4019,\n/**/\n 4018,\n/**/\n 4017,\n/**/\n 4016,\n/**/\n 4015,\n/**/\n 4014,\n/**/\n 4013,\n/**/\n 4012,\n/**/\n 4011,\n/**/\n 4010,\n/**/\n 4009,\n/**/\n 4008,\n/**/\n 4007,\n/**/\n 4006,\n/**/\n 4005,\n/**/\n 4004,\n/**/\n 4003,\n/**/\n 4002,\n/**/\n 4001,\n/**/\n 4000,\n/**/\n 3999,\n/**/\n 3998,\n/**/\n 3997,\n/**/\n 3996,\n/**/\n 3995,\n/**/\n 3994,\n/**/\n 3993,\n/**/\n 3992,\n/**/\n 3991,\n/**/\n 3990,\n/**/\n 3989,\n/**/\n 3988,\n/**/\n 3987,\n/**/\n 3986,\n/**/\n 3985,\n/**/\n 3984,\n/**/\n 3983,\n/**/\n 3982,\n/**/\n 3981,\n/**/\n 3980,\n/**/\n 3979,\n/**/\n 3978,\n/**/\n 3977,\n/**/\n 3976,\n/**/\n 3975,\n/**/\n 3974,\n/**/\n 3973,\n/**/\n 3972,\n/**/\n 3971,\n/**/\n 3970,\n/**/\n 3969,\n/**/\n 3968,\n/**/\n 3967,\n/**/\n 3966,\n/**/\n 3965,\n/**/\n 3964,\n/**/\n 3963,\n/**/\n 3962,\n/**/\n 3961,\n/**/\n 3960,\n/**/\n 3959,\n/**/\n 3958,\n/**/\n 3957,\n/**/\n 3956,\n/**/\n 3955,\n/**/\n 3954,\n/**/\n 3953,\n/**/\n 3952,\n/**/\n 3951,\n/**/\n 3950,\n/**/\n 3949,\n/**/\n 3948,\n/**/\n 3947,\n/**/\n 3946,\n/**/\n 3945,\n/**/\n 3944,\n/**/\n 3943,\n/**/\n 3942,\n/**/\n 3941,\n/**/\n 3940,\n/**/\n 3939,\n/**/\n 3938,\n/**/\n 3937,\n/**/\n 3936,\n/**/\n 3935,\n/**/\n 3934,\n/**/\n 3933,\n/**/\n 3932,\n/**/\n 3931,\n/**/\n 3930,\n/**/\n 3929,\n/**/\n 3928,\n/**/\n 3927,\n/**/\n 3926,\n/**/\n 3925,\n/**/\n 3924,\n/**/\n 3923,\n/**/\n 3922,\n/**/\n 3921,\n/**/\n 3920,\n/**/\n 3919,\n/**/\n 3918,\n/**/\n 3917,\n/**/\n 3916,\n/**/\n 3915,\n/**/\n 3914,\n/**/\n 3913,\n/**/\n 3912,\n/**/\n 3911,\n/**/\n 3910,\n/**/\n 3909,\n/**/\n 3908,\n/**/\n 3907,\n/**/\n 3906,\n/**/\n 3905,\n/**/\n 3904,\n/**/\n 3903,\n/**/\n 3902,\n/**/\n 3901,\n/**/\n 3900,\n/**/\n 3899,\n/**/\n 3898,\n/**/\n 3897,\n/**/\n 3896,\n/**/\n 3895,\n/**/\n 3894,\n/**/\n 3893,\n/**/\n 3892,\n/**/\n 3891,\n/**/\n 3890,\n/**/\n 3889,\n/**/\n 3888,\n/**/\n 3887,\n/**/\n 3886,\n/**/\n 3885,\n/**/\n 3884,\n/**/\n 3883,\n/**/\n 3882,\n/**/\n 3881,\n/**/\n 3880,\n/**/\n 3879,\n/**/\n 3878,\n/**/\n 3877,\n/**/\n 3876,\n/**/\n 3875,\n/**/\n 3874,\n/**/\n 3873,\n/**/\n 3872,\n/**/\n 3871,\n/**/\n 3870,\n/**/\n 3869,\n/**/\n 3868,\n/**/\n 3867,\n/**/\n 3866,\n/**/\n 3865,\n/**/\n 3864,\n/**/\n 3863,\n/**/\n 3862,\n/**/\n 3861,\n/**/\n 3860,\n/**/\n 3859,\n/**/\n 3858,\n/**/\n 3857,\n/**/\n 3856,\n/**/\n 3855,\n/**/\n 3854,\n/**/\n 3853,\n/**/\n 3852,\n/**/\n 3851,\n/**/\n 3850,\n/**/\n 3849,\n/**/\n 3848,\n/**/\n 3847,\n/**/\n 3846,\n/**/\n 3845,\n/**/\n 3844,\n/**/\n 3843,\n/**/\n 3842,\n/**/\n 3841,\n/**/\n 3840,\n/**/\n 3839,\n/**/\n 3838,\n/**/\n 3837,\n/**/\n 3836,\n/**/\n 3835,\n/**/\n 3834,\n/**/\n 3833,\n/**/\n 3832,\n/**/\n 3831,\n/**/\n 3830,\n/**/\n 3829,\n/**/\n 3828,\n/**/\n 3827,\n/**/\n 3826,\n/**/\n 3825,\n/**/\n 3824,\n/**/\n 3823,\n/**/\n 3822,\n/**/\n 3821,\n/**/\n 3820,\n/**/\n 3819,\n/**/\n 3818,\n/**/\n 3817,\n/**/\n 3816,\n/**/\n 3815,\n/**/\n 3814,\n/**/\n 3813,\n/**/\n 3812,\n/**/\n 3811,\n/**/\n 3810,\n/**/\n 3809,\n/**/\n 3808,\n/**/\n 3807,\n/**/\n 3806,\n/**/\n 3805,\n/**/\n 3804,\n/**/\n 3803,\n/**/\n 3802,\n/**/\n 3801,\n/**/\n 3800,\n/**/\n 3799,\n/**/\n 3798,\n/**/\n 3797,\n/**/\n 3796,\n/**/\n 3795,\n/**/\n 3794,\n/**/\n 3793,\n/**/\n 3792,\n/**/\n 3791,\n/**/\n 3790,\n/**/\n 3789,\n/**/\n 3788,\n/**/\n 3787,\n/**/\n 3786,\n/**/\n 3785,\n/**/\n 3784,\n/**/\n 3783,\n/**/\n 3782,\n/**/\n 3781,\n/**/\n 3780,\n/**/\n 3779,\n/**/\n 3778,\n/**/\n 3777,\n/**/\n 3776,\n/**/\n 3775,\n/**/\n 3774,\n/**/\n 3773,\n/**/\n 3772,\n/**/\n 3771,\n/**/\n 3770,\n/**/\n 3769,\n/**/\n 3768,\n/**/\n 3767,\n/**/\n 3766,\n/**/\n 3765,\n/**/\n 3764,\n/**/\n 3763,\n/**/\n 3762,\n/**/\n 3761,\n/**/\n 3760,\n/**/\n 3759,\n/**/\n 3758,\n/**/\n 3757,\n/**/\n 3756,\n/**/\n 3755,\n/**/\n 3754,\n/**/\n 3753,\n/**/\n 3752,\n/**/\n 3751,\n/**/\n 3750,\n/**/\n 3749,\n/**/\n 3748,\n/**/\n 3747,\n/**/\n 3746,\n/**/\n 3745,\n/**/\n 3744,\n/**/\n 3743,\n/**/\n 3742,\n/**/\n 3741,\n/**/\n 3740,\n/**/\n 3739,\n/**/\n 3738,\n/**/\n 3737,\n/**/\n 3736,\n/**/\n 3735,\n/**/\n 3734,\n/**/\n 3733,\n/**/\n 3732,\n/**/\n 3731,\n/**/\n 3730,\n/**/\n 3729,\n/**/\n 3728,\n/**/\n 3727,\n/**/\n 3726,\n/**/\n 3725,\n/**/\n 3724,\n/**/\n 3723,\n/**/\n 3722,\n/**/\n 3721,\n/**/\n 3720,\n/**/\n 3719,\n/**/\n 3718,\n/**/\n 3717,\n/**/\n 3716,\n/**/\n 3715,\n/**/\n 3714,\n/**/\n 3713,\n/**/\n 3712,\n/**/\n 3711,\n/**/\n 3710,\n/**/\n 3709,\n/**/\n 3708,\n/**/\n 3707,\n/**/\n 3706,\n/**/\n 3705,\n/**/\n 3704,\n/**/\n 3703,\n/**/\n 3702,\n/**/\n 3701,\n/**/\n 3700,\n/**/\n 3699,\n/**/\n 3698,\n/**/\n 3697,\n/**/\n 3696,\n/**/\n 3695,\n/**/\n 3694,\n/**/\n 3693,\n/**/\n 3692,\n/**/\n 3691,\n/**/\n 3690,\n/**/\n 3689,\n/**/\n 3688,\n/**/\n 3687,\n/**/\n 3686,\n/**/\n 3685,\n/**/\n 3684,\n/**/\n 3683,\n/**/\n 3682,\n/**/\n 3681,\n/**/\n 3680,\n/**/\n 3679,\n/**/\n 3678,\n/**/\n 3677,\n/**/\n 3676,\n/**/\n 3675,\n/**/\n 3674,\n/**/\n 3673,\n/**/\n 3672,\n/**/\n 3671,\n/**/\n 3670,\n/**/\n 3669,\n/**/\n 3668,\n/**/\n 3667,\n/**/\n 3666,\n/**/\n 3665,\n/**/\n 3664,\n/**/\n 3663,\n/**/\n 3662,\n/**/\n 3661,\n/**/\n 3660,\n/**/\n 3659,\n/**/\n 3658,\n/**/\n 3657,\n/**/\n 3656,\n/**/\n 3655,\n/**/\n 3654,\n/**/\n 3653,\n/**/\n 3652,\n/**/\n 3651,\n/**/\n 3650,\n/**/\n 3649,\n/**/\n 3648,\n/**/\n 3647,\n/**/\n 3646,\n/**/\n 3645,\n/**/\n 3644,\n/**/\n 3643,\n/**/\n 3642,\n/**/\n 3641,\n/**/\n 3640,\n/**/\n 3639,\n/**/\n 3638,\n/**/\n 3637,\n/**/\n 3636,\n/**/\n 3635,\n/**/\n 3634,\n/**/\n 3633,\n/**/\n 3632,\n/**/\n 3631,\n/**/\n 3630,\n/**/\n 3629,\n/**/\n 3628,\n/**/\n 3627,\n/**/\n 3626,\n/**/\n 3625,\n/**/\n 3624,\n/**/\n 3623,\n/**/\n 3622,\n/**/\n 3621,\n/**/\n 3620,\n/**/\n 3619,\n/**/\n 3618,\n/**/\n 3617,\n/**/\n 3616,\n/**/\n 3615,\n/**/\n 3614,\n/**/\n 3613,\n/**/\n 3612,\n/**/\n 3611,\n/**/\n 3610,\n/**/\n 3609,\n/**/\n 3608,\n/**/\n 3607,\n/**/\n 3606,\n/**/\n 3605,\n/**/\n 3604,\n/**/\n 3603,\n/**/\n 3602,\n/**/\n 3601,\n/**/\n 3600,\n/**/\n 3599,\n/**/\n 3598,\n/**/\n 3597,\n/**/\n 3596,\n/**/\n 3595,\n/**/\n 3594,\n/**/\n 3593,\n/**/\n 3592,\n/**/\n 3591,\n/**/\n 3590,\n/**/\n 3589,\n/**/\n 3588,\n/**/\n 3587,\n/**/\n 3586,\n/**/\n 3585,\n/**/\n 3584,\n/**/\n 3583,\n/**/\n 3582,\n/**/\n 3581,\n/**/\n 3580,\n/**/\n 3579,\n/**/\n 3578,\n/**/\n 3577,\n/**/\n 3576,\n/**/\n 3575,\n/**/\n 3574,\n/**/\n 3573,\n/**/\n 3572,\n/**/\n 3571,\n/**/\n 3570,\n/**/\n 3569,\n/**/\n 3568,\n/**/\n 3567,\n/**/\n 3566,\n/**/\n 3565,\n/**/\n 3564,\n/**/\n 3563,\n/**/\n 3562,\n/**/\n 3561,\n/**/\n 3560,\n/**/\n 3559,\n/**/\n 3558,\n/**/\n 3557,\n/**/\n 3556,\n/**/\n 3555,\n/**/\n 3554,\n/**/\n 3553,\n/**/\n 3552,\n/**/\n 3551,\n/**/\n 3550,\n/**/\n 3549,\n/**/\n 3548,\n/**/\n 3547,\n/**/\n 3546,\n/**/\n 3545,\n/**/\n 3544,\n/**/\n 3543,\n/**/\n 3542,\n/**/\n 3541,\n/**/\n 3540,\n/**/\n 3539,\n/**/\n 3538,\n/**/\n 3537,\n/**/\n 3536,\n/**/\n 3535,\n/**/\n 3534,\n/**/\n 3533,\n/**/\n 3532,\n/**/\n 3531,\n/**/\n 3530,\n/**/\n 3529,\n/**/\n 3528,\n/**/\n 3527,\n/**/\n 3526,\n/**/\n 3525,\n/**/\n 3524,\n/**/\n 3523,\n/**/\n 3522,\n/**/\n 3521,\n/**/\n 3520,\n/**/\n 3519,\n/**/\n 3518,\n/**/\n 3517,\n/**/\n 3516,\n/**/\n 3515,\n/**/\n 3514,\n/**/\n 3513,\n/**/\n 3512,\n/**/\n 3511,\n/**/\n 3510,\n/**/\n 3509,\n/**/\n 3508,\n/**/\n 3507,\n/**/\n 3506,\n/**/\n 3505,\n/**/\n 3504,\n/**/\n 3503,\n/**/\n 3502,\n/**/\n 3501,\n/**/\n 3500,\n/**/\n 3499,\n/**/\n 3498,\n/**/\n 3497,\n/**/\n 3496,\n/**/\n 3495,\n/**/\n 3494,\n/**/\n 3493,\n/**/\n 3492,\n/**/\n 3491,\n/**/\n 3490,\n/**/\n 3489,\n/**/\n 3488,\n/**/\n 3487,\n/**/\n 3486,\n/**/\n 3485,\n/**/\n 3484,\n/**/\n 3483,\n/**/\n 3482,\n/**/\n 3481,\n/**/\n 3480,\n/**/\n 3479,\n/**/\n 3478,\n/**/\n 3477,\n/**/\n 3476,\n/**/\n 3475,\n/**/\n 3474,\n/**/\n 3473,\n/**/\n 3472,\n/**/\n 3471,\n/**/\n 3470,\n/**/\n 3469,\n/**/\n 3468,\n/**/\n 3467,\n/**/\n 3466,\n/**/\n 3465,\n/**/\n 3464,\n/**/\n 3463,\n/**/\n 3462,\n/**/\n 3461,\n/**/\n 3460,\n/**/\n 3459,\n/**/\n 3458,\n/**/\n 3457,\n/**/\n 3456,\n/**/\n 3455,\n/**/\n 3454,\n/**/\n 3453,\n/**/\n 3452,\n/**/\n 3451,\n/**/\n 3450,\n/**/\n 3449,\n/**/\n 3448,\n/**/\n 3447,\n/**/\n 3446,\n/**/\n 3445,\n/**/\n 3444,\n/**/\n 3443,\n/**/\n 3442,\n/**/\n 3441,\n/**/\n 3440,\n/**/\n 3439,\n/**/\n 3438,\n/**/\n 3437,\n/**/\n 3436,\n/**/\n 3435,\n/**/\n 3434,\n/**/\n 3433,\n/**/\n 3432,\n/**/\n 3431,\n/**/\n 3430,\n/**/\n 3429,\n/**/\n 3428,\n/**/\n 3427,\n/**/\n 3426,\n/**/\n 3425,\n/**/\n 3424,\n/**/\n 3423,\n/**/\n 3422,\n/**/\n 3421,\n/**/\n 3420,\n/**/\n 3419,\n/**/\n 3418,\n/**/\n 3417,\n/**/\n 3416,\n/**/\n 3415,\n/**/\n 3414,\n/**/\n 3413,\n/**/\n 3412,\n/**/\n 3411,\n/**/\n 3410,\n/**/\n 3409,\n/**/\n 3408,\n/**/\n 3407,\n/**/\n 3406,\n/**/\n 3405,\n/**/\n 3404,\n/**/\n 3403,\n/**/\n 3402,\n/**/\n 3401,\n/**/\n 3400,\n/**/\n 3399,\n/**/\n 3398,\n/**/\n 3397,\n/**/\n 3396,\n/**/\n 3395,\n/**/\n 3394,\n/**/\n 3393,\n/**/\n 3392,\n/**/\n 3391,\n/**/\n 3390,\n/**/\n 3389,\n/**/\n 3388,\n/**/\n 3387,\n/**/\n 3386,\n/**/\n 3385,\n/**/\n 3384,\n/**/\n 3383,\n/**/\n 3382,\n/**/\n 3381,\n/**/\n 3380,\n/**/\n 3379,\n/**/\n 3378,\n/**/\n 3377,\n/**/\n 3376,\n/**/\n 3375,\n/**/\n 3374,\n/**/\n 3373,\n/**/\n 3372,\n/**/\n 3371,\n/**/\n 3370,\n/**/\n 3369,\n/**/\n 3368,\n/**/\n 3367,\n/**/\n 3366,\n/**/\n 3365,\n/**/\n 3364,\n/**/\n 3363,\n/**/\n 3362,\n/**/\n 3361,\n/**/\n 3360,\n/**/\n 3359,\n/**/\n 3358,\n/**/\n 3357,\n/**/\n 3356,\n/**/\n 3355,\n/**/\n 3354,\n/**/\n 3353,\n/**/\n 3352,\n/**/\n 3351,\n/**/\n 3350,\n/**/\n 3349,\n/**/\n 3348,\n/**/\n 3347,\n/**/\n 3346,\n/**/\n 3345,\n/**/\n 3344,\n/**/\n 3343,\n/**/\n 3342,\n/**/\n 3341,\n/**/\n 3340,\n/**/\n 3339,\n/**/\n 3338,\n/**/\n 3337,\n/**/\n 3336,\n/**/\n 3335,\n/**/\n 3334,\n/**/\n 3333,\n/**/\n 3332,\n/**/\n 3331,\n/**/\n 3330,\n/**/\n 3329,\n/**/\n 3328,\n/**/\n 3327,\n/**/\n 3326,\n/**/\n 3325,\n/**/\n 3324,\n/**/\n 3323,\n/**/\n 3322,\n/**/\n 3321,\n/**/\n 3320,\n/**/\n 3319,\n/**/\n 3318,\n/**/\n 3317,\n/**/\n 3316,\n/**/\n 3315,\n/**/\n 3314,\n/**/\n 3313,\n/**/\n 3312,\n/**/\n 3311,\n/**/\n 3310,\n/**/\n 3309,\n/**/\n 3308,\n/**/\n 3307,\n/**/\n 3306,\n/**/\n 3305,\n/**/\n 3304,\n/**/\n 3303,\n/**/\n 3302,\n/**/\n 3301,\n/**/\n 3300,\n/**/\n 3299,\n/**/\n 3298,\n/**/\n 3297,\n/**/\n 3296,\n/**/\n 3295,\n/**/\n 3294,\n/**/\n 3293,\n/**/\n 3292,\n/**/\n 3291,\n/**/\n 3290,\n/**/\n 3289,\n/**/\n 3288,\n/**/\n 3287,\n/**/\n 3286,\n/**/\n 3285,\n/**/\n 3284,\n/**/\n 3283,\n/**/\n 3282,\n/**/\n 3281,\n/**/\n 3280,\n/**/\n 3279,\n/**/\n 3278,\n/**/\n 3277,\n/**/\n 3276,\n/**/\n 3275,\n/**/\n 3274,\n/**/\n 3273,\n/**/\n 3272,\n/**/\n 3271,\n/**/\n 3270,\n/**/\n 3269,\n/**/\n 3268,\n/**/\n 3267,\n/**/\n 3266,\n/**/\n 3265,\n/**/\n 3264,\n/**/\n 3263,\n/**/\n 3262,\n/**/\n 3261,\n/**/\n 3260,\n/**/\n 3259,\n/**/\n 3258,\n/**/\n 3257,\n/**/\n 3256,\n/**/\n 3255,\n/**/\n 3254,\n/**/\n 3253,\n/**/\n 3252,\n/**/\n 3251,\n/**/\n 3250,\n/**/\n 3249,\n/**/\n 3248,\n/**/\n 3247,\n/**/\n 3246,\n/**/\n 3245,\n/**/\n 3244,\n/**/\n 3243,\n/**/\n 3242,\n/**/\n 3241,\n/**/\n 3240,\n/**/\n 3239,\n/**/\n 3238,\n/**/\n 3237,\n/**/\n 3236,\n/**/\n 3235,\n/**/\n 3234,\n/**/\n 3233,\n/**/\n 3232,\n/**/\n 3231,\n/**/\n 3230,\n/**/\n 3229,\n/**/\n 3228,\n/**/\n 3227,\n/**/\n 3226,\n/**/\n 3225,\n/**/\n 3224,\n/**/\n 3223,\n/**/\n 3222,\n/**/\n 3221,\n/**/\n 3220,\n/**/\n 3219,\n/**/\n 3218,\n/**/\n 3217,\n/**/\n 3216,\n/**/\n 3215,\n/**/\n 3214,\n/**/\n 3213,\n/**/\n 3212,\n/**/\n 3211,\n/**/\n 3210,\n/**/\n 3209,\n/**/\n 3208,\n/**/\n 3207,\n/**/\n 3206,\n/**/\n 3205,\n/**/\n 3204,\n/**/\n 3203,\n/**/\n 3202,\n/**/\n 3201,\n/**/\n 3200,\n/**/\n 3199,\n/**/\n 3198,\n/**/\n 3197,\n/**/\n 3196,\n/**/\n 3195,\n/**/\n 3194,\n/**/\n 3193,\n/**/\n 3192,\n/**/\n 3191,\n/**/\n 3190,\n/**/\n 3189,\n/**/\n 3188,\n/**/\n 3187,\n/**/\n 3186,\n/**/\n 3185,\n/**/\n 3184,\n/**/\n 3183,\n/**/\n 3182,\n/**/\n 3181,\n/**/\n 3180,\n/**/\n 3179,\n/**/\n 3178,\n/**/\n 3177,\n/**/\n 3176,\n/**/\n 3175,\n/**/\n 3174,\n/**/\n 3173,\n/**/\n 3172,\n/**/\n 3171,\n/**/\n 3170,\n/**/\n 3169,\n/**/\n 3168,\n/**/\n 3167,\n/**/\n 3166,\n/**/\n 3165,\n/**/\n 3164,\n/**/\n 3163,\n/**/\n 3162,\n/**/\n 3161,\n/**/\n 3160,\n/**/\n 3159,\n/**/\n 3158,\n/**/\n 3157,\n/**/\n 3156,\n/**/\n 3155,\n/**/\n 3154,\n/**/\n 3153,\n/**/\n 3152,\n/**/\n 3151,\n/**/\n 3150,\n/**/\n 3149,\n/**/\n 3148,\n/**/\n 3147,\n/**/\n 3146,\n/**/\n 3145,\n/**/\n 3144,\n/**/\n 3143,\n/**/\n 3142,\n/**/\n 3141,\n/**/\n 3140,\n/**/\n 3139,\n/**/\n 3138,\n/**/\n 3137,\n/**/\n 3136,\n/**/\n 3135,\n/**/\n 3134,\n/**/\n 3133,\n/**/\n 3132,\n/**/\n 3131,\n/**/\n 3130,\n/**/\n 3129,\n/**/\n 3128,\n/**/\n 3127,\n/**/\n 3126,\n/**/\n 3125,\n/**/\n 3124,\n/**/\n 3123,\n/**/\n 3122,\n/**/\n 3121,\n/**/\n 3120,\n/**/\n 3119,\n/**/\n 3118,\n/**/\n 3117,\n/**/\n 3116,\n/**/\n 3115,\n/**/\n 3114,\n/**/\n 3113,\n/**/\n 3112,\n/**/\n 3111,\n/**/\n 3110,\n/**/\n 3109,\n/**/\n 3108,\n/**/\n 3107,\n/**/\n 3106,\n/**/\n 3105,\n/**/\n 3104,\n/**/\n 3103,\n/**/\n 3102,\n/**/\n 3101,\n/**/\n 3100,\n/**/\n 3099,\n/**/\n 3098,\n/**/\n 3097,\n/**/\n 3096,\n/**/\n 3095,\n/**/\n 3094,\n/**/\n 3093,\n/**/\n 3092,\n/**/\n 3091,\n/**/\n 3090,\n/**/\n 3089,\n/**/\n 3088,\n/**/\n 3087,\n/**/\n 3086,\n/**/\n 3085,\n/**/\n 3084,\n/**/\n 3083,\n/**/\n 3082,\n/**/\n 3081,\n/**/\n 3080,\n/**/\n 3079,\n/**/\n 3078,\n/**/\n 3077,\n/**/\n 3076,\n/**/\n 3075,\n/**/\n 3074,\n/**/\n 3073,\n/**/\n 3072,\n/**/\n 3071,\n/**/\n 3070,\n/**/\n 3069,\n/**/\n 3068,\n/**/\n 3067,\n/**/\n 3066,\n/**/\n 3065,\n/**/\n 3064,\n/**/\n 3063,\n/**/\n 3062,\n/**/\n 3061,\n/**/\n 3060,\n/**/\n 3059,\n/**/\n 3058,\n/**/\n 3057,\n/**/\n 3056,\n/**/\n 3055,\n/**/\n 3054,\n/**/\n 3053,\n/**/\n 3052,\n/**/\n 3051,\n/**/\n 3050,\n/**/\n 3049,\n/**/\n 3048,\n/**/\n 3047,\n/**/\n 3046,\n/**/\n 3045,\n/**/\n 3044,\n/**/\n 3043,\n/**/\n 3042,\n/**/\n 3041,\n/**/\n 3040,\n/**/\n 3039,\n/**/\n 3038,\n/**/\n 3037,\n/**/\n 3036,\n/**/\n 3035,\n/**/\n 3034,\n/**/\n 3033,\n/**/\n 3032,\n/**/\n 3031,\n/**/\n 3030,\n/**/\n 3029,\n/**/\n 3028,\n/**/\n 3027,\n/**/\n 3026,\n/**/\n 3025,\n/**/\n 3024,\n/**/\n 3023,\n/**/\n 3022,\n/**/\n 3021,\n/**/\n 3020,\n/**/\n 3019,\n/**/\n 3018,\n/**/\n 3017,\n/**/\n 3016,\n/**/\n 3015,\n/**/\n 3014,\n/**/\n 3013,\n/**/\n 3012,\n/**/\n 3011,\n/**/\n 3010,\n/**/\n 3009,\n/**/\n 3008,\n/**/\n 3007,\n/**/\n 3006,\n/**/\n 3005,\n/**/\n 3004,\n/**/\n 3003,\n/**/\n 3002,\n/**/\n 3001,\n/**/\n 3000,\n/**/\n 2999,\n/**/\n 2998,\n/**/\n 2997,\n/**/\n 2996,\n/**/\n 2995,\n/**/\n 2994,\n/**/\n 2993,\n/**/\n 2992,\n/**/\n 2991,\n/**/\n 2990,\n/**/\n 2989,\n/**/\n 2988,\n/**/\n 2987,\n/**/\n 2986,\n/**/\n 2985,\n/**/\n 2984,\n/**/\n 2983,\n/**/\n 2982,\n/**/\n 2981,\n/**/\n 2980,\n/**/\n 2979,\n/**/\n 2978,\n/**/\n 2977,\n/**/\n 2976,\n/**/\n 2975,\n/**/\n 2974,\n/**/\n 2973,\n/**/\n 2972,\n/**/\n 2971,\n/**/\n 2970,\n/**/\n 2969,\n/**/\n 2968,\n/**/\n 2967,\n/**/\n 2966,\n/**/\n 2965,\n/**/\n 2964,\n/**/\n 2963,\n/**/\n 2962,\n/**/\n 2961,\n/**/\n 2960,\n/**/\n 2959,\n/**/\n 2958,\n/**/\n 2957,\n/**/\n 2956,\n/**/\n 2955,\n/**/\n 2954,\n/**/\n 2953,\n/**/\n 2952,\n/**/\n 2951,\n/**/\n 2950,\n/**/\n 2949,\n/**/\n 2948,\n/**/\n 2947,\n/**/\n 2946,\n/**/\n 2945,\n/**/\n 2944,\n/**/\n 2943,\n/**/\n 2942,\n/**/\n 2941,\n/**/\n 2940,\n/**/\n 2939,\n/**/\n 2938,\n/**/\n 2937,\n/**/\n 2936,\n/**/\n 2935,\n/**/\n 2934,\n/**/\n 2933,\n/**/\n 2932,\n/**/\n 2931,\n/**/\n 2930,\n/**/\n 2929,\n/**/\n 2928,\n/**/\n 2927,\n/**/\n 2926,\n/**/\n 2925,\n/**/\n 2924,\n/**/\n 2923,\n/**/\n 2922,\n/**/\n 2921,\n/**/\n 2920,\n/**/\n 2919,\n/**/\n 2918,\n/**/\n 2917,\n/**/\n 2916,\n/**/\n 2915,\n/**/\n 2914,\n/**/\n 2913,\n/**/\n 2912,\n/**/\n 2911,\n/**/\n 2910,\n/**/\n 2909,\n/**/\n 2908,\n/**/\n 2907,\n/**/\n 2906,\n/**/\n 2905,\n/**/\n 2904,\n/**/\n 2903,\n/**/\n 2902,\n/**/\n 2901,\n/**/\n 2900,\n/**/\n 2899,\n/**/\n 2898,\n/**/\n 2897,\n/**/\n 2896,\n/**/\n 2895,\n/**/\n 2894,\n/**/\n 2893,\n/**/\n 2892,\n/**/\n 2891,\n/**/\n 2890,\n/**/\n 2889,\n/**/\n 2888,\n/**/\n 2887,\n/**/\n 2886,\n/**/\n 2885,\n/**/\n 2884,\n/**/\n 2883,\n/**/\n 2882,\n/**/\n 2881,\n/**/\n 2880,\n/**/\n 2879,\n/**/\n 2878,\n/**/\n 2877,\n/**/\n 2876,\n/**/\n 2875,\n/**/\n 2874,\n/**/\n 2873,\n/**/\n 2872,\n/**/\n 2871,\n/**/\n 2870,\n/**/\n 2869,\n/**/\n 2868,\n/**/\n 2867,\n/**/\n 2866,\n/**/\n 2865,\n/**/\n 2864,\n/**/\n 2863,\n/**/\n 2862,\n/**/\n 2861,\n/**/\n 2860,\n/**/\n 2859,\n/**/\n 2858,\n/**/\n 2857,\n/**/\n 2856,\n/**/\n 2855,\n/**/\n 2854,\n/**/\n 2853,\n/**/\n 2852,\n/**/\n 2851,\n/**/\n 2850,\n/**/\n 2849,\n/**/\n 2848,\n/**/\n 2847,\n/**/\n 2846,\n/**/\n 2845,\n/**/\n 2844,\n/**/\n 2843,\n/**/\n 2842,\n/**/\n 2841,\n/**/\n 2840,\n/**/\n 2839,\n/**/\n 2838,\n/**/\n 2837,\n/**/\n 2836,\n/**/\n 2835,\n/**/\n 2834,\n/**/\n 2833,\n/**/\n 2832,\n/**/\n 2831,\n/**/\n 2830,\n/**/\n 2829,\n/**/\n 2828,\n/**/\n 2827,\n/**/\n 2826,\n/**/\n 2825,\n/**/\n 2824,\n/**/\n 2823,\n/**/\n 2822,\n/**/\n 2821,\n/**/\n 2820,\n/**/\n 2819,\n/**/\n 2818,\n/**/\n 2817,\n/**/\n 2816,\n/**/\n 2815,\n/**/\n 2814,\n/**/\n 2813,\n/**/\n 2812,\n/**/\n 2811,\n/**/\n 2810,\n/**/\n 2809,\n/**/\n 2808,\n/**/\n 2807,\n/**/\n 2806,\n/**/\n 2805,\n/**/\n 2804,\n/**/\n 2803,\n/**/\n 2802,\n/**/\n 2801,\n/**/\n 2800,\n/**/\n 2799,\n/**/\n 2798,\n/**/\n 2797,\n/**/\n 2796,\n/**/\n 2795,\n/**/\n 2794,\n/**/\n 2793,\n/**/\n 2792,\n/**/\n 2791,\n/**/\n 2790,\n/**/\n 2789,\n/**/\n 2788,\n/**/\n 2787,\n/**/\n 2786,\n/**/\n 2785,\n/**/\n 2784,\n/**/\n 2783,\n/**/\n 2782,\n/**/\n 2781,\n/**/\n 2780,\n/**/\n 2779,\n/**/\n 2778,\n/**/\n 2777,\n/**/\n 2776,\n/**/\n 2775,\n/**/\n 2774,\n/**/\n 2773,\n/**/\n 2772,\n/**/\n 2771,\n/**/\n 2770,\n/**/\n 2769,\n/**/\n 2768,\n/**/\n 2767,\n/**/\n 2766,\n/**/\n 2765,\n/**/\n 2764,\n/**/\n 2763,\n/**/\n 2762,\n/**/\n 2761,\n/**/\n 2760,\n/**/\n 2759,\n/**/\n 2758,\n/**/\n 2757,\n/**/\n 2756,\n/**/\n 2755,\n/**/\n 2754,\n/**/\n 2753,\n/**/\n 2752,\n/**/\n 2751,\n/**/\n 2750,\n/**/\n 2749,\n/**/\n 2748,\n/**/\n 2747,\n/**/\n 2746,\n/**/\n 2745,\n/**/\n 2744,\n/**/\n 2743,\n/**/\n 2742,\n/**/\n 2741,\n/**/\n 2740,\n/**/\n 2739,\n/**/\n 2738,\n/**/\n 2737,\n/**/\n 2736,\n/**/\n 2735,\n/**/\n 2734,\n/**/\n 2733,\n/**/\n 2732,\n/**/\n 2731,\n/**/\n 2730,\n/**/\n 2729,\n/**/\n 2728,\n/**/\n 2727,\n/**/\n 2726,\n/**/\n 2725,\n/**/\n 2724,\n/**/\n 2723,\n/**/\n 2722,\n/**/\n 2721,\n/**/\n 2720,\n/**/\n 2719,\n/**/\n 2718,\n/**/\n 2717,\n/**/\n 2716,\n/**/\n 2715,\n/**/\n 2714,\n/**/\n 2713,\n/**/\n 2712,\n/**/\n 2711,\n/**/\n 2710,\n/**/\n 2709,\n/**/\n 2708,\n/**/\n 2707,\n/**/\n 2706,\n/**/\n 2705,\n/**/\n 2704,\n/**/\n 2703,\n/**/\n 2702,\n/**/\n 2701,\n/**/\n 2700,\n/**/\n 2699,\n/**/\n 2698,\n/**/\n 2697,\n/**/\n 2696,\n/**/\n 2695,\n/**/\n 2694,\n/**/\n 2693,\n/**/\n 2692,\n/**/\n 2691,\n/**/\n 2690,\n/**/\n 2689,\n/**/\n 2688,\n/**/\n 2687,\n/**/\n 2686,\n/**/\n 2685,\n/**/\n 2684,\n/**/\n 2683,\n/**/\n 2682,\n/**/\n 2681,\n/**/\n 2680,\n/**/\n 2679,\n/**/\n 2678,\n/**/\n 2677,\n/**/\n 2676,\n/**/\n 2675,\n/**/\n 2674,\n/**/\n 2673,\n/**/\n 2672,\n/**/\n 2671,\n/**/\n 2670,\n/**/\n 2669,\n/**/\n 2668,\n/**/\n 2667,\n/**/\n 2666,\n/**/\n 2665,\n/**/\n 2664,\n/**/\n 2663,\n/**/\n 2662,\n/**/\n 2661,\n/**/\n 2660,\n/**/\n 2659,\n/**/\n 2658,\n/**/\n 2657,\n/**/\n 2656,\n/**/\n 2655,\n/**/\n 2654,\n/**/\n 2653,\n/**/\n 2652,\n/**/\n 2651,\n/**/\n 2650,\n/**/\n 2649,\n/**/\n 2648,\n/**/\n 2647,\n/**/\n 2646,\n/**/\n 2645,\n/**/\n 2644,\n/**/\n 2643,\n/**/\n 2642,\n/**/\n 2641,\n/**/\n 2640,\n/**/\n 2639,\n/**/\n 2638,\n/**/\n 2637,\n/**/\n 2636,\n/**/\n 2635,\n/**/\n 2634,\n/**/\n 2633,\n/**/\n 2632,\n/**/\n 2631,\n/**/\n 2630,\n/**/\n 2629,\n/**/\n 2628,\n/**/\n 2627,\n/**/\n 2626,\n/**/\n 2625,\n/**/\n 2624,\n/**/\n 2623,\n/**/\n 2622,\n/**/\n 2621,\n/**/\n 2620,\n/**/\n 2619,\n/**/\n 2618,\n/**/\n 2617,\n/**/\n 2616,\n/**/\n 2615,\n/**/\n 2614,\n/**/\n 2613,\n/**/\n 2612,\n/**/\n 2611,\n/**/\n 2610,\n/**/\n 2609,\n/**/\n 2608,\n/**/\n 2607,\n/**/\n 2606,\n/**/\n 2605,\n/**/\n 2604,\n/**/\n 2603,\n/**/\n 2602,\n/**/\n 2601,\n/**/\n 2600,\n/**/\n 2599,\n/**/\n 2598,\n/**/\n 2597,\n/**/\n 2596,\n/**/\n 2595,\n/**/\n 2594,\n/**/\n 2593,\n/**/\n 2592,\n/**/\n 2591,\n/**/\n 2590,\n/**/\n 2589,\n/**/\n 2588,\n/**/\n 2587,\n/**/\n 2586,\n/**/\n 2585,\n/**/\n 2584,\n/**/\n 2583,\n/**/\n 2582,\n/**/\n 2581,\n/**/\n 2580,\n/**/\n 2579,\n/**/\n 2578,\n/**/\n 2577,\n/**/\n 2576,\n/**/\n 2575,\n/**/\n 2574,\n/**/\n 2573,\n/**/\n 2572,\n/**/\n 2571,\n/**/\n 2570,\n/**/\n 2569,\n/**/\n 2568,\n/**/\n 2567,\n/**/\n 2566,\n/**/\n 2565,\n/**/\n 2564,\n/**/\n 2563,\n/**/\n 2562,\n/**/\n 2561,\n/**/\n 2560,\n/**/\n 2559,\n/**/\n 2558,\n/**/\n 2557,\n/**/\n 2556,\n/**/\n 2555,\n/**/\n 2554,\n/**/\n 2553,\n/**/\n 2552,\n/**/\n 2551,\n/**/\n 2550,\n/**/\n 2549,\n/**/\n 2548,\n/**/\n 2547,\n/**/\n 2546,\n/**/\n 2545,\n/**/\n 2544,\n/**/\n 2543,\n/**/\n 2542,\n/**/\n 2541,\n/**/\n 2540,\n/**/\n 2539,\n/**/\n 2538,\n/**/\n 2537,\n/**/\n 2536,\n/**/\n 2535,\n/**/\n 2534,\n/**/\n 2533,\n/**/\n 2532,\n/**/\n 2531,\n/**/\n 2530,\n/**/\n 2529,\n/**/\n 2528,\n/**/\n 2527,\n/**/\n 2526,\n/**/\n 2525,\n/**/\n 2524,\n/**/\n 2523,\n/**/\n 2522,\n/**/\n 2521,\n/**/\n 2520,\n/**/\n 2519,\n/**/\n 2518,\n/**/\n 2517,\n/**/\n 2516,\n/**/\n 2515,\n/**/\n 2514,\n/**/\n 2513,\n/**/\n 2512,\n/**/\n 2511,\n/**/\n 2510,\n/**/\n 2509,\n/**/\n 2508,\n/**/\n 2507,\n/**/\n 2506,\n/**/\n 2505,\n/**/\n 2504,\n/**/\n 2503,\n/**/\n 2502,\n/**/\n 2501,\n/**/\n 2500,\n/**/\n 2499,\n/**/\n 2498,\n/**/\n 2497,\n/**/\n 2496,\n/**/\n 2495,\n/**/\n 2494,\n/**/\n 2493,\n/**/\n 2492,\n/**/\n 2491,\n/**/\n 2490,\n/**/\n 2489,\n/**/\n 2488,\n/**/\n 2487,\n/**/\n 2486,\n/**/\n 2485,\n/**/\n 2484,\n/**/\n 2483,\n/**/\n 2482,\n/**/\n 2481,\n/**/\n 2480,\n/**/\n 2479,\n/**/\n 2478,\n/**/\n 2477,\n/**/\n 2476,\n/**/\n 2475,\n/**/\n 2474,\n/**/\n 2473,\n/**/\n 2472,\n/**/\n 2471,\n/**/\n 2470,\n/**/\n 2469,\n/**/\n 2468,\n/**/\n 2467,\n/**/\n 2466,\n/**/\n 2465,\n/**/\n 2464,\n/**/\n 2463,\n/**/\n 2462,\n/**/\n 2461,\n/**/\n 2460,\n/**/\n 2459,\n/**/\n 2458,\n/**/\n 2457,\n/**/\n 2456,\n/**/\n 2455,\n/**/\n 2454,\n/**/\n 2453,\n/**/\n 2452,\n/**/\n 2451,\n/**/\n 2450,\n/**/\n 2449,\n/**/\n 2448,\n/**/\n 2447,\n/**/\n 2446,\n/**/\n 2445,\n/**/\n 2444,\n/**/\n 2443,\n/**/\n 2442,\n/**/\n 2441,\n/**/\n 2440,\n/**/\n 2439,\n/**/\n 2438,\n/**/\n 2437,\n/**/\n 2436,\n/**/\n 2435,\n/**/\n 2434,\n/**/\n 2433,\n/**/\n 2432,\n/**/\n 2431,\n/**/\n 2430,\n/**/\n 2429,\n/**/\n 2428,\n/**/\n 2427,\n/**/\n 2426,\n/**/\n 2425,\n/**/\n 2424,\n/**/\n 2423,\n/**/\n 2422,\n/**/\n 2421,\n/**/\n 2420,\n/**/\n 2419,\n/**/\n 2418,\n/**/\n 2417,\n/**/\n 2416,\n/**/\n 2415,\n/**/\n 2414,\n/**/\n 2413,\n/**/\n 2412,\n/**/\n 2411,\n/**/\n 2410,\n/**/\n 2409,\n/**/\n 2408,\n/**/\n 2407,\n/**/\n 2406,\n/**/\n 2405,\n/**/\n 2404,\n/**/\n 2403,\n/**/\n 2402,\n/**/\n 2401,\n/**/\n 2400,\n/**/\n 2399,\n/**/\n 2398,\n/**/\n 2397,\n/**/\n 2396,\n/**/\n 2395,\n/**/\n 2394,\n/**/\n 2393,\n/**/\n 2392,\n/**/\n 2391,\n/**/\n 2390,\n/**/\n 2389,\n/**/\n 2388,\n/**/\n 2387,\n/**/\n 2386,\n/**/\n 2385,\n/**/\n 2384,\n/**/\n 2383,\n/**/\n 2382,\n/**/\n 2381,\n/**/\n 2380,\n/**/\n 2379,\n/**/\n 2378,\n/**/\n 2377,\n/**/\n 2376,\n/**/\n 2375,\n/**/\n 2374,\n/**/\n 2373,\n/**/\n 2372,\n/**/\n 2371,\n/**/\n 2370,\n/**/\n 2369,\n/**/\n 2368,\n/**/\n 2367,\n/**/\n 2366,\n/**/\n 2365,\n/**/\n 2364,\n/**/\n 2363,\n/**/\n 2362,\n/**/\n 2361,\n/**/\n 2360,\n/**/\n 2359,\n/**/\n 2358,\n/**/\n 2357,\n/**/\n 2356,\n/**/\n 2355,\n/**/\n 2354,\n/**/\n 2353,\n/**/\n 2352,\n/**/\n 2351,\n/**/\n 2350,\n/**/\n 2349,\n/**/\n 2348,\n/**/\n 2347,\n/**/\n 2346,\n/**/\n 2345,\n/**/\n 2344,\n/**/\n 2343,\n/**/\n 2342,\n/**/\n 2341,\n/**/\n 2340,\n/**/\n 2339,\n/**/\n 2338,\n/**/\n 2337,\n/**/\n 2336,\n/**/\n 2335,\n/**/\n 2334,\n/**/\n 2333,\n/**/\n 2332,\n/**/\n 2331,\n/**/\n 2330,\n/**/\n 2329,\n/**/\n 2328,\n/**/\n 2327,\n/**/\n 2326,\n/**/\n 2325,\n/**/\n 2324,\n/**/\n 2323,\n/**/\n 2322,\n/**/\n 2321,\n/**/\n 2320,\n/**/\n 2319,\n/**/\n 2318,\n/**/\n 2317,\n/**/\n 2316,\n/**/\n 2315,\n/**/\n 2314,\n/**/\n 2313,\n/**/\n 2312,\n/**/\n 2311,\n/**/\n 2310,\n/**/\n 2309,\n/**/\n 2308,\n/**/\n 2307,\n/**/\n 2306,\n/**/\n 2305,\n/**/\n 2304,\n/**/\n 2303,\n/**/\n 2302,\n/**/\n 2301,\n/**/\n 2300,\n/**/\n 2299,\n/**/\n 2298,\n/**/\n 2297,\n/**/\n 2296,\n/**/\n 2295,\n/**/\n 2294,\n/**/\n 2293,\n/**/\n 2292,\n/**/\n 2291,\n/**/\n 2290,\n/**/\n 2289,\n/**/\n 2288,\n/**/\n 2287,\n/**/\n 2286,\n/**/\n 2285,\n/**/\n 2284,\n/**/\n 2283,\n/**/\n 2282,\n/**/\n 2281,\n/**/\n 2280,\n/**/\n 2279,\n/**/\n 2278,\n/**/\n 2277,\n/**/\n 2276,\n/**/\n 2275,\n/**/\n 2274,\n/**/\n 2273,\n/**/\n 2272,\n/**/\n 2271,\n/**/\n 2270,\n/**/\n 2269,\n/**/\n 2268,\n/**/\n 2267,\n/**/\n 2266,\n/**/\n 2265,\n/**/\n 2264,\n/**/\n 2263,\n/**/\n 2262,\n/**/\n 2261,\n/**/\n 2260,\n/**/\n 2259,\n/**/\n 2258,\n/**/\n 2257,\n/**/\n 2256,\n/**/\n 2255,\n/**/\n 2254,\n/**/\n 2253,\n/**/\n 2252,\n/**/\n 2251,\n/**/\n 2250,\n/**/\n 2249,\n/**/\n 2248,\n/**/\n 2247,\n/**/\n 2246,\n/**/\n 2245,\n/**/\n 2244,\n/**/\n 2243,\n/**/\n 2242,\n/**/\n 2241,\n/**/\n 2240,\n/**/\n 2239,\n/**/\n 2238,\n/**/\n 2237,\n/**/\n 2236,\n/**/\n 2235,\n/**/\n 2234,\n/**/\n 2233,\n/**/\n 2232,\n/**/\n 2231,\n/**/\n 2230,\n/**/\n 2229,\n/**/\n 2228,\n/**/\n 2227,\n/**/\n 2226,\n/**/\n 2225,\n/**/\n 2224,\n/**/\n 2223,\n/**/\n 2222,\n/**/\n 2221,\n/**/\n 2220,\n/**/\n 2219,\n/**/\n 2218,\n/**/\n 2217,\n/**/\n 2216,\n/**/\n 2215,\n/**/\n 2214,\n/**/\n 2213,\n/**/\n 2212,\n/**/\n 2211,\n/**/\n 2210,\n/**/\n 2209,\n/**/\n 2208,\n/**/\n 2207,\n/**/\n 2206,\n/**/\n 2205,\n/**/\n 2204,\n/**/\n 2203,\n/**/\n 2202,\n/**/\n 2201,\n/**/\n 2200,\n/**/\n 2199,\n/**/\n 2198,\n/**/\n 2197,\n/**/\n 2196,\n/**/\n 2195,\n/**/\n 2194,\n/**/\n 2193,\n/**/\n 2192,\n/**/\n 2191,\n/**/\n 2190,\n/**/\n 2189,\n/**/\n 2188,\n/**/\n 2187,\n/**/\n 2186,\n/**/\n 2185,\n/**/\n 2184,\n/**/\n 2183,\n/**/\n 2182,\n/**/\n 2181,\n/**/\n 2180,\n/**/\n 2179,\n/**/\n 2178,\n/**/\n 2177,\n/**/\n 2176,\n/**/\n 2175,\n/**/\n 2174,\n/**/\n 2173,\n/**/\n 2172,\n/**/\n 2171,\n/**/\n 2170,\n/**/\n 2169,\n/**/\n 2168,\n/**/\n 2167,\n/**/\n 2166,\n/**/\n 2165,\n/**/\n 2164,\n/**/\n 2163,\n/**/\n 2162,\n/**/\n 2161,\n/**/\n 2160,\n/**/\n 2159,\n/**/\n 2158,\n/**/\n 2157,\n/**/\n 2156,\n/**/\n 2155,\n/**/\n 2154,\n/**/\n 2153,\n/**/\n 2152,\n/**/\n 2151,\n/**/\n 2150,\n/**/\n 2149,\n/**/\n 2148,\n/**/\n 2147,\n/**/\n 2146,\n/**/\n 2145,\n/**/\n 2144,\n/**/\n 2143,\n/**/\n 2142,\n/**/\n 2141,\n/**/\n 2140,\n/**/\n 2139,\n/**/\n 2138,\n/**/\n 2137,\n/**/\n 2136,\n/**/\n 2135,\n/**/\n 2134,\n/**/\n 2133,\n/**/\n 2132,\n/**/\n 2131,\n/**/\n 2130,\n/**/\n 2129,\n/**/\n 2128,\n/**/\n 2127,\n/**/\n 2126,\n/**/\n 2125,\n/**/\n 2124,\n/**/\n 2123,\n/**/\n 2122,\n/**/\n 2121,\n/**/\n 2120,\n/**/\n 2119,\n/**/\n 2118,\n/**/\n 2117,\n/**/\n 2116,\n/**/\n 2115,\n/**/\n 2114,\n/**/\n 2113,\n/**/\n 2112,\n/**/\n 2111,\n/**/\n 2110,\n/**/\n 2109,\n/**/\n 2108,\n/**/\n 2107,\n/**/\n 2106,\n/**/\n 2105,\n/**/\n 2104,\n/**/\n 2103,\n/**/\n 2102,\n/**/\n 2101,\n/**/\n 2100,\n/**/\n 2099,\n/**/\n 2098,\n/**/\n 2097,\n/**/\n 2096,\n/**/\n 2095,\n/**/\n 2094,\n/**/\n 2093,\n/**/\n 2092,\n/**/\n 2091,\n/**/\n 2090,\n/**/\n 2089,\n/**/\n 2088,\n/**/\n 2087,\n/**/\n 2086,\n/**/\n 2085,\n/**/\n 2084,\n/**/\n 2083,\n/**/\n 2082,\n/**/\n 2081,\n/**/\n 2080,\n/**/\n 2079,\n/**/\n 2078,\n/**/\n 2077,\n/**/\n 2076,\n/**/\n 2075,\n/**/\n 2074,\n/**/\n 2073,\n/**/\n 2072,\n/**/\n 2071,\n/**/\n 2070,\n/**/\n 2069,\n/**/\n 2068,\n/**/\n 2067,\n/**/\n 2066,\n/**/\n 2065,\n/**/\n 2064,\n/**/\n 2063,\n/**/\n 2062,\n/**/\n 2061,\n/**/\n 2060,\n/**/\n 2059,\n/**/\n 2058,\n/**/\n 2057,\n/**/\n 2056,\n/**/\n 2055,\n/**/\n 2054,\n/**/\n 2053,\n/**/\n 2052,\n/**/\n 2051,\n/**/\n 2050,\n/**/\n 2049,\n/**/\n 2048,\n/**/\n 2047,\n/**/\n 2046,\n/**/\n 2045,\n/**/\n 2044,\n/**/\n 2043,\n/**/\n 2042,\n/**/\n 2041,\n/**/\n 2040,\n/**/\n 2039,\n/**/\n 2038,\n/**/\n 2037,\n/**/\n 2036,\n/**/\n 2035,\n/**/\n 2034,\n/**/\n 2033,\n/**/\n 2032,\n/**/\n 2031,\n/**/\n 2030,\n/**/\n 2029,\n/**/\n 2028,\n/**/\n 2027,\n/**/\n 2026,\n/**/\n 2025,\n/**/\n 2024,\n/**/\n 2023,\n/**/\n 2022,\n/**/\n 2021,\n/**/\n 2020,\n/**/\n 2019,\n/**/\n 2018,\n/**/\n 2017,\n/**/\n 2016,\n/**/\n 2015,\n/**/\n 2014,\n/**/\n 2013,\n/**/\n 2012,\n/**/\n 2011,\n/**/\n 2010,\n/**/\n 2009,\n/**/\n 2008,\n/**/\n 2007,\n/**/\n 2006,\n/**/\n 2005,\n/**/\n 2004,\n/**/\n 2003,\n/**/\n 2002,\n/**/\n 2001,\n/**/\n 2000,\n/**/\n 1999,\n/**/\n 1998,\n/**/\n 1997,\n/**/\n 1996,\n/**/\n 1995,\n/**/\n 1994,\n/**/\n 1993,\n/**/\n 1992,\n/**/\n 1991,\n/**/\n 1990,\n/**/\n 1989,\n/**/\n 1988,\n/**/\n 1987,\n/**/\n 1986,\n/**/\n 1985,\n/**/\n 1984,\n/**/\n 1983,\n/**/\n 1982,\n/**/\n 1981,\n/**/\n 1980,\n/**/\n 1979,\n/**/\n 1978,\n/**/\n 1977,\n/**/\n 1976,\n/**/\n 1975,\n/**/\n 1974,\n/**/\n 1973,\n/**/\n 1972,\n/**/\n 1971,\n/**/\n 1970,\n/**/\n 1969,\n/**/\n 1968,\n/**/\n 1967,\n/**/\n 1966,\n/**/\n 1965,\n/**/\n 1964,\n/**/\n 1963,\n/**/\n 1962,\n/**/\n 1961,\n/**/\n 1960,\n/**/\n 1959,\n/**/\n 1958,\n/**/\n 1957,\n/**/\n 1956,\n/**/\n 1955,\n/**/\n 1954,\n/**/\n 1953,\n/**/\n 1952,\n/**/\n 1951,\n/**/\n 1950,\n/**/\n 1949,\n/**/\n 1948,\n/**/\n 1947,\n/**/\n 1946,\n/**/\n 1945,\n/**/\n 1944,\n/**/\n 1943,\n/**/\n 1942,\n/**/\n 1941,\n/**/\n 1940,\n/**/\n 1939,\n/**/\n 1938,\n/**/\n 1937,\n/**/\n 1936,\n/**/\n 1935,\n/**/\n 1934,\n/**/\n 1933,\n/**/\n 1932,\n/**/\n 1931,\n/**/\n 1930,\n/**/\n 1929,\n/**/\n 1928,\n/**/\n 1927,\n/**/\n 1926,\n/**/\n 1925,\n/**/\n 1924,\n/**/\n 1923,\n/**/\n 1922,\n/**/\n 1921,\n/**/\n 1920,\n/**/\n 1919,\n/**/\n 1918,\n/**/\n 1917,\n/**/\n 1916,\n/**/\n 1915,\n/**/\n 1914,\n/**/\n 1913,\n/**/\n 1912,\n/**/\n 1911,\n/**/\n 1910,\n/**/\n 1909,\n/**/\n 1908,\n/**/\n 1907,\n/**/\n 1906,\n/**/\n 1905,\n/**/\n 1904,\n/**/\n 1903,\n/**/\n 1902,\n/**/\n 1901,\n/**/\n 1900,\n/**/\n 1899,\n/**/\n 1898,\n/**/\n 1897,\n/**/\n 1896,\n/**/\n 1895,\n/**/\n 1894,\n/**/\n 1893,\n/**/\n 1892,\n/**/\n 1891,\n/**/\n 1890,\n/**/\n 1889,\n/**/\n 1888,\n/**/\n 1887,\n/**/\n 1886,\n/**/\n 1885,\n/**/\n 1884,\n/**/\n 1883,\n/**/\n 1882,\n/**/\n 1881,\n/**/\n 1880,\n/**/\n 1879,\n/**/\n 1878,\n/**/\n 1877,\n/**/\n 1876,\n/**/\n 1875,\n/**/\n 1874,\n/**/\n 1873,\n/**/\n 1872,\n/**/\n 1871,\n/**/\n 1870,\n/**/\n 1869,\n/**/\n 1868,\n/**/\n 1867,\n/**/\n 1866,\n/**/\n 1865,\n/**/\n 1864,\n/**/\n 1863,\n/**/\n 1862,\n/**/\n 1861,\n/**/\n 1860,\n/**/\n 1859,\n/**/\n 1858,\n/**/\n 1857,\n/**/\n 1856,\n/**/\n 1855,\n/**/\n 1854,\n/**/\n 1853,\n/**/\n 1852,\n/**/\n 1851,\n/**/\n 1850,\n/**/\n 1849,\n/**/\n 1848,\n/**/\n 1847,\n/**/\n 1846,\n/**/\n 1845,\n/**/\n 1844,\n/**/\n 1843,\n/**/\n 1842,\n/**/\n 1841,\n/**/\n 1840,\n/**/\n 1839,\n/**/\n 1838,\n/**/\n 1837,\n/**/\n 1836,\n/**/\n 1835,\n/**/\n 1834,\n/**/\n 1833,\n/**/\n 1832,\n/**/\n 1831,\n/**/\n 1830,\n/**/\n 1829,\n/**/\n 1828,\n/**/\n 1827,\n/**/\n 1826,\n/**/\n 1825,\n/**/\n 1824,\n/**/\n 1823,\n/**/\n 1822,\n/**/\n 1821,\n/**/\n 1820,\n/**/\n 1819,\n/**/\n 1818,\n/**/\n 1817,\n/**/\n 1816,\n/**/\n 1815,\n/**/\n 1814,\n/**/\n 1813,\n/**/\n 1812,\n/**/\n 1811,\n/**/\n 1810,\n/**/\n 1809,\n/**/\n 1808,\n/**/\n 1807,\n/**/\n 1806,\n/**/\n 1805,\n/**/\n 1804,\n/**/\n 1803,\n/**/\n 1802,\n/**/\n 1801,\n/**/\n 1800,\n/**/\n 1799,\n/**/\n 1798,\n/**/\n 1797,\n/**/\n 1796,\n/**/\n 1795,\n/**/\n 1794,\n/**/\n 1793,\n/**/\n 1792,\n/**/\n 1791,\n/**/\n 1790,\n/**/\n 1789,\n/**/\n 1788,\n/**/\n 1787,\n/**/\n 1786,\n/**/\n 1785,\n/**/\n 1784,\n/**/\n 1783,\n/**/\n 1782,\n/**/\n 1781,\n/**/\n 1780,\n/**/\n 1779,\n/**/\n 1778,\n/**/\n 1777,\n/**/\n 1776,\n/**/\n 1775,\n/**/\n 1774,\n/**/\n 1773,\n/**/\n 1772,\n/**/\n 1771,\n/**/\n 1770,\n/**/\n 1769,\n/**/\n 1768,\n/**/\n 1767,\n/**/\n 1766,\n/**/\n 1765,\n/**/\n 1764,\n/**/\n 1763,\n/**/\n 1762,\n/**/\n 1761,\n/**/\n 1760,\n/**/\n 1759,\n/**/\n 1758,\n/**/\n 1757,\n/**/\n 1756,\n/**/\n 1755,\n/**/\n 1754,\n/**/\n 1753,\n/**/\n 1752,\n/**/\n 1751,\n/**/\n 1750,\n/**/\n 1749,\n/**/\n 1748,\n/**/\n 1747,\n/**/\n 1746,\n/**/\n 1745,\n/**/\n 1744,\n/**/\n 1743,\n/**/\n 1742,\n/**/\n 1741,\n/**/\n 1740,\n/**/\n 1739,\n/**/\n 1738,\n/**/\n 1737,\n/**/\n 1736,\n/**/\n 1735,\n/**/\n 1734,\n/**/\n 1733,\n/**/\n 1732,\n/**/\n 1731,\n/**/\n 1730,\n/**/\n 1729,\n/**/\n 1728,\n/**/\n 1727,\n/**/\n 1726,\n/**/\n 1725,\n/**/\n 1724,\n/**/\n 1723,\n/**/\n 1722,\n/**/\n 1721,\n/**/\n 1720,\n/**/\n 1719,\n/**/\n 1718,\n/**/\n 1717,\n/**/\n 1716,\n/**/\n 1715,\n/**/\n 1714,\n/**/\n 1713,\n/**/\n 1712,\n/**/\n 1711,\n/**/\n 1710,\n/**/\n 1709,\n/**/\n 1708,\n/**/\n 1707,\n/**/\n 1706,\n/**/\n 1705,\n/**/\n 1704,\n/**/\n 1703,\n/**/\n 1702,\n/**/\n 1701,\n/**/\n 1700,\n/**/\n 1699,\n/**/\n 1698,\n/**/\n 1697,\n/**/\n 1696,\n/**/\n 1695,\n/**/\n 1694,\n/**/\n 1693,\n/**/\n 1692,\n/**/\n 1691,\n/**/\n 1690,\n/**/\n 1689,\n/**/\n 1688,\n/**/\n 1687,\n/**/\n 1686,\n/**/\n 1685,\n/**/\n 1684,\n/**/\n 1683,\n/**/\n 1682,\n/**/\n 1681,\n/**/\n 1680,\n/**/\n 1679,\n/**/\n 1678,\n/**/\n 1677,\n/**/\n 1676,\n/**/\n 1675,\n/**/\n 1674,\n/**/\n 1673,\n/**/\n 1672,\n/**/\n 1671,\n/**/\n 1670,\n/**/\n 1669,\n/**/\n 1668,\n/**/\n 1667,\n/**/\n 1666,\n/**/\n 1665,\n/**/\n 1664,\n/**/\n 1663,\n/**/\n 1662,\n/**/\n 1661,\n/**/\n 1660,\n/**/\n 1659,\n/**/\n 1658,\n/**/\n 1657,\n/**/\n 1656,\n/**/\n 1655,\n/**/\n 1654,\n/**/\n 1653,\n/**/\n 1652,\n/**/\n 1651,\n/**/\n 1650,\n/**/\n 1649,\n/**/\n 1648,\n/**/\n 1647,\n/**/\n 1646,\n/**/\n 1645,\n/**/\n 1644,\n/**/\n 1643,\n/**/\n 1642,\n/**/\n 1641,\n/**/\n 1640,\n/**/\n 1639,\n/**/\n 1638,\n/**/\n 1637,\n/**/\n 1636,\n/**/\n 1635,\n/**/\n 1634,\n/**/\n 1633,\n/**/\n 1632,\n/**/\n 1631,\n/**/\n 1630,\n/**/\n 1629,\n/**/\n 1628,\n/**/\n 1627,\n/**/\n 1626,\n/**/\n 1625,\n/**/\n 1624,\n/**/\n 1623,\n/**/\n 1622,\n/**/\n 1621,\n/**/\n 1620,\n/**/\n 1619,\n/**/\n 1618,\n/**/\n 1617,\n/**/\n 1616,\n/**/\n 1615,\n/**/\n 1614,\n/**/\n 1613,\n/**/\n 1612,\n/**/\n 1611,\n/**/\n 1610,\n/**/\n 1609,\n/**/\n 1608,\n/**/\n 1607,\n/**/\n 1606,\n/**/\n 1605,\n/**/\n 1604,\n/**/\n 1603,\n/**/\n 1602,\n/**/\n 1601,\n/**/\n 1600,\n/**/\n 1599,\n/**/\n 1598,\n/**/\n 1597,\n/**/\n 1596,\n/**/\n 1595,\n/**/\n 1594,\n/**/\n 1593,\n/**/\n 1592,\n/**/\n 1591,\n/**/\n 1590,\n/**/\n 1589,\n/**/\n 1588,\n/**/\n 1587,\n/**/\n 1586,\n/**/\n 1585,\n/**/\n 1584,\n/**/\n 1583,\n/**/\n 1582,\n/**/\n 1581,\n/**/\n 1580,\n/**/\n 1579,\n/**/\n 1578,\n/**/\n 1577,\n/**/\n 1576,\n/**/\n 1575,\n/**/\n 1574,\n/**/\n 1573,\n/**/\n 1572,\n/**/\n 1571,\n/**/\n 1570,\n/**/\n 1569,\n/**/\n 1568,\n/**/\n 1567,\n/**/\n 1566,\n/**/\n 1565,\n/**/\n 1564,\n/**/\n 1563,\n/**/\n 1562,\n/**/\n 1561,\n/**/\n 1560,\n/**/\n 1559,\n/**/\n 1558,\n/**/\n 1557,\n/**/\n 1556,\n/**/\n 1555,\n/**/\n 1554,\n/**/\n 1553,\n/**/\n 1552,\n/**/\n 1551,\n/**/\n 1550,\n/**/\n 1549,\n/**/\n 1548,\n/**/\n 1547,\n/**/\n 1546,\n/**/\n 1545,\n/**/\n 1544,\n/**/\n 1543,\n/**/\n 1542,\n/**/\n 1541,\n/**/\n 1540,\n/**/\n 1539,\n/**/\n 1538,\n/**/\n 1537,\n/**/\n 1536,\n/**/\n 1535,\n/**/\n 1534,\n/**/\n 1533,\n/**/\n 1532,\n/**/\n 1531,\n/**/\n 1530,\n/**/\n 1529,\n/**/\n 1528,\n/**/\n 1527,\n/**/\n 1526,\n/**/\n 1525,\n/**/\n 1524,\n/**/\n 1523,\n/**/\n 1522,\n/**/\n 1521,\n/**/\n 1520,\n/**/\n 1519,\n/**/\n 1518,\n/**/\n 1517,\n/**/\n 1516,\n/**/\n 1515,\n/**/\n 1514,\n/**/\n 1513,\n/**/\n 1512,\n/**/\n 1511,\n/**/\n 1510,\n/**/\n 1509,\n/**/\n 1508,\n/**/\n 1507,\n/**/\n 1506,\n/**/\n 1505,\n/**/\n 1504,\n/**/\n 1503,\n/**/\n 1502,\n/**/\n 1501,\n/**/\n 1500,\n/**/\n 1499,\n/**/\n 1498,\n/**/\n 1497,\n/**/\n 1496,\n/**/\n 1495,\n/**/\n 1494,\n/**/\n 1493,\n/**/\n 1492,\n/**/\n 1491,\n/**/\n 1490,\n/**/\n 1489,\n/**/\n 1488,\n/**/\n 1487,\n/**/\n 1486,\n/**/\n 1485,\n/**/\n 1484,\n/**/\n 1483,\n/**/\n 1482,\n/**/\n 1481,\n/**/\n 1480,\n/**/\n 1479,\n/**/\n 1478,\n/**/\n 1477,\n/**/\n 1476,\n/**/\n 1475,\n/**/\n 1474,\n/**/\n 1473,\n/**/\n 1472,\n/**/\n 1471,\n/**/\n 1470,\n/**/\n 1469,\n/**/\n 1468,\n/**/\n 1467,\n/**/\n 1466,\n/**/\n 1465,\n/**/\n 1464,\n/**/\n 1463,\n/**/\n 1462,\n/**/\n 1461,\n/**/\n 1460,\n/**/\n 1459,\n/**/\n 1458,\n/**/\n 1457,\n/**/\n 1456,\n/**/\n 1455,\n/**/\n 1454,\n/**/\n 1453,\n/**/\n 1452,\n/**/\n 1451,\n/**/\n 1450,\n/**/\n 1449,\n/**/\n 1448,\n/**/\n 1447,\n/**/\n 1446,\n/**/\n 1445,\n/**/\n 1444,\n/**/\n 1443,\n/**/\n 1442,\n/**/\n 1441,\n/**/\n 1440,\n/**/\n 1439,\n/**/\n 1438,\n/**/\n 1437,\n/**/\n 1436,\n/**/\n 1435,\n/**/\n 1434,\n/**/\n 1433,\n/**/\n 1432,\n/**/\n 1431,\n/**/\n 1430,\n/**/\n 1429,\n/**/\n 1428,\n/**/\n 1427,\n/**/\n 1426,\n/**/\n 1425,\n/**/\n 1424,\n/**/\n 1423,\n/**/\n 1422,\n/**/\n 1421,\n/**/\n 1420,\n/**/\n 1419,\n/**/\n 1418,\n/**/\n 1417,\n/**/\n 1416,\n/**/\n 1415,\n/**/\n 1414,\n/**/\n 1413,\n/**/\n 1412,\n/**/\n 1411,\n/**/\n 1410,\n/**/\n 1409,\n/**/\n 1408,\n/**/\n 1407,\n/**/\n 1406,\n/**/\n 1405,\n/**/\n 1404,\n/**/\n 1403,\n/**/\n 1402,\n/**/\n 1401,\n/**/\n 1400,\n/**/\n 1399,\n/**/\n 1398,\n/**/\n 1397,\n/**/\n 1396,\n/**/\n 1395,\n/**/\n 1394,\n/**/\n 1393,\n/**/\n 1392,\n/**/\n 1391,\n/**/\n 1390,\n/**/\n 1389,\n/**/\n 1388,\n/**/\n 1387,\n/**/\n 1386,\n/**/\n 1385,\n/**/\n 1384,\n/**/\n 1383,\n/**/\n 1382,\n/**/\n 1381,\n/**/\n 1380,\n/**/\n 1379,\n/**/\n 1378,\n/**/\n 1377,\n/**/\n 1376,\n/**/\n 1375,\n/**/\n 1374,\n/**/\n 1373,\n/**/\n 1372,\n/**/\n 1371,\n/**/\n 1370,\n/**/\n 1369,\n/**/\n 1368,\n/**/\n 1367,\n/**/\n 1366,\n/**/\n 1365,\n/**/\n 1364,\n/**/\n 1363,\n/**/\n 1362,\n/**/\n 1361,\n/**/\n 1360,\n/**/\n 1359,\n/**/\n 1358,\n/**/\n 1357,\n/**/\n 1356,\n/**/\n 1355,\n/**/\n 1354,\n/**/\n 1353,\n/**/\n 1352,\n/**/\n 1351,\n/**/\n 1350,\n/**/\n 1349,\n/**/\n 1348,\n/**/\n 1347,\n/**/\n 1346,\n/**/\n 1345,\n/**/\n 1344,\n/**/\n 1343,\n/**/\n 1342,\n/**/\n 1341,\n/**/\n 1340,\n/**/\n 1339,\n/**/\n 1338,\n/**/\n 1337,\n/**/\n 1336,\n/**/\n 1335,\n/**/\n 1334,\n/**/\n 1333,\n/**/\n 1332,\n/**/\n 1331,\n/**/\n 1330,\n/**/\n 1329,\n/**/\n 1328,\n/**/\n 1327,\n/**/\n 1326,\n/**/\n 1325,\n/**/\n 1324,\n/**/\n 1323,\n/**/\n 1322,\n/**/\n 1321,\n/**/\n 1320,\n/**/\n 1319,\n/**/\n 1318,\n/**/\n 1317,\n/**/\n 1316,\n/**/\n 1315,\n/**/\n 1314,\n/**/\n 1313,\n/**/\n 1312,\n/**/\n 1311,\n/**/\n 1310,\n/**/\n 1309,\n/**/\n 1308,\n/**/\n 1307,\n/**/\n 1306,\n/**/\n 1305,\n/**/\n 1304,\n/**/\n 1303,\n/**/\n 1302,\n/**/\n 1301,\n/**/\n 1300,\n/**/\n 1299,\n/**/\n 1298,\n/**/\n 1297,\n/**/\n 1296,\n/**/\n 1295,\n/**/\n 1294,\n/**/\n 1293,\n/**/\n 1292,\n/**/\n 1291,\n/**/\n 1290,\n/**/\n 1289,\n/**/\n 1288,\n/**/\n 1287,\n/**/\n 1286,\n/**/\n 1285,\n/**/\n 1284,\n/**/\n 1283,\n/**/\n 1282,\n/**/\n 1281,\n/**/\n 1280,\n/**/\n 1279,\n/**/\n 1278,\n/**/\n 1277,\n/**/\n 1276,\n/**/\n 1275,\n/**/\n 1274,\n/**/\n 1273,\n/**/\n 1272,\n/**/\n 1271,\n/**/\n 1270,\n/**/\n 1269,\n/**/\n 1268,\n/**/\n 1267,\n/**/\n 1266,\n/**/\n 1265,\n/**/\n 1264,\n/**/\n 1263,\n/**/\n 1262,\n/**/\n 1261,\n/**/\n 1260,\n/**/\n 1259,\n/**/\n 1258,\n/**/\n 1257,\n/**/\n 1256,\n/**/\n 1255,\n/**/\n 1254,\n/**/\n 1253,\n/**/\n 1252,\n/**/\n 1251,\n/**/\n 1250,\n/**/\n 1249,\n/**/\n 1248,\n/**/\n 1247,\n/**/\n 1246,\n/**/\n 1245,\n/**/\n 1244,\n/**/\n 1243,\n/**/\n 1242,\n/**/\n 1241,\n/**/\n 1240,\n/**/\n 1239,\n/**/\n 1238,\n/**/\n 1237,\n/**/\n 1236,\n/**/\n 1235,\n/**/\n 1234,\n/**/\n 1233,\n/**/\n 1232,\n/**/\n 1231,\n/**/\n 1230,\n/**/\n 1229,\n/**/\n 1228,\n/**/\n 1227,\n/**/\n 1226,\n/**/\n 1225,\n/**/\n 1224,\n/**/\n 1223,\n/**/\n 1222,\n/**/\n 1221,\n/**/\n 1220,\n/**/\n 1219,\n/**/\n 1218,\n/**/\n 1217,\n/**/\n 1216,\n/**/\n 1215,\n/**/\n 1214,\n/**/\n 1213,\n/**/\n 1212,\n/**/\n 1211,\n/**/\n 1210,\n/**/\n 1209,\n/**/\n 1208,\n/**/\n 1207,\n/**/\n 1206,\n/**/\n 1205,\n/**/\n 1204,\n/**/\n 1203,\n/**/\n 1202,\n/**/\n 1201,\n/**/\n 1200,\n/**/\n 1199,\n/**/\n 1198,\n/**/\n 1197,\n/**/\n 1196,\n/**/\n 1195,\n/**/\n 1194,\n/**/\n 1193,\n/**/\n 1192,\n/**/\n 1191,\n/**/\n 1190,\n/**/\n 1189,\n/**/\n 1188,\n/**/\n 1187,\n/**/\n 1186,\n/**/\n 1185,\n/**/\n 1184,\n/**/\n 1183,\n/**/\n 1182,\n/**/\n 1181,\n/**/\n 1180,\n/**/\n 1179,\n/**/\n 1178,\n/**/\n 1177,\n/**/\n 1176,\n/**/\n 1175,\n/**/\n 1174,\n/**/\n 1173,\n/**/\n 1172,\n/**/\n 1171,\n/**/\n 1170,\n/**/\n 1169,\n/**/\n 1168,\n/**/\n 1167,\n/**/\n 1166,\n/**/\n 1165,\n/**/\n 1164,\n/**/\n 1163,\n/**/\n 1162,\n/**/\n 1161,\n/**/\n 1160,\n/**/\n 1159,\n/**/\n 1158,\n/**/\n 1157,\n/**/\n 1156,\n/**/\n 1155,\n/**/\n 1154,\n/**/\n 1153,\n/**/\n 1152,\n/**/\n 1151,\n/**/\n 1150,\n/**/\n 1149,\n/**/\n 1148,\n/**/\n 1147,\n/**/\n 1146,\n/**/\n 1145,\n/**/\n 1144,\n/**/\n 1143,\n/**/\n 1142,\n/**/\n 1141,\n/**/\n 1140,\n/**/\n 1139,\n/**/\n 1138,\n/**/\n 1137,\n/**/\n 1136,\n/**/\n 1135,\n/**/\n 1134,\n/**/\n 1133,\n/**/\n 1132,\n/**/\n 1131,\n/**/\n 1130,\n/**/\n 1129,\n/**/\n 1128,\n/**/\n 1127,\n/**/\n 1126,\n/**/\n 1125,\n/**/\n 1124,\n/**/\n 1123,\n/**/\n 1122,\n/**/\n 1121,\n/**/\n 1120,\n/**/\n 1119,\n/**/\n 1118,\n/**/\n 1117,\n/**/\n 1116,\n/**/\n 1115,\n/**/\n 1114,\n/**/\n 1113,\n/**/\n 1112,\n/**/\n 1111,\n/**/\n 1110,\n/**/\n 1109,\n/**/\n 1108,\n/**/\n 1107,\n/**/\n 1106,\n/**/\n 1105,\n/**/\n 1104,\n/**/\n 1103,\n/**/\n 1102,\n/**/\n 1101,\n/**/\n 1100,\n/**/\n 1099,\n/**/\n 1098,\n/**/\n 1097,\n/**/\n 1096,\n/**/\n 1095,\n/**/\n 1094,\n/**/\n 1093,\n/**/\n 1092,\n/**/\n 1091,\n/**/\n 1090,\n/**/\n 1089,\n/**/\n 1088,\n/**/\n 1087,\n/**/\n 1086,\n/**/\n 1085,\n/**/\n 1084,\n/**/\n 1083,\n/**/\n 1082,\n/**/\n 1081,\n/**/\n 1080,\n/**/\n 1079,\n/**/\n 1078,\n/**/\n 1077,\n/**/\n 1076,\n/**/\n 1075,\n/**/\n 1074,\n/**/\n 1073,\n/**/\n 1072,\n/**/\n 1071,\n/**/\n 1070,\n/**/\n 1069,\n/**/\n 1068,\n/**/\n 1067,\n/**/\n 1066,\n/**/\n 1065,\n/**/\n 1064,\n/**/\n 1063,\n/**/\n 1062,\n/**/\n 1061,\n/**/\n 1060,\n/**/\n 1059,\n/**/\n 1058,\n/**/\n 1057,\n/**/\n 1056,\n/**/\n 1055,\n/**/\n 1054,\n/**/\n 1053,\n/**/\n 1052,\n/**/\n 1051,\n/**/\n 1050,\n/**/\n 1049,\n/**/\n 1048,\n/**/\n 1047,\n/**/\n 1046,\n/**/\n 1045,\n/**/\n 1044,\n/**/\n 1043,\n/**/\n 1042,\n/**/\n 1041,\n/**/\n 1040,\n/**/\n 1039,\n/**/\n 1038,\n/**/\n 1037,\n/**/\n 1036,\n/**/\n 1035,\n/**/\n 1034,\n/**/\n 1033,\n/**/\n 1032,\n/**/\n 1031,\n/**/\n 1030,\n/**/\n 1029,\n/**/\n 1028,\n/**/\n 1027,\n/**/\n 1026,\n/**/\n 1025,\n/**/\n 1024,\n/**/\n 1023,\n/**/\n 1022,\n/**/\n 1021,\n/**/\n 1020,\n/**/\n 1019,\n/**/\n 1018,\n/**/\n 1017,\n/**/\n 1016,\n/**/\n 1015,\n/**/\n 1014,\n/**/\n 1013,\n/**/\n 1012,\n/**/\n 1011,\n/**/\n 1010,\n/**/\n 1009,\n/**/\n 1008,\n/**/\n 1007,\n/**/\n 1006,\n/**/\n 1005,\n/**/\n 1004,\n/**/\n 1003,\n/**/\n 1002,\n/**/\n 1001,\n/**/\n 1000,\n/**/\n 999,\n/**/\n 998,\n/**/\n 997,\n/**/\n 996,\n/**/\n 995,\n/**/\n 994,\n/**/\n 993,\n/**/\n 992,\n/**/\n 991,\n/**/\n 990,\n/**/\n 989,\n/**/\n 988,\n/**/\n 987,\n/**/\n 986,\n/**/\n 985,\n/**/\n 984,\n/**/\n 983,\n/**/\n 982,\n/**/\n 981,\n/**/\n 980,\n/**/\n 979,\n/**/\n 978,\n/**/\n 977,\n/**/\n 976,\n/**/\n 975,\n/**/\n 974,\n/**/\n 973,\n/**/\n 972,\n/**/\n 971,\n/**/\n 970,\n/**/\n 969,\n/**/\n 968,\n/**/\n 967,\n/**/\n 966,\n/**/\n 965,\n/**/\n 964,\n/**/\n 963,\n/**/\n 962,\n/**/\n 961,\n/**/\n 960,\n/**/\n 959,\n/**/\n 958,\n/**/\n 957,\n/**/\n 956,\n/**/\n 955,\n/**/\n 954,\n/**/\n 953,\n/**/\n 952,\n/**/\n 951,\n/**/\n 950,\n/**/\n 949,\n/**/\n 948,\n/**/\n 947,\n/**/\n 946,\n/**/\n 945,\n/**/\n 944,\n/**/\n 943,\n/**/\n 942,\n/**/\n 941,\n/**/\n 940,\n/**/\n 939,\n/**/\n 938,\n/**/\n 937,\n/**/\n 936,\n/**/\n 935,\n/**/\n 934,\n/**/\n 933,\n/**/\n 932,\n/**/\n 931,\n/**/\n 930,\n/**/\n 929,\n/**/\n 928,\n/**/\n 927,\n/**/\n 926,\n/**/\n 925,\n/**/\n 924,\n/**/\n 923,\n/**/\n 922,\n/**/\n 921,\n/**/\n 920,\n/**/\n 919,\n/**/\n 918,\n/**/\n 917,\n/**/\n 916,\n/**/\n 915,\n/**/\n 914,\n/**/\n 913,\n/**/\n 912,\n/**/\n 911,\n/**/\n 910,\n/**/\n 909,\n/**/\n 908,\n/**/\n 907,\n/**/\n 906,\n/**/\n 905,\n/**/\n 904,\n/**/\n 903,\n/**/\n 902,\n/**/\n 901,\n/**/\n 900,\n/**/\n 899,\n/**/\n 898,\n/**/\n 897,\n/**/\n 896,\n/**/\n 895,\n/**/\n 894,\n/**/\n 893,\n/**/\n 892,\n/**/\n 891,\n/**/\n 890,\n/**/\n 889,\n/**/\n 888,\n/**/\n 887,\n/**/\n 886,\n/**/\n 885,\n/**/\n 884,\n/**/\n 883,\n/**/\n 882,\n/**/\n 881,\n/**/\n 880,\n/**/\n 879,\n/**/\n 878,\n/**/\n 877,\n/**/\n 876,\n/**/\n 875,\n/**/\n 874,\n/**/\n 873,\n/**/\n 872,\n/**/\n 871,\n/**/\n 870,\n/**/\n 869,\n/**/\n 868,\n/**/\n 867,\n/**/\n 866,\n/**/\n 865,\n/**/\n 864,\n/**/\n 863,\n/**/\n 862,\n/**/\n 861,\n/**/\n 860,\n/**/\n 859,\n/**/\n 858,\n/**/\n 857,\n/**/\n 856,\n/**/\n 855,\n/**/\n 854,\n/**/\n 853,\n/**/\n 852,\n/**/\n 851,\n/**/\n 850,\n/**/\n 849,\n/**/\n 848,\n/**/\n 847,\n/**/\n 846,\n/**/\n 845,\n/**/\n 844,\n/**/\n 843,\n/**/\n 842,\n/**/\n 841,\n/**/\n 840,\n/**/\n 839,\n/**/\n 838,\n/**/\n 837,\n/**/\n 836,\n/**/\n 835,\n/**/\n 834,\n/**/\n 833,\n/**/\n 832,\n/**/\n 831,\n/**/\n 830,\n/**/\n 829,\n/**/\n 828,\n/**/\n 827,\n/**/\n 826,\n/**/\n 825,\n/**/\n 824,\n/**/\n 823,\n/**/\n 822,\n/**/\n 821,\n/**/\n 820,\n/**/\n 819,\n/**/\n 818,\n/**/\n 817,\n/**/\n 816,\n/**/\n 815,\n/**/\n 814,\n/**/\n 813,\n/**/\n 812,\n/**/\n 811,\n/**/\n 810,\n/**/\n 809,\n/**/\n 808,\n/**/\n 807,\n/**/\n 806,\n/**/\n 805,\n/**/\n 804,\n/**/\n 803,\n/**/\n 802,\n/**/\n 801,\n/**/\n 800,\n/**/\n 799,\n/**/\n 798,\n/**/\n 797,\n/**/\n 796,\n/**/\n 795,\n/**/\n 794,\n/**/\n 793,\n/**/\n 792,\n/**/\n 791,\n/**/\n 790,\n/**/\n 789,\n/**/\n 788,\n/**/\n 787,\n/**/\n 786,\n/**/\n 785,\n/**/\n 784,\n/**/\n 783,\n/**/\n 782,\n/**/\n 781,\n/**/\n 780,\n/**/\n 779,\n/**/\n 778,\n/**/\n 777,\n/**/\n 776,\n/**/\n 775,\n/**/\n 774,\n/**/\n 773,\n/**/\n 772,\n/**/\n 771,\n/**/\n 770,\n/**/\n 769,\n/**/\n 768,\n/**/\n 767,\n/**/\n 766,\n/**/\n 765,\n/**/\n 764,\n/**/\n 763,\n/**/\n 762,\n/**/\n 761,\n/**/\n 760,\n/**/\n 759,\n/**/\n 758,\n/**/\n 757,\n/**/\n 756,\n/**/\n 755,\n/**/\n 754,\n/**/\n 753,\n/**/\n 752,\n/**/\n 751,\n/**/\n 750,\n/**/\n 749,\n/**/\n 748,\n/**/\n 747,\n/**/\n 746,\n/**/\n 745,\n/**/\n 744,\n/**/\n 743,\n/**/\n 742,\n/**/\n 741,\n/**/\n 740,\n/**/\n 739,\n/**/\n 738,\n/**/\n 737,\n/**/\n 736,\n/**/\n 735,\n/**/\n 734,\n/**/\n 733,\n/**/\n 732,\n/**/\n 731,\n/**/\n 730,\n/**/\n 729,\n/**/\n 728,\n/**/\n 727,\n/**/\n 726,\n/**/\n 725,\n/**/\n 724,\n/**/\n 723,\n/**/\n 722,\n/**/\n 721,\n/**/\n 720,\n/**/\n 719,\n/**/\n 718,\n/**/\n 717,\n/**/\n 716,\n/**/\n 715,\n/**/\n 714,\n/**/\n 713,\n/**/\n 712,\n/**/\n 711,\n/**/\n 710,\n/**/\n 709,\n/**/\n 708,\n/**/\n 707,\n/**/\n 706,\n/**/\n 705,\n/**/\n 704,\n/**/\n 703,\n/**/\n 702,\n/**/\n 701,\n/**/\n 700,\n/**/\n 699,\n/**/\n 698,\n/**/\n 697,\n/**/\n 696,\n/**/\n 695,\n/**/\n 694,\n/**/\n 693,\n/**/\n 692,\n/**/\n 691,\n/**/\n 690,\n/**/\n 689,\n/**/\n 688,\n/**/\n 687,\n/**/\n 686,\n/**/\n 685,\n/**/\n 684,\n/**/\n 683,\n/**/\n 682,\n/**/\n 681,\n/**/\n 680,\n/**/\n 679,\n/**/\n 678,\n/**/\n 677,\n/**/\n 676,\n/**/\n 675,\n/**/\n 674,\n/**/\n 673,\n/**/\n 672,\n/**/\n 671,\n/**/\n 670,\n/**/\n 669,\n/**/\n 668,\n/**/\n 667,\n/**/\n 666,\n/**/\n 665,\n/**/\n 664,\n/**/\n 663,\n/**/\n 662,\n/**/\n 661,\n/**/\n 660,\n/**/\n 659,\n/**/\n 658,\n/**/\n 657,\n/**/\n 656,\n/**/\n 655,\n/**/\n 654,\n/**/\n 653,\n/**/\n 652,\n/**/\n 651,\n/**/\n 650,\n/**/\n 649,\n/**/\n 648,\n/**/\n 647,\n/**/\n 646,\n/**/\n 645,\n/**/\n 644,\n/**/\n 643,\n/**/\n 642,\n/**/\n 641,\n/**/\n 640,\n/**/\n 639,\n/**/\n 638,\n/**/\n 637,\n/**/\n 636,\n/**/\n 635,\n/**/\n 634,\n/**/\n 633,\n/**/\n 632,\n/**/\n 631,\n/**/\n 630,\n/**/\n 629,\n/**/\n 628,\n/**/\n 627,\n/**/\n 626,\n/**/\n 625,\n/**/\n 624,\n/**/\n 623,\n/**/\n 622,\n/**/\n 621,\n/**/\n 620,\n/**/\n 619,\n/**/\n 618,\n/**/\n 617,\n/**/\n 616,\n/**/\n 615,\n/**/\n 614,\n/**/\n 613,\n/**/\n 612,\n/**/\n 611,\n/**/\n 610,\n/**/\n 609,\n/**/\n 608,\n/**/\n 607,\n/**/\n 606,\n/**/\n 605,\n/**/\n 604,\n/**/\n 603,\n/**/\n 602,\n/**/\n 601,\n/**/\n 600,\n/**/\n 599,\n/**/\n 598,\n/**/\n 597,\n/**/\n 596,\n/**/\n 595,\n/**/\n 594,\n/**/\n 593,\n/**/\n 592,\n/**/\n 591,\n/**/\n 590,\n/**/\n 589,\n/**/\n 588,\n/**/\n 587,\n/**/\n 586,\n/**/\n 585,\n/**/\n 584,\n/**/\n 583,\n/**/\n 582,\n/**/\n 581,\n/**/\n 580,\n/**/\n 579,\n/**/\n 578,\n/**/\n 577,\n/**/\n 576,\n/**/\n 575,\n/**/\n 574,\n/**/\n 573,\n/**/\n 572,\n/**/\n 571,\n/**/\n 570,\n/**/\n 569,\n/**/\n 568,\n/**/\n 567,\n/**/\n 566,\n/**/\n 565,\n/**/\n 564,\n/**/\n 563,\n/**/\n 562,\n/**/\n 561,\n/**/\n 560,\n/**/\n 559,\n/**/\n 558,\n/**/\n 557,\n/**/\n 556,\n/**/\n 555,\n/**/\n 554,\n/**/\n 553,\n/**/\n 552,\n/**/\n 551,\n/**/\n 550,\n/**/\n 549,\n/**/\n 548,\n/**/\n 547,\n/**/\n 546,\n/**/\n 545,\n/**/\n 544,\n/**/\n 543,\n/**/\n 542,\n/**/\n 541,\n/**/\n 540,\n/**/\n 539,\n/**/\n 538,\n/**/\n 537,\n/**/\n 536,\n/**/\n 535,\n/**/\n 534,\n/**/\n 533,\n/**/\n 532,\n/**/\n 531,\n/**/\n 530,\n/**/\n 529,\n/**/\n 528,\n/**/\n 527,\n/**/\n 526,\n/**/\n 525,\n/**/\n 524,\n/**/\n 523,\n/**/\n 522,\n/**/\n 521,\n/**/\n 520,\n/**/\n 519,\n/**/\n 518,\n/**/\n 517,\n/**/\n 516,\n/**/\n 515,\n/**/\n 514,\n/**/\n 513,\n/**/\n 512,\n/**/\n 511,\n/**/\n 510,\n/**/\n 509,\n/**/\n 508,\n/**/\n 507,\n/**/\n 506,\n/**/\n 505,\n/**/\n 504,\n/**/\n 503,\n/**/\n 502,\n/**/\n 501,\n/**/\n 500,\n/**/\n 499,\n/**/\n 498,\n/**/\n 497,\n/**/\n 496,\n/**/\n 495,\n/**/\n 494,\n/**/\n 493,\n/**/\n 492,\n/**/\n 491,\n/**/\n 490,\n/**/\n 489,\n/**/\n 488,\n/**/\n 487,\n/**/\n 486,\n/**/\n 485,\n/**/\n 484,\n/**/\n 483,\n/**/\n 482,\n/**/\n 481,\n/**/\n 480,\n/**/\n 479,\n/**/\n 478,\n/**/\n 477,\n/**/\n 476,\n/**/\n 475,\n/**/\n 474,\n/**/\n 473,\n/**/\n 472,\n/**/\n 471,\n/**/\n 470,\n/**/\n 469,\n/**/\n 468,\n/**/\n 467,\n/**/\n 466,\n/**/\n 465,\n/**/\n 464,\n/**/\n 463,\n/**/\n 462,\n/**/\n 461,\n/**/\n 460,\n/**/\n 459,\n/**/\n 458,\n/**/\n 457,\n/**/\n 456,\n/**/\n 455,\n/**/\n 454,\n/**/\n 453,\n/**/\n 452,\n/**/\n 451,\n/**/\n 450,\n/**/\n 449,\n/**/\n 448,\n/**/\n 447,\n/**/\n 446,\n/**/\n 445,\n/**/\n 444,\n/**/\n 443,\n/**/\n 442,\n/**/\n 441,\n/**/\n 440,\n/**/\n 439,\n/**/\n 438,\n/**/\n 437,\n/**/\n 436,\n/**/\n 435,\n/**/\n 434,\n/**/\n 433,\n/**/\n 432,\n/**/\n 431,\n/**/\n 430,\n/**/\n 429,\n/**/\n 428,\n/**/\n 427,\n/**/\n 426,\n/**/\n 425,\n/**/\n 424,\n/**/\n 423,\n/**/\n 422,\n/**/\n 421,\n/**/\n 420,\n/**/\n 419,\n/**/\n 418,\n/**/\n 417,\n/**/\n 416,\n/**/\n 415,\n/**/\n 414,\n/**/\n 413,\n/**/\n 412,\n/**/\n 411,\n/**/\n 410,\n/**/\n 409,\n/**/\n 408,\n/**/\n 407,\n/**/\n 406,\n/**/\n 405,\n/**/\n 404,\n/**/\n 403,\n/**/\n 402,\n/**/\n 401,\n/**/\n 400,\n/**/\n 399,\n/**/\n 398,\n/**/\n 397,\n/**/\n 396,\n/**/\n 395,\n/**/\n 394,\n/**/\n 393,\n/**/\n 392,\n/**/\n 391,\n/**/\n 390,\n/**/\n 389,\n/**/\n 388,\n/**/\n 387,\n/**/\n 386,\n/**/\n 385,\n/**/\n 384,\n/**/\n 383,\n/**/\n 382,\n/**/\n 381,\n/**/\n 380,\n/**/\n 379,\n/**/\n 378,\n/**/\n 377,\n/**/\n 376,\n/**/\n 375,\n/**/\n 374,\n/**/\n 373,\n/**/\n 372,\n/**/\n 371,\n/**/\n 370,\n/**/\n 369,\n/**/\n 368,\n/**/\n 367,\n/**/\n 366,\n/**/\n 365,\n/**/\n 364,\n/**/\n 363,\n/**/\n 362,\n/**/\n 361,\n/**/\n 360,\n/**/\n 359,\n/**/\n 358,\n/**/\n 357,\n/**/\n 356,\n/**/\n 355,\n/**/\n 354,\n/**/\n 353,\n/**/\n 352,\n/**/\n 351,\n/**/\n 350,\n/**/\n 349,\n/**/\n 348,\n/**/\n 347,\n/**/\n 346,\n/**/\n 345,\n/**/\n 344,\n/**/\n 343,\n/**/\n 342,\n/**/\n 341,\n/**/\n 340,\n/**/\n 339,\n/**/\n 338,\n/**/\n 337,\n/**/\n 336,\n/**/\n 335,\n/**/\n 334,\n/**/\n 333,\n/**/\n 332,\n/**/\n 331,\n/**/\n 330,\n/**/\n 329,\n/**/\n 328,\n/**/\n 327,\n/**/\n 326,\n/**/\n 325,\n/**/\n 324,\n/**/\n 323,\n/**/\n 322,\n/**/\n 321,\n/**/\n 320,\n/**/\n 319,\n/**/\n 318,\n/**/\n 317,\n/**/\n 316,\n/**/\n 315,\n/**/\n 314,\n/**/\n 313,\n/**/\n 312,\n/**/\n 311,\n/**/\n 310,\n/**/\n 309,\n/**/\n 308,\n/**/\n 307,\n/**/\n 306,\n/**/\n 305,\n/**/\n 304,\n/**/\n 303,\n/**/\n 302,\n/**/\n 301,\n/**/\n 300,\n/**/\n 299,\n/**/\n 298,\n/**/\n 297,\n/**/\n 296,\n/**/\n 295,\n/**/\n 294,\n/**/\n 293,\n/**/\n 292,\n/**/\n 291,\n/**/\n 290,\n/**/\n 289,\n/**/\n 288,\n/**/\n 287,\n/**/\n 286,\n/**/\n 285,\n/**/\n 284,\n/**/\n 283,\n/**/\n 282,\n/**/\n 281,\n/**/\n 280,\n/**/\n 279,\n/**/\n 278,\n/**/\n 277,\n/**/\n 276,\n/**/\n 275,\n/**/\n 274,\n/**/\n 273,\n/**/\n 272,\n/**/\n 271,\n/**/\n 270,\n/**/\n 269,\n/**/\n 268,\n/**/\n 267,\n/**/\n 266,\n/**/\n 265,\n/**/\n 264,\n/**/\n 263,\n/**/\n 262,\n/**/\n 261,\n/**/\n 260,\n/**/\n 259,\n/**/\n 258,\n/**/\n 257,\n/**/\n 256,\n/**/\n 255,\n/**/\n 254,\n/**/\n 253,\n/**/\n 252,\n/**/\n 251,\n/**/\n 250,\n/**/\n 249,\n/**/\n 248,\n/**/\n 247,\n/**/\n 246,\n/**/\n 245,\n/**/\n 244,\n/**/\n 243,\n/**/\n 242,\n/**/\n 241,\n/**/\n 240,\n/**/\n 239,\n/**/\n 238,\n/**/\n 237,\n/**/\n 236,\n/**/\n 235,\n/**/\n 234,\n/**/\n 233,\n/**/\n 232,\n/**/\n 231,\n/**/\n 230,\n/**/\n 229,\n/**/\n 228,\n/**/\n 227,\n/**/\n 226,\n/**/\n 225,\n/**/\n 224,\n/**/\n 223,\n/**/\n 222,\n/**/\n 221,\n/**/\n 220,\n/**/\n 219,\n/**/\n 218,\n/**/\n 217,\n/**/\n 216,\n/**/\n 215,\n/**/\n 214,\n/**/\n 213,\n/**/\n 212,\n/**/\n 211,\n/**/\n 210,\n/**/\n 209,\n/**/\n 208,\n/**/\n 207,\n/**/\n 206,\n/**/\n 205,\n/**/\n 204,\n/**/\n 203,\n/**/\n 202,\n/**/\n 201,\n/**/\n 200,\n/**/\n 199,\n/**/\n 198,\n/**/\n 197,\n/**/\n 196,\n/**/\n 195,\n/**/\n 194,\n/**/\n 193,\n/**/\n 192,\n/**/\n 191,\n/**/\n 190,\n/**/\n 189,\n/**/\n 188,\n/**/\n 187,\n/**/\n 186,\n/**/\n 185,\n/**/\n 184,\n/**/\n 183,\n/**/\n 182,\n/**/\n 181,\n/**/\n 180,\n/**/\n 179,\n/**/\n 178,\n/**/\n 177,\n/**/\n 176,\n/**/\n 175,\n/**/\n 174,\n/**/\n 173,\n/**/\n 172,\n/**/\n 171,\n/**/\n 170,\n/**/\n 169,\n/**/\n 168,\n/**/\n 167,\n/**/\n 166,\n/**/\n 165,\n/**/\n 164,\n/**/\n 163,\n/**/\n 162,\n/**/\n 161,\n/**/\n 160,\n/**/\n 159,\n/**/\n 158,\n/**/\n 157,\n/**/\n 156,\n/**/\n 155,\n/**/\n 154,\n/**/\n 153,\n/**/\n 152,\n/**/\n 151,\n/**/\n 150,\n/**/\n 149,\n/**/\n 148,\n/**/\n 147,\n/**/\n 146,\n/**/\n 145,\n/**/\n 144,\n/**/\n 143,\n/**/\n 142,\n/**/\n 141,\n/**/\n 140,\n/**/\n 139,\n/**/\n 138,\n/**/\n 137,\n/**/\n 136,\n/**/\n 135,\n/**/\n 134,\n/**/\n 133,\n/**/\n 132,\n/**/\n 131,\n/**/\n 130,\n/**/\n 129,\n/**/\n 128,\n/**/\n 127,\n/**/\n 126,\n/**/\n 125,\n/**/\n 124,\n/**/\n 123,\n/**/\n 122,\n/**/\n 121,\n/**/\n 120,\n/**/\n 119,\n/**/\n 118,\n/**/\n 117,\n/**/\n 116,\n/**/\n 115,\n/**/\n 114,\n/**/\n 113,\n/**/\n 112,\n/**/\n 111,\n/**/\n 110,\n/**/\n 109,\n/**/\n 108,\n/**/\n 107,\n/**/\n 106,\n/**/\n 105,\n/**/\n 104,\n/**/\n 103,\n/**/\n 102,\n/**/\n 101,\n/**/\n 100,\n/**/\n 99,\n/**/\n 98,\n/**/\n 97,\n/**/\n 96,\n/**/\n 95,\n/**/\n 94,\n/**/\n 93,\n/**/\n 92,\n/**/\n 91,\n/**/\n 90,\n/**/\n 89,\n/**/\n 88,\n/**/\n 87,\n/**/\n 86,\n/**/\n 85,\n/**/\n 84,\n/**/\n 83,\n/**/\n 82,\n/**/\n 81,\n/**/\n 80,\n/**/\n 79,\n/**/\n 78,\n/**/\n 77,\n/**/\n 76,\n/**/\n 75,\n/**/\n 74,\n/**/\n 73,\n/**/\n 72,\n/**/\n 71,\n/**/\n 70,\n/**/\n 69,\n/**/\n 68,\n/**/\n 67,\n/**/\n 66,\n/**/\n 65,\n/**/\n 64,\n/**/\n 63,\n/**/\n 62,\n/**/\n 61,\n/**/\n 60,\n/**/\n 59,\n/**/\n 58,\n/**/\n 57,\n/**/\n 56,\n/**/\n 55,\n/**/\n 54,\n/**/\n 53,\n/**/\n 52,\n/**/\n 51,\n/**/\n 50,\n/**/\n 49,\n/**/\n 48,\n/**/\n 47,\n/**/\n 46,\n/**/\n 45,\n/**/\n 44,\n/**/\n 43,\n/**/\n 42,\n/**/\n 41,\n/**/\n 40,\n/**/\n 39,\n/**/\n 38,\n/**/\n 37,\n/**/\n 36,\n/**/\n 35,\n/**/\n 34,\n/**/\n 33,\n/**/\n 32,\n/**/\n 31,\n/**/\n 30,\n/**/\n 29,\n/**/\n 28,\n/**/\n 27,\n/**/\n 26,\n/**/\n 25,\n/**/\n 24,\n/**/\n 23,\n/**/\n 22,\n/**/\n 21,\n/**/\n 20,\n/**/\n 19,\n/**/\n 18,\n/**/\n 17,\n/**/\n 16,\n/**/\n 15,\n/**/\n 14,\n/**/\n 13,\n/**/\n 12,\n/**/\n 11,\n/**/\n 10,\n/**/\n 9,\n/**/\n 8,\n/**/\n 7,\n/**/\n 6,\n/**/\n 5,\n/**/\n 4,\n/**/\n 3,\n/**/\n 2,\n/**/\n 1,\n/**/\n 0\n};","/*\n * Place to put a short description when adding a feature with a patch.\n * Keep it short, e.g.,: \"relative numbers\", \"persistent undo\".\n * Also add a comment marker to separate the lines.\n * See the official Vim patches for the diff format: It must use a context of\n * one line only. Create it by hand or use \"diff -C2\" and edit the patch.\n */\nstatic char *(extra_patches[]) =\n{ /* Add your patch description below this line */\n/**/\n NULL\n};"," int\nhighest_patch(void)\n{\n // this relies on the highest patch number to be the first entry\n return included_patches[0];\n}","#if defined(FEAT_EVAL) || defined(PROTO)\n/*\n * Return TRUE if patch \"n\" has been included.\n */\n int\nhas_patch(int n)\n{\n int\t\th, m, l;"," // Perform a binary search.\n l = 0;\n h = (int)ARRAY_LENGTH(included_patches) - 1;\n while (l < h)\n {\n\tm = (l + h) / 2;\n\tif (included_patches[m] == n)\n\t return TRUE;\n\tif (included_patches[m] < n)\n\t h = m;\n\telse\n\t l = m + 1;\n }\n return FALSE;\n}\n#endif"," void\nex_version(exarg_T *eap)\n{\n /*\n * Ignore a \":version 9.99\" command.\n */\n if (*eap->arg == NUL)\n {\n\tmsg_putchar('\\n');\n\tlist_version();\n }\n}","/*\n * Output a string for the version message. If it's going to wrap, output a\n * newline, unless the message is too long to fit on the screen anyway.\n * When \"wrap\" is TRUE wrap the string in [].\n */\n static void\nversion_msg_wrap(char_u *s, int wrap)\n{\n int\t\tlen = vim_strsize(s) + (wrap ? 2 : 0);"," if (!got_int && len < (int)Columns && msg_col + len >= (int)Columns\n\t\t\t\t\t\t\t\t&& *s != '\\n')\n\tmsg_putchar('\\n');\n if (!got_int)\n {\n\tif (wrap)\n\t msg_puts(\"[\");\n\tmsg_puts((char *)s);\n\tif (wrap)\n\t msg_puts(\"]\");\n }\n}"," static void\nversion_msg(char *s)\n{\n version_msg_wrap((char_u *)s, FALSE);\n}","/*\n * List all features aligned in columns, dictionary style.\n */\n static void\nlist_features(void)\n{\n list_in_columns((char_u **)features, -1, -1);\n}","/*\n * List string items nicely aligned in columns.\n * When \"size\" is < 0 then the last entry is marked with NULL.\n * The entry with index \"current\" is inclosed in [].\n */\n void\nlist_in_columns(char_u **items, int size, int current)\n{\n int\t\ti;\n int\t\tncol;\n int\t\tnrow;\n int\t\tcur_row = 1;\n int\t\titem_count = 0;\n int\t\twidth = 0;\n#ifdef FEAT_SYN_HL\n int\t\tuse_highlight = (items == (char_u **)features);\n#endif"," // Find the length of the longest item, use that + 1 as the column\n // width.\n for (i = 0; size < 0 ? items[i] != NULL : i < size; ++i)\n {\n\tint l = vim_strsize(items[i]) + (i == current ? 2 : 0);","\tif (l > width)\n\t width = l;\n\t++item_count;\n }\n width += 1;"," if (Columns < width)\n {\n\t// Not enough screen columns - show one per line\n\tfor (i = 0; i < item_count; ++i)\n\t{\n\t version_msg_wrap(items[i], i == current);\n\t if (msg_col > 0 && i < item_count - 1)\n\t\tmsg_putchar('\\n');\n\t}\n\treturn;\n }"," // The rightmost column doesn't need a separator.\n // Sacrifice it to fit in one more column if possible.\n ncol = (int) (Columns + 1) / width;\n nrow = item_count / ncol + ((item_count % ncol) ? 1 : 0);"," // \"i\" counts columns then rows. \"idx\" counts rows then columns.\n for (i = 0; !got_int && i < nrow * ncol; ++i)\n {\n\tint idx = (i / ncol) + (i % ncol) * nrow;","\tif (idx < item_count)\n\t{\n\t int last_col = (i + 1) % ncol == 0;","\t if (idx == current)\n\t\tmsg_putchar('[');\n#ifdef FEAT_SYN_HL\n\t if (use_highlight && items[idx][0] == '-')\n\t\tmsg_puts_attr((char *)items[idx], HL_ATTR(HLF_W));\n\t else\n#endif\n\t\tmsg_puts((char *)items[idx]);\n\t if (idx == current)\n\t\tmsg_putchar(']');\n\t if (last_col)\n\t {\n\t\tif (msg_col > 0 && cur_row < nrow)\n\t\t msg_putchar('\\n');\n\t\t++cur_row;\n\t }\n\t else\n\t {\n\t\twhile (msg_col % width)\n\t\t msg_putchar(' ');\n\t }\n\t}\n\telse\n\t{\n\t // this row is out of items, thus at the end of the row\n\t if (msg_col > 0)\n\t {\n\t\tif (cur_row < nrow)\n\t\t msg_putchar('\\n');\n\t\t++cur_row;\n\t }\n\t}\n }\n}"," void\nlist_version(void)\n{\n int\t\ti;\n int\t\tfirst;\n char\t*s = \"\";"," /*\n * When adding features here, don't forget to update the list of\n * internal variables in eval.c!\n */\n init_longVersion();\n msg(longVersion);\n#ifdef MSWIN\n# ifdef FEAT_GUI_MSWIN\n# ifdef VIMDLL\n# ifdef _WIN64\n msg_puts(_(\"\\nMS-Windows 64-bit GUI/console version\"));\n# else\n msg_puts(_(\"\\nMS-Windows 32-bit GUI/console version\"));\n# endif\n# else\n# ifdef _WIN64\n msg_puts(_(\"\\nMS-Windows 64-bit GUI version\"));\n# else\n msg_puts(_(\"\\nMS-Windows 32-bit GUI version\"));\n# endif\n# endif\n# ifdef FEAT_OLE\n msg_puts(_(\" with OLE support\"));\n# endif\n# else\n# ifdef _WIN64\n msg_puts(_(\"\\nMS-Windows 64-bit console version\"));\n# else\n msg_puts(_(\"\\nMS-Windows 32-bit console version\"));\n# endif\n# endif\n#endif\n#if defined(MACOS_X)\n# if defined(MACOS_X_DARWIN)\n msg_puts(_(\"\\nmacOS version\"));\n# else\n msg_puts(_(\"\\nmacOS version w/o darwin feat.\"));\n# endif\n# if defined(__arm64__)\n msg_puts(\" - arm64\");\n# elif defined(__x86_64__)\n msg_puts(\" - x86_64\");\n# endif\n#endif","#ifdef VMS\n msg_puts(_(\"\\nOpenVMS version\"));\n# ifdef HAVE_PATHDEF\n if (*compiled_arch != NUL)\n {\n\tmsg_puts(\" - \");\n\tmsg_puts((char *)compiled_arch);\n }\n# endif","#endif"," // Print the list of patch numbers if there is at least one.\n // Print a range when patches are consecutive: \"1-10, 12, 15-40, 42-45\"\n if (included_patches[0] != 0)\n {\n\tmsg_puts(_(\"\\nIncluded patches: \"));\n\tfirst = -1;\n\ti = (int)ARRAY_LENGTH(included_patches) - 1;\n\twhile (--i >= 0)\n\t{\n\t if (first < 0)\n\t\tfirst = included_patches[i];\n\t if (i == 0 || included_patches[i - 1] != included_patches[i] + 1)\n\t {\n\t\tmsg_puts(s);\n\t\ts = \", \";\n\t\tmsg_outnum((long)first);\n\t\tif (first != included_patches[i])\n\t\t{\n\t\t msg_puts(\"-\");\n\t\t msg_outnum((long)included_patches[i]);\n\t\t}\n\t\tfirst = -1;\n\t }\n\t}\n }"," // Print the list of extra patch descriptions if there is at least one.\n if (extra_patches[0] != NULL)\n {\n\tmsg_puts(_(\"\\nExtra patches: \"));\n\ts = \"\";\n\tfor (i = 0; extra_patches[i] != NULL; ++i)\n\t{\n\t msg_puts(s);\n\t s = \", \";\n\t msg_puts(extra_patches[i]);\n\t}\n }","#ifdef MODIFIED_BY\n msg_puts(\"\\n\");\n msg_puts(_(\"Modified by \"));\n msg_puts(MODIFIED_BY);\n#endif","#ifdef HAVE_PATHDEF\n if (*compiled_user != NUL || *compiled_sys != NUL)\n {\n\tmsg_puts(_(\"\\nCompiled \"));\n\tif (*compiled_user != NUL)\n\t{\n\t msg_puts(_(\"by \"));\n\t msg_puts((char *)compiled_user);\n\t}\n\tif (*compiled_sys != NUL)\n\t{\n\t msg_puts(\"@\");\n\t msg_puts((char *)compiled_sys);\n\t}\n }\n#endif","#if defined(FEAT_HUGE)\n msg_puts(_(\"\\nHuge version \"));\n#elif defined(FEAT_BIG)\n msg_puts(_(\"\\nBig version \"));\n#elif defined(FEAT_NORMAL)\n msg_puts(_(\"\\nNormal version \"));\n#elif defined(FEAT_SMALL)\n msg_puts(_(\"\\nSmall version \"));\n#else\n msg_puts(_(\"\\nTiny version \"));\n#endif\n#if !defined(FEAT_GUI)\n msg_puts(_(\"without GUI.\"));\n#elif defined(FEAT_GUI_GTK)\n# if defined(USE_GTK3)\n msg_puts(_(\"with GTK3 GUI.\"));\n# elif defined(FEAT_GUI_GNOME)\n msg_puts(_(\"with GTK2-GNOME GUI.\"));\n# else\n msg_puts(_(\"with GTK2 GUI.\"));\n# endif\n#elif defined(FEAT_GUI_MOTIF)\n msg_puts(_(\"with X11-Motif GUI.\"));\n#elif defined(FEAT_GUI_HAIKU)\n msg_puts(_(\"with Haiku GUI.\"));\n#elif defined(FEAT_GUI_PHOTON)\n msg_puts(_(\"with Photon GUI.\"));\n#elif defined(MSWIN)\n msg_puts(_(\"with GUI.\"));\n#endif\n version_msg(_(\" Features included (+) or not (-):\\n\"));"," list_features();\n if (msg_col > 0)\n\tmsg_putchar('\\n');","#ifdef SYS_VIMRC_FILE\n version_msg(_(\" system vimrc file: \\\"\"));\n version_msg(SYS_VIMRC_FILE);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_VIMRC_FILE\n version_msg(_(\" user vimrc file: \\\"\"));\n version_msg(USR_VIMRC_FILE);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_VIMRC_FILE2\n version_msg(_(\" 2nd user vimrc file: \\\"\"));\n version_msg(USR_VIMRC_FILE2);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_VIMRC_FILE3\n version_msg(_(\" 3rd user vimrc file: \\\"\"));\n version_msg(USR_VIMRC_FILE3);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_EXRC_FILE\n version_msg(_(\" user exrc file: \\\"\"));\n version_msg(USR_EXRC_FILE);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_EXRC_FILE2\n version_msg(_(\" 2nd user exrc file: \\\"\"));\n version_msg(USR_EXRC_FILE2);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef FEAT_GUI\n# ifdef SYS_GVIMRC_FILE\n version_msg(_(\" system gvimrc file: \\\"\"));\n version_msg(SYS_GVIMRC_FILE);\n version_msg(\"\\\"\\n\");\n# endif\n version_msg(_(\" user gvimrc file: \\\"\"));\n version_msg(USR_GVIMRC_FILE);\n version_msg(\"\\\"\\n\");\n# ifdef USR_GVIMRC_FILE2\n version_msg(_(\"2nd user gvimrc file: \\\"\"));\n version_msg(USR_GVIMRC_FILE2);\n version_msg(\"\\\"\\n\");\n# endif\n# ifdef USR_GVIMRC_FILE3\n version_msg(_(\"3rd user gvimrc file: \\\"\"));\n version_msg(USR_GVIMRC_FILE3);\n version_msg(\"\\\"\\n\");\n# endif\n#endif\n version_msg(_(\" defaults file: \\\"\"));\n version_msg(VIM_DEFAULTS_FILE);\n version_msg(\"\\\"\\n\");\n#ifdef FEAT_GUI\n# ifdef SYS_MENU_FILE\n version_msg(_(\" system menu file: \\\"\"));\n version_msg(SYS_MENU_FILE);\n version_msg(\"\\\"\\n\");\n# endif\n#endif\n#ifdef HAVE_PATHDEF\n if (*default_vim_dir != NUL)\n {\n\tversion_msg(_(\" fall-back for $VIM: \\\"\"));\n\tversion_msg((char *)default_vim_dir);\n\tversion_msg(\"\\\"\\n\");\n }\n if (*default_vimruntime_dir != NUL)\n {\n\tversion_msg(_(\" f-b for $VIMRUNTIME: \\\"\"));\n\tversion_msg((char *)default_vimruntime_dir);\n\tversion_msg(\"\\\"\\n\");\n }\n version_msg(_(\"Compilation: \"));\n version_msg((char *)all_cflags);\n version_msg(\"\\n\");\n#ifdef VMS\n if (*compiler_version != NUL)\n {\n\tversion_msg(_(\"Compiler: \"));\n\tversion_msg((char *)compiler_version);\n\tversion_msg(\"\\n\");\n }\n#endif\n version_msg(_(\"Linking: \"));\n version_msg((char *)all_lflags);\n#endif\n#ifdef DEBUG\n version_msg(\"\\n\");\n version_msg(_(\" DEBUG BUILD\"));\n#endif\n}","static void do_intro_line(int row, char_u *mesg, int add_version, int attr);\nstatic void intro_message(int colon);","/*\n * Show the intro message when not editing a file.\n */\n void\nmaybe_intro_message(void)\n{\n if (BUFEMPTY()\n\t && curbuf->b_fname == NULL\n\t && firstwin->w_next == NULL\n\t && vim_strchr(p_shm, SHM_INTRO) == NULL)\n\tintro_message(FALSE);\n}","/*\n * Give an introductory message about Vim.\n * Only used when starting Vim on an empty file, without a file name.\n * Or with the \":intro\" command (for Sven :-).\n */\n static void\nintro_message(\n int\t\tcolon)\t\t// TRUE for \":intro\"\n{\n int\t\ti;\n int\t\trow;\n int\t\tblanklines;\n int\t\tsponsor;\n char\t*p;\n static char\t*(lines[]) =\n {\n\tN_(\"VIM - Vi IMproved\"),\n\t\"\",\n\tN_(\"version \"),\n\tN_(\"by Bram Moolenaar et al.\"),\n#ifdef MODIFIED_BY\n\t\" \",\n#endif\n\tN_(\"Vim is open source and freely distributable\"),\n\t\"\",\n\tN_(\"Help poor children in Uganda!\"),\n\tN_(\"type :help iccf<Enter> for information \"),\n\t\"\",\n\tN_(\"type :q<Enter> to exit \"),\n\tN_(\"type :help<Enter> or <F1> for on-line help\"),\n\tN_(\"type :help version8<Enter> for version info\"),\n\tNULL,\n\t\"\",\n\tN_(\"Running in Vi compatible mode\"),\n\tN_(\"type :set nocp<Enter> for Vim defaults\"),\n\tN_(\"type :help cp-default<Enter> for info on this\"),\n };\n#ifdef FEAT_GUI\n static char\t*(gui_lines[]) =\n {\n\tNULL,\n\tNULL,\n\tNULL,\n\tNULL,\n#ifdef MODIFIED_BY\n\tNULL,\n#endif\n\tNULL,\n\tNULL,\n\tNULL,\n\tN_(\"menu Help->Orphans for information \"),\n\tNULL,\n\tN_(\"Running modeless, typed text is inserted\"),\n\tN_(\"menu Edit->Global Settings->Toggle Insert Mode \"),\n\tN_(\" for two modes \"),\n\tNULL,\n\tNULL,\n\tNULL,\n\tN_(\"menu Edit->Global Settings->Toggle Vi Compatible\"),\n\tN_(\" for Vim defaults \"),\n };\n#endif"," // blanklines = screen height - # message lines\n blanklines = (int)Rows - (ARRAY_LENGTH(lines) - 1);\n if (!p_cp)\n\tblanklines += 4; // add 4 for not showing \"Vi compatible\" message"," // Don't overwrite a statusline. Depends on 'cmdheight'.\n if (p_ls > 1)\n\tblanklines -= Rows - topframe->fr_height;\n if (blanklines < 0)\n\tblanklines = 0;"," // Show the sponsor and register message one out of four times, the Uganda\n // message two out of four times.\n sponsor = (int)time(NULL);\n sponsor = ((sponsor & 2) == 0) - ((sponsor & 4) == 0);"," // start displaying the message lines after half of the blank lines\n row = blanklines / 2;\n if ((row >= 2 && Columns >= 50) || colon)\n {\n\tfor (i = 0; i < (int)ARRAY_LENGTH(lines); ++i)\n\t{\n\t p = lines[i];\n#ifdef FEAT_GUI\n\t if (p_im && gui.in_use && gui_lines[i] != NULL)\n\t\tp = gui_lines[i];\n#endif\n\t if (p == NULL)\n\t {\n\t\tif (!p_cp)\n\t\t break;\n\t\tcontinue;\n\t }\n\t if (sponsor != 0)\n\t {\n\t\tif (strstr(p, \"children\") != NULL)\n\t\t p = sponsor < 0\n\t\t\t? N_(\"Sponsor Vim development!\")\n\t\t\t: N_(\"Become a registered Vim user!\");\n\t\telse if (strstr(p, \"iccf\") != NULL)\n\t\t p = sponsor < 0\n\t\t\t? N_(\"type :help sponsor<Enter> for information \")\n\t\t\t: N_(\"type :help register<Enter> for information \");\n\t\telse if (strstr(p, \"Orphans\") != NULL)\n\t\t p = N_(\"menu Help->Sponsor/Register for information \");\n\t }\n\t if (*p != NUL)\n\t\tdo_intro_line(row, (char_u *)_(p), i == 2, 0);\n\t ++row;\n\t}\n }"," // Make the wait-return message appear just below the text.\n if (colon)\n\tmsg_row = row;\n}"," static void\ndo_intro_line(\n int\t\trow,\n char_u\t*mesg,\n int\t\tadd_version,\n int\t\tattr)\n{\n char_u\tvers[20];\n int\t\tcol;\n char_u\t*p;\n int\t\tl;\n int\t\tclen;\n#ifdef MODIFIED_BY\n# define MODBY_LEN 150\n char_u\tmodby[MODBY_LEN];"," if (*mesg == ' ')\n {\n\tvim_strncpy(modby, (char_u *)_(\"Modified by \"), MODBY_LEN - 1);\n\tl = (int)STRLEN(modby);\n\tvim_strncpy(modby + l, (char_u *)MODIFIED_BY, MODBY_LEN - l - 1);\n\tmesg = modby;\n }\n#endif"," // Center the message horizontally.\n col = vim_strsize(mesg);\n if (add_version)\n {\n\tSTRCPY(vers, mediumVersion);\n\tif (highest_patch())\n\t{\n\t // Check for 9.9x or 9.9xx, alpha/beta version\n\t if (isalpha((int)vers[3]))\n\t {\n\t\tint len = (isalpha((int)vers[4])) ? 5 : 4;\n\t\tsprintf((char *)vers + len, \".%d%s\", highest_patch(),\n\t\t\t\t\t\t\t mediumVersion + len);\n\t }\n\t else\n\t\tsprintf((char *)vers + 3, \".%d\", highest_patch());\n\t}\n\tcol += (int)STRLEN(vers);\n }\n col = (Columns - col) / 2;\n if (col < 0)\n\tcol = 0;"," // Split up in parts to highlight <> items differently.\n for (p = mesg; *p != NUL; p += l)\n {\n\tclen = 0;\n\tfor (l = 0; p[l] != NUL\n\t\t\t && (l == 0 || (p[l] != '<' && p[l - 1] != '>')); ++l)\n\t{\n\t if (has_mbyte)\n\t {\n\t\tclen += ptr2cells(p + l);\n\t\tl += (*mb_ptr2len)(p + l) - 1;\n\t }\n\t else\n\t\tclen += byte2cells(p[l]);\n\t}\n\tscreen_puts_len(p, l, row, col, *p == '<' ? HL_ATTR(HLF_8) : attr);\n\tcol += clen;\n }"," // Add the version number to the version line.\n if (add_version)\n\tscreen_puts(vers, row, col, 0);\n}","/*\n * \":intro\": clear screen, display intro screen and wait for return.\n */\n void\nex_intro(exarg_T *eap UNUSED)\n{\n screenclear();\n intro_message(TRUE);\n wait_return(TRUE);\n}"],"string":"[\n \"/* vi:set ts=8 sts=4 sw=4 noet:\\n *\\n * VIM - Vi IMproved\\t\\tby Bram Moolenaar\\n *\\n * Do \\\":help uganda\\\" in Vim to read copying and usage conditions.\\n * Do \\\":help credits\\\" in Vim to see a list of people who contributed.\\n * See README.txt for an overview of the Vim source code.\\n */\",\n \"#include \\\"vim.h\\\"\",\n \"/*\\n * Vim originated from Stevie version 3.6 (Fish disk 217) by GRWalter (Fred)\\n * It has been changed beyond recognition since then.\\n *\\n * Differences between version 7.4 and 8.x can be found with \\\":help version8\\\".\\n * Differences between version 6.4 and 7.x can be found with \\\":help version7\\\".\\n * Differences between version 5.8 and 6.x can be found with \\\":help version6\\\".\\n * Differences between version 4.x and 5.x can be found with \\\":help version5\\\".\\n * Differences between version 3.0 and 4.x can be found with \\\":help version4\\\".\\n * All the remarks about older versions have been removed, they are not very\\n * interesting.\\n */\",\n \"#include \\\"version.h\\\"\",\n \"char\\t\\t*Version = VIM_VERSION_SHORT;\\nstatic char\\t*mediumVersion = VIM_VERSION_MEDIUM;\",\n \"#if defined(HAVE_DATE_TIME) || defined(PROTO)\\n# if (defined(VMS) && defined(VAXC)) || defined(PROTO)\\nchar\\tlongVersion[sizeof(VIM_VERSION_LONG_DATE) + sizeof(__DATE__)\\n\\t\\t\\t\\t\\t\\t + sizeof(__TIME__) + 3];\",\n \" void\\ninit_longVersion(void)\\n{\\n /*\\n * Construct the long version string. Necessary because\\n * VAX C can't concatenate strings in the preprocessor.\\n */\\n strcpy(longVersion, VIM_VERSION_LONG_DATE);\\n#ifdef BUILD_DATE\\n strcat(longVersion, BUILD_DATE);\\n#else\\n strcat(longVersion, __DATE__);\\n strcat(longVersion, \\\" \\\");\\n strcat(longVersion, __TIME__);\\n#endif\\n strcat(longVersion, \\\")\\\");\\n}\",\n \"# else\\nchar\\t*longVersion = NULL;\",\n \" void\\ninit_longVersion(void)\\n{\\n if (longVersion == NULL)\\n {\\n#ifdef BUILD_DATE\\n\\tchar *date_time = BUILD_DATE;\\n#else\\n\\tchar *date_time = __DATE__ \\\" \\\" __TIME__;\\n#endif\\n\\tchar *msg = _(\\\"%s (%s, compiled %s)\\\");\\n\\tsize_t len = strlen(msg)\\n\\t\\t + strlen(VIM_VERSION_LONG_ONLY)\\n\\t\\t + strlen(VIM_VERSION_DATE_ONLY)\\n\\t\\t + strlen(date_time);\",\n \"\\tlongVersion = alloc(len);\\n\\tif (longVersion == NULL)\\n\\t longVersion = VIM_VERSION_LONG;\\n\\telse\\n\\t vim_snprintf(longVersion, len, msg,\\n\\t\\t VIM_VERSION_LONG_ONLY, VIM_VERSION_DATE_ONLY, date_time);\\n }\\n}\\n# endif\\n#else\\nchar\\t*longVersion = VIM_VERSION_LONG;\",\n \" void\\ninit_longVersion(void)\\n{\\n // nothing to do\\n}\\n#endif\",\n \"static char *(features[]) =\\n{\\n#ifdef HAVE_ACL\\n\\t\\\"+acl\\\",\\n#else\\n\\t\\\"-acl\\\",\\n#endif\\n#ifdef AMIGA\\t\\t// only for Amiga systems\\n# ifdef FEAT_ARP\\n\\t\\\"+ARP\\\",\\n# else\\n\\t\\\"-ARP\\\",\\n# endif\\n#endif\\n#ifdef FEAT_ARABIC\\n\\t\\\"+arabic\\\",\\n#else\\n\\t\\\"-arabic\\\",\\n#endif\\n\\t\\\"+autocmd\\\",\\n#ifdef FEAT_AUTOCHDIR\\n \\\"+autochdir\\\",\\n#else\\n \\\"-autochdir\\\",\\n#endif\\n#ifdef FEAT_AUTOSERVERNAME\\n\\t\\\"+autoservername\\\",\\n#else\\n\\t\\\"-autoservername\\\",\\n#endif\\n#ifdef FEAT_BEVAL_GUI\\n\\t\\\"+balloon_eval\\\",\\n#else\\n\\t\\\"-balloon_eval\\\",\\n#endif\\n#ifdef FEAT_BEVAL_TERM\\n\\t\\\"+balloon_eval_term\\\",\\n#else\\n\\t\\\"-balloon_eval_term\\\",\\n#endif\\n#ifdef FEAT_BROWSE\\n\\t\\\"+browse\\\",\\n#else\\n\\t\\\"-browse\\\",\\n#endif\\n#ifdef NO_BUILTIN_TCAPS\\n\\t\\\"-builtin_terms\\\",\\n#endif\\n#ifdef SOME_BUILTIN_TCAPS\\n\\t\\\"+builtin_terms\\\",\\n#endif\\n#ifdef ALL_BUILTIN_TCAPS\\n\\t\\\"++builtin_terms\\\",\\n#endif\\n#ifdef FEAT_BYTEOFF\\n\\t\\\"+byte_offset\\\",\\n#else\\n\\t\\\"-byte_offset\\\",\\n#endif\\n#ifdef FEAT_JOB_CHANNEL\\n\\t\\\"+channel\\\",\\n#else\\n\\t\\\"-channel\\\",\\n#endif\\n#ifdef FEAT_CINDENT\\n\\t\\\"+cindent\\\",\\n#else\\n\\t\\\"-cindent\\\",\\n#endif\\n#ifdef FEAT_CLIENTSERVER\\n\\t\\\"+clientserver\\\",\\n#else\\n\\t\\\"-clientserver\\\",\\n#endif\\n#ifdef FEAT_CLIPBOARD\\n\\t\\\"+clipboard\\\",\\n#else\\n\\t\\\"-clipboard\\\",\\n#endif\\n\\t\\\"+cmdline_compl\\\",\\n\\t\\\"+cmdline_hist\\\",\\n#ifdef FEAT_CMDL_INFO\\n\\t\\\"+cmdline_info\\\",\\n#else\\n\\t\\\"-cmdline_info\\\",\\n#endif\\n\\t\\\"+comments\\\",\\n#ifdef FEAT_CONCEAL\\n\\t\\\"+conceal\\\",\\n#else\\n\\t\\\"-conceal\\\",\\n#endif\\n#ifdef FEAT_CRYPT\\n\\t\\\"+cryptv\\\",\\n#else\\n\\t\\\"-cryptv\\\",\\n#endif\\n#ifdef FEAT_CSCOPE\\n\\t\\\"+cscope\\\",\\n#else\\n\\t\\\"-cscope\\\",\\n#endif\\n\\t\\\"+cursorbind\\\",\\n#ifdef CURSOR_SHAPE\\n\\t\\\"+cursorshape\\\",\\n#else\\n\\t\\\"-cursorshape\\\",\\n#endif\\n#if defined(FEAT_CON_DIALOG) && defined(FEAT_GUI_DIALOG)\\n\\t\\\"+dialog_con_gui\\\",\\n#else\\n# if defined(FEAT_CON_DIALOG)\\n\\t\\\"+dialog_con\\\",\\n# else\\n# if defined(FEAT_GUI_DIALOG)\\n\\t\\\"+dialog_gui\\\",\\n# else\\n\\t\\\"-dialog\\\",\\n# endif\\n# endif\\n#endif\\n#ifdef FEAT_DIFF\\n\\t\\\"+diff\\\",\\n#else\\n\\t\\\"-diff\\\",\\n#endif\\n#ifdef FEAT_DIGRAPHS\\n\\t\\\"+digraphs\\\",\\n#else\\n\\t\\\"-digraphs\\\",\\n#endif\\n#ifdef FEAT_GUI_MSWIN\\n# ifdef FEAT_DIRECTX\\n\\t\\\"+directx\\\",\\n# else\\n\\t\\\"-directx\\\",\\n# endif\\n#endif\\n#ifdef FEAT_DND\\n\\t\\\"+dnd\\\",\\n#else\\n\\t\\\"-dnd\\\",\\n#endif\\n\\t\\\"-ebcdic\\\",\\n#ifdef FEAT_EMACS_TAGS\\n\\t\\\"+emacs_tags\\\",\\n#else\\n\\t\\\"-emacs_tags\\\",\\n#endif\\n#ifdef FEAT_EVAL\\n\\t\\\"+eval\\\",\\n#else\\n\\t\\\"-eval\\\",\\n#endif\\n\\t\\\"+ex_extra\\\",\\n#ifdef FEAT_SEARCH_EXTRA\\n\\t\\\"+extra_search\\\",\\n#else\\n\\t\\\"-extra_search\\\",\\n#endif\\n\\t\\\"-farsi\\\",\\n#ifdef FEAT_SEARCHPATH\\n\\t\\\"+file_in_path\\\",\\n#else\\n\\t\\\"-file_in_path\\\",\\n#endif\\n#ifdef FEAT_FIND_ID\\n\\t\\\"+find_in_path\\\",\\n#else\\n\\t\\\"-find_in_path\\\",\\n#endif\\n#ifdef FEAT_FLOAT\\n\\t\\\"+float\\\",\\n#else\\n\\t\\\"-float\\\",\\n#endif\\n#ifdef FEAT_FOLDING\\n\\t\\\"+folding\\\",\\n#else\\n\\t\\\"-folding\\\",\\n#endif\\n#ifdef FEAT_FOOTER\\n\\t\\\"+footer\\\",\\n#else\\n\\t\\\"-footer\\\",\\n#endif\\n\\t // only interesting on Unix systems\\n#if !defined(USE_SYSTEM) && defined(UNIX)\\n\\t\\\"+fork()\\\",\\n#endif\\n#ifdef FEAT_GETTEXT\\n# ifdef DYNAMIC_GETTEXT\\n\\t\\\"+gettext/dyn\\\",\\n# else\\n\\t\\\"+gettext\\\",\\n# endif\\n#else\\n\\t\\\"-gettext\\\",\\n#endif\\n\\t\\\"-hangul_input\\\",\\n#if (defined(HAVE_ICONV_H) && defined(USE_ICONV)) || defined(DYNAMIC_ICONV)\\n# ifdef DYNAMIC_ICONV\\n\\t\\\"+iconv/dyn\\\",\\n# else\\n\\t\\\"+iconv\\\",\\n# endif\\n#else\\n\\t\\\"-iconv\\\",\\n#endif\\n\\t\\\"+insert_expand\\\",\\n#ifdef FEAT_IPV6\\n\\t\\\"+ipv6\\\",\\n#else\\n\\t\\\"-ipv6\\\",\\n#endif\\n#ifdef FEAT_JOB_CHANNEL\\n\\t\\\"+job\\\",\\n#else\\n\\t\\\"-job\\\",\\n#endif\\n\\t\\\"+jumplist\\\",\\n#ifdef FEAT_KEYMAP\\n\\t\\\"+keymap\\\",\\n#else\\n\\t\\\"-keymap\\\",\\n#endif\\n#ifdef FEAT_EVAL\\n\\t\\\"+lambda\\\",\\n#else\\n\\t\\\"-lambda\\\",\\n#endif\\n#ifdef FEAT_LANGMAP\\n\\t\\\"+langmap\\\",\\n#else\\n\\t\\\"-langmap\\\",\\n#endif\\n#ifdef FEAT_LIBCALL\\n\\t\\\"+libcall\\\",\\n#else\\n\\t\\\"-libcall\\\",\\n#endif\\n#ifdef FEAT_LINEBREAK\\n\\t\\\"+linebreak\\\",\\n#else\\n\\t\\\"-linebreak\\\",\\n#endif\\n#ifdef FEAT_LISP\\n\\t\\\"+lispindent\\\",\\n#else\\n\\t\\\"-lispindent\\\",\\n#endif\\n\\t\\\"+listcmds\\\",\\n\\t\\\"+localmap\\\",\\n#ifdef FEAT_LUA\\n# ifdef DYNAMIC_LUA\\n\\t\\\"+lua/dyn\\\",\\n# else\\n\\t\\\"+lua\\\",\\n# endif\\n#else\\n\\t\\\"-lua\\\",\\n#endif\\n#ifdef FEAT_MENU\\n\\t\\\"+menu\\\",\\n#else\\n\\t\\\"-menu\\\",\\n#endif\\n#ifdef FEAT_SESSION\\n\\t\\\"+mksession\\\",\\n#else\\n\\t\\\"-mksession\\\",\\n#endif\\n\\t\\\"+modify_fname\\\",\\n\\t\\\"+mouse\\\",\\n#ifdef FEAT_MOUSESHAPE\\n\\t\\\"+mouseshape\\\",\\n#else\\n\\t\\\"-mouseshape\\\",\\n#endif\",\n \"#if defined(UNIX) || defined(VMS)\\n# ifdef FEAT_MOUSE_DEC\\n\\t\\\"+mouse_dec\\\",\\n# else\\n\\t\\\"-mouse_dec\\\",\\n# endif\\n# ifdef FEAT_MOUSE_GPM\\n# ifdef DYNAMIC_GPM\\n\\t\\\"+mouse_gpm/dyn\\\",\\n# else\\n\\t\\\"+mouse_gpm\\\",\\n# endif\\n# else\\n\\t\\\"-mouse_gpm\\\",\\n# endif\\n# ifdef FEAT_MOUSE_JSB\\n\\t\\\"+mouse_jsbterm\\\",\\n# else\\n\\t\\\"-mouse_jsbterm\\\",\\n# endif\\n# ifdef FEAT_MOUSE_NET\\n\\t\\\"+mouse_netterm\\\",\\n# else\\n\\t\\\"-mouse_netterm\\\",\\n# endif\\n#endif\",\n \"#ifdef __QNX__\\n# ifdef FEAT_MOUSE_PTERM\\n\\t\\\"+mouse_pterm\\\",\\n# else\\n\\t\\\"-mouse_pterm\\\",\\n# endif\\n#endif\",\n \"#if defined(UNIX) || defined(VMS)\\n\\t\\\"+mouse_sgr\\\",\\n# ifdef FEAT_SYSMOUSE\\n\\t\\\"+mouse_sysmouse\\\",\\n# else\\n\\t\\\"-mouse_sysmouse\\\",\\n# endif\\n# ifdef FEAT_MOUSE_URXVT\\n\\t\\\"+mouse_urxvt\\\",\\n# else\\n\\t\\\"-mouse_urxvt\\\",\\n# endif\\n\\t\\\"+mouse_xterm\\\",\\n#endif\",\n \"#ifdef FEAT_MBYTE_IME\\n# ifdef DYNAMIC_IME\\n\\t\\\"+multi_byte_ime/dyn\\\",\\n# else\\n\\t\\\"+multi_byte_ime\\\",\\n# endif\\n#else\\n\\t\\\"+multi_byte\\\",\\n#endif\\n#ifdef FEAT_MULTI_LANG\\n\\t\\\"+multi_lang\\\",\\n#else\\n\\t\\\"-multi_lang\\\",\\n#endif\\n#ifdef FEAT_MZSCHEME\\n# ifdef DYNAMIC_MZSCHEME\\n\\t\\\"+mzscheme/dyn\\\",\\n# else\\n\\t\\\"+mzscheme\\\",\\n# endif\\n#else\\n\\t\\\"-mzscheme\\\",\\n#endif\\n#ifdef FEAT_NETBEANS_INTG\\n\\t\\\"+netbeans_intg\\\",\\n#else\\n\\t\\\"-netbeans_intg\\\",\\n#endif\\n\\t\\\"+num64\\\",\\n#ifdef FEAT_GUI_MSWIN\\n# ifdef FEAT_OLE\\n\\t\\\"+ole\\\",\\n# else\\n\\t\\\"-ole\\\",\\n# endif\\n#endif\\n#ifdef FEAT_EVAL\\n\\t\\\"+packages\\\",\\n#else\\n\\t\\\"-packages\\\",\\n#endif\\n#ifdef FEAT_PATH_EXTRA\\n\\t\\\"+path_extra\\\",\\n#else\\n\\t\\\"-path_extra\\\",\\n#endif\\n#ifdef FEAT_PERL\\n# ifdef DYNAMIC_PERL\\n\\t\\\"+perl/dyn\\\",\\n# else\\n\\t\\\"+perl\\\",\\n# endif\\n#else\\n\\t\\\"-perl\\\",\\n#endif\\n#ifdef FEAT_PERSISTENT_UNDO\\n\\t\\\"+persistent_undo\\\",\\n#else\\n\\t\\\"-persistent_undo\\\",\\n#endif\\n#ifdef FEAT_PROP_POPUP\\n\\t\\\"+popupwin\\\",\\n#else\\n\\t\\\"-popupwin\\\",\\n#endif\\n#ifdef FEAT_PRINTER\\n# ifdef FEAT_POSTSCRIPT\\n\\t\\\"+postscript\\\",\\n# else\\n\\t\\\"-postscript\\\",\\n# endif\\n\\t\\\"+printer\\\",\\n#else\\n\\t\\\"-printer\\\",\\n#endif\\n#ifdef FEAT_PROFILE\\n\\t\\\"+profile\\\",\\n#else\\n\\t\\\"-profile\\\",\\n#endif\\n#ifdef FEAT_PYTHON\\n# ifdef DYNAMIC_PYTHON\\n\\t\\\"+python/dyn\\\",\\n# else\\n\\t\\\"+python\\\",\\n# endif\\n#else\\n\\t\\\"-python\\\",\\n#endif\\n#ifdef FEAT_PYTHON3\\n# ifdef DYNAMIC_PYTHON3\\n\\t\\\"+python3/dyn\\\",\\n# else\\n\\t\\\"+python3\\\",\\n# endif\\n#else\\n\\t\\\"-python3\\\",\\n#endif\\n#ifdef FEAT_QUICKFIX\\n\\t\\\"+quickfix\\\",\\n#else\\n\\t\\\"-quickfix\\\",\\n#endif\\n#ifdef FEAT_RELTIME\\n\\t\\\"+reltime\\\",\\n#else\\n\\t\\\"-reltime\\\",\\n#endif\\n#ifdef FEAT_RIGHTLEFT\\n\\t\\\"+rightleft\\\",\\n#else\\n\\t\\\"-rightleft\\\",\\n#endif\\n#ifdef FEAT_RUBY\\n# ifdef DYNAMIC_RUBY\\n\\t\\\"+ruby/dyn\\\",\\n# else\\n\\t\\\"+ruby\\\",\\n# endif\\n#else\\n\\t\\\"-ruby\\\",\\n#endif\\n\\t\\\"+scrollbind\\\",\\n#ifdef FEAT_SIGNS\\n\\t\\\"+signs\\\",\\n#else\\n\\t\\\"-signs\\\",\\n#endif\\n#ifdef FEAT_SMARTINDENT\\n\\t\\\"+smartindent\\\",\\n#else\\n\\t\\\"-smartindent\\\",\\n#endif\\n#ifdef FEAT_SODIUM\\n# ifdef DYNAMIC_SODIUM\\n\\t\\\"+sodium/dyn\\\",\\n# else\\n\\t\\\"+sodium\\\",\\n# endif\\n#else\\n\\t\\\"-sodium\\\",\\n#endif\\n#ifdef FEAT_SOUND\\n\\t\\\"+sound\\\",\\n#else\\n\\t\\\"-sound\\\",\\n#endif\\n#ifdef FEAT_SPELL\\n\\t\\\"+spell\\\",\\n#else\\n\\t\\\"-spell\\\",\\n#endif\\n#ifdef STARTUPTIME\\n\\t\\\"+startuptime\\\",\\n#else\\n\\t\\\"-startuptime\\\",\\n#endif\\n#ifdef FEAT_STL_OPT\\n\\t\\\"+statusline\\\",\\n#else\\n\\t\\\"-statusline\\\",\\n#endif\\n\\t\\\"-sun_workshop\\\",\\n#ifdef FEAT_SYN_HL\\n\\t\\\"+syntax\\\",\\n#else\\n\\t\\\"-syntax\\\",\\n#endif\\n\\t // only interesting on Unix systems\\n#if defined(USE_SYSTEM) && defined(UNIX)\\n\\t\\\"+system()\\\",\\n#endif\\n\\t\\\"+tag_binary\\\",\\n\\t\\\"-tag_old_static\\\",\\n\\t\\\"-tag_any_white\\\",\\n#ifdef FEAT_TCL\\n# ifdef DYNAMIC_TCL\\n\\t\\\"+tcl/dyn\\\",\\n# else\\n\\t\\\"+tcl\\\",\\n# endif\\n#else\\n\\t\\\"-tcl\\\",\\n#endif\\n#ifdef FEAT_TERMGUICOLORS\\n\\t\\\"+termguicolors\\\",\\n#else\\n\\t\\\"-termguicolors\\\",\\n#endif\\n#ifdef FEAT_TERMINAL\\n\\t\\\"+terminal\\\",\\n#else\\n\\t\\\"-terminal\\\",\\n#endif\\n#if defined(UNIX)\\n// only Unix can have terminfo instead of termcap\\n# ifdef TERMINFO\\n\\t\\\"+terminfo\\\",\\n# else\\n\\t\\\"-terminfo\\\",\\n# endif\\n#endif\\n#ifdef FEAT_TERMRESPONSE\\n\\t\\\"+termresponse\\\",\\n#else\\n\\t\\\"-termresponse\\\",\\n#endif\\n#ifdef FEAT_TEXTOBJ\\n\\t\\\"+textobjects\\\",\\n#else\\n\\t\\\"-textobjects\\\",\\n#endif\\n#ifdef FEAT_PROP_POPUP\\n\\t\\\"+textprop\\\",\\n#else\\n\\t\\\"-textprop\\\",\\n#endif\\n#if !defined(UNIX)\\n// unix always includes termcap support\\n# ifdef HAVE_TGETENT\\n\\t\\\"+tgetent\\\",\\n# else\\n\\t\\\"-tgetent\\\",\\n# endif\\n#endif\\n#ifdef FEAT_TIMERS\\n\\t\\\"+timers\\\",\\n#else\\n\\t\\\"-timers\\\",\\n#endif\\n\\t\\\"+title\\\",\\n#ifdef FEAT_TOOLBAR\\n\\t\\\"+toolbar\\\",\\n#else\\n\\t\\\"-toolbar\\\",\\n#endif\\n\\t\\\"+user_commands\\\",\\n#ifdef FEAT_VARTABS\\n\\t\\\"+vartabs\\\",\\n#else\\n\\t\\\"-vartabs\\\",\\n#endif\\n\\t\\\"+vertsplit\\\",\\n\\t\\\"+vim9script\\\",\\n#ifdef FEAT_VIMINFO\\n\\t\\\"+viminfo\\\",\\n#else\\n\\t\\\"-viminfo\\\",\\n#endif\\n\\t\\\"+virtualedit\\\",\\n\\t\\\"+visual\\\",\\n\\t\\\"+visualextra\\\",\\n\\t\\\"+vreplace\\\",\\n#ifdef MSWIN\\n# ifdef FEAT_VTP\\n\\t\\\"+vtp\\\",\\n# else\\n\\t\\\"-vtp\\\",\\n# endif\\n#endif\\n#ifdef FEAT_WILDIGN\\n\\t\\\"+wildignore\\\",\\n#else\\n\\t\\\"-wildignore\\\",\\n#endif\\n#ifdef FEAT_WILDMENU\\n\\t\\\"+wildmenu\\\",\\n#else\\n\\t\\\"-wildmenu\\\",\\n#endif\\n\\t\\\"+windows\\\",\\n#ifdef FEAT_WRITEBACKUP\\n\\t\\\"+writebackup\\\",\\n#else\\n\\t\\\"-writebackup\\\",\\n#endif\\n#if defined(UNIX) || defined(VMS)\\n# ifdef FEAT_X11\\n\\t\\\"+X11\\\",\\n# else\\n\\t\\\"-X11\\\",\\n# endif\\n#endif\\n#ifdef FEAT_XFONTSET\\n\\t\\\"+xfontset\\\",\\n#else\\n\\t\\\"-xfontset\\\",\\n#endif\\n#ifdef FEAT_XIM\\n\\t\\\"+xim\\\",\\n#else\\n\\t\\\"-xim\\\",\\n#endif\\n#if defined(MSWIN)\\n# ifdef FEAT_XPM_W32\\n\\t\\\"+xpm_w32\\\",\\n# else\\n\\t\\\"-xpm_w32\\\",\\n# endif\\n#elif defined(HAVE_XPM)\\n\\t\\\"+xpm\\\",\\n#else\\n\\t\\\"-xpm\\\",\\n#endif\\n#if defined(UNIX) || defined(VMS)\\n# if defined(USE_XSMP_INTERACT)\\n\\t\\\"+xsmp_interact\\\",\\n# elif defined(USE_XSMP)\\n\\t\\\"+xsmp\\\",\\n# else\\n\\t\\\"-xsmp\\\",\\n# endif\\n# ifdef FEAT_XCLIPBOARD\\n\\t\\\"+xterm_clipboard\\\",\\n# else\\n\\t\\\"-xterm_clipboard\\\",\\n# endif\\n#endif\\n#ifdef FEAT_XTERM_SAVE\\n\\t\\\"+xterm_save\\\",\\n#else\\n\\t\\\"-xterm_save\\\",\\n#endif\\n\\tNULL\\n};\",\n \"static int included_patches[] =\\n{ /* Add new patch number below this line */\",\n \"\",\n \"/**/\\n 4918,\\n/**/\\n 4917,\\n/**/\\n 4916,\\n/**/\\n 4915,\\n/**/\\n 4914,\\n/**/\\n 4913,\\n/**/\\n 4912,\\n/**/\\n 4911,\\n/**/\\n 4910,\\n/**/\\n 4909,\\n/**/\\n 4908,\\n/**/\\n 4907,\\n/**/\\n 4906,\\n/**/\\n 4905,\\n/**/\\n 4904,\\n/**/\\n 4903,\\n/**/\\n 4902,\\n/**/\\n 4901,\\n/**/\\n 4900,\\n/**/\\n 4899,\\n/**/\\n 4898,\\n/**/\\n 4897,\\n/**/\\n 4896,\\n/**/\\n 4895,\\n/**/\\n 4894,\\n/**/\\n 4893,\\n/**/\\n 4892,\\n/**/\\n 4891,\\n/**/\\n 4890,\\n/**/\\n 4889,\\n/**/\\n 4888,\\n/**/\\n 4887,\\n/**/\\n 4886,\\n/**/\\n 4885,\\n/**/\\n 4884,\\n/**/\\n 4883,\\n/**/\\n 4882,\\n/**/\\n 4881,\\n/**/\\n 4880,\\n/**/\\n 4879,\\n/**/\\n 4878,\\n/**/\\n 4877,\\n/**/\\n 4876,\\n/**/\\n 4875,\\n/**/\\n 4874,\\n/**/\\n 4873,\\n/**/\\n 4872,\\n/**/\\n 4871,\\n/**/\\n 4870,\\n/**/\\n 4869,\\n/**/\\n 4868,\\n/**/\\n 4867,\\n/**/\\n 4866,\\n/**/\\n 4865,\\n/**/\\n 4864,\\n/**/\\n 4863,\\n/**/\\n 4862,\\n/**/\\n 4861,\\n/**/\\n 4860,\\n/**/\\n 4859,\\n/**/\\n 4858,\\n/**/\\n 4857,\\n/**/\\n 4856,\\n/**/\\n 4855,\\n/**/\\n 4854,\\n/**/\\n 4853,\\n/**/\\n 4852,\\n/**/\\n 4851,\\n/**/\\n 4850,\\n/**/\\n 4849,\\n/**/\\n 4848,\\n/**/\\n 4847,\\n/**/\\n 4846,\\n/**/\\n 4845,\\n/**/\\n 4844,\\n/**/\\n 4843,\\n/**/\\n 4842,\\n/**/\\n 4841,\\n/**/\\n 4840,\\n/**/\\n 4839,\\n/**/\\n 4838,\\n/**/\\n 4837,\\n/**/\\n 4836,\\n/**/\\n 4835,\\n/**/\\n 4834,\\n/**/\\n 4833,\\n/**/\\n 4832,\\n/**/\\n 4831,\\n/**/\\n 4830,\\n/**/\\n 4829,\\n/**/\\n 4828,\\n/**/\\n 4827,\\n/**/\\n 4826,\\n/**/\\n 4825,\\n/**/\\n 4824,\\n/**/\\n 4823,\\n/**/\\n 4822,\\n/**/\\n 4821,\\n/**/\\n 4820,\\n/**/\\n 4819,\\n/**/\\n 4818,\\n/**/\\n 4817,\\n/**/\\n 4816,\\n/**/\\n 4815,\\n/**/\\n 4814,\\n/**/\\n 4813,\\n/**/\\n 4812,\\n/**/\\n 4811,\\n/**/\\n 4810,\\n/**/\\n 4809,\\n/**/\\n 4808,\\n/**/\\n 4807,\\n/**/\\n 4806,\\n/**/\\n 4805,\\n/**/\\n 4804,\\n/**/\\n 4803,\\n/**/\\n 4802,\\n/**/\\n 4801,\\n/**/\\n 4800,\\n/**/\\n 4799,\\n/**/\\n 4798,\\n/**/\\n 4797,\\n/**/\\n 4796,\\n/**/\\n 4795,\\n/**/\\n 4794,\\n/**/\\n 4793,\\n/**/\\n 4792,\\n/**/\\n 4791,\\n/**/\\n 4790,\\n/**/\\n 4789,\\n/**/\\n 4788,\\n/**/\\n 4787,\\n/**/\\n 4786,\\n/**/\\n 4785,\\n/**/\\n 4784,\\n/**/\\n 4783,\\n/**/\\n 4782,\\n/**/\\n 4781,\\n/**/\\n 4780,\\n/**/\\n 4779,\\n/**/\\n 4778,\\n/**/\\n 4777,\\n/**/\\n 4776,\\n/**/\\n 4775,\\n/**/\\n 4774,\\n/**/\\n 4773,\\n/**/\\n 4772,\\n/**/\\n 4771,\\n/**/\\n 4770,\\n/**/\\n 4769,\\n/**/\\n 4768,\\n/**/\\n 4767,\\n/**/\\n 4766,\\n/**/\\n 4765,\\n/**/\\n 4764,\\n/**/\\n 4763,\\n/**/\\n 4762,\\n/**/\\n 4761,\\n/**/\\n 4760,\\n/**/\\n 4759,\\n/**/\\n 4758,\\n/**/\\n 4757,\\n/**/\\n 4756,\\n/**/\\n 4755,\\n/**/\\n 4754,\\n/**/\\n 4753,\\n/**/\\n 4752,\\n/**/\\n 4751,\\n/**/\\n 4750,\\n/**/\\n 4749,\\n/**/\\n 4748,\\n/**/\\n 4747,\\n/**/\\n 4746,\\n/**/\\n 4745,\\n/**/\\n 4744,\\n/**/\\n 4743,\\n/**/\\n 4742,\\n/**/\\n 4741,\\n/**/\\n 4740,\\n/**/\\n 4739,\\n/**/\\n 4738,\\n/**/\\n 4737,\\n/**/\\n 4736,\\n/**/\\n 4735,\\n/**/\\n 4734,\\n/**/\\n 4733,\\n/**/\\n 4732,\\n/**/\\n 4731,\\n/**/\\n 4730,\\n/**/\\n 4729,\\n/**/\\n 4728,\\n/**/\\n 4727,\\n/**/\\n 4726,\\n/**/\\n 4725,\\n/**/\\n 4724,\\n/**/\\n 4723,\\n/**/\\n 4722,\\n/**/\\n 4721,\\n/**/\\n 4720,\\n/**/\\n 4719,\\n/**/\\n 4718,\\n/**/\\n 4717,\\n/**/\\n 4716,\\n/**/\\n 4715,\\n/**/\\n 4714,\\n/**/\\n 4713,\\n/**/\\n 4712,\\n/**/\\n 4711,\\n/**/\\n 4710,\\n/**/\\n 4709,\\n/**/\\n 4708,\\n/**/\\n 4707,\\n/**/\\n 4706,\\n/**/\\n 4705,\\n/**/\\n 4704,\\n/**/\\n 4703,\\n/**/\\n 4702,\\n/**/\\n 4701,\\n/**/\\n 4700,\\n/**/\\n 4699,\\n/**/\\n 4698,\\n/**/\\n 4697,\\n/**/\\n 4696,\\n/**/\\n 4695,\\n/**/\\n 4694,\\n/**/\\n 4693,\\n/**/\\n 4692,\\n/**/\\n 4691,\\n/**/\\n 4690,\\n/**/\\n 4689,\\n/**/\\n 4688,\\n/**/\\n 4687,\\n/**/\\n 4686,\\n/**/\\n 4685,\\n/**/\\n 4684,\\n/**/\\n 4683,\\n/**/\\n 4682,\\n/**/\\n 4681,\\n/**/\\n 4680,\\n/**/\\n 4679,\\n/**/\\n 4678,\\n/**/\\n 4677,\\n/**/\\n 4676,\\n/**/\\n 4675,\\n/**/\\n 4674,\\n/**/\\n 4673,\\n/**/\\n 4672,\\n/**/\\n 4671,\\n/**/\\n 4670,\\n/**/\\n 4669,\\n/**/\\n 4668,\\n/**/\\n 4667,\\n/**/\\n 4666,\\n/**/\\n 4665,\\n/**/\\n 4664,\\n/**/\\n 4663,\\n/**/\\n 4662,\\n/**/\\n 4661,\\n/**/\\n 4660,\\n/**/\\n 4659,\\n/**/\\n 4658,\\n/**/\\n 4657,\\n/**/\\n 4656,\\n/**/\\n 4655,\\n/**/\\n 4654,\\n/**/\\n 4653,\\n/**/\\n 4652,\\n/**/\\n 4651,\\n/**/\\n 4650,\\n/**/\\n 4649,\\n/**/\\n 4648,\\n/**/\\n 4647,\\n/**/\\n 4646,\\n/**/\\n 4645,\\n/**/\\n 4644,\\n/**/\\n 4643,\\n/**/\\n 4642,\\n/**/\\n 4641,\\n/**/\\n 4640,\\n/**/\\n 4639,\\n/**/\\n 4638,\\n/**/\\n 4637,\\n/**/\\n 4636,\\n/**/\\n 4635,\\n/**/\\n 4634,\\n/**/\\n 4633,\\n/**/\\n 4632,\\n/**/\\n 4631,\\n/**/\\n 4630,\\n/**/\\n 4629,\\n/**/\\n 4628,\\n/**/\\n 4627,\\n/**/\\n 4626,\\n/**/\\n 4625,\\n/**/\\n 4624,\\n/**/\\n 4623,\\n/**/\\n 4622,\\n/**/\\n 4621,\\n/**/\\n 4620,\\n/**/\\n 4619,\\n/**/\\n 4618,\\n/**/\\n 4617,\\n/**/\\n 4616,\\n/**/\\n 4615,\\n/**/\\n 4614,\\n/**/\\n 4613,\\n/**/\\n 4612,\\n/**/\\n 4611,\\n/**/\\n 4610,\\n/**/\\n 4609,\\n/**/\\n 4608,\\n/**/\\n 4607,\\n/**/\\n 4606,\\n/**/\\n 4605,\\n/**/\\n 4604,\\n/**/\\n 4603,\\n/**/\\n 4602,\\n/**/\\n 4601,\\n/**/\\n 4600,\\n/**/\\n 4599,\\n/**/\\n 4598,\\n/**/\\n 4597,\\n/**/\\n 4596,\\n/**/\\n 4595,\\n/**/\\n 4594,\\n/**/\\n 4593,\\n/**/\\n 4592,\\n/**/\\n 4591,\\n/**/\\n 4590,\\n/**/\\n 4589,\\n/**/\\n 4588,\\n/**/\\n 4587,\\n/**/\\n 4586,\\n/**/\\n 4585,\\n/**/\\n 4584,\\n/**/\\n 4583,\\n/**/\\n 4582,\\n/**/\\n 4581,\\n/**/\\n 4580,\\n/**/\\n 4579,\\n/**/\\n 4578,\\n/**/\\n 4577,\\n/**/\\n 4576,\\n/**/\\n 4575,\\n/**/\\n 4574,\\n/**/\\n 4573,\\n/**/\\n 4572,\\n/**/\\n 4571,\\n/**/\\n 4570,\\n/**/\\n 4569,\\n/**/\\n 4568,\\n/**/\\n 4567,\\n/**/\\n 4566,\\n/**/\\n 4565,\\n/**/\\n 4564,\\n/**/\\n 4563,\\n/**/\\n 4562,\\n/**/\\n 4561,\\n/**/\\n 4560,\\n/**/\\n 4559,\\n/**/\\n 4558,\\n/**/\\n 4557,\\n/**/\\n 4556,\\n/**/\\n 4555,\\n/**/\\n 4554,\\n/**/\\n 4553,\\n/**/\\n 4552,\\n/**/\\n 4551,\\n/**/\\n 4550,\\n/**/\\n 4549,\\n/**/\\n 4548,\\n/**/\\n 4547,\\n/**/\\n 4546,\\n/**/\\n 4545,\\n/**/\\n 4544,\\n/**/\\n 4543,\\n/**/\\n 4542,\\n/**/\\n 4541,\\n/**/\\n 4540,\\n/**/\\n 4539,\\n/**/\\n 4538,\\n/**/\\n 4537,\\n/**/\\n 4536,\\n/**/\\n 4535,\\n/**/\\n 4534,\\n/**/\\n 4533,\\n/**/\\n 4532,\\n/**/\\n 4531,\\n/**/\\n 4530,\\n/**/\\n 4529,\\n/**/\\n 4528,\\n/**/\\n 4527,\\n/**/\\n 4526,\\n/**/\\n 4525,\\n/**/\\n 4524,\\n/**/\\n 4523,\\n/**/\\n 4522,\\n/**/\\n 4521,\\n/**/\\n 4520,\\n/**/\\n 4519,\\n/**/\\n 4518,\\n/**/\\n 4517,\\n/**/\\n 4516,\\n/**/\\n 4515,\\n/**/\\n 4514,\\n/**/\\n 4513,\\n/**/\\n 4512,\\n/**/\\n 4511,\\n/**/\\n 4510,\\n/**/\\n 4509,\\n/**/\\n 4508,\\n/**/\\n 4507,\\n/**/\\n 4506,\\n/**/\\n 4505,\\n/**/\\n 4504,\\n/**/\\n 4503,\\n/**/\\n 4502,\\n/**/\\n 4501,\\n/**/\\n 4500,\\n/**/\\n 4499,\\n/**/\\n 4498,\\n/**/\\n 4497,\\n/**/\\n 4496,\\n/**/\\n 4495,\\n/**/\\n 4494,\\n/**/\\n 4493,\\n/**/\\n 4492,\\n/**/\\n 4491,\\n/**/\\n 4490,\\n/**/\\n 4489,\\n/**/\\n 4488,\\n/**/\\n 4487,\\n/**/\\n 4486,\\n/**/\\n 4485,\\n/**/\\n 4484,\\n/**/\\n 4483,\\n/**/\\n 4482,\\n/**/\\n 4481,\\n/**/\\n 4480,\\n/**/\\n 4479,\\n/**/\\n 4478,\\n/**/\\n 4477,\\n/**/\\n 4476,\\n/**/\\n 4475,\\n/**/\\n 4474,\\n/**/\\n 4473,\\n/**/\\n 4472,\\n/**/\\n 4471,\\n/**/\\n 4470,\\n/**/\\n 4469,\\n/**/\\n 4468,\\n/**/\\n 4467,\\n/**/\\n 4466,\\n/**/\\n 4465,\\n/**/\\n 4464,\\n/**/\\n 4463,\\n/**/\\n 4462,\\n/**/\\n 4461,\\n/**/\\n 4460,\\n/**/\\n 4459,\\n/**/\\n 4458,\\n/**/\\n 4457,\\n/**/\\n 4456,\\n/**/\\n 4455,\\n/**/\\n 4454,\\n/**/\\n 4453,\\n/**/\\n 4452,\\n/**/\\n 4451,\\n/**/\\n 4450,\\n/**/\\n 4449,\\n/**/\\n 4448,\\n/**/\\n 4447,\\n/**/\\n 4446,\\n/**/\\n 4445,\\n/**/\\n 4444,\\n/**/\\n 4443,\\n/**/\\n 4442,\\n/**/\\n 4441,\\n/**/\\n 4440,\\n/**/\\n 4439,\\n/**/\\n 4438,\\n/**/\\n 4437,\\n/**/\\n 4436,\\n/**/\\n 4435,\\n/**/\\n 4434,\\n/**/\\n 4433,\\n/**/\\n 4432,\\n/**/\\n 4431,\\n/**/\\n 4430,\\n/**/\\n 4429,\\n/**/\\n 4428,\\n/**/\\n 4427,\\n/**/\\n 4426,\\n/**/\\n 4425,\\n/**/\\n 4424,\\n/**/\\n 4423,\\n/**/\\n 4422,\\n/**/\\n 4421,\\n/**/\\n 4420,\\n/**/\\n 4419,\\n/**/\\n 4418,\\n/**/\\n 4417,\\n/**/\\n 4416,\\n/**/\\n 4415,\\n/**/\\n 4414,\\n/**/\\n 4413,\\n/**/\\n 4412,\\n/**/\\n 4411,\\n/**/\\n 4410,\\n/**/\\n 4409,\\n/**/\\n 4408,\\n/**/\\n 4407,\\n/**/\\n 4406,\\n/**/\\n 4405,\\n/**/\\n 4404,\\n/**/\\n 4403,\\n/**/\\n 4402,\\n/**/\\n 4401,\\n/**/\\n 4400,\\n/**/\\n 4399,\\n/**/\\n 4398,\\n/**/\\n 4397,\\n/**/\\n 4396,\\n/**/\\n 4395,\\n/**/\\n 4394,\\n/**/\\n 4393,\\n/**/\\n 4392,\\n/**/\\n 4391,\\n/**/\\n 4390,\\n/**/\\n 4389,\\n/**/\\n 4388,\\n/**/\\n 4387,\\n/**/\\n 4386,\\n/**/\\n 4385,\\n/**/\\n 4384,\\n/**/\\n 4383,\\n/**/\\n 4382,\\n/**/\\n 4381,\\n/**/\\n 4380,\\n/**/\\n 4379,\\n/**/\\n 4378,\\n/**/\\n 4377,\\n/**/\\n 4376,\\n/**/\\n 4375,\\n/**/\\n 4374,\\n/**/\\n 4373,\\n/**/\\n 4372,\\n/**/\\n 4371,\\n/**/\\n 4370,\\n/**/\\n 4369,\\n/**/\\n 4368,\\n/**/\\n 4367,\\n/**/\\n 4366,\\n/**/\\n 4365,\\n/**/\\n 4364,\\n/**/\\n 4363,\\n/**/\\n 4362,\\n/**/\\n 4361,\\n/**/\\n 4360,\\n/**/\\n 4359,\\n/**/\\n 4358,\\n/**/\\n 4357,\\n/**/\\n 4356,\\n/**/\\n 4355,\\n/**/\\n 4354,\\n/**/\\n 4353,\\n/**/\\n 4352,\\n/**/\\n 4351,\\n/**/\\n 4350,\\n/**/\\n 4349,\\n/**/\\n 4348,\\n/**/\\n 4347,\\n/**/\\n 4346,\\n/**/\\n 4345,\\n/**/\\n 4344,\\n/**/\\n 4343,\\n/**/\\n 4342,\\n/**/\\n 4341,\\n/**/\\n 4340,\\n/**/\\n 4339,\\n/**/\\n 4338,\\n/**/\\n 4337,\\n/**/\\n 4336,\\n/**/\\n 4335,\\n/**/\\n 4334,\\n/**/\\n 4333,\\n/**/\\n 4332,\\n/**/\\n 4331,\\n/**/\\n 4330,\\n/**/\\n 4329,\\n/**/\\n 4328,\\n/**/\\n 4327,\\n/**/\\n 4326,\\n/**/\\n 4325,\\n/**/\\n 4324,\\n/**/\\n 4323,\\n/**/\\n 4322,\\n/**/\\n 4321,\\n/**/\\n 4320,\\n/**/\\n 4319,\\n/**/\\n 4318,\\n/**/\\n 4317,\\n/**/\\n 4316,\\n/**/\\n 4315,\\n/**/\\n 4314,\\n/**/\\n 4313,\\n/**/\\n 4312,\\n/**/\\n 4311,\\n/**/\\n 4310,\\n/**/\\n 4309,\\n/**/\\n 4308,\\n/**/\\n 4307,\\n/**/\\n 4306,\\n/**/\\n 4305,\\n/**/\\n 4304,\\n/**/\\n 4303,\\n/**/\\n 4302,\\n/**/\\n 4301,\\n/**/\\n 4300,\\n/**/\\n 4299,\\n/**/\\n 4298,\\n/**/\\n 4297,\\n/**/\\n 4296,\\n/**/\\n 4295,\\n/**/\\n 4294,\\n/**/\\n 4293,\\n/**/\\n 4292,\\n/**/\\n 4291,\\n/**/\\n 4290,\\n/**/\\n 4289,\\n/**/\\n 4288,\\n/**/\\n 4287,\\n/**/\\n 4286,\\n/**/\\n 4285,\\n/**/\\n 4284,\\n/**/\\n 4283,\\n/**/\\n 4282,\\n/**/\\n 4281,\\n/**/\\n 4280,\\n/**/\\n 4279,\\n/**/\\n 4278,\\n/**/\\n 4277,\\n/**/\\n 4276,\\n/**/\\n 4275,\\n/**/\\n 4274,\\n/**/\\n 4273,\\n/**/\\n 4272,\\n/**/\\n 4271,\\n/**/\\n 4270,\\n/**/\\n 4269,\\n/**/\\n 4268,\\n/**/\\n 4267,\\n/**/\\n 4266,\\n/**/\\n 4265,\\n/**/\\n 4264,\\n/**/\\n 4263,\\n/**/\\n 4262,\\n/**/\\n 4261,\\n/**/\\n 4260,\\n/**/\\n 4259,\\n/**/\\n 4258,\\n/**/\\n 4257,\\n/**/\\n 4256,\\n/**/\\n 4255,\\n/**/\\n 4254,\\n/**/\\n 4253,\\n/**/\\n 4252,\\n/**/\\n 4251,\\n/**/\\n 4250,\\n/**/\\n 4249,\\n/**/\\n 4248,\\n/**/\\n 4247,\\n/**/\\n 4246,\\n/**/\\n 4245,\\n/**/\\n 4244,\\n/**/\\n 4243,\\n/**/\\n 4242,\\n/**/\\n 4241,\\n/**/\\n 4240,\\n/**/\\n 4239,\\n/**/\\n 4238,\\n/**/\\n 4237,\\n/**/\\n 4236,\\n/**/\\n 4235,\\n/**/\\n 4234,\\n/**/\\n 4233,\\n/**/\\n 4232,\\n/**/\\n 4231,\\n/**/\\n 4230,\\n/**/\\n 4229,\\n/**/\\n 4228,\\n/**/\\n 4227,\\n/**/\\n 4226,\\n/**/\\n 4225,\\n/**/\\n 4224,\\n/**/\\n 4223,\\n/**/\\n 4222,\\n/**/\\n 4221,\\n/**/\\n 4220,\\n/**/\\n 4219,\\n/**/\\n 4218,\\n/**/\\n 4217,\\n/**/\\n 4216,\\n/**/\\n 4215,\\n/**/\\n 4214,\\n/**/\\n 4213,\\n/**/\\n 4212,\\n/**/\\n 4211,\\n/**/\\n 4210,\\n/**/\\n 4209,\\n/**/\\n 4208,\\n/**/\\n 4207,\\n/**/\\n 4206,\\n/**/\\n 4205,\\n/**/\\n 4204,\\n/**/\\n 4203,\\n/**/\\n 4202,\\n/**/\\n 4201,\\n/**/\\n 4200,\\n/**/\\n 4199,\\n/**/\\n 4198,\\n/**/\\n 4197,\\n/**/\\n 4196,\\n/**/\\n 4195,\\n/**/\\n 4194,\\n/**/\\n 4193,\\n/**/\\n 4192,\\n/**/\\n 4191,\\n/**/\\n 4190,\\n/**/\\n 4189,\\n/**/\\n 4188,\\n/**/\\n 4187,\\n/**/\\n 4186,\\n/**/\\n 4185,\\n/**/\\n 4184,\\n/**/\\n 4183,\\n/**/\\n 4182,\\n/**/\\n 4181,\\n/**/\\n 4180,\\n/**/\\n 4179,\\n/**/\\n 4178,\\n/**/\\n 4177,\\n/**/\\n 4176,\\n/**/\\n 4175,\\n/**/\\n 4174,\\n/**/\\n 4173,\\n/**/\\n 4172,\\n/**/\\n 4171,\\n/**/\\n 4170,\\n/**/\\n 4169,\\n/**/\\n 4168,\\n/**/\\n 4167,\\n/**/\\n 4166,\\n/**/\\n 4165,\\n/**/\\n 4164,\\n/**/\\n 4163,\\n/**/\\n 4162,\\n/**/\\n 4161,\\n/**/\\n 4160,\\n/**/\\n 4159,\\n/**/\\n 4158,\\n/**/\\n 4157,\\n/**/\\n 4156,\\n/**/\\n 4155,\\n/**/\\n 4154,\\n/**/\\n 4153,\\n/**/\\n 4152,\\n/**/\\n 4151,\\n/**/\\n 4150,\\n/**/\\n 4149,\\n/**/\\n 4148,\\n/**/\\n 4147,\\n/**/\\n 4146,\\n/**/\\n 4145,\\n/**/\\n 4144,\\n/**/\\n 4143,\\n/**/\\n 4142,\\n/**/\\n 4141,\\n/**/\\n 4140,\\n/**/\\n 4139,\\n/**/\\n 4138,\\n/**/\\n 4137,\\n/**/\\n 4136,\\n/**/\\n 4135,\\n/**/\\n 4134,\\n/**/\\n 4133,\\n/**/\\n 4132,\\n/**/\\n 4131,\\n/**/\\n 4130,\\n/**/\\n 4129,\\n/**/\\n 4128,\\n/**/\\n 4127,\\n/**/\\n 4126,\\n/**/\\n 4125,\\n/**/\\n 4124,\\n/**/\\n 4123,\\n/**/\\n 4122,\\n/**/\\n 4121,\\n/**/\\n 4120,\\n/**/\\n 4119,\\n/**/\\n 4118,\\n/**/\\n 4117,\\n/**/\\n 4116,\\n/**/\\n 4115,\\n/**/\\n 4114,\\n/**/\\n 4113,\\n/**/\\n 4112,\\n/**/\\n 4111,\\n/**/\\n 4110,\\n/**/\\n 4109,\\n/**/\\n 4108,\\n/**/\\n 4107,\\n/**/\\n 4106,\\n/**/\\n 4105,\\n/**/\\n 4104,\\n/**/\\n 4103,\\n/**/\\n 4102,\\n/**/\\n 4101,\\n/**/\\n 4100,\\n/**/\\n 4099,\\n/**/\\n 4098,\\n/**/\\n 4097,\\n/**/\\n 4096,\\n/**/\\n 4095,\\n/**/\\n 4094,\\n/**/\\n 4093,\\n/**/\\n 4092,\\n/**/\\n 4091,\\n/**/\\n 4090,\\n/**/\\n 4089,\\n/**/\\n 4088,\\n/**/\\n 4087,\\n/**/\\n 4086,\\n/**/\\n 4085,\\n/**/\\n 4084,\\n/**/\\n 4083,\\n/**/\\n 4082,\\n/**/\\n 4081,\\n/**/\\n 4080,\\n/**/\\n 4079,\\n/**/\\n 4078,\\n/**/\\n 4077,\\n/**/\\n 4076,\\n/**/\\n 4075,\\n/**/\\n 4074,\\n/**/\\n 4073,\\n/**/\\n 4072,\\n/**/\\n 4071,\\n/**/\\n 4070,\\n/**/\\n 4069,\\n/**/\\n 4068,\\n/**/\\n 4067,\\n/**/\\n 4066,\\n/**/\\n 4065,\\n/**/\\n 4064,\\n/**/\\n 4063,\\n/**/\\n 4062,\\n/**/\\n 4061,\\n/**/\\n 4060,\\n/**/\\n 4059,\\n/**/\\n 4058,\\n/**/\\n 4057,\\n/**/\\n 4056,\\n/**/\\n 4055,\\n/**/\\n 4054,\\n/**/\\n 4053,\\n/**/\\n 4052,\\n/**/\\n 4051,\\n/**/\\n 4050,\\n/**/\\n 4049,\\n/**/\\n 4048,\\n/**/\\n 4047,\\n/**/\\n 4046,\\n/**/\\n 4045,\\n/**/\\n 4044,\\n/**/\\n 4043,\\n/**/\\n 4042,\\n/**/\\n 4041,\\n/**/\\n 4040,\\n/**/\\n 4039,\\n/**/\\n 4038,\\n/**/\\n 4037,\\n/**/\\n 4036,\\n/**/\\n 4035,\\n/**/\\n 4034,\\n/**/\\n 4033,\\n/**/\\n 4032,\\n/**/\\n 4031,\\n/**/\\n 4030,\\n/**/\\n 4029,\\n/**/\\n 4028,\\n/**/\\n 4027,\\n/**/\\n 4026,\\n/**/\\n 4025,\\n/**/\\n 4024,\\n/**/\\n 4023,\\n/**/\\n 4022,\\n/**/\\n 4021,\\n/**/\\n 4020,\\n/**/\\n 4019,\\n/**/\\n 4018,\\n/**/\\n 4017,\\n/**/\\n 4016,\\n/**/\\n 4015,\\n/**/\\n 4014,\\n/**/\\n 4013,\\n/**/\\n 4012,\\n/**/\\n 4011,\\n/**/\\n 4010,\\n/**/\\n 4009,\\n/**/\\n 4008,\\n/**/\\n 4007,\\n/**/\\n 4006,\\n/**/\\n 4005,\\n/**/\\n 4004,\\n/**/\\n 4003,\\n/**/\\n 4002,\\n/**/\\n 4001,\\n/**/\\n 4000,\\n/**/\\n 3999,\\n/**/\\n 3998,\\n/**/\\n 3997,\\n/**/\\n 3996,\\n/**/\\n 3995,\\n/**/\\n 3994,\\n/**/\\n 3993,\\n/**/\\n 3992,\\n/**/\\n 3991,\\n/**/\\n 3990,\\n/**/\\n 3989,\\n/**/\\n 3988,\\n/**/\\n 3987,\\n/**/\\n 3986,\\n/**/\\n 3985,\\n/**/\\n 3984,\\n/**/\\n 3983,\\n/**/\\n 3982,\\n/**/\\n 3981,\\n/**/\\n 3980,\\n/**/\\n 3979,\\n/**/\\n 3978,\\n/**/\\n 3977,\\n/**/\\n 3976,\\n/**/\\n 3975,\\n/**/\\n 3974,\\n/**/\\n 3973,\\n/**/\\n 3972,\\n/**/\\n 3971,\\n/**/\\n 3970,\\n/**/\\n 3969,\\n/**/\\n 3968,\\n/**/\\n 3967,\\n/**/\\n 3966,\\n/**/\\n 3965,\\n/**/\\n 3964,\\n/**/\\n 3963,\\n/**/\\n 3962,\\n/**/\\n 3961,\\n/**/\\n 3960,\\n/**/\\n 3959,\\n/**/\\n 3958,\\n/**/\\n 3957,\\n/**/\\n 3956,\\n/**/\\n 3955,\\n/**/\\n 3954,\\n/**/\\n 3953,\\n/**/\\n 3952,\\n/**/\\n 3951,\\n/**/\\n 3950,\\n/**/\\n 3949,\\n/**/\\n 3948,\\n/**/\\n 3947,\\n/**/\\n 3946,\\n/**/\\n 3945,\\n/**/\\n 3944,\\n/**/\\n 3943,\\n/**/\\n 3942,\\n/**/\\n 3941,\\n/**/\\n 3940,\\n/**/\\n 3939,\\n/**/\\n 3938,\\n/**/\\n 3937,\\n/**/\\n 3936,\\n/**/\\n 3935,\\n/**/\\n 3934,\\n/**/\\n 3933,\\n/**/\\n 3932,\\n/**/\\n 3931,\\n/**/\\n 3930,\\n/**/\\n 3929,\\n/**/\\n 3928,\\n/**/\\n 3927,\\n/**/\\n 3926,\\n/**/\\n 3925,\\n/**/\\n 3924,\\n/**/\\n 3923,\\n/**/\\n 3922,\\n/**/\\n 3921,\\n/**/\\n 3920,\\n/**/\\n 3919,\\n/**/\\n 3918,\\n/**/\\n 3917,\\n/**/\\n 3916,\\n/**/\\n 3915,\\n/**/\\n 3914,\\n/**/\\n 3913,\\n/**/\\n 3912,\\n/**/\\n 3911,\\n/**/\\n 3910,\\n/**/\\n 3909,\\n/**/\\n 3908,\\n/**/\\n 3907,\\n/**/\\n 3906,\\n/**/\\n 3905,\\n/**/\\n 3904,\\n/**/\\n 3903,\\n/**/\\n 3902,\\n/**/\\n 3901,\\n/**/\\n 3900,\\n/**/\\n 3899,\\n/**/\\n 3898,\\n/**/\\n 3897,\\n/**/\\n 3896,\\n/**/\\n 3895,\\n/**/\\n 3894,\\n/**/\\n 3893,\\n/**/\\n 3892,\\n/**/\\n 3891,\\n/**/\\n 3890,\\n/**/\\n 3889,\\n/**/\\n 3888,\\n/**/\\n 3887,\\n/**/\\n 3886,\\n/**/\\n 3885,\\n/**/\\n 3884,\\n/**/\\n 3883,\\n/**/\\n 3882,\\n/**/\\n 3881,\\n/**/\\n 3880,\\n/**/\\n 3879,\\n/**/\\n 3878,\\n/**/\\n 3877,\\n/**/\\n 3876,\\n/**/\\n 3875,\\n/**/\\n 3874,\\n/**/\\n 3873,\\n/**/\\n 3872,\\n/**/\\n 3871,\\n/**/\\n 3870,\\n/**/\\n 3869,\\n/**/\\n 3868,\\n/**/\\n 3867,\\n/**/\\n 3866,\\n/**/\\n 3865,\\n/**/\\n 3864,\\n/**/\\n 3863,\\n/**/\\n 3862,\\n/**/\\n 3861,\\n/**/\\n 3860,\\n/**/\\n 3859,\\n/**/\\n 3858,\\n/**/\\n 3857,\\n/**/\\n 3856,\\n/**/\\n 3855,\\n/**/\\n 3854,\\n/**/\\n 3853,\\n/**/\\n 3852,\\n/**/\\n 3851,\\n/**/\\n 3850,\\n/**/\\n 3849,\\n/**/\\n 3848,\\n/**/\\n 3847,\\n/**/\\n 3846,\\n/**/\\n 3845,\\n/**/\\n 3844,\\n/**/\\n 3843,\\n/**/\\n 3842,\\n/**/\\n 3841,\\n/**/\\n 3840,\\n/**/\\n 3839,\\n/**/\\n 3838,\\n/**/\\n 3837,\\n/**/\\n 3836,\\n/**/\\n 3835,\\n/**/\\n 3834,\\n/**/\\n 3833,\\n/**/\\n 3832,\\n/**/\\n 3831,\\n/**/\\n 3830,\\n/**/\\n 3829,\\n/**/\\n 3828,\\n/**/\\n 3827,\\n/**/\\n 3826,\\n/**/\\n 3825,\\n/**/\\n 3824,\\n/**/\\n 3823,\\n/**/\\n 3822,\\n/**/\\n 3821,\\n/**/\\n 3820,\\n/**/\\n 3819,\\n/**/\\n 3818,\\n/**/\\n 3817,\\n/**/\\n 3816,\\n/**/\\n 3815,\\n/**/\\n 3814,\\n/**/\\n 3813,\\n/**/\\n 3812,\\n/**/\\n 3811,\\n/**/\\n 3810,\\n/**/\\n 3809,\\n/**/\\n 3808,\\n/**/\\n 3807,\\n/**/\\n 3806,\\n/**/\\n 3805,\\n/**/\\n 3804,\\n/**/\\n 3803,\\n/**/\\n 3802,\\n/**/\\n 3801,\\n/**/\\n 3800,\\n/**/\\n 3799,\\n/**/\\n 3798,\\n/**/\\n 3797,\\n/**/\\n 3796,\\n/**/\\n 3795,\\n/**/\\n 3794,\\n/**/\\n 3793,\\n/**/\\n 3792,\\n/**/\\n 3791,\\n/**/\\n 3790,\\n/**/\\n 3789,\\n/**/\\n 3788,\\n/**/\\n 3787,\\n/**/\\n 3786,\\n/**/\\n 3785,\\n/**/\\n 3784,\\n/**/\\n 3783,\\n/**/\\n 3782,\\n/**/\\n 3781,\\n/**/\\n 3780,\\n/**/\\n 3779,\\n/**/\\n 3778,\\n/**/\\n 3777,\\n/**/\\n 3776,\\n/**/\\n 3775,\\n/**/\\n 3774,\\n/**/\\n 3773,\\n/**/\\n 3772,\\n/**/\\n 3771,\\n/**/\\n 3770,\\n/**/\\n 3769,\\n/**/\\n 3768,\\n/**/\\n 3767,\\n/**/\\n 3766,\\n/**/\\n 3765,\\n/**/\\n 3764,\\n/**/\\n 3763,\\n/**/\\n 3762,\\n/**/\\n 3761,\\n/**/\\n 3760,\\n/**/\\n 3759,\\n/**/\\n 3758,\\n/**/\\n 3757,\\n/**/\\n 3756,\\n/**/\\n 3755,\\n/**/\\n 3754,\\n/**/\\n 3753,\\n/**/\\n 3752,\\n/**/\\n 3751,\\n/**/\\n 3750,\\n/**/\\n 3749,\\n/**/\\n 3748,\\n/**/\\n 3747,\\n/**/\\n 3746,\\n/**/\\n 3745,\\n/**/\\n 3744,\\n/**/\\n 3743,\\n/**/\\n 3742,\\n/**/\\n 3741,\\n/**/\\n 3740,\\n/**/\\n 3739,\\n/**/\\n 3738,\\n/**/\\n 3737,\\n/**/\\n 3736,\\n/**/\\n 3735,\\n/**/\\n 3734,\\n/**/\\n 3733,\\n/**/\\n 3732,\\n/**/\\n 3731,\\n/**/\\n 3730,\\n/**/\\n 3729,\\n/**/\\n 3728,\\n/**/\\n 3727,\\n/**/\\n 3726,\\n/**/\\n 3725,\\n/**/\\n 3724,\\n/**/\\n 3723,\\n/**/\\n 3722,\\n/**/\\n 3721,\\n/**/\\n 3720,\\n/**/\\n 3719,\\n/**/\\n 3718,\\n/**/\\n 3717,\\n/**/\\n 3716,\\n/**/\\n 3715,\\n/**/\\n 3714,\\n/**/\\n 3713,\\n/**/\\n 3712,\\n/**/\\n 3711,\\n/**/\\n 3710,\\n/**/\\n 3709,\\n/**/\\n 3708,\\n/**/\\n 3707,\\n/**/\\n 3706,\\n/**/\\n 3705,\\n/**/\\n 3704,\\n/**/\\n 3703,\\n/**/\\n 3702,\\n/**/\\n 3701,\\n/**/\\n 3700,\\n/**/\\n 3699,\\n/**/\\n 3698,\\n/**/\\n 3697,\\n/**/\\n 3696,\\n/**/\\n 3695,\\n/**/\\n 3694,\\n/**/\\n 3693,\\n/**/\\n 3692,\\n/**/\\n 3691,\\n/**/\\n 3690,\\n/**/\\n 3689,\\n/**/\\n 3688,\\n/**/\\n 3687,\\n/**/\\n 3686,\\n/**/\\n 3685,\\n/**/\\n 3684,\\n/**/\\n 3683,\\n/**/\\n 3682,\\n/**/\\n 3681,\\n/**/\\n 3680,\\n/**/\\n 3679,\\n/**/\\n 3678,\\n/**/\\n 3677,\\n/**/\\n 3676,\\n/**/\\n 3675,\\n/**/\\n 3674,\\n/**/\\n 3673,\\n/**/\\n 3672,\\n/**/\\n 3671,\\n/**/\\n 3670,\\n/**/\\n 3669,\\n/**/\\n 3668,\\n/**/\\n 3667,\\n/**/\\n 3666,\\n/**/\\n 3665,\\n/**/\\n 3664,\\n/**/\\n 3663,\\n/**/\\n 3662,\\n/**/\\n 3661,\\n/**/\\n 3660,\\n/**/\\n 3659,\\n/**/\\n 3658,\\n/**/\\n 3657,\\n/**/\\n 3656,\\n/**/\\n 3655,\\n/**/\\n 3654,\\n/**/\\n 3653,\\n/**/\\n 3652,\\n/**/\\n 3651,\\n/**/\\n 3650,\\n/**/\\n 3649,\\n/**/\\n 3648,\\n/**/\\n 3647,\\n/**/\\n 3646,\\n/**/\\n 3645,\\n/**/\\n 3644,\\n/**/\\n 3643,\\n/**/\\n 3642,\\n/**/\\n 3641,\\n/**/\\n 3640,\\n/**/\\n 3639,\\n/**/\\n 3638,\\n/**/\\n 3637,\\n/**/\\n 3636,\\n/**/\\n 3635,\\n/**/\\n 3634,\\n/**/\\n 3633,\\n/**/\\n 3632,\\n/**/\\n 3631,\\n/**/\\n 3630,\\n/**/\\n 3629,\\n/**/\\n 3628,\\n/**/\\n 3627,\\n/**/\\n 3626,\\n/**/\\n 3625,\\n/**/\\n 3624,\\n/**/\\n 3623,\\n/**/\\n 3622,\\n/**/\\n 3621,\\n/**/\\n 3620,\\n/**/\\n 3619,\\n/**/\\n 3618,\\n/**/\\n 3617,\\n/**/\\n 3616,\\n/**/\\n 3615,\\n/**/\\n 3614,\\n/**/\\n 3613,\\n/**/\\n 3612,\\n/**/\\n 3611,\\n/**/\\n 3610,\\n/**/\\n 3609,\\n/**/\\n 3608,\\n/**/\\n 3607,\\n/**/\\n 3606,\\n/**/\\n 3605,\\n/**/\\n 3604,\\n/**/\\n 3603,\\n/**/\\n 3602,\\n/**/\\n 3601,\\n/**/\\n 3600,\\n/**/\\n 3599,\\n/**/\\n 3598,\\n/**/\\n 3597,\\n/**/\\n 3596,\\n/**/\\n 3595,\\n/**/\\n 3594,\\n/**/\\n 3593,\\n/**/\\n 3592,\\n/**/\\n 3591,\\n/**/\\n 3590,\\n/**/\\n 3589,\\n/**/\\n 3588,\\n/**/\\n 3587,\\n/**/\\n 3586,\\n/**/\\n 3585,\\n/**/\\n 3584,\\n/**/\\n 3583,\\n/**/\\n 3582,\\n/**/\\n 3581,\\n/**/\\n 3580,\\n/**/\\n 3579,\\n/**/\\n 3578,\\n/**/\\n 3577,\\n/**/\\n 3576,\\n/**/\\n 3575,\\n/**/\\n 3574,\\n/**/\\n 3573,\\n/**/\\n 3572,\\n/**/\\n 3571,\\n/**/\\n 3570,\\n/**/\\n 3569,\\n/**/\\n 3568,\\n/**/\\n 3567,\\n/**/\\n 3566,\\n/**/\\n 3565,\\n/**/\\n 3564,\\n/**/\\n 3563,\\n/**/\\n 3562,\\n/**/\\n 3561,\\n/**/\\n 3560,\\n/**/\\n 3559,\\n/**/\\n 3558,\\n/**/\\n 3557,\\n/**/\\n 3556,\\n/**/\\n 3555,\\n/**/\\n 3554,\\n/**/\\n 3553,\\n/**/\\n 3552,\\n/**/\\n 3551,\\n/**/\\n 3550,\\n/**/\\n 3549,\\n/**/\\n 3548,\\n/**/\\n 3547,\\n/**/\\n 3546,\\n/**/\\n 3545,\\n/**/\\n 3544,\\n/**/\\n 3543,\\n/**/\\n 3542,\\n/**/\\n 3541,\\n/**/\\n 3540,\\n/**/\\n 3539,\\n/**/\\n 3538,\\n/**/\\n 3537,\\n/**/\\n 3536,\\n/**/\\n 3535,\\n/**/\\n 3534,\\n/**/\\n 3533,\\n/**/\\n 3532,\\n/**/\\n 3531,\\n/**/\\n 3530,\\n/**/\\n 3529,\\n/**/\\n 3528,\\n/**/\\n 3527,\\n/**/\\n 3526,\\n/**/\\n 3525,\\n/**/\\n 3524,\\n/**/\\n 3523,\\n/**/\\n 3522,\\n/**/\\n 3521,\\n/**/\\n 3520,\\n/**/\\n 3519,\\n/**/\\n 3518,\\n/**/\\n 3517,\\n/**/\\n 3516,\\n/**/\\n 3515,\\n/**/\\n 3514,\\n/**/\\n 3513,\\n/**/\\n 3512,\\n/**/\\n 3511,\\n/**/\\n 3510,\\n/**/\\n 3509,\\n/**/\\n 3508,\\n/**/\\n 3507,\\n/**/\\n 3506,\\n/**/\\n 3505,\\n/**/\\n 3504,\\n/**/\\n 3503,\\n/**/\\n 3502,\\n/**/\\n 3501,\\n/**/\\n 3500,\\n/**/\\n 3499,\\n/**/\\n 3498,\\n/**/\\n 3497,\\n/**/\\n 3496,\\n/**/\\n 3495,\\n/**/\\n 3494,\\n/**/\\n 3493,\\n/**/\\n 3492,\\n/**/\\n 3491,\\n/**/\\n 3490,\\n/**/\\n 3489,\\n/**/\\n 3488,\\n/**/\\n 3487,\\n/**/\\n 3486,\\n/**/\\n 3485,\\n/**/\\n 3484,\\n/**/\\n 3483,\\n/**/\\n 3482,\\n/**/\\n 3481,\\n/**/\\n 3480,\\n/**/\\n 3479,\\n/**/\\n 3478,\\n/**/\\n 3477,\\n/**/\\n 3476,\\n/**/\\n 3475,\\n/**/\\n 3474,\\n/**/\\n 3473,\\n/**/\\n 3472,\\n/**/\\n 3471,\\n/**/\\n 3470,\\n/**/\\n 3469,\\n/**/\\n 3468,\\n/**/\\n 3467,\\n/**/\\n 3466,\\n/**/\\n 3465,\\n/**/\\n 3464,\\n/**/\\n 3463,\\n/**/\\n 3462,\\n/**/\\n 3461,\\n/**/\\n 3460,\\n/**/\\n 3459,\\n/**/\\n 3458,\\n/**/\\n 3457,\\n/**/\\n 3456,\\n/**/\\n 3455,\\n/**/\\n 3454,\\n/**/\\n 3453,\\n/**/\\n 3452,\\n/**/\\n 3451,\\n/**/\\n 3450,\\n/**/\\n 3449,\\n/**/\\n 3448,\\n/**/\\n 3447,\\n/**/\\n 3446,\\n/**/\\n 3445,\\n/**/\\n 3444,\\n/**/\\n 3443,\\n/**/\\n 3442,\\n/**/\\n 3441,\\n/**/\\n 3440,\\n/**/\\n 3439,\\n/**/\\n 3438,\\n/**/\\n 3437,\\n/**/\\n 3436,\\n/**/\\n 3435,\\n/**/\\n 3434,\\n/**/\\n 3433,\\n/**/\\n 3432,\\n/**/\\n 3431,\\n/**/\\n 3430,\\n/**/\\n 3429,\\n/**/\\n 3428,\\n/**/\\n 3427,\\n/**/\\n 3426,\\n/**/\\n 3425,\\n/**/\\n 3424,\\n/**/\\n 3423,\\n/**/\\n 3422,\\n/**/\\n 3421,\\n/**/\\n 3420,\\n/**/\\n 3419,\\n/**/\\n 3418,\\n/**/\\n 3417,\\n/**/\\n 3416,\\n/**/\\n 3415,\\n/**/\\n 3414,\\n/**/\\n 3413,\\n/**/\\n 3412,\\n/**/\\n 3411,\\n/**/\\n 3410,\\n/**/\\n 3409,\\n/**/\\n 3408,\\n/**/\\n 3407,\\n/**/\\n 3406,\\n/**/\\n 3405,\\n/**/\\n 3404,\\n/**/\\n 3403,\\n/**/\\n 3402,\\n/**/\\n 3401,\\n/**/\\n 3400,\\n/**/\\n 3399,\\n/**/\\n 3398,\\n/**/\\n 3397,\\n/**/\\n 3396,\\n/**/\\n 3395,\\n/**/\\n 3394,\\n/**/\\n 3393,\\n/**/\\n 3392,\\n/**/\\n 3391,\\n/**/\\n 3390,\\n/**/\\n 3389,\\n/**/\\n 3388,\\n/**/\\n 3387,\\n/**/\\n 3386,\\n/**/\\n 3385,\\n/**/\\n 3384,\\n/**/\\n 3383,\\n/**/\\n 3382,\\n/**/\\n 3381,\\n/**/\\n 3380,\\n/**/\\n 3379,\\n/**/\\n 3378,\\n/**/\\n 3377,\\n/**/\\n 3376,\\n/**/\\n 3375,\\n/**/\\n 3374,\\n/**/\\n 3373,\\n/**/\\n 3372,\\n/**/\\n 3371,\\n/**/\\n 3370,\\n/**/\\n 3369,\\n/**/\\n 3368,\\n/**/\\n 3367,\\n/**/\\n 3366,\\n/**/\\n 3365,\\n/**/\\n 3364,\\n/**/\\n 3363,\\n/**/\\n 3362,\\n/**/\\n 3361,\\n/**/\\n 3360,\\n/**/\\n 3359,\\n/**/\\n 3358,\\n/**/\\n 3357,\\n/**/\\n 3356,\\n/**/\\n 3355,\\n/**/\\n 3354,\\n/**/\\n 3353,\\n/**/\\n 3352,\\n/**/\\n 3351,\\n/**/\\n 3350,\\n/**/\\n 3349,\\n/**/\\n 3348,\\n/**/\\n 3347,\\n/**/\\n 3346,\\n/**/\\n 3345,\\n/**/\\n 3344,\\n/**/\\n 3343,\\n/**/\\n 3342,\\n/**/\\n 3341,\\n/**/\\n 3340,\\n/**/\\n 3339,\\n/**/\\n 3338,\\n/**/\\n 3337,\\n/**/\\n 3336,\\n/**/\\n 3335,\\n/**/\\n 3334,\\n/**/\\n 3333,\\n/**/\\n 3332,\\n/**/\\n 3331,\\n/**/\\n 3330,\\n/**/\\n 3329,\\n/**/\\n 3328,\\n/**/\\n 3327,\\n/**/\\n 3326,\\n/**/\\n 3325,\\n/**/\\n 3324,\\n/**/\\n 3323,\\n/**/\\n 3322,\\n/**/\\n 3321,\\n/**/\\n 3320,\\n/**/\\n 3319,\\n/**/\\n 3318,\\n/**/\\n 3317,\\n/**/\\n 3316,\\n/**/\\n 3315,\\n/**/\\n 3314,\\n/**/\\n 3313,\\n/**/\\n 3312,\\n/**/\\n 3311,\\n/**/\\n 3310,\\n/**/\\n 3309,\\n/**/\\n 3308,\\n/**/\\n 3307,\\n/**/\\n 3306,\\n/**/\\n 3305,\\n/**/\\n 3304,\\n/**/\\n 3303,\\n/**/\\n 3302,\\n/**/\\n 3301,\\n/**/\\n 3300,\\n/**/\\n 3299,\\n/**/\\n 3298,\\n/**/\\n 3297,\\n/**/\\n 3296,\\n/**/\\n 3295,\\n/**/\\n 3294,\\n/**/\\n 3293,\\n/**/\\n 3292,\\n/**/\\n 3291,\\n/**/\\n 3290,\\n/**/\\n 3289,\\n/**/\\n 3288,\\n/**/\\n 3287,\\n/**/\\n 3286,\\n/**/\\n 3285,\\n/**/\\n 3284,\\n/**/\\n 3283,\\n/**/\\n 3282,\\n/**/\\n 3281,\\n/**/\\n 3280,\\n/**/\\n 3279,\\n/**/\\n 3278,\\n/**/\\n 3277,\\n/**/\\n 3276,\\n/**/\\n 3275,\\n/**/\\n 3274,\\n/**/\\n 3273,\\n/**/\\n 3272,\\n/**/\\n 3271,\\n/**/\\n 3270,\\n/**/\\n 3269,\\n/**/\\n 3268,\\n/**/\\n 3267,\\n/**/\\n 3266,\\n/**/\\n 3265,\\n/**/\\n 3264,\\n/**/\\n 3263,\\n/**/\\n 3262,\\n/**/\\n 3261,\\n/**/\\n 3260,\\n/**/\\n 3259,\\n/**/\\n 3258,\\n/**/\\n 3257,\\n/**/\\n 3256,\\n/**/\\n 3255,\\n/**/\\n 3254,\\n/**/\\n 3253,\\n/**/\\n 3252,\\n/**/\\n 3251,\\n/**/\\n 3250,\\n/**/\\n 3249,\\n/**/\\n 3248,\\n/**/\\n 3247,\\n/**/\\n 3246,\\n/**/\\n 3245,\\n/**/\\n 3244,\\n/**/\\n 3243,\\n/**/\\n 3242,\\n/**/\\n 3241,\\n/**/\\n 3240,\\n/**/\\n 3239,\\n/**/\\n 3238,\\n/**/\\n 3237,\\n/**/\\n 3236,\\n/**/\\n 3235,\\n/**/\\n 3234,\\n/**/\\n 3233,\\n/**/\\n 3232,\\n/**/\\n 3231,\\n/**/\\n 3230,\\n/**/\\n 3229,\\n/**/\\n 3228,\\n/**/\\n 3227,\\n/**/\\n 3226,\\n/**/\\n 3225,\\n/**/\\n 3224,\\n/**/\\n 3223,\\n/**/\\n 3222,\\n/**/\\n 3221,\\n/**/\\n 3220,\\n/**/\\n 3219,\\n/**/\\n 3218,\\n/**/\\n 3217,\\n/**/\\n 3216,\\n/**/\\n 3215,\\n/**/\\n 3214,\\n/**/\\n 3213,\\n/**/\\n 3212,\\n/**/\\n 3211,\\n/**/\\n 3210,\\n/**/\\n 3209,\\n/**/\\n 3208,\\n/**/\\n 3207,\\n/**/\\n 3206,\\n/**/\\n 3205,\\n/**/\\n 3204,\\n/**/\\n 3203,\\n/**/\\n 3202,\\n/**/\\n 3201,\\n/**/\\n 3200,\\n/**/\\n 3199,\\n/**/\\n 3198,\\n/**/\\n 3197,\\n/**/\\n 3196,\\n/**/\\n 3195,\\n/**/\\n 3194,\\n/**/\\n 3193,\\n/**/\\n 3192,\\n/**/\\n 3191,\\n/**/\\n 3190,\\n/**/\\n 3189,\\n/**/\\n 3188,\\n/**/\\n 3187,\\n/**/\\n 3186,\\n/**/\\n 3185,\\n/**/\\n 3184,\\n/**/\\n 3183,\\n/**/\\n 3182,\\n/**/\\n 3181,\\n/**/\\n 3180,\\n/**/\\n 3179,\\n/**/\\n 3178,\\n/**/\\n 3177,\\n/**/\\n 3176,\\n/**/\\n 3175,\\n/**/\\n 3174,\\n/**/\\n 3173,\\n/**/\\n 3172,\\n/**/\\n 3171,\\n/**/\\n 3170,\\n/**/\\n 3169,\\n/**/\\n 3168,\\n/**/\\n 3167,\\n/**/\\n 3166,\\n/**/\\n 3165,\\n/**/\\n 3164,\\n/**/\\n 3163,\\n/**/\\n 3162,\\n/**/\\n 3161,\\n/**/\\n 3160,\\n/**/\\n 3159,\\n/**/\\n 3158,\\n/**/\\n 3157,\\n/**/\\n 3156,\\n/**/\\n 3155,\\n/**/\\n 3154,\\n/**/\\n 3153,\\n/**/\\n 3152,\\n/**/\\n 3151,\\n/**/\\n 3150,\\n/**/\\n 3149,\\n/**/\\n 3148,\\n/**/\\n 3147,\\n/**/\\n 3146,\\n/**/\\n 3145,\\n/**/\\n 3144,\\n/**/\\n 3143,\\n/**/\\n 3142,\\n/**/\\n 3141,\\n/**/\\n 3140,\\n/**/\\n 3139,\\n/**/\\n 3138,\\n/**/\\n 3137,\\n/**/\\n 3136,\\n/**/\\n 3135,\\n/**/\\n 3134,\\n/**/\\n 3133,\\n/**/\\n 3132,\\n/**/\\n 3131,\\n/**/\\n 3130,\\n/**/\\n 3129,\\n/**/\\n 3128,\\n/**/\\n 3127,\\n/**/\\n 3126,\\n/**/\\n 3125,\\n/**/\\n 3124,\\n/**/\\n 3123,\\n/**/\\n 3122,\\n/**/\\n 3121,\\n/**/\\n 3120,\\n/**/\\n 3119,\\n/**/\\n 3118,\\n/**/\\n 3117,\\n/**/\\n 3116,\\n/**/\\n 3115,\\n/**/\\n 3114,\\n/**/\\n 3113,\\n/**/\\n 3112,\\n/**/\\n 3111,\\n/**/\\n 3110,\\n/**/\\n 3109,\\n/**/\\n 3108,\\n/**/\\n 3107,\\n/**/\\n 3106,\\n/**/\\n 3105,\\n/**/\\n 3104,\\n/**/\\n 3103,\\n/**/\\n 3102,\\n/**/\\n 3101,\\n/**/\\n 3100,\\n/**/\\n 3099,\\n/**/\\n 3098,\\n/**/\\n 3097,\\n/**/\\n 3096,\\n/**/\\n 3095,\\n/**/\\n 3094,\\n/**/\\n 3093,\\n/**/\\n 3092,\\n/**/\\n 3091,\\n/**/\\n 3090,\\n/**/\\n 3089,\\n/**/\\n 3088,\\n/**/\\n 3087,\\n/**/\\n 3086,\\n/**/\\n 3085,\\n/**/\\n 3084,\\n/**/\\n 3083,\\n/**/\\n 3082,\\n/**/\\n 3081,\\n/**/\\n 3080,\\n/**/\\n 3079,\\n/**/\\n 3078,\\n/**/\\n 3077,\\n/**/\\n 3076,\\n/**/\\n 3075,\\n/**/\\n 3074,\\n/**/\\n 3073,\\n/**/\\n 3072,\\n/**/\\n 3071,\\n/**/\\n 3070,\\n/**/\\n 3069,\\n/**/\\n 3068,\\n/**/\\n 3067,\\n/**/\\n 3066,\\n/**/\\n 3065,\\n/**/\\n 3064,\\n/**/\\n 3063,\\n/**/\\n 3062,\\n/**/\\n 3061,\\n/**/\\n 3060,\\n/**/\\n 3059,\\n/**/\\n 3058,\\n/**/\\n 3057,\\n/**/\\n 3056,\\n/**/\\n 3055,\\n/**/\\n 3054,\\n/**/\\n 3053,\\n/**/\\n 3052,\\n/**/\\n 3051,\\n/**/\\n 3050,\\n/**/\\n 3049,\\n/**/\\n 3048,\\n/**/\\n 3047,\\n/**/\\n 3046,\\n/**/\\n 3045,\\n/**/\\n 3044,\\n/**/\\n 3043,\\n/**/\\n 3042,\\n/**/\\n 3041,\\n/**/\\n 3040,\\n/**/\\n 3039,\\n/**/\\n 3038,\\n/**/\\n 3037,\\n/**/\\n 3036,\\n/**/\\n 3035,\\n/**/\\n 3034,\\n/**/\\n 3033,\\n/**/\\n 3032,\\n/**/\\n 3031,\\n/**/\\n 3030,\\n/**/\\n 3029,\\n/**/\\n 3028,\\n/**/\\n 3027,\\n/**/\\n 3026,\\n/**/\\n 3025,\\n/**/\\n 3024,\\n/**/\\n 3023,\\n/**/\\n 3022,\\n/**/\\n 3021,\\n/**/\\n 3020,\\n/**/\\n 3019,\\n/**/\\n 3018,\\n/**/\\n 3017,\\n/**/\\n 3016,\\n/**/\\n 3015,\\n/**/\\n 3014,\\n/**/\\n 3013,\\n/**/\\n 3012,\\n/**/\\n 3011,\\n/**/\\n 3010,\\n/**/\\n 3009,\\n/**/\\n 3008,\\n/**/\\n 3007,\\n/**/\\n 3006,\\n/**/\\n 3005,\\n/**/\\n 3004,\\n/**/\\n 3003,\\n/**/\\n 3002,\\n/**/\\n 3001,\\n/**/\\n 3000,\\n/**/\\n 2999,\\n/**/\\n 2998,\\n/**/\\n 2997,\\n/**/\\n 2996,\\n/**/\\n 2995,\\n/**/\\n 2994,\\n/**/\\n 2993,\\n/**/\\n 2992,\\n/**/\\n 2991,\\n/**/\\n 2990,\\n/**/\\n 2989,\\n/**/\\n 2988,\\n/**/\\n 2987,\\n/**/\\n 2986,\\n/**/\\n 2985,\\n/**/\\n 2984,\\n/**/\\n 2983,\\n/**/\\n 2982,\\n/**/\\n 2981,\\n/**/\\n 2980,\\n/**/\\n 2979,\\n/**/\\n 2978,\\n/**/\\n 2977,\\n/**/\\n 2976,\\n/**/\\n 2975,\\n/**/\\n 2974,\\n/**/\\n 2973,\\n/**/\\n 2972,\\n/**/\\n 2971,\\n/**/\\n 2970,\\n/**/\\n 2969,\\n/**/\\n 2968,\\n/**/\\n 2967,\\n/**/\\n 2966,\\n/**/\\n 2965,\\n/**/\\n 2964,\\n/**/\\n 2963,\\n/**/\\n 2962,\\n/**/\\n 2961,\\n/**/\\n 2960,\\n/**/\\n 2959,\\n/**/\\n 2958,\\n/**/\\n 2957,\\n/**/\\n 2956,\\n/**/\\n 2955,\\n/**/\\n 2954,\\n/**/\\n 2953,\\n/**/\\n 2952,\\n/**/\\n 2951,\\n/**/\\n 2950,\\n/**/\\n 2949,\\n/**/\\n 2948,\\n/**/\\n 2947,\\n/**/\\n 2946,\\n/**/\\n 2945,\\n/**/\\n 2944,\\n/**/\\n 2943,\\n/**/\\n 2942,\\n/**/\\n 2941,\\n/**/\\n 2940,\\n/**/\\n 2939,\\n/**/\\n 2938,\\n/**/\\n 2937,\\n/**/\\n 2936,\\n/**/\\n 2935,\\n/**/\\n 2934,\\n/**/\\n 2933,\\n/**/\\n 2932,\\n/**/\\n 2931,\\n/**/\\n 2930,\\n/**/\\n 2929,\\n/**/\\n 2928,\\n/**/\\n 2927,\\n/**/\\n 2926,\\n/**/\\n 2925,\\n/**/\\n 2924,\\n/**/\\n 2923,\\n/**/\\n 2922,\\n/**/\\n 2921,\\n/**/\\n 2920,\\n/**/\\n 2919,\\n/**/\\n 2918,\\n/**/\\n 2917,\\n/**/\\n 2916,\\n/**/\\n 2915,\\n/**/\\n 2914,\\n/**/\\n 2913,\\n/**/\\n 2912,\\n/**/\\n 2911,\\n/**/\\n 2910,\\n/**/\\n 2909,\\n/**/\\n 2908,\\n/**/\\n 2907,\\n/**/\\n 2906,\\n/**/\\n 2905,\\n/**/\\n 2904,\\n/**/\\n 2903,\\n/**/\\n 2902,\\n/**/\\n 2901,\\n/**/\\n 2900,\\n/**/\\n 2899,\\n/**/\\n 2898,\\n/**/\\n 2897,\\n/**/\\n 2896,\\n/**/\\n 2895,\\n/**/\\n 2894,\\n/**/\\n 2893,\\n/**/\\n 2892,\\n/**/\\n 2891,\\n/**/\\n 2890,\\n/**/\\n 2889,\\n/**/\\n 2888,\\n/**/\\n 2887,\\n/**/\\n 2886,\\n/**/\\n 2885,\\n/**/\\n 2884,\\n/**/\\n 2883,\\n/**/\\n 2882,\\n/**/\\n 2881,\\n/**/\\n 2880,\\n/**/\\n 2879,\\n/**/\\n 2878,\\n/**/\\n 2877,\\n/**/\\n 2876,\\n/**/\\n 2875,\\n/**/\\n 2874,\\n/**/\\n 2873,\\n/**/\\n 2872,\\n/**/\\n 2871,\\n/**/\\n 2870,\\n/**/\\n 2869,\\n/**/\\n 2868,\\n/**/\\n 2867,\\n/**/\\n 2866,\\n/**/\\n 2865,\\n/**/\\n 2864,\\n/**/\\n 2863,\\n/**/\\n 2862,\\n/**/\\n 2861,\\n/**/\\n 2860,\\n/**/\\n 2859,\\n/**/\\n 2858,\\n/**/\\n 2857,\\n/**/\\n 2856,\\n/**/\\n 2855,\\n/**/\\n 2854,\\n/**/\\n 2853,\\n/**/\\n 2852,\\n/**/\\n 2851,\\n/**/\\n 2850,\\n/**/\\n 2849,\\n/**/\\n 2848,\\n/**/\\n 2847,\\n/**/\\n 2846,\\n/**/\\n 2845,\\n/**/\\n 2844,\\n/**/\\n 2843,\\n/**/\\n 2842,\\n/**/\\n 2841,\\n/**/\\n 2840,\\n/**/\\n 2839,\\n/**/\\n 2838,\\n/**/\\n 2837,\\n/**/\\n 2836,\\n/**/\\n 2835,\\n/**/\\n 2834,\\n/**/\\n 2833,\\n/**/\\n 2832,\\n/**/\\n 2831,\\n/**/\\n 2830,\\n/**/\\n 2829,\\n/**/\\n 2828,\\n/**/\\n 2827,\\n/**/\\n 2826,\\n/**/\\n 2825,\\n/**/\\n 2824,\\n/**/\\n 2823,\\n/**/\\n 2822,\\n/**/\\n 2821,\\n/**/\\n 2820,\\n/**/\\n 2819,\\n/**/\\n 2818,\\n/**/\\n 2817,\\n/**/\\n 2816,\\n/**/\\n 2815,\\n/**/\\n 2814,\\n/**/\\n 2813,\\n/**/\\n 2812,\\n/**/\\n 2811,\\n/**/\\n 2810,\\n/**/\\n 2809,\\n/**/\\n 2808,\\n/**/\\n 2807,\\n/**/\\n 2806,\\n/**/\\n 2805,\\n/**/\\n 2804,\\n/**/\\n 2803,\\n/**/\\n 2802,\\n/**/\\n 2801,\\n/**/\\n 2800,\\n/**/\\n 2799,\\n/**/\\n 2798,\\n/**/\\n 2797,\\n/**/\\n 2796,\\n/**/\\n 2795,\\n/**/\\n 2794,\\n/**/\\n 2793,\\n/**/\\n 2792,\\n/**/\\n 2791,\\n/**/\\n 2790,\\n/**/\\n 2789,\\n/**/\\n 2788,\\n/**/\\n 2787,\\n/**/\\n 2786,\\n/**/\\n 2785,\\n/**/\\n 2784,\\n/**/\\n 2783,\\n/**/\\n 2782,\\n/**/\\n 2781,\\n/**/\\n 2780,\\n/**/\\n 2779,\\n/**/\\n 2778,\\n/**/\\n 2777,\\n/**/\\n 2776,\\n/**/\\n 2775,\\n/**/\\n 2774,\\n/**/\\n 2773,\\n/**/\\n 2772,\\n/**/\\n 2771,\\n/**/\\n 2770,\\n/**/\\n 2769,\\n/**/\\n 2768,\\n/**/\\n 2767,\\n/**/\\n 2766,\\n/**/\\n 2765,\\n/**/\\n 2764,\\n/**/\\n 2763,\\n/**/\\n 2762,\\n/**/\\n 2761,\\n/**/\\n 2760,\\n/**/\\n 2759,\\n/**/\\n 2758,\\n/**/\\n 2757,\\n/**/\\n 2756,\\n/**/\\n 2755,\\n/**/\\n 2754,\\n/**/\\n 2753,\\n/**/\\n 2752,\\n/**/\\n 2751,\\n/**/\\n 2750,\\n/**/\\n 2749,\\n/**/\\n 2748,\\n/**/\\n 2747,\\n/**/\\n 2746,\\n/**/\\n 2745,\\n/**/\\n 2744,\\n/**/\\n 2743,\\n/**/\\n 2742,\\n/**/\\n 2741,\\n/**/\\n 2740,\\n/**/\\n 2739,\\n/**/\\n 2738,\\n/**/\\n 2737,\\n/**/\\n 2736,\\n/**/\\n 2735,\\n/**/\\n 2734,\\n/**/\\n 2733,\\n/**/\\n 2732,\\n/**/\\n 2731,\\n/**/\\n 2730,\\n/**/\\n 2729,\\n/**/\\n 2728,\\n/**/\\n 2727,\\n/**/\\n 2726,\\n/**/\\n 2725,\\n/**/\\n 2724,\\n/**/\\n 2723,\\n/**/\\n 2722,\\n/**/\\n 2721,\\n/**/\\n 2720,\\n/**/\\n 2719,\\n/**/\\n 2718,\\n/**/\\n 2717,\\n/**/\\n 2716,\\n/**/\\n 2715,\\n/**/\\n 2714,\\n/**/\\n 2713,\\n/**/\\n 2712,\\n/**/\\n 2711,\\n/**/\\n 2710,\\n/**/\\n 2709,\\n/**/\\n 2708,\\n/**/\\n 2707,\\n/**/\\n 2706,\\n/**/\\n 2705,\\n/**/\\n 2704,\\n/**/\\n 2703,\\n/**/\\n 2702,\\n/**/\\n 2701,\\n/**/\\n 2700,\\n/**/\\n 2699,\\n/**/\\n 2698,\\n/**/\\n 2697,\\n/**/\\n 2696,\\n/**/\\n 2695,\\n/**/\\n 2694,\\n/**/\\n 2693,\\n/**/\\n 2692,\\n/**/\\n 2691,\\n/**/\\n 2690,\\n/**/\\n 2689,\\n/**/\\n 2688,\\n/**/\\n 2687,\\n/**/\\n 2686,\\n/**/\\n 2685,\\n/**/\\n 2684,\\n/**/\\n 2683,\\n/**/\\n 2682,\\n/**/\\n 2681,\\n/**/\\n 2680,\\n/**/\\n 2679,\\n/**/\\n 2678,\\n/**/\\n 2677,\\n/**/\\n 2676,\\n/**/\\n 2675,\\n/**/\\n 2674,\\n/**/\\n 2673,\\n/**/\\n 2672,\\n/**/\\n 2671,\\n/**/\\n 2670,\\n/**/\\n 2669,\\n/**/\\n 2668,\\n/**/\\n 2667,\\n/**/\\n 2666,\\n/**/\\n 2665,\\n/**/\\n 2664,\\n/**/\\n 2663,\\n/**/\\n 2662,\\n/**/\\n 2661,\\n/**/\\n 2660,\\n/**/\\n 2659,\\n/**/\\n 2658,\\n/**/\\n 2657,\\n/**/\\n 2656,\\n/**/\\n 2655,\\n/**/\\n 2654,\\n/**/\\n 2653,\\n/**/\\n 2652,\\n/**/\\n 2651,\\n/**/\\n 2650,\\n/**/\\n 2649,\\n/**/\\n 2648,\\n/**/\\n 2647,\\n/**/\\n 2646,\\n/**/\\n 2645,\\n/**/\\n 2644,\\n/**/\\n 2643,\\n/**/\\n 2642,\\n/**/\\n 2641,\\n/**/\\n 2640,\\n/**/\\n 2639,\\n/**/\\n 2638,\\n/**/\\n 2637,\\n/**/\\n 2636,\\n/**/\\n 2635,\\n/**/\\n 2634,\\n/**/\\n 2633,\\n/**/\\n 2632,\\n/**/\\n 2631,\\n/**/\\n 2630,\\n/**/\\n 2629,\\n/**/\\n 2628,\\n/**/\\n 2627,\\n/**/\\n 2626,\\n/**/\\n 2625,\\n/**/\\n 2624,\\n/**/\\n 2623,\\n/**/\\n 2622,\\n/**/\\n 2621,\\n/**/\\n 2620,\\n/**/\\n 2619,\\n/**/\\n 2618,\\n/**/\\n 2617,\\n/**/\\n 2616,\\n/**/\\n 2615,\\n/**/\\n 2614,\\n/**/\\n 2613,\\n/**/\\n 2612,\\n/**/\\n 2611,\\n/**/\\n 2610,\\n/**/\\n 2609,\\n/**/\\n 2608,\\n/**/\\n 2607,\\n/**/\\n 2606,\\n/**/\\n 2605,\\n/**/\\n 2604,\\n/**/\\n 2603,\\n/**/\\n 2602,\\n/**/\\n 2601,\\n/**/\\n 2600,\\n/**/\\n 2599,\\n/**/\\n 2598,\\n/**/\\n 2597,\\n/**/\\n 2596,\\n/**/\\n 2595,\\n/**/\\n 2594,\\n/**/\\n 2593,\\n/**/\\n 2592,\\n/**/\\n 2591,\\n/**/\\n 2590,\\n/**/\\n 2589,\\n/**/\\n 2588,\\n/**/\\n 2587,\\n/**/\\n 2586,\\n/**/\\n 2585,\\n/**/\\n 2584,\\n/**/\\n 2583,\\n/**/\\n 2582,\\n/**/\\n 2581,\\n/**/\\n 2580,\\n/**/\\n 2579,\\n/**/\\n 2578,\\n/**/\\n 2577,\\n/**/\\n 2576,\\n/**/\\n 2575,\\n/**/\\n 2574,\\n/**/\\n 2573,\\n/**/\\n 2572,\\n/**/\\n 2571,\\n/**/\\n 2570,\\n/**/\\n 2569,\\n/**/\\n 2568,\\n/**/\\n 2567,\\n/**/\\n 2566,\\n/**/\\n 2565,\\n/**/\\n 2564,\\n/**/\\n 2563,\\n/**/\\n 2562,\\n/**/\\n 2561,\\n/**/\\n 2560,\\n/**/\\n 2559,\\n/**/\\n 2558,\\n/**/\\n 2557,\\n/**/\\n 2556,\\n/**/\\n 2555,\\n/**/\\n 2554,\\n/**/\\n 2553,\\n/**/\\n 2552,\\n/**/\\n 2551,\\n/**/\\n 2550,\\n/**/\\n 2549,\\n/**/\\n 2548,\\n/**/\\n 2547,\\n/**/\\n 2546,\\n/**/\\n 2545,\\n/**/\\n 2544,\\n/**/\\n 2543,\\n/**/\\n 2542,\\n/**/\\n 2541,\\n/**/\\n 2540,\\n/**/\\n 2539,\\n/**/\\n 2538,\\n/**/\\n 2537,\\n/**/\\n 2536,\\n/**/\\n 2535,\\n/**/\\n 2534,\\n/**/\\n 2533,\\n/**/\\n 2532,\\n/**/\\n 2531,\\n/**/\\n 2530,\\n/**/\\n 2529,\\n/**/\\n 2528,\\n/**/\\n 2527,\\n/**/\\n 2526,\\n/**/\\n 2525,\\n/**/\\n 2524,\\n/**/\\n 2523,\\n/**/\\n 2522,\\n/**/\\n 2521,\\n/**/\\n 2520,\\n/**/\\n 2519,\\n/**/\\n 2518,\\n/**/\\n 2517,\\n/**/\\n 2516,\\n/**/\\n 2515,\\n/**/\\n 2514,\\n/**/\\n 2513,\\n/**/\\n 2512,\\n/**/\\n 2511,\\n/**/\\n 2510,\\n/**/\\n 2509,\\n/**/\\n 2508,\\n/**/\\n 2507,\\n/**/\\n 2506,\\n/**/\\n 2505,\\n/**/\\n 2504,\\n/**/\\n 2503,\\n/**/\\n 2502,\\n/**/\\n 2501,\\n/**/\\n 2500,\\n/**/\\n 2499,\\n/**/\\n 2498,\\n/**/\\n 2497,\\n/**/\\n 2496,\\n/**/\\n 2495,\\n/**/\\n 2494,\\n/**/\\n 2493,\\n/**/\\n 2492,\\n/**/\\n 2491,\\n/**/\\n 2490,\\n/**/\\n 2489,\\n/**/\\n 2488,\\n/**/\\n 2487,\\n/**/\\n 2486,\\n/**/\\n 2485,\\n/**/\\n 2484,\\n/**/\\n 2483,\\n/**/\\n 2482,\\n/**/\\n 2481,\\n/**/\\n 2480,\\n/**/\\n 2479,\\n/**/\\n 2478,\\n/**/\\n 2477,\\n/**/\\n 2476,\\n/**/\\n 2475,\\n/**/\\n 2474,\\n/**/\\n 2473,\\n/**/\\n 2472,\\n/**/\\n 2471,\\n/**/\\n 2470,\\n/**/\\n 2469,\\n/**/\\n 2468,\\n/**/\\n 2467,\\n/**/\\n 2466,\\n/**/\\n 2465,\\n/**/\\n 2464,\\n/**/\\n 2463,\\n/**/\\n 2462,\\n/**/\\n 2461,\\n/**/\\n 2460,\\n/**/\\n 2459,\\n/**/\\n 2458,\\n/**/\\n 2457,\\n/**/\\n 2456,\\n/**/\\n 2455,\\n/**/\\n 2454,\\n/**/\\n 2453,\\n/**/\\n 2452,\\n/**/\\n 2451,\\n/**/\\n 2450,\\n/**/\\n 2449,\\n/**/\\n 2448,\\n/**/\\n 2447,\\n/**/\\n 2446,\\n/**/\\n 2445,\\n/**/\\n 2444,\\n/**/\\n 2443,\\n/**/\\n 2442,\\n/**/\\n 2441,\\n/**/\\n 2440,\\n/**/\\n 2439,\\n/**/\\n 2438,\\n/**/\\n 2437,\\n/**/\\n 2436,\\n/**/\\n 2435,\\n/**/\\n 2434,\\n/**/\\n 2433,\\n/**/\\n 2432,\\n/**/\\n 2431,\\n/**/\\n 2430,\\n/**/\\n 2429,\\n/**/\\n 2428,\\n/**/\\n 2427,\\n/**/\\n 2426,\\n/**/\\n 2425,\\n/**/\\n 2424,\\n/**/\\n 2423,\\n/**/\\n 2422,\\n/**/\\n 2421,\\n/**/\\n 2420,\\n/**/\\n 2419,\\n/**/\\n 2418,\\n/**/\\n 2417,\\n/**/\\n 2416,\\n/**/\\n 2415,\\n/**/\\n 2414,\\n/**/\\n 2413,\\n/**/\\n 2412,\\n/**/\\n 2411,\\n/**/\\n 2410,\\n/**/\\n 2409,\\n/**/\\n 2408,\\n/**/\\n 2407,\\n/**/\\n 2406,\\n/**/\\n 2405,\\n/**/\\n 2404,\\n/**/\\n 2403,\\n/**/\\n 2402,\\n/**/\\n 2401,\\n/**/\\n 2400,\\n/**/\\n 2399,\\n/**/\\n 2398,\\n/**/\\n 2397,\\n/**/\\n 2396,\\n/**/\\n 2395,\\n/**/\\n 2394,\\n/**/\\n 2393,\\n/**/\\n 2392,\\n/**/\\n 2391,\\n/**/\\n 2390,\\n/**/\\n 2389,\\n/**/\\n 2388,\\n/**/\\n 2387,\\n/**/\\n 2386,\\n/**/\\n 2385,\\n/**/\\n 2384,\\n/**/\\n 2383,\\n/**/\\n 2382,\\n/**/\\n 2381,\\n/**/\\n 2380,\\n/**/\\n 2379,\\n/**/\\n 2378,\\n/**/\\n 2377,\\n/**/\\n 2376,\\n/**/\\n 2375,\\n/**/\\n 2374,\\n/**/\\n 2373,\\n/**/\\n 2372,\\n/**/\\n 2371,\\n/**/\\n 2370,\\n/**/\\n 2369,\\n/**/\\n 2368,\\n/**/\\n 2367,\\n/**/\\n 2366,\\n/**/\\n 2365,\\n/**/\\n 2364,\\n/**/\\n 2363,\\n/**/\\n 2362,\\n/**/\\n 2361,\\n/**/\\n 2360,\\n/**/\\n 2359,\\n/**/\\n 2358,\\n/**/\\n 2357,\\n/**/\\n 2356,\\n/**/\\n 2355,\\n/**/\\n 2354,\\n/**/\\n 2353,\\n/**/\\n 2352,\\n/**/\\n 2351,\\n/**/\\n 2350,\\n/**/\\n 2349,\\n/**/\\n 2348,\\n/**/\\n 2347,\\n/**/\\n 2346,\\n/**/\\n 2345,\\n/**/\\n 2344,\\n/**/\\n 2343,\\n/**/\\n 2342,\\n/**/\\n 2341,\\n/**/\\n 2340,\\n/**/\\n 2339,\\n/**/\\n 2338,\\n/**/\\n 2337,\\n/**/\\n 2336,\\n/**/\\n 2335,\\n/**/\\n 2334,\\n/**/\\n 2333,\\n/**/\\n 2332,\\n/**/\\n 2331,\\n/**/\\n 2330,\\n/**/\\n 2329,\\n/**/\\n 2328,\\n/**/\\n 2327,\\n/**/\\n 2326,\\n/**/\\n 2325,\\n/**/\\n 2324,\\n/**/\\n 2323,\\n/**/\\n 2322,\\n/**/\\n 2321,\\n/**/\\n 2320,\\n/**/\\n 2319,\\n/**/\\n 2318,\\n/**/\\n 2317,\\n/**/\\n 2316,\\n/**/\\n 2315,\\n/**/\\n 2314,\\n/**/\\n 2313,\\n/**/\\n 2312,\\n/**/\\n 2311,\\n/**/\\n 2310,\\n/**/\\n 2309,\\n/**/\\n 2308,\\n/**/\\n 2307,\\n/**/\\n 2306,\\n/**/\\n 2305,\\n/**/\\n 2304,\\n/**/\\n 2303,\\n/**/\\n 2302,\\n/**/\\n 2301,\\n/**/\\n 2300,\\n/**/\\n 2299,\\n/**/\\n 2298,\\n/**/\\n 2297,\\n/**/\\n 2296,\\n/**/\\n 2295,\\n/**/\\n 2294,\\n/**/\\n 2293,\\n/**/\\n 2292,\\n/**/\\n 2291,\\n/**/\\n 2290,\\n/**/\\n 2289,\\n/**/\\n 2288,\\n/**/\\n 2287,\\n/**/\\n 2286,\\n/**/\\n 2285,\\n/**/\\n 2284,\\n/**/\\n 2283,\\n/**/\\n 2282,\\n/**/\\n 2281,\\n/**/\\n 2280,\\n/**/\\n 2279,\\n/**/\\n 2278,\\n/**/\\n 2277,\\n/**/\\n 2276,\\n/**/\\n 2275,\\n/**/\\n 2274,\\n/**/\\n 2273,\\n/**/\\n 2272,\\n/**/\\n 2271,\\n/**/\\n 2270,\\n/**/\\n 2269,\\n/**/\\n 2268,\\n/**/\\n 2267,\\n/**/\\n 2266,\\n/**/\\n 2265,\\n/**/\\n 2264,\\n/**/\\n 2263,\\n/**/\\n 2262,\\n/**/\\n 2261,\\n/**/\\n 2260,\\n/**/\\n 2259,\\n/**/\\n 2258,\\n/**/\\n 2257,\\n/**/\\n 2256,\\n/**/\\n 2255,\\n/**/\\n 2254,\\n/**/\\n 2253,\\n/**/\\n 2252,\\n/**/\\n 2251,\\n/**/\\n 2250,\\n/**/\\n 2249,\\n/**/\\n 2248,\\n/**/\\n 2247,\\n/**/\\n 2246,\\n/**/\\n 2245,\\n/**/\\n 2244,\\n/**/\\n 2243,\\n/**/\\n 2242,\\n/**/\\n 2241,\\n/**/\\n 2240,\\n/**/\\n 2239,\\n/**/\\n 2238,\\n/**/\\n 2237,\\n/**/\\n 2236,\\n/**/\\n 2235,\\n/**/\\n 2234,\\n/**/\\n 2233,\\n/**/\\n 2232,\\n/**/\\n 2231,\\n/**/\\n 2230,\\n/**/\\n 2229,\\n/**/\\n 2228,\\n/**/\\n 2227,\\n/**/\\n 2226,\\n/**/\\n 2225,\\n/**/\\n 2224,\\n/**/\\n 2223,\\n/**/\\n 2222,\\n/**/\\n 2221,\\n/**/\\n 2220,\\n/**/\\n 2219,\\n/**/\\n 2218,\\n/**/\\n 2217,\\n/**/\\n 2216,\\n/**/\\n 2215,\\n/**/\\n 2214,\\n/**/\\n 2213,\\n/**/\\n 2212,\\n/**/\\n 2211,\\n/**/\\n 2210,\\n/**/\\n 2209,\\n/**/\\n 2208,\\n/**/\\n 2207,\\n/**/\\n 2206,\\n/**/\\n 2205,\\n/**/\\n 2204,\\n/**/\\n 2203,\\n/**/\\n 2202,\\n/**/\\n 2201,\\n/**/\\n 2200,\\n/**/\\n 2199,\\n/**/\\n 2198,\\n/**/\\n 2197,\\n/**/\\n 2196,\\n/**/\\n 2195,\\n/**/\\n 2194,\\n/**/\\n 2193,\\n/**/\\n 2192,\\n/**/\\n 2191,\\n/**/\\n 2190,\\n/**/\\n 2189,\\n/**/\\n 2188,\\n/**/\\n 2187,\\n/**/\\n 2186,\\n/**/\\n 2185,\\n/**/\\n 2184,\\n/**/\\n 2183,\\n/**/\\n 2182,\\n/**/\\n 2181,\\n/**/\\n 2180,\\n/**/\\n 2179,\\n/**/\\n 2178,\\n/**/\\n 2177,\\n/**/\\n 2176,\\n/**/\\n 2175,\\n/**/\\n 2174,\\n/**/\\n 2173,\\n/**/\\n 2172,\\n/**/\\n 2171,\\n/**/\\n 2170,\\n/**/\\n 2169,\\n/**/\\n 2168,\\n/**/\\n 2167,\\n/**/\\n 2166,\\n/**/\\n 2165,\\n/**/\\n 2164,\\n/**/\\n 2163,\\n/**/\\n 2162,\\n/**/\\n 2161,\\n/**/\\n 2160,\\n/**/\\n 2159,\\n/**/\\n 2158,\\n/**/\\n 2157,\\n/**/\\n 2156,\\n/**/\\n 2155,\\n/**/\\n 2154,\\n/**/\\n 2153,\\n/**/\\n 2152,\\n/**/\\n 2151,\\n/**/\\n 2150,\\n/**/\\n 2149,\\n/**/\\n 2148,\\n/**/\\n 2147,\\n/**/\\n 2146,\\n/**/\\n 2145,\\n/**/\\n 2144,\\n/**/\\n 2143,\\n/**/\\n 2142,\\n/**/\\n 2141,\\n/**/\\n 2140,\\n/**/\\n 2139,\\n/**/\\n 2138,\\n/**/\\n 2137,\\n/**/\\n 2136,\\n/**/\\n 2135,\\n/**/\\n 2134,\\n/**/\\n 2133,\\n/**/\\n 2132,\\n/**/\\n 2131,\\n/**/\\n 2130,\\n/**/\\n 2129,\\n/**/\\n 2128,\\n/**/\\n 2127,\\n/**/\\n 2126,\\n/**/\\n 2125,\\n/**/\\n 2124,\\n/**/\\n 2123,\\n/**/\\n 2122,\\n/**/\\n 2121,\\n/**/\\n 2120,\\n/**/\\n 2119,\\n/**/\\n 2118,\\n/**/\\n 2117,\\n/**/\\n 2116,\\n/**/\\n 2115,\\n/**/\\n 2114,\\n/**/\\n 2113,\\n/**/\\n 2112,\\n/**/\\n 2111,\\n/**/\\n 2110,\\n/**/\\n 2109,\\n/**/\\n 2108,\\n/**/\\n 2107,\\n/**/\\n 2106,\\n/**/\\n 2105,\\n/**/\\n 2104,\\n/**/\\n 2103,\\n/**/\\n 2102,\\n/**/\\n 2101,\\n/**/\\n 2100,\\n/**/\\n 2099,\\n/**/\\n 2098,\\n/**/\\n 2097,\\n/**/\\n 2096,\\n/**/\\n 2095,\\n/**/\\n 2094,\\n/**/\\n 2093,\\n/**/\\n 2092,\\n/**/\\n 2091,\\n/**/\\n 2090,\\n/**/\\n 2089,\\n/**/\\n 2088,\\n/**/\\n 2087,\\n/**/\\n 2086,\\n/**/\\n 2085,\\n/**/\\n 2084,\\n/**/\\n 2083,\\n/**/\\n 2082,\\n/**/\\n 2081,\\n/**/\\n 2080,\\n/**/\\n 2079,\\n/**/\\n 2078,\\n/**/\\n 2077,\\n/**/\\n 2076,\\n/**/\\n 2075,\\n/**/\\n 2074,\\n/**/\\n 2073,\\n/**/\\n 2072,\\n/**/\\n 2071,\\n/**/\\n 2070,\\n/**/\\n 2069,\\n/**/\\n 2068,\\n/**/\\n 2067,\\n/**/\\n 2066,\\n/**/\\n 2065,\\n/**/\\n 2064,\\n/**/\\n 2063,\\n/**/\\n 2062,\\n/**/\\n 2061,\\n/**/\\n 2060,\\n/**/\\n 2059,\\n/**/\\n 2058,\\n/**/\\n 2057,\\n/**/\\n 2056,\\n/**/\\n 2055,\\n/**/\\n 2054,\\n/**/\\n 2053,\\n/**/\\n 2052,\\n/**/\\n 2051,\\n/**/\\n 2050,\\n/**/\\n 2049,\\n/**/\\n 2048,\\n/**/\\n 2047,\\n/**/\\n 2046,\\n/**/\\n 2045,\\n/**/\\n 2044,\\n/**/\\n 2043,\\n/**/\\n 2042,\\n/**/\\n 2041,\\n/**/\\n 2040,\\n/**/\\n 2039,\\n/**/\\n 2038,\\n/**/\\n 2037,\\n/**/\\n 2036,\\n/**/\\n 2035,\\n/**/\\n 2034,\\n/**/\\n 2033,\\n/**/\\n 2032,\\n/**/\\n 2031,\\n/**/\\n 2030,\\n/**/\\n 2029,\\n/**/\\n 2028,\\n/**/\\n 2027,\\n/**/\\n 2026,\\n/**/\\n 2025,\\n/**/\\n 2024,\\n/**/\\n 2023,\\n/**/\\n 2022,\\n/**/\\n 2021,\\n/**/\\n 2020,\\n/**/\\n 2019,\\n/**/\\n 2018,\\n/**/\\n 2017,\\n/**/\\n 2016,\\n/**/\\n 2015,\\n/**/\\n 2014,\\n/**/\\n 2013,\\n/**/\\n 2012,\\n/**/\\n 2011,\\n/**/\\n 2010,\\n/**/\\n 2009,\\n/**/\\n 2008,\\n/**/\\n 2007,\\n/**/\\n 2006,\\n/**/\\n 2005,\\n/**/\\n 2004,\\n/**/\\n 2003,\\n/**/\\n 2002,\\n/**/\\n 2001,\\n/**/\\n 2000,\\n/**/\\n 1999,\\n/**/\\n 1998,\\n/**/\\n 1997,\\n/**/\\n 1996,\\n/**/\\n 1995,\\n/**/\\n 1994,\\n/**/\\n 1993,\\n/**/\\n 1992,\\n/**/\\n 1991,\\n/**/\\n 1990,\\n/**/\\n 1989,\\n/**/\\n 1988,\\n/**/\\n 1987,\\n/**/\\n 1986,\\n/**/\\n 1985,\\n/**/\\n 1984,\\n/**/\\n 1983,\\n/**/\\n 1982,\\n/**/\\n 1981,\\n/**/\\n 1980,\\n/**/\\n 1979,\\n/**/\\n 1978,\\n/**/\\n 1977,\\n/**/\\n 1976,\\n/**/\\n 1975,\\n/**/\\n 1974,\\n/**/\\n 1973,\\n/**/\\n 1972,\\n/**/\\n 1971,\\n/**/\\n 1970,\\n/**/\\n 1969,\\n/**/\\n 1968,\\n/**/\\n 1967,\\n/**/\\n 1966,\\n/**/\\n 1965,\\n/**/\\n 1964,\\n/**/\\n 1963,\\n/**/\\n 1962,\\n/**/\\n 1961,\\n/**/\\n 1960,\\n/**/\\n 1959,\\n/**/\\n 1958,\\n/**/\\n 1957,\\n/**/\\n 1956,\\n/**/\\n 1955,\\n/**/\\n 1954,\\n/**/\\n 1953,\\n/**/\\n 1952,\\n/**/\\n 1951,\\n/**/\\n 1950,\\n/**/\\n 1949,\\n/**/\\n 1948,\\n/**/\\n 1947,\\n/**/\\n 1946,\\n/**/\\n 1945,\\n/**/\\n 1944,\\n/**/\\n 1943,\\n/**/\\n 1942,\\n/**/\\n 1941,\\n/**/\\n 1940,\\n/**/\\n 1939,\\n/**/\\n 1938,\\n/**/\\n 1937,\\n/**/\\n 1936,\\n/**/\\n 1935,\\n/**/\\n 1934,\\n/**/\\n 1933,\\n/**/\\n 1932,\\n/**/\\n 1931,\\n/**/\\n 1930,\\n/**/\\n 1929,\\n/**/\\n 1928,\\n/**/\\n 1927,\\n/**/\\n 1926,\\n/**/\\n 1925,\\n/**/\\n 1924,\\n/**/\\n 1923,\\n/**/\\n 1922,\\n/**/\\n 1921,\\n/**/\\n 1920,\\n/**/\\n 1919,\\n/**/\\n 1918,\\n/**/\\n 1917,\\n/**/\\n 1916,\\n/**/\\n 1915,\\n/**/\\n 1914,\\n/**/\\n 1913,\\n/**/\\n 1912,\\n/**/\\n 1911,\\n/**/\\n 1910,\\n/**/\\n 1909,\\n/**/\\n 1908,\\n/**/\\n 1907,\\n/**/\\n 1906,\\n/**/\\n 1905,\\n/**/\\n 1904,\\n/**/\\n 1903,\\n/**/\\n 1902,\\n/**/\\n 1901,\\n/**/\\n 1900,\\n/**/\\n 1899,\\n/**/\\n 1898,\\n/**/\\n 1897,\\n/**/\\n 1896,\\n/**/\\n 1895,\\n/**/\\n 1894,\\n/**/\\n 1893,\\n/**/\\n 1892,\\n/**/\\n 1891,\\n/**/\\n 1890,\\n/**/\\n 1889,\\n/**/\\n 1888,\\n/**/\\n 1887,\\n/**/\\n 1886,\\n/**/\\n 1885,\\n/**/\\n 1884,\\n/**/\\n 1883,\\n/**/\\n 1882,\\n/**/\\n 1881,\\n/**/\\n 1880,\\n/**/\\n 1879,\\n/**/\\n 1878,\\n/**/\\n 1877,\\n/**/\\n 1876,\\n/**/\\n 1875,\\n/**/\\n 1874,\\n/**/\\n 1873,\\n/**/\\n 1872,\\n/**/\\n 1871,\\n/**/\\n 1870,\\n/**/\\n 1869,\\n/**/\\n 1868,\\n/**/\\n 1867,\\n/**/\\n 1866,\\n/**/\\n 1865,\\n/**/\\n 1864,\\n/**/\\n 1863,\\n/**/\\n 1862,\\n/**/\\n 1861,\\n/**/\\n 1860,\\n/**/\\n 1859,\\n/**/\\n 1858,\\n/**/\\n 1857,\\n/**/\\n 1856,\\n/**/\\n 1855,\\n/**/\\n 1854,\\n/**/\\n 1853,\\n/**/\\n 1852,\\n/**/\\n 1851,\\n/**/\\n 1850,\\n/**/\\n 1849,\\n/**/\\n 1848,\\n/**/\\n 1847,\\n/**/\\n 1846,\\n/**/\\n 1845,\\n/**/\\n 1844,\\n/**/\\n 1843,\\n/**/\\n 1842,\\n/**/\\n 1841,\\n/**/\\n 1840,\\n/**/\\n 1839,\\n/**/\\n 1838,\\n/**/\\n 1837,\\n/**/\\n 1836,\\n/**/\\n 1835,\\n/**/\\n 1834,\\n/**/\\n 1833,\\n/**/\\n 1832,\\n/**/\\n 1831,\\n/**/\\n 1830,\\n/**/\\n 1829,\\n/**/\\n 1828,\\n/**/\\n 1827,\\n/**/\\n 1826,\\n/**/\\n 1825,\\n/**/\\n 1824,\\n/**/\\n 1823,\\n/**/\\n 1822,\\n/**/\\n 1821,\\n/**/\\n 1820,\\n/**/\\n 1819,\\n/**/\\n 1818,\\n/**/\\n 1817,\\n/**/\\n 1816,\\n/**/\\n 1815,\\n/**/\\n 1814,\\n/**/\\n 1813,\\n/**/\\n 1812,\\n/**/\\n 1811,\\n/**/\\n 1810,\\n/**/\\n 1809,\\n/**/\\n 1808,\\n/**/\\n 1807,\\n/**/\\n 1806,\\n/**/\\n 1805,\\n/**/\\n 1804,\\n/**/\\n 1803,\\n/**/\\n 1802,\\n/**/\\n 1801,\\n/**/\\n 1800,\\n/**/\\n 1799,\\n/**/\\n 1798,\\n/**/\\n 1797,\\n/**/\\n 1796,\\n/**/\\n 1795,\\n/**/\\n 1794,\\n/**/\\n 1793,\\n/**/\\n 1792,\\n/**/\\n 1791,\\n/**/\\n 1790,\\n/**/\\n 1789,\\n/**/\\n 1788,\\n/**/\\n 1787,\\n/**/\\n 1786,\\n/**/\\n 1785,\\n/**/\\n 1784,\\n/**/\\n 1783,\\n/**/\\n 1782,\\n/**/\\n 1781,\\n/**/\\n 1780,\\n/**/\\n 1779,\\n/**/\\n 1778,\\n/**/\\n 1777,\\n/**/\\n 1776,\\n/**/\\n 1775,\\n/**/\\n 1774,\\n/**/\\n 1773,\\n/**/\\n 1772,\\n/**/\\n 1771,\\n/**/\\n 1770,\\n/**/\\n 1769,\\n/**/\\n 1768,\\n/**/\\n 1767,\\n/**/\\n 1766,\\n/**/\\n 1765,\\n/**/\\n 1764,\\n/**/\\n 1763,\\n/**/\\n 1762,\\n/**/\\n 1761,\\n/**/\\n 1760,\\n/**/\\n 1759,\\n/**/\\n 1758,\\n/**/\\n 1757,\\n/**/\\n 1756,\\n/**/\\n 1755,\\n/**/\\n 1754,\\n/**/\\n 1753,\\n/**/\\n 1752,\\n/**/\\n 1751,\\n/**/\\n 1750,\\n/**/\\n 1749,\\n/**/\\n 1748,\\n/**/\\n 1747,\\n/**/\\n 1746,\\n/**/\\n 1745,\\n/**/\\n 1744,\\n/**/\\n 1743,\\n/**/\\n 1742,\\n/**/\\n 1741,\\n/**/\\n 1740,\\n/**/\\n 1739,\\n/**/\\n 1738,\\n/**/\\n 1737,\\n/**/\\n 1736,\\n/**/\\n 1735,\\n/**/\\n 1734,\\n/**/\\n 1733,\\n/**/\\n 1732,\\n/**/\\n 1731,\\n/**/\\n 1730,\\n/**/\\n 1729,\\n/**/\\n 1728,\\n/**/\\n 1727,\\n/**/\\n 1726,\\n/**/\\n 1725,\\n/**/\\n 1724,\\n/**/\\n 1723,\\n/**/\\n 1722,\\n/**/\\n 1721,\\n/**/\\n 1720,\\n/**/\\n 1719,\\n/**/\\n 1718,\\n/**/\\n 1717,\\n/**/\\n 1716,\\n/**/\\n 1715,\\n/**/\\n 1714,\\n/**/\\n 1713,\\n/**/\\n 1712,\\n/**/\\n 1711,\\n/**/\\n 1710,\\n/**/\\n 1709,\\n/**/\\n 1708,\\n/**/\\n 1707,\\n/**/\\n 1706,\\n/**/\\n 1705,\\n/**/\\n 1704,\\n/**/\\n 1703,\\n/**/\\n 1702,\\n/**/\\n 1701,\\n/**/\\n 1700,\\n/**/\\n 1699,\\n/**/\\n 1698,\\n/**/\\n 1697,\\n/**/\\n 1696,\\n/**/\\n 1695,\\n/**/\\n 1694,\\n/**/\\n 1693,\\n/**/\\n 1692,\\n/**/\\n 1691,\\n/**/\\n 1690,\\n/**/\\n 1689,\\n/**/\\n 1688,\\n/**/\\n 1687,\\n/**/\\n 1686,\\n/**/\\n 1685,\\n/**/\\n 1684,\\n/**/\\n 1683,\\n/**/\\n 1682,\\n/**/\\n 1681,\\n/**/\\n 1680,\\n/**/\\n 1679,\\n/**/\\n 1678,\\n/**/\\n 1677,\\n/**/\\n 1676,\\n/**/\\n 1675,\\n/**/\\n 1674,\\n/**/\\n 1673,\\n/**/\\n 1672,\\n/**/\\n 1671,\\n/**/\\n 1670,\\n/**/\\n 1669,\\n/**/\\n 1668,\\n/**/\\n 1667,\\n/**/\\n 1666,\\n/**/\\n 1665,\\n/**/\\n 1664,\\n/**/\\n 1663,\\n/**/\\n 1662,\\n/**/\\n 1661,\\n/**/\\n 1660,\\n/**/\\n 1659,\\n/**/\\n 1658,\\n/**/\\n 1657,\\n/**/\\n 1656,\\n/**/\\n 1655,\\n/**/\\n 1654,\\n/**/\\n 1653,\\n/**/\\n 1652,\\n/**/\\n 1651,\\n/**/\\n 1650,\\n/**/\\n 1649,\\n/**/\\n 1648,\\n/**/\\n 1647,\\n/**/\\n 1646,\\n/**/\\n 1645,\\n/**/\\n 1644,\\n/**/\\n 1643,\\n/**/\\n 1642,\\n/**/\\n 1641,\\n/**/\\n 1640,\\n/**/\\n 1639,\\n/**/\\n 1638,\\n/**/\\n 1637,\\n/**/\\n 1636,\\n/**/\\n 1635,\\n/**/\\n 1634,\\n/**/\\n 1633,\\n/**/\\n 1632,\\n/**/\\n 1631,\\n/**/\\n 1630,\\n/**/\\n 1629,\\n/**/\\n 1628,\\n/**/\\n 1627,\\n/**/\\n 1626,\\n/**/\\n 1625,\\n/**/\\n 1624,\\n/**/\\n 1623,\\n/**/\\n 1622,\\n/**/\\n 1621,\\n/**/\\n 1620,\\n/**/\\n 1619,\\n/**/\\n 1618,\\n/**/\\n 1617,\\n/**/\\n 1616,\\n/**/\\n 1615,\\n/**/\\n 1614,\\n/**/\\n 1613,\\n/**/\\n 1612,\\n/**/\\n 1611,\\n/**/\\n 1610,\\n/**/\\n 1609,\\n/**/\\n 1608,\\n/**/\\n 1607,\\n/**/\\n 1606,\\n/**/\\n 1605,\\n/**/\\n 1604,\\n/**/\\n 1603,\\n/**/\\n 1602,\\n/**/\\n 1601,\\n/**/\\n 1600,\\n/**/\\n 1599,\\n/**/\\n 1598,\\n/**/\\n 1597,\\n/**/\\n 1596,\\n/**/\\n 1595,\\n/**/\\n 1594,\\n/**/\\n 1593,\\n/**/\\n 1592,\\n/**/\\n 1591,\\n/**/\\n 1590,\\n/**/\\n 1589,\\n/**/\\n 1588,\\n/**/\\n 1587,\\n/**/\\n 1586,\\n/**/\\n 1585,\\n/**/\\n 1584,\\n/**/\\n 1583,\\n/**/\\n 1582,\\n/**/\\n 1581,\\n/**/\\n 1580,\\n/**/\\n 1579,\\n/**/\\n 1578,\\n/**/\\n 1577,\\n/**/\\n 1576,\\n/**/\\n 1575,\\n/**/\\n 1574,\\n/**/\\n 1573,\\n/**/\\n 1572,\\n/**/\\n 1571,\\n/**/\\n 1570,\\n/**/\\n 1569,\\n/**/\\n 1568,\\n/**/\\n 1567,\\n/**/\\n 1566,\\n/**/\\n 1565,\\n/**/\\n 1564,\\n/**/\\n 1563,\\n/**/\\n 1562,\\n/**/\\n 1561,\\n/**/\\n 1560,\\n/**/\\n 1559,\\n/**/\\n 1558,\\n/**/\\n 1557,\\n/**/\\n 1556,\\n/**/\\n 1555,\\n/**/\\n 1554,\\n/**/\\n 1553,\\n/**/\\n 1552,\\n/**/\\n 1551,\\n/**/\\n 1550,\\n/**/\\n 1549,\\n/**/\\n 1548,\\n/**/\\n 1547,\\n/**/\\n 1546,\\n/**/\\n 1545,\\n/**/\\n 1544,\\n/**/\\n 1543,\\n/**/\\n 1542,\\n/**/\\n 1541,\\n/**/\\n 1540,\\n/**/\\n 1539,\\n/**/\\n 1538,\\n/**/\\n 1537,\\n/**/\\n 1536,\\n/**/\\n 1535,\\n/**/\\n 1534,\\n/**/\\n 1533,\\n/**/\\n 1532,\\n/**/\\n 1531,\\n/**/\\n 1530,\\n/**/\\n 1529,\\n/**/\\n 1528,\\n/**/\\n 1527,\\n/**/\\n 1526,\\n/**/\\n 1525,\\n/**/\\n 1524,\\n/**/\\n 1523,\\n/**/\\n 1522,\\n/**/\\n 1521,\\n/**/\\n 1520,\\n/**/\\n 1519,\\n/**/\\n 1518,\\n/**/\\n 1517,\\n/**/\\n 1516,\\n/**/\\n 1515,\\n/**/\\n 1514,\\n/**/\\n 1513,\\n/**/\\n 1512,\\n/**/\\n 1511,\\n/**/\\n 1510,\\n/**/\\n 1509,\\n/**/\\n 1508,\\n/**/\\n 1507,\\n/**/\\n 1506,\\n/**/\\n 1505,\\n/**/\\n 1504,\\n/**/\\n 1503,\\n/**/\\n 1502,\\n/**/\\n 1501,\\n/**/\\n 1500,\\n/**/\\n 1499,\\n/**/\\n 1498,\\n/**/\\n 1497,\\n/**/\\n 1496,\\n/**/\\n 1495,\\n/**/\\n 1494,\\n/**/\\n 1493,\\n/**/\\n 1492,\\n/**/\\n 1491,\\n/**/\\n 1490,\\n/**/\\n 1489,\\n/**/\\n 1488,\\n/**/\\n 1487,\\n/**/\\n 1486,\\n/**/\\n 1485,\\n/**/\\n 1484,\\n/**/\\n 1483,\\n/**/\\n 1482,\\n/**/\\n 1481,\\n/**/\\n 1480,\\n/**/\\n 1479,\\n/**/\\n 1478,\\n/**/\\n 1477,\\n/**/\\n 1476,\\n/**/\\n 1475,\\n/**/\\n 1474,\\n/**/\\n 1473,\\n/**/\\n 1472,\\n/**/\\n 1471,\\n/**/\\n 1470,\\n/**/\\n 1469,\\n/**/\\n 1468,\\n/**/\\n 1467,\\n/**/\\n 1466,\\n/**/\\n 1465,\\n/**/\\n 1464,\\n/**/\\n 1463,\\n/**/\\n 1462,\\n/**/\\n 1461,\\n/**/\\n 1460,\\n/**/\\n 1459,\\n/**/\\n 1458,\\n/**/\\n 1457,\\n/**/\\n 1456,\\n/**/\\n 1455,\\n/**/\\n 1454,\\n/**/\\n 1453,\\n/**/\\n 1452,\\n/**/\\n 1451,\\n/**/\\n 1450,\\n/**/\\n 1449,\\n/**/\\n 1448,\\n/**/\\n 1447,\\n/**/\\n 1446,\\n/**/\\n 1445,\\n/**/\\n 1444,\\n/**/\\n 1443,\\n/**/\\n 1442,\\n/**/\\n 1441,\\n/**/\\n 1440,\\n/**/\\n 1439,\\n/**/\\n 1438,\\n/**/\\n 1437,\\n/**/\\n 1436,\\n/**/\\n 1435,\\n/**/\\n 1434,\\n/**/\\n 1433,\\n/**/\\n 1432,\\n/**/\\n 1431,\\n/**/\\n 1430,\\n/**/\\n 1429,\\n/**/\\n 1428,\\n/**/\\n 1427,\\n/**/\\n 1426,\\n/**/\\n 1425,\\n/**/\\n 1424,\\n/**/\\n 1423,\\n/**/\\n 1422,\\n/**/\\n 1421,\\n/**/\\n 1420,\\n/**/\\n 1419,\\n/**/\\n 1418,\\n/**/\\n 1417,\\n/**/\\n 1416,\\n/**/\\n 1415,\\n/**/\\n 1414,\\n/**/\\n 1413,\\n/**/\\n 1412,\\n/**/\\n 1411,\\n/**/\\n 1410,\\n/**/\\n 1409,\\n/**/\\n 1408,\\n/**/\\n 1407,\\n/**/\\n 1406,\\n/**/\\n 1405,\\n/**/\\n 1404,\\n/**/\\n 1403,\\n/**/\\n 1402,\\n/**/\\n 1401,\\n/**/\\n 1400,\\n/**/\\n 1399,\\n/**/\\n 1398,\\n/**/\\n 1397,\\n/**/\\n 1396,\\n/**/\\n 1395,\\n/**/\\n 1394,\\n/**/\\n 1393,\\n/**/\\n 1392,\\n/**/\\n 1391,\\n/**/\\n 1390,\\n/**/\\n 1389,\\n/**/\\n 1388,\\n/**/\\n 1387,\\n/**/\\n 1386,\\n/**/\\n 1385,\\n/**/\\n 1384,\\n/**/\\n 1383,\\n/**/\\n 1382,\\n/**/\\n 1381,\\n/**/\\n 1380,\\n/**/\\n 1379,\\n/**/\\n 1378,\\n/**/\\n 1377,\\n/**/\\n 1376,\\n/**/\\n 1375,\\n/**/\\n 1374,\\n/**/\\n 1373,\\n/**/\\n 1372,\\n/**/\\n 1371,\\n/**/\\n 1370,\\n/**/\\n 1369,\\n/**/\\n 1368,\\n/**/\\n 1367,\\n/**/\\n 1366,\\n/**/\\n 1365,\\n/**/\\n 1364,\\n/**/\\n 1363,\\n/**/\\n 1362,\\n/**/\\n 1361,\\n/**/\\n 1360,\\n/**/\\n 1359,\\n/**/\\n 1358,\\n/**/\\n 1357,\\n/**/\\n 1356,\\n/**/\\n 1355,\\n/**/\\n 1354,\\n/**/\\n 1353,\\n/**/\\n 1352,\\n/**/\\n 1351,\\n/**/\\n 1350,\\n/**/\\n 1349,\\n/**/\\n 1348,\\n/**/\\n 1347,\\n/**/\\n 1346,\\n/**/\\n 1345,\\n/**/\\n 1344,\\n/**/\\n 1343,\\n/**/\\n 1342,\\n/**/\\n 1341,\\n/**/\\n 1340,\\n/**/\\n 1339,\\n/**/\\n 1338,\\n/**/\\n 1337,\\n/**/\\n 1336,\\n/**/\\n 1335,\\n/**/\\n 1334,\\n/**/\\n 1333,\\n/**/\\n 1332,\\n/**/\\n 1331,\\n/**/\\n 1330,\\n/**/\\n 1329,\\n/**/\\n 1328,\\n/**/\\n 1327,\\n/**/\\n 1326,\\n/**/\\n 1325,\\n/**/\\n 1324,\\n/**/\\n 1323,\\n/**/\\n 1322,\\n/**/\\n 1321,\\n/**/\\n 1320,\\n/**/\\n 1319,\\n/**/\\n 1318,\\n/**/\\n 1317,\\n/**/\\n 1316,\\n/**/\\n 1315,\\n/**/\\n 1314,\\n/**/\\n 1313,\\n/**/\\n 1312,\\n/**/\\n 1311,\\n/**/\\n 1310,\\n/**/\\n 1309,\\n/**/\\n 1308,\\n/**/\\n 1307,\\n/**/\\n 1306,\\n/**/\\n 1305,\\n/**/\\n 1304,\\n/**/\\n 1303,\\n/**/\\n 1302,\\n/**/\\n 1301,\\n/**/\\n 1300,\\n/**/\\n 1299,\\n/**/\\n 1298,\\n/**/\\n 1297,\\n/**/\\n 1296,\\n/**/\\n 1295,\\n/**/\\n 1294,\\n/**/\\n 1293,\\n/**/\\n 1292,\\n/**/\\n 1291,\\n/**/\\n 1290,\\n/**/\\n 1289,\\n/**/\\n 1288,\\n/**/\\n 1287,\\n/**/\\n 1286,\\n/**/\\n 1285,\\n/**/\\n 1284,\\n/**/\\n 1283,\\n/**/\\n 1282,\\n/**/\\n 1281,\\n/**/\\n 1280,\\n/**/\\n 1279,\\n/**/\\n 1278,\\n/**/\\n 1277,\\n/**/\\n 1276,\\n/**/\\n 1275,\\n/**/\\n 1274,\\n/**/\\n 1273,\\n/**/\\n 1272,\\n/**/\\n 1271,\\n/**/\\n 1270,\\n/**/\\n 1269,\\n/**/\\n 1268,\\n/**/\\n 1267,\\n/**/\\n 1266,\\n/**/\\n 1265,\\n/**/\\n 1264,\\n/**/\\n 1263,\\n/**/\\n 1262,\\n/**/\\n 1261,\\n/**/\\n 1260,\\n/**/\\n 1259,\\n/**/\\n 1258,\\n/**/\\n 1257,\\n/**/\\n 1256,\\n/**/\\n 1255,\\n/**/\\n 1254,\\n/**/\\n 1253,\\n/**/\\n 1252,\\n/**/\\n 1251,\\n/**/\\n 1250,\\n/**/\\n 1249,\\n/**/\\n 1248,\\n/**/\\n 1247,\\n/**/\\n 1246,\\n/**/\\n 1245,\\n/**/\\n 1244,\\n/**/\\n 1243,\\n/**/\\n 1242,\\n/**/\\n 1241,\\n/**/\\n 1240,\\n/**/\\n 1239,\\n/**/\\n 1238,\\n/**/\\n 1237,\\n/**/\\n 1236,\\n/**/\\n 1235,\\n/**/\\n 1234,\\n/**/\\n 1233,\\n/**/\\n 1232,\\n/**/\\n 1231,\\n/**/\\n 1230,\\n/**/\\n 1229,\\n/**/\\n 1228,\\n/**/\\n 1227,\\n/**/\\n 1226,\\n/**/\\n 1225,\\n/**/\\n 1224,\\n/**/\\n 1223,\\n/**/\\n 1222,\\n/**/\\n 1221,\\n/**/\\n 1220,\\n/**/\\n 1219,\\n/**/\\n 1218,\\n/**/\\n 1217,\\n/**/\\n 1216,\\n/**/\\n 1215,\\n/**/\\n 1214,\\n/**/\\n 1213,\\n/**/\\n 1212,\\n/**/\\n 1211,\\n/**/\\n 1210,\\n/**/\\n 1209,\\n/**/\\n 1208,\\n/**/\\n 1207,\\n/**/\\n 1206,\\n/**/\\n 1205,\\n/**/\\n 1204,\\n/**/\\n 1203,\\n/**/\\n 1202,\\n/**/\\n 1201,\\n/**/\\n 1200,\\n/**/\\n 1199,\\n/**/\\n 1198,\\n/**/\\n 1197,\\n/**/\\n 1196,\\n/**/\\n 1195,\\n/**/\\n 1194,\\n/**/\\n 1193,\\n/**/\\n 1192,\\n/**/\\n 1191,\\n/**/\\n 1190,\\n/**/\\n 1189,\\n/**/\\n 1188,\\n/**/\\n 1187,\\n/**/\\n 1186,\\n/**/\\n 1185,\\n/**/\\n 1184,\\n/**/\\n 1183,\\n/**/\\n 1182,\\n/**/\\n 1181,\\n/**/\\n 1180,\\n/**/\\n 1179,\\n/**/\\n 1178,\\n/**/\\n 1177,\\n/**/\\n 1176,\\n/**/\\n 1175,\\n/**/\\n 1174,\\n/**/\\n 1173,\\n/**/\\n 1172,\\n/**/\\n 1171,\\n/**/\\n 1170,\\n/**/\\n 1169,\\n/**/\\n 1168,\\n/**/\\n 1167,\\n/**/\\n 1166,\\n/**/\\n 1165,\\n/**/\\n 1164,\\n/**/\\n 1163,\\n/**/\\n 1162,\\n/**/\\n 1161,\\n/**/\\n 1160,\\n/**/\\n 1159,\\n/**/\\n 1158,\\n/**/\\n 1157,\\n/**/\\n 1156,\\n/**/\\n 1155,\\n/**/\\n 1154,\\n/**/\\n 1153,\\n/**/\\n 1152,\\n/**/\\n 1151,\\n/**/\\n 1150,\\n/**/\\n 1149,\\n/**/\\n 1148,\\n/**/\\n 1147,\\n/**/\\n 1146,\\n/**/\\n 1145,\\n/**/\\n 1144,\\n/**/\\n 1143,\\n/**/\\n 1142,\\n/**/\\n 1141,\\n/**/\\n 1140,\\n/**/\\n 1139,\\n/**/\\n 1138,\\n/**/\\n 1137,\\n/**/\\n 1136,\\n/**/\\n 1135,\\n/**/\\n 1134,\\n/**/\\n 1133,\\n/**/\\n 1132,\\n/**/\\n 1131,\\n/**/\\n 1130,\\n/**/\\n 1129,\\n/**/\\n 1128,\\n/**/\\n 1127,\\n/**/\\n 1126,\\n/**/\\n 1125,\\n/**/\\n 1124,\\n/**/\\n 1123,\\n/**/\\n 1122,\\n/**/\\n 1121,\\n/**/\\n 1120,\\n/**/\\n 1119,\\n/**/\\n 1118,\\n/**/\\n 1117,\\n/**/\\n 1116,\\n/**/\\n 1115,\\n/**/\\n 1114,\\n/**/\\n 1113,\\n/**/\\n 1112,\\n/**/\\n 1111,\\n/**/\\n 1110,\\n/**/\\n 1109,\\n/**/\\n 1108,\\n/**/\\n 1107,\\n/**/\\n 1106,\\n/**/\\n 1105,\\n/**/\\n 1104,\\n/**/\\n 1103,\\n/**/\\n 1102,\\n/**/\\n 1101,\\n/**/\\n 1100,\\n/**/\\n 1099,\\n/**/\\n 1098,\\n/**/\\n 1097,\\n/**/\\n 1096,\\n/**/\\n 1095,\\n/**/\\n 1094,\\n/**/\\n 1093,\\n/**/\\n 1092,\\n/**/\\n 1091,\\n/**/\\n 1090,\\n/**/\\n 1089,\\n/**/\\n 1088,\\n/**/\\n 1087,\\n/**/\\n 1086,\\n/**/\\n 1085,\\n/**/\\n 1084,\\n/**/\\n 1083,\\n/**/\\n 1082,\\n/**/\\n 1081,\\n/**/\\n 1080,\\n/**/\\n 1079,\\n/**/\\n 1078,\\n/**/\\n 1077,\\n/**/\\n 1076,\\n/**/\\n 1075,\\n/**/\\n 1074,\\n/**/\\n 1073,\\n/**/\\n 1072,\\n/**/\\n 1071,\\n/**/\\n 1070,\\n/**/\\n 1069,\\n/**/\\n 1068,\\n/**/\\n 1067,\\n/**/\\n 1066,\\n/**/\\n 1065,\\n/**/\\n 1064,\\n/**/\\n 1063,\\n/**/\\n 1062,\\n/**/\\n 1061,\\n/**/\\n 1060,\\n/**/\\n 1059,\\n/**/\\n 1058,\\n/**/\\n 1057,\\n/**/\\n 1056,\\n/**/\\n 1055,\\n/**/\\n 1054,\\n/**/\\n 1053,\\n/**/\\n 1052,\\n/**/\\n 1051,\\n/**/\\n 1050,\\n/**/\\n 1049,\\n/**/\\n 1048,\\n/**/\\n 1047,\\n/**/\\n 1046,\\n/**/\\n 1045,\\n/**/\\n 1044,\\n/**/\\n 1043,\\n/**/\\n 1042,\\n/**/\\n 1041,\\n/**/\\n 1040,\\n/**/\\n 1039,\\n/**/\\n 1038,\\n/**/\\n 1037,\\n/**/\\n 1036,\\n/**/\\n 1035,\\n/**/\\n 1034,\\n/**/\\n 1033,\\n/**/\\n 1032,\\n/**/\\n 1031,\\n/**/\\n 1030,\\n/**/\\n 1029,\\n/**/\\n 1028,\\n/**/\\n 1027,\\n/**/\\n 1026,\\n/**/\\n 1025,\\n/**/\\n 1024,\\n/**/\\n 1023,\\n/**/\\n 1022,\\n/**/\\n 1021,\\n/**/\\n 1020,\\n/**/\\n 1019,\\n/**/\\n 1018,\\n/**/\\n 1017,\\n/**/\\n 1016,\\n/**/\\n 1015,\\n/**/\\n 1014,\\n/**/\\n 1013,\\n/**/\\n 1012,\\n/**/\\n 1011,\\n/**/\\n 1010,\\n/**/\\n 1009,\\n/**/\\n 1008,\\n/**/\\n 1007,\\n/**/\\n 1006,\\n/**/\\n 1005,\\n/**/\\n 1004,\\n/**/\\n 1003,\\n/**/\\n 1002,\\n/**/\\n 1001,\\n/**/\\n 1000,\\n/**/\\n 999,\\n/**/\\n 998,\\n/**/\\n 997,\\n/**/\\n 996,\\n/**/\\n 995,\\n/**/\\n 994,\\n/**/\\n 993,\\n/**/\\n 992,\\n/**/\\n 991,\\n/**/\\n 990,\\n/**/\\n 989,\\n/**/\\n 988,\\n/**/\\n 987,\\n/**/\\n 986,\\n/**/\\n 985,\\n/**/\\n 984,\\n/**/\\n 983,\\n/**/\\n 982,\\n/**/\\n 981,\\n/**/\\n 980,\\n/**/\\n 979,\\n/**/\\n 978,\\n/**/\\n 977,\\n/**/\\n 976,\\n/**/\\n 975,\\n/**/\\n 974,\\n/**/\\n 973,\\n/**/\\n 972,\\n/**/\\n 971,\\n/**/\\n 970,\\n/**/\\n 969,\\n/**/\\n 968,\\n/**/\\n 967,\\n/**/\\n 966,\\n/**/\\n 965,\\n/**/\\n 964,\\n/**/\\n 963,\\n/**/\\n 962,\\n/**/\\n 961,\\n/**/\\n 960,\\n/**/\\n 959,\\n/**/\\n 958,\\n/**/\\n 957,\\n/**/\\n 956,\\n/**/\\n 955,\\n/**/\\n 954,\\n/**/\\n 953,\\n/**/\\n 952,\\n/**/\\n 951,\\n/**/\\n 950,\\n/**/\\n 949,\\n/**/\\n 948,\\n/**/\\n 947,\\n/**/\\n 946,\\n/**/\\n 945,\\n/**/\\n 944,\\n/**/\\n 943,\\n/**/\\n 942,\\n/**/\\n 941,\\n/**/\\n 940,\\n/**/\\n 939,\\n/**/\\n 938,\\n/**/\\n 937,\\n/**/\\n 936,\\n/**/\\n 935,\\n/**/\\n 934,\\n/**/\\n 933,\\n/**/\\n 932,\\n/**/\\n 931,\\n/**/\\n 930,\\n/**/\\n 929,\\n/**/\\n 928,\\n/**/\\n 927,\\n/**/\\n 926,\\n/**/\\n 925,\\n/**/\\n 924,\\n/**/\\n 923,\\n/**/\\n 922,\\n/**/\\n 921,\\n/**/\\n 920,\\n/**/\\n 919,\\n/**/\\n 918,\\n/**/\\n 917,\\n/**/\\n 916,\\n/**/\\n 915,\\n/**/\\n 914,\\n/**/\\n 913,\\n/**/\\n 912,\\n/**/\\n 911,\\n/**/\\n 910,\\n/**/\\n 909,\\n/**/\\n 908,\\n/**/\\n 907,\\n/**/\\n 906,\\n/**/\\n 905,\\n/**/\\n 904,\\n/**/\\n 903,\\n/**/\\n 902,\\n/**/\\n 901,\\n/**/\\n 900,\\n/**/\\n 899,\\n/**/\\n 898,\\n/**/\\n 897,\\n/**/\\n 896,\\n/**/\\n 895,\\n/**/\\n 894,\\n/**/\\n 893,\\n/**/\\n 892,\\n/**/\\n 891,\\n/**/\\n 890,\\n/**/\\n 889,\\n/**/\\n 888,\\n/**/\\n 887,\\n/**/\\n 886,\\n/**/\\n 885,\\n/**/\\n 884,\\n/**/\\n 883,\\n/**/\\n 882,\\n/**/\\n 881,\\n/**/\\n 880,\\n/**/\\n 879,\\n/**/\\n 878,\\n/**/\\n 877,\\n/**/\\n 876,\\n/**/\\n 875,\\n/**/\\n 874,\\n/**/\\n 873,\\n/**/\\n 872,\\n/**/\\n 871,\\n/**/\\n 870,\\n/**/\\n 869,\\n/**/\\n 868,\\n/**/\\n 867,\\n/**/\\n 866,\\n/**/\\n 865,\\n/**/\\n 864,\\n/**/\\n 863,\\n/**/\\n 862,\\n/**/\\n 861,\\n/**/\\n 860,\\n/**/\\n 859,\\n/**/\\n 858,\\n/**/\\n 857,\\n/**/\\n 856,\\n/**/\\n 855,\\n/**/\\n 854,\\n/**/\\n 853,\\n/**/\\n 852,\\n/**/\\n 851,\\n/**/\\n 850,\\n/**/\\n 849,\\n/**/\\n 848,\\n/**/\\n 847,\\n/**/\\n 846,\\n/**/\\n 845,\\n/**/\\n 844,\\n/**/\\n 843,\\n/**/\\n 842,\\n/**/\\n 841,\\n/**/\\n 840,\\n/**/\\n 839,\\n/**/\\n 838,\\n/**/\\n 837,\\n/**/\\n 836,\\n/**/\\n 835,\\n/**/\\n 834,\\n/**/\\n 833,\\n/**/\\n 832,\\n/**/\\n 831,\\n/**/\\n 830,\\n/**/\\n 829,\\n/**/\\n 828,\\n/**/\\n 827,\\n/**/\\n 826,\\n/**/\\n 825,\\n/**/\\n 824,\\n/**/\\n 823,\\n/**/\\n 822,\\n/**/\\n 821,\\n/**/\\n 820,\\n/**/\\n 819,\\n/**/\\n 818,\\n/**/\\n 817,\\n/**/\\n 816,\\n/**/\\n 815,\\n/**/\\n 814,\\n/**/\\n 813,\\n/**/\\n 812,\\n/**/\\n 811,\\n/**/\\n 810,\\n/**/\\n 809,\\n/**/\\n 808,\\n/**/\\n 807,\\n/**/\\n 806,\\n/**/\\n 805,\\n/**/\\n 804,\\n/**/\\n 803,\\n/**/\\n 802,\\n/**/\\n 801,\\n/**/\\n 800,\\n/**/\\n 799,\\n/**/\\n 798,\\n/**/\\n 797,\\n/**/\\n 796,\\n/**/\\n 795,\\n/**/\\n 794,\\n/**/\\n 793,\\n/**/\\n 792,\\n/**/\\n 791,\\n/**/\\n 790,\\n/**/\\n 789,\\n/**/\\n 788,\\n/**/\\n 787,\\n/**/\\n 786,\\n/**/\\n 785,\\n/**/\\n 784,\\n/**/\\n 783,\\n/**/\\n 782,\\n/**/\\n 781,\\n/**/\\n 780,\\n/**/\\n 779,\\n/**/\\n 778,\\n/**/\\n 777,\\n/**/\\n 776,\\n/**/\\n 775,\\n/**/\\n 774,\\n/**/\\n 773,\\n/**/\\n 772,\\n/**/\\n 771,\\n/**/\\n 770,\\n/**/\\n 769,\\n/**/\\n 768,\\n/**/\\n 767,\\n/**/\\n 766,\\n/**/\\n 765,\\n/**/\\n 764,\\n/**/\\n 763,\\n/**/\\n 762,\\n/**/\\n 761,\\n/**/\\n 760,\\n/**/\\n 759,\\n/**/\\n 758,\\n/**/\\n 757,\\n/**/\\n 756,\\n/**/\\n 755,\\n/**/\\n 754,\\n/**/\\n 753,\\n/**/\\n 752,\\n/**/\\n 751,\\n/**/\\n 750,\\n/**/\\n 749,\\n/**/\\n 748,\\n/**/\\n 747,\\n/**/\\n 746,\\n/**/\\n 745,\\n/**/\\n 744,\\n/**/\\n 743,\\n/**/\\n 742,\\n/**/\\n 741,\\n/**/\\n 740,\\n/**/\\n 739,\\n/**/\\n 738,\\n/**/\\n 737,\\n/**/\\n 736,\\n/**/\\n 735,\\n/**/\\n 734,\\n/**/\\n 733,\\n/**/\\n 732,\\n/**/\\n 731,\\n/**/\\n 730,\\n/**/\\n 729,\\n/**/\\n 728,\\n/**/\\n 727,\\n/**/\\n 726,\\n/**/\\n 725,\\n/**/\\n 724,\\n/**/\\n 723,\\n/**/\\n 722,\\n/**/\\n 721,\\n/**/\\n 720,\\n/**/\\n 719,\\n/**/\\n 718,\\n/**/\\n 717,\\n/**/\\n 716,\\n/**/\\n 715,\\n/**/\\n 714,\\n/**/\\n 713,\\n/**/\\n 712,\\n/**/\\n 711,\\n/**/\\n 710,\\n/**/\\n 709,\\n/**/\\n 708,\\n/**/\\n 707,\\n/**/\\n 706,\\n/**/\\n 705,\\n/**/\\n 704,\\n/**/\\n 703,\\n/**/\\n 702,\\n/**/\\n 701,\\n/**/\\n 700,\\n/**/\\n 699,\\n/**/\\n 698,\\n/**/\\n 697,\\n/**/\\n 696,\\n/**/\\n 695,\\n/**/\\n 694,\\n/**/\\n 693,\\n/**/\\n 692,\\n/**/\\n 691,\\n/**/\\n 690,\\n/**/\\n 689,\\n/**/\\n 688,\\n/**/\\n 687,\\n/**/\\n 686,\\n/**/\\n 685,\\n/**/\\n 684,\\n/**/\\n 683,\\n/**/\\n 682,\\n/**/\\n 681,\\n/**/\\n 680,\\n/**/\\n 679,\\n/**/\\n 678,\\n/**/\\n 677,\\n/**/\\n 676,\\n/**/\\n 675,\\n/**/\\n 674,\\n/**/\\n 673,\\n/**/\\n 672,\\n/**/\\n 671,\\n/**/\\n 670,\\n/**/\\n 669,\\n/**/\\n 668,\\n/**/\\n 667,\\n/**/\\n 666,\\n/**/\\n 665,\\n/**/\\n 664,\\n/**/\\n 663,\\n/**/\\n 662,\\n/**/\\n 661,\\n/**/\\n 660,\\n/**/\\n 659,\\n/**/\\n 658,\\n/**/\\n 657,\\n/**/\\n 656,\\n/**/\\n 655,\\n/**/\\n 654,\\n/**/\\n 653,\\n/**/\\n 652,\\n/**/\\n 651,\\n/**/\\n 650,\\n/**/\\n 649,\\n/**/\\n 648,\\n/**/\\n 647,\\n/**/\\n 646,\\n/**/\\n 645,\\n/**/\\n 644,\\n/**/\\n 643,\\n/**/\\n 642,\\n/**/\\n 641,\\n/**/\\n 640,\\n/**/\\n 639,\\n/**/\\n 638,\\n/**/\\n 637,\\n/**/\\n 636,\\n/**/\\n 635,\\n/**/\\n 634,\\n/**/\\n 633,\\n/**/\\n 632,\\n/**/\\n 631,\\n/**/\\n 630,\\n/**/\\n 629,\\n/**/\\n 628,\\n/**/\\n 627,\\n/**/\\n 626,\\n/**/\\n 625,\\n/**/\\n 624,\\n/**/\\n 623,\\n/**/\\n 622,\\n/**/\\n 621,\\n/**/\\n 620,\\n/**/\\n 619,\\n/**/\\n 618,\\n/**/\\n 617,\\n/**/\\n 616,\\n/**/\\n 615,\\n/**/\\n 614,\\n/**/\\n 613,\\n/**/\\n 612,\\n/**/\\n 611,\\n/**/\\n 610,\\n/**/\\n 609,\\n/**/\\n 608,\\n/**/\\n 607,\\n/**/\\n 606,\\n/**/\\n 605,\\n/**/\\n 604,\\n/**/\\n 603,\\n/**/\\n 602,\\n/**/\\n 601,\\n/**/\\n 600,\\n/**/\\n 599,\\n/**/\\n 598,\\n/**/\\n 597,\\n/**/\\n 596,\\n/**/\\n 595,\\n/**/\\n 594,\\n/**/\\n 593,\\n/**/\\n 592,\\n/**/\\n 591,\\n/**/\\n 590,\\n/**/\\n 589,\\n/**/\\n 588,\\n/**/\\n 587,\\n/**/\\n 586,\\n/**/\\n 585,\\n/**/\\n 584,\\n/**/\\n 583,\\n/**/\\n 582,\\n/**/\\n 581,\\n/**/\\n 580,\\n/**/\\n 579,\\n/**/\\n 578,\\n/**/\\n 577,\\n/**/\\n 576,\\n/**/\\n 575,\\n/**/\\n 574,\\n/**/\\n 573,\\n/**/\\n 572,\\n/**/\\n 571,\\n/**/\\n 570,\\n/**/\\n 569,\\n/**/\\n 568,\\n/**/\\n 567,\\n/**/\\n 566,\\n/**/\\n 565,\\n/**/\\n 564,\\n/**/\\n 563,\\n/**/\\n 562,\\n/**/\\n 561,\\n/**/\\n 560,\\n/**/\\n 559,\\n/**/\\n 558,\\n/**/\\n 557,\\n/**/\\n 556,\\n/**/\\n 555,\\n/**/\\n 554,\\n/**/\\n 553,\\n/**/\\n 552,\\n/**/\\n 551,\\n/**/\\n 550,\\n/**/\\n 549,\\n/**/\\n 548,\\n/**/\\n 547,\\n/**/\\n 546,\\n/**/\\n 545,\\n/**/\\n 544,\\n/**/\\n 543,\\n/**/\\n 542,\\n/**/\\n 541,\\n/**/\\n 540,\\n/**/\\n 539,\\n/**/\\n 538,\\n/**/\\n 537,\\n/**/\\n 536,\\n/**/\\n 535,\\n/**/\\n 534,\\n/**/\\n 533,\\n/**/\\n 532,\\n/**/\\n 531,\\n/**/\\n 530,\\n/**/\\n 529,\\n/**/\\n 528,\\n/**/\\n 527,\\n/**/\\n 526,\\n/**/\\n 525,\\n/**/\\n 524,\\n/**/\\n 523,\\n/**/\\n 522,\\n/**/\\n 521,\\n/**/\\n 520,\\n/**/\\n 519,\\n/**/\\n 518,\\n/**/\\n 517,\\n/**/\\n 516,\\n/**/\\n 515,\\n/**/\\n 514,\\n/**/\\n 513,\\n/**/\\n 512,\\n/**/\\n 511,\\n/**/\\n 510,\\n/**/\\n 509,\\n/**/\\n 508,\\n/**/\\n 507,\\n/**/\\n 506,\\n/**/\\n 505,\\n/**/\\n 504,\\n/**/\\n 503,\\n/**/\\n 502,\\n/**/\\n 501,\\n/**/\\n 500,\\n/**/\\n 499,\\n/**/\\n 498,\\n/**/\\n 497,\\n/**/\\n 496,\\n/**/\\n 495,\\n/**/\\n 494,\\n/**/\\n 493,\\n/**/\\n 492,\\n/**/\\n 491,\\n/**/\\n 490,\\n/**/\\n 489,\\n/**/\\n 488,\\n/**/\\n 487,\\n/**/\\n 486,\\n/**/\\n 485,\\n/**/\\n 484,\\n/**/\\n 483,\\n/**/\\n 482,\\n/**/\\n 481,\\n/**/\\n 480,\\n/**/\\n 479,\\n/**/\\n 478,\\n/**/\\n 477,\\n/**/\\n 476,\\n/**/\\n 475,\\n/**/\\n 474,\\n/**/\\n 473,\\n/**/\\n 472,\\n/**/\\n 471,\\n/**/\\n 470,\\n/**/\\n 469,\\n/**/\\n 468,\\n/**/\\n 467,\\n/**/\\n 466,\\n/**/\\n 465,\\n/**/\\n 464,\\n/**/\\n 463,\\n/**/\\n 462,\\n/**/\\n 461,\\n/**/\\n 460,\\n/**/\\n 459,\\n/**/\\n 458,\\n/**/\\n 457,\\n/**/\\n 456,\\n/**/\\n 455,\\n/**/\\n 454,\\n/**/\\n 453,\\n/**/\\n 452,\\n/**/\\n 451,\\n/**/\\n 450,\\n/**/\\n 449,\\n/**/\\n 448,\\n/**/\\n 447,\\n/**/\\n 446,\\n/**/\\n 445,\\n/**/\\n 444,\\n/**/\\n 443,\\n/**/\\n 442,\\n/**/\\n 441,\\n/**/\\n 440,\\n/**/\\n 439,\\n/**/\\n 438,\\n/**/\\n 437,\\n/**/\\n 436,\\n/**/\\n 435,\\n/**/\\n 434,\\n/**/\\n 433,\\n/**/\\n 432,\\n/**/\\n 431,\\n/**/\\n 430,\\n/**/\\n 429,\\n/**/\\n 428,\\n/**/\\n 427,\\n/**/\\n 426,\\n/**/\\n 425,\\n/**/\\n 424,\\n/**/\\n 423,\\n/**/\\n 422,\\n/**/\\n 421,\\n/**/\\n 420,\\n/**/\\n 419,\\n/**/\\n 418,\\n/**/\\n 417,\\n/**/\\n 416,\\n/**/\\n 415,\\n/**/\\n 414,\\n/**/\\n 413,\\n/**/\\n 412,\\n/**/\\n 411,\\n/**/\\n 410,\\n/**/\\n 409,\\n/**/\\n 408,\\n/**/\\n 407,\\n/**/\\n 406,\\n/**/\\n 405,\\n/**/\\n 404,\\n/**/\\n 403,\\n/**/\\n 402,\\n/**/\\n 401,\\n/**/\\n 400,\\n/**/\\n 399,\\n/**/\\n 398,\\n/**/\\n 397,\\n/**/\\n 396,\\n/**/\\n 395,\\n/**/\\n 394,\\n/**/\\n 393,\\n/**/\\n 392,\\n/**/\\n 391,\\n/**/\\n 390,\\n/**/\\n 389,\\n/**/\\n 388,\\n/**/\\n 387,\\n/**/\\n 386,\\n/**/\\n 385,\\n/**/\\n 384,\\n/**/\\n 383,\\n/**/\\n 382,\\n/**/\\n 381,\\n/**/\\n 380,\\n/**/\\n 379,\\n/**/\\n 378,\\n/**/\\n 377,\\n/**/\\n 376,\\n/**/\\n 375,\\n/**/\\n 374,\\n/**/\\n 373,\\n/**/\\n 372,\\n/**/\\n 371,\\n/**/\\n 370,\\n/**/\\n 369,\\n/**/\\n 368,\\n/**/\\n 367,\\n/**/\\n 366,\\n/**/\\n 365,\\n/**/\\n 364,\\n/**/\\n 363,\\n/**/\\n 362,\\n/**/\\n 361,\\n/**/\\n 360,\\n/**/\\n 359,\\n/**/\\n 358,\\n/**/\\n 357,\\n/**/\\n 356,\\n/**/\\n 355,\\n/**/\\n 354,\\n/**/\\n 353,\\n/**/\\n 352,\\n/**/\\n 351,\\n/**/\\n 350,\\n/**/\\n 349,\\n/**/\\n 348,\\n/**/\\n 347,\\n/**/\\n 346,\\n/**/\\n 345,\\n/**/\\n 344,\\n/**/\\n 343,\\n/**/\\n 342,\\n/**/\\n 341,\\n/**/\\n 340,\\n/**/\\n 339,\\n/**/\\n 338,\\n/**/\\n 337,\\n/**/\\n 336,\\n/**/\\n 335,\\n/**/\\n 334,\\n/**/\\n 333,\\n/**/\\n 332,\\n/**/\\n 331,\\n/**/\\n 330,\\n/**/\\n 329,\\n/**/\\n 328,\\n/**/\\n 327,\\n/**/\\n 326,\\n/**/\\n 325,\\n/**/\\n 324,\\n/**/\\n 323,\\n/**/\\n 322,\\n/**/\\n 321,\\n/**/\\n 320,\\n/**/\\n 319,\\n/**/\\n 318,\\n/**/\\n 317,\\n/**/\\n 316,\\n/**/\\n 315,\\n/**/\\n 314,\\n/**/\\n 313,\\n/**/\\n 312,\\n/**/\\n 311,\\n/**/\\n 310,\\n/**/\\n 309,\\n/**/\\n 308,\\n/**/\\n 307,\\n/**/\\n 306,\\n/**/\\n 305,\\n/**/\\n 304,\\n/**/\\n 303,\\n/**/\\n 302,\\n/**/\\n 301,\\n/**/\\n 300,\\n/**/\\n 299,\\n/**/\\n 298,\\n/**/\\n 297,\\n/**/\\n 296,\\n/**/\\n 295,\\n/**/\\n 294,\\n/**/\\n 293,\\n/**/\\n 292,\\n/**/\\n 291,\\n/**/\\n 290,\\n/**/\\n 289,\\n/**/\\n 288,\\n/**/\\n 287,\\n/**/\\n 286,\\n/**/\\n 285,\\n/**/\\n 284,\\n/**/\\n 283,\\n/**/\\n 282,\\n/**/\\n 281,\\n/**/\\n 280,\\n/**/\\n 279,\\n/**/\\n 278,\\n/**/\\n 277,\\n/**/\\n 276,\\n/**/\\n 275,\\n/**/\\n 274,\\n/**/\\n 273,\\n/**/\\n 272,\\n/**/\\n 271,\\n/**/\\n 270,\\n/**/\\n 269,\\n/**/\\n 268,\\n/**/\\n 267,\\n/**/\\n 266,\\n/**/\\n 265,\\n/**/\\n 264,\\n/**/\\n 263,\\n/**/\\n 262,\\n/**/\\n 261,\\n/**/\\n 260,\\n/**/\\n 259,\\n/**/\\n 258,\\n/**/\\n 257,\\n/**/\\n 256,\\n/**/\\n 255,\\n/**/\\n 254,\\n/**/\\n 253,\\n/**/\\n 252,\\n/**/\\n 251,\\n/**/\\n 250,\\n/**/\\n 249,\\n/**/\\n 248,\\n/**/\\n 247,\\n/**/\\n 246,\\n/**/\\n 245,\\n/**/\\n 244,\\n/**/\\n 243,\\n/**/\\n 242,\\n/**/\\n 241,\\n/**/\\n 240,\\n/**/\\n 239,\\n/**/\\n 238,\\n/**/\\n 237,\\n/**/\\n 236,\\n/**/\\n 235,\\n/**/\\n 234,\\n/**/\\n 233,\\n/**/\\n 232,\\n/**/\\n 231,\\n/**/\\n 230,\\n/**/\\n 229,\\n/**/\\n 228,\\n/**/\\n 227,\\n/**/\\n 226,\\n/**/\\n 225,\\n/**/\\n 224,\\n/**/\\n 223,\\n/**/\\n 222,\\n/**/\\n 221,\\n/**/\\n 220,\\n/**/\\n 219,\\n/**/\\n 218,\\n/**/\\n 217,\\n/**/\\n 216,\\n/**/\\n 215,\\n/**/\\n 214,\\n/**/\\n 213,\\n/**/\\n 212,\\n/**/\\n 211,\\n/**/\\n 210,\\n/**/\\n 209,\\n/**/\\n 208,\\n/**/\\n 207,\\n/**/\\n 206,\\n/**/\\n 205,\\n/**/\\n 204,\\n/**/\\n 203,\\n/**/\\n 202,\\n/**/\\n 201,\\n/**/\\n 200,\\n/**/\\n 199,\\n/**/\\n 198,\\n/**/\\n 197,\\n/**/\\n 196,\\n/**/\\n 195,\\n/**/\\n 194,\\n/**/\\n 193,\\n/**/\\n 192,\\n/**/\\n 191,\\n/**/\\n 190,\\n/**/\\n 189,\\n/**/\\n 188,\\n/**/\\n 187,\\n/**/\\n 186,\\n/**/\\n 185,\\n/**/\\n 184,\\n/**/\\n 183,\\n/**/\\n 182,\\n/**/\\n 181,\\n/**/\\n 180,\\n/**/\\n 179,\\n/**/\\n 178,\\n/**/\\n 177,\\n/**/\\n 176,\\n/**/\\n 175,\\n/**/\\n 174,\\n/**/\\n 173,\\n/**/\\n 172,\\n/**/\\n 171,\\n/**/\\n 170,\\n/**/\\n 169,\\n/**/\\n 168,\\n/**/\\n 167,\\n/**/\\n 166,\\n/**/\\n 165,\\n/**/\\n 164,\\n/**/\\n 163,\\n/**/\\n 162,\\n/**/\\n 161,\\n/**/\\n 160,\\n/**/\\n 159,\\n/**/\\n 158,\\n/**/\\n 157,\\n/**/\\n 156,\\n/**/\\n 155,\\n/**/\\n 154,\\n/**/\\n 153,\\n/**/\\n 152,\\n/**/\\n 151,\\n/**/\\n 150,\\n/**/\\n 149,\\n/**/\\n 148,\\n/**/\\n 147,\\n/**/\\n 146,\\n/**/\\n 145,\\n/**/\\n 144,\\n/**/\\n 143,\\n/**/\\n 142,\\n/**/\\n 141,\\n/**/\\n 140,\\n/**/\\n 139,\\n/**/\\n 138,\\n/**/\\n 137,\\n/**/\\n 136,\\n/**/\\n 135,\\n/**/\\n 134,\\n/**/\\n 133,\\n/**/\\n 132,\\n/**/\\n 131,\\n/**/\\n 130,\\n/**/\\n 129,\\n/**/\\n 128,\\n/**/\\n 127,\\n/**/\\n 126,\\n/**/\\n 125,\\n/**/\\n 124,\\n/**/\\n 123,\\n/**/\\n 122,\\n/**/\\n 121,\\n/**/\\n 120,\\n/**/\\n 119,\\n/**/\\n 118,\\n/**/\\n 117,\\n/**/\\n 116,\\n/**/\\n 115,\\n/**/\\n 114,\\n/**/\\n 113,\\n/**/\\n 112,\\n/**/\\n 111,\\n/**/\\n 110,\\n/**/\\n 109,\\n/**/\\n 108,\\n/**/\\n 107,\\n/**/\\n 106,\\n/**/\\n 105,\\n/**/\\n 104,\\n/**/\\n 103,\\n/**/\\n 102,\\n/**/\\n 101,\\n/**/\\n 100,\\n/**/\\n 99,\\n/**/\\n 98,\\n/**/\\n 97,\\n/**/\\n 96,\\n/**/\\n 95,\\n/**/\\n 94,\\n/**/\\n 93,\\n/**/\\n 92,\\n/**/\\n 91,\\n/**/\\n 90,\\n/**/\\n 89,\\n/**/\\n 88,\\n/**/\\n 87,\\n/**/\\n 86,\\n/**/\\n 85,\\n/**/\\n 84,\\n/**/\\n 83,\\n/**/\\n 82,\\n/**/\\n 81,\\n/**/\\n 80,\\n/**/\\n 79,\\n/**/\\n 78,\\n/**/\\n 77,\\n/**/\\n 76,\\n/**/\\n 75,\\n/**/\\n 74,\\n/**/\\n 73,\\n/**/\\n 72,\\n/**/\\n 71,\\n/**/\\n 70,\\n/**/\\n 69,\\n/**/\\n 68,\\n/**/\\n 67,\\n/**/\\n 66,\\n/**/\\n 65,\\n/**/\\n 64,\\n/**/\\n 63,\\n/**/\\n 62,\\n/**/\\n 61,\\n/**/\\n 60,\\n/**/\\n 59,\\n/**/\\n 58,\\n/**/\\n 57,\\n/**/\\n 56,\\n/**/\\n 55,\\n/**/\\n 54,\\n/**/\\n 53,\\n/**/\\n 52,\\n/**/\\n 51,\\n/**/\\n 50,\\n/**/\\n 49,\\n/**/\\n 48,\\n/**/\\n 47,\\n/**/\\n 46,\\n/**/\\n 45,\\n/**/\\n 44,\\n/**/\\n 43,\\n/**/\\n 42,\\n/**/\\n 41,\\n/**/\\n 40,\\n/**/\\n 39,\\n/**/\\n 38,\\n/**/\\n 37,\\n/**/\\n 36,\\n/**/\\n 35,\\n/**/\\n 34,\\n/**/\\n 33,\\n/**/\\n 32,\\n/**/\\n 31,\\n/**/\\n 30,\\n/**/\\n 29,\\n/**/\\n 28,\\n/**/\\n 27,\\n/**/\\n 26,\\n/**/\\n 25,\\n/**/\\n 24,\\n/**/\\n 23,\\n/**/\\n 22,\\n/**/\\n 21,\\n/**/\\n 20,\\n/**/\\n 19,\\n/**/\\n 18,\\n/**/\\n 17,\\n/**/\\n 16,\\n/**/\\n 15,\\n/**/\\n 14,\\n/**/\\n 13,\\n/**/\\n 12,\\n/**/\\n 11,\\n/**/\\n 10,\\n/**/\\n 9,\\n/**/\\n 8,\\n/**/\\n 7,\\n/**/\\n 6,\\n/**/\\n 5,\\n/**/\\n 4,\\n/**/\\n 3,\\n/**/\\n 2,\\n/**/\\n 1,\\n/**/\\n 0\\n};\",\n \"/*\\n * Place to put a short description when adding a feature with a patch.\\n * Keep it short, e.g.,: \\\"relative numbers\\\", \\\"persistent undo\\\".\\n * Also add a comment marker to separate the lines.\\n * See the official Vim patches for the diff format: It must use a context of\\n * one line only. Create it by hand or use \\\"diff -C2\\\" and edit the patch.\\n */\\nstatic char *(extra_patches[]) =\\n{ /* Add your patch description below this line */\\n/**/\\n NULL\\n};\",\n \" int\\nhighest_patch(void)\\n{\\n // this relies on the highest patch number to be the first entry\\n return included_patches[0];\\n}\",\n \"#if defined(FEAT_EVAL) || defined(PROTO)\\n/*\\n * Return TRUE if patch \\\"n\\\" has been included.\\n */\\n int\\nhas_patch(int n)\\n{\\n int\\t\\th, m, l;\",\n \" // Perform a binary search.\\n l = 0;\\n h = (int)ARRAY_LENGTH(included_patches) - 1;\\n while (l < h)\\n {\\n\\tm = (l + h) / 2;\\n\\tif (included_patches[m] == n)\\n\\t return TRUE;\\n\\tif (included_patches[m] < n)\\n\\t h = m;\\n\\telse\\n\\t l = m + 1;\\n }\\n return FALSE;\\n}\\n#endif\",\n \" void\\nex_version(exarg_T *eap)\\n{\\n /*\\n * Ignore a \\\":version 9.99\\\" command.\\n */\\n if (*eap->arg == NUL)\\n {\\n\\tmsg_putchar('\\\\n');\\n\\tlist_version();\\n }\\n}\",\n \"/*\\n * Output a string for the version message. If it's going to wrap, output a\\n * newline, unless the message is too long to fit on the screen anyway.\\n * When \\\"wrap\\\" is TRUE wrap the string in [].\\n */\\n static void\\nversion_msg_wrap(char_u *s, int wrap)\\n{\\n int\\t\\tlen = vim_strsize(s) + (wrap ? 2 : 0);\",\n \" if (!got_int && len < (int)Columns && msg_col + len >= (int)Columns\\n\\t\\t\\t\\t\\t\\t\\t\\t&& *s != '\\\\n')\\n\\tmsg_putchar('\\\\n');\\n if (!got_int)\\n {\\n\\tif (wrap)\\n\\t msg_puts(\\\"[\\\");\\n\\tmsg_puts((char *)s);\\n\\tif (wrap)\\n\\t msg_puts(\\\"]\\\");\\n }\\n}\",\n \" static void\\nversion_msg(char *s)\\n{\\n version_msg_wrap((char_u *)s, FALSE);\\n}\",\n \"/*\\n * List all features aligned in columns, dictionary style.\\n */\\n static void\\nlist_features(void)\\n{\\n list_in_columns((char_u **)features, -1, -1);\\n}\",\n \"/*\\n * List string items nicely aligned in columns.\\n * When \\\"size\\\" is < 0 then the last entry is marked with NULL.\\n * The entry with index \\\"current\\\" is inclosed in [].\\n */\\n void\\nlist_in_columns(char_u **items, int size, int current)\\n{\\n int\\t\\ti;\\n int\\t\\tncol;\\n int\\t\\tnrow;\\n int\\t\\tcur_row = 1;\\n int\\t\\titem_count = 0;\\n int\\t\\twidth = 0;\\n#ifdef FEAT_SYN_HL\\n int\\t\\tuse_highlight = (items == (char_u **)features);\\n#endif\",\n \" // Find the length of the longest item, use that + 1 as the column\\n // width.\\n for (i = 0; size < 0 ? items[i] != NULL : i < size; ++i)\\n {\\n\\tint l = vim_strsize(items[i]) + (i == current ? 2 : 0);\",\n \"\\tif (l > width)\\n\\t width = l;\\n\\t++item_count;\\n }\\n width += 1;\",\n \" if (Columns < width)\\n {\\n\\t// Not enough screen columns - show one per line\\n\\tfor (i = 0; i < item_count; ++i)\\n\\t{\\n\\t version_msg_wrap(items[i], i == current);\\n\\t if (msg_col > 0 && i < item_count - 1)\\n\\t\\tmsg_putchar('\\\\n');\\n\\t}\\n\\treturn;\\n }\",\n \" // The rightmost column doesn't need a separator.\\n // Sacrifice it to fit in one more column if possible.\\n ncol = (int) (Columns + 1) / width;\\n nrow = item_count / ncol + ((item_count % ncol) ? 1 : 0);\",\n \" // \\\"i\\\" counts columns then rows. \\\"idx\\\" counts rows then columns.\\n for (i = 0; !got_int && i < nrow * ncol; ++i)\\n {\\n\\tint idx = (i / ncol) + (i % ncol) * nrow;\",\n \"\\tif (idx < item_count)\\n\\t{\\n\\t int last_col = (i + 1) % ncol == 0;\",\n \"\\t if (idx == current)\\n\\t\\tmsg_putchar('[');\\n#ifdef FEAT_SYN_HL\\n\\t if (use_highlight && items[idx][0] == '-')\\n\\t\\tmsg_puts_attr((char *)items[idx], HL_ATTR(HLF_W));\\n\\t else\\n#endif\\n\\t\\tmsg_puts((char *)items[idx]);\\n\\t if (idx == current)\\n\\t\\tmsg_putchar(']');\\n\\t if (last_col)\\n\\t {\\n\\t\\tif (msg_col > 0 && cur_row < nrow)\\n\\t\\t msg_putchar('\\\\n');\\n\\t\\t++cur_row;\\n\\t }\\n\\t else\\n\\t {\\n\\t\\twhile (msg_col % width)\\n\\t\\t msg_putchar(' ');\\n\\t }\\n\\t}\\n\\telse\\n\\t{\\n\\t // this row is out of items, thus at the end of the row\\n\\t if (msg_col > 0)\\n\\t {\\n\\t\\tif (cur_row < nrow)\\n\\t\\t msg_putchar('\\\\n');\\n\\t\\t++cur_row;\\n\\t }\\n\\t}\\n }\\n}\",\n \" void\\nlist_version(void)\\n{\\n int\\t\\ti;\\n int\\t\\tfirst;\\n char\\t*s = \\\"\\\";\",\n \" /*\\n * When adding features here, don't forget to update the list of\\n * internal variables in eval.c!\\n */\\n init_longVersion();\\n msg(longVersion);\\n#ifdef MSWIN\\n# ifdef FEAT_GUI_MSWIN\\n# ifdef VIMDLL\\n# ifdef _WIN64\\n msg_puts(_(\\\"\\\\nMS-Windows 64-bit GUI/console version\\\"));\\n# else\\n msg_puts(_(\\\"\\\\nMS-Windows 32-bit GUI/console version\\\"));\\n# endif\\n# else\\n# ifdef _WIN64\\n msg_puts(_(\\\"\\\\nMS-Windows 64-bit GUI version\\\"));\\n# else\\n msg_puts(_(\\\"\\\\nMS-Windows 32-bit GUI version\\\"));\\n# endif\\n# endif\\n# ifdef FEAT_OLE\\n msg_puts(_(\\\" with OLE support\\\"));\\n# endif\\n# else\\n# ifdef _WIN64\\n msg_puts(_(\\\"\\\\nMS-Windows 64-bit console version\\\"));\\n# else\\n msg_puts(_(\\\"\\\\nMS-Windows 32-bit console version\\\"));\\n# endif\\n# endif\\n#endif\\n#if defined(MACOS_X)\\n# if defined(MACOS_X_DARWIN)\\n msg_puts(_(\\\"\\\\nmacOS version\\\"));\\n# else\\n msg_puts(_(\\\"\\\\nmacOS version w/o darwin feat.\\\"));\\n# endif\\n# if defined(__arm64__)\\n msg_puts(\\\" - arm64\\\");\\n# elif defined(__x86_64__)\\n msg_puts(\\\" - x86_64\\\");\\n# endif\\n#endif\",\n \"#ifdef VMS\\n msg_puts(_(\\\"\\\\nOpenVMS version\\\"));\\n# ifdef HAVE_PATHDEF\\n if (*compiled_arch != NUL)\\n {\\n\\tmsg_puts(\\\" - \\\");\\n\\tmsg_puts((char *)compiled_arch);\\n }\\n# endif\",\n \"#endif\",\n \" // Print the list of patch numbers if there is at least one.\\n // Print a range when patches are consecutive: \\\"1-10, 12, 15-40, 42-45\\\"\\n if (included_patches[0] != 0)\\n {\\n\\tmsg_puts(_(\\\"\\\\nIncluded patches: \\\"));\\n\\tfirst = -1;\\n\\ti = (int)ARRAY_LENGTH(included_patches) - 1;\\n\\twhile (--i >= 0)\\n\\t{\\n\\t if (first < 0)\\n\\t\\tfirst = included_patches[i];\\n\\t if (i == 0 || included_patches[i - 1] != included_patches[i] + 1)\\n\\t {\\n\\t\\tmsg_puts(s);\\n\\t\\ts = \\\", \\\";\\n\\t\\tmsg_outnum((long)first);\\n\\t\\tif (first != included_patches[i])\\n\\t\\t{\\n\\t\\t msg_puts(\\\"-\\\");\\n\\t\\t msg_outnum((long)included_patches[i]);\\n\\t\\t}\\n\\t\\tfirst = -1;\\n\\t }\\n\\t}\\n }\",\n \" // Print the list of extra patch descriptions if there is at least one.\\n if (extra_patches[0] != NULL)\\n {\\n\\tmsg_puts(_(\\\"\\\\nExtra patches: \\\"));\\n\\ts = \\\"\\\";\\n\\tfor (i = 0; extra_patches[i] != NULL; ++i)\\n\\t{\\n\\t msg_puts(s);\\n\\t s = \\\", \\\";\\n\\t msg_puts(extra_patches[i]);\\n\\t}\\n }\",\n \"#ifdef MODIFIED_BY\\n msg_puts(\\\"\\\\n\\\");\\n msg_puts(_(\\\"Modified by \\\"));\\n msg_puts(MODIFIED_BY);\\n#endif\",\n \"#ifdef HAVE_PATHDEF\\n if (*compiled_user != NUL || *compiled_sys != NUL)\\n {\\n\\tmsg_puts(_(\\\"\\\\nCompiled \\\"));\\n\\tif (*compiled_user != NUL)\\n\\t{\\n\\t msg_puts(_(\\\"by \\\"));\\n\\t msg_puts((char *)compiled_user);\\n\\t}\\n\\tif (*compiled_sys != NUL)\\n\\t{\\n\\t msg_puts(\\\"@\\\");\\n\\t msg_puts((char *)compiled_sys);\\n\\t}\\n }\\n#endif\",\n \"#if defined(FEAT_HUGE)\\n msg_puts(_(\\\"\\\\nHuge version \\\"));\\n#elif defined(FEAT_BIG)\\n msg_puts(_(\\\"\\\\nBig version \\\"));\\n#elif defined(FEAT_NORMAL)\\n msg_puts(_(\\\"\\\\nNormal version \\\"));\\n#elif defined(FEAT_SMALL)\\n msg_puts(_(\\\"\\\\nSmall version \\\"));\\n#else\\n msg_puts(_(\\\"\\\\nTiny version \\\"));\\n#endif\\n#if !defined(FEAT_GUI)\\n msg_puts(_(\\\"without GUI.\\\"));\\n#elif defined(FEAT_GUI_GTK)\\n# if defined(USE_GTK3)\\n msg_puts(_(\\\"with GTK3 GUI.\\\"));\\n# elif defined(FEAT_GUI_GNOME)\\n msg_puts(_(\\\"with GTK2-GNOME GUI.\\\"));\\n# else\\n msg_puts(_(\\\"with GTK2 GUI.\\\"));\\n# endif\\n#elif defined(FEAT_GUI_MOTIF)\\n msg_puts(_(\\\"with X11-Motif GUI.\\\"));\\n#elif defined(FEAT_GUI_HAIKU)\\n msg_puts(_(\\\"with Haiku GUI.\\\"));\\n#elif defined(FEAT_GUI_PHOTON)\\n msg_puts(_(\\\"with Photon GUI.\\\"));\\n#elif defined(MSWIN)\\n msg_puts(_(\\\"with GUI.\\\"));\\n#endif\\n version_msg(_(\\\" Features included (+) or not (-):\\\\n\\\"));\",\n \" list_features();\\n if (msg_col > 0)\\n\\tmsg_putchar('\\\\n');\",\n \"#ifdef SYS_VIMRC_FILE\\n version_msg(_(\\\" system vimrc file: \\\\\\\"\\\"));\\n version_msg(SYS_VIMRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_VIMRC_FILE\\n version_msg(_(\\\" user vimrc file: \\\\\\\"\\\"));\\n version_msg(USR_VIMRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_VIMRC_FILE2\\n version_msg(_(\\\" 2nd user vimrc file: \\\\\\\"\\\"));\\n version_msg(USR_VIMRC_FILE2);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_VIMRC_FILE3\\n version_msg(_(\\\" 3rd user vimrc file: \\\\\\\"\\\"));\\n version_msg(USR_VIMRC_FILE3);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_EXRC_FILE\\n version_msg(_(\\\" user exrc file: \\\\\\\"\\\"));\\n version_msg(USR_EXRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_EXRC_FILE2\\n version_msg(_(\\\" 2nd user exrc file: \\\\\\\"\\\"));\\n version_msg(USR_EXRC_FILE2);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef FEAT_GUI\\n# ifdef SYS_GVIMRC_FILE\\n version_msg(_(\\\" system gvimrc file: \\\\\\\"\\\"));\\n version_msg(SYS_GVIMRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# endif\\n version_msg(_(\\\" user gvimrc file: \\\\\\\"\\\"));\\n version_msg(USR_GVIMRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# ifdef USR_GVIMRC_FILE2\\n version_msg(_(\\\"2nd user gvimrc file: \\\\\\\"\\\"));\\n version_msg(USR_GVIMRC_FILE2);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# endif\\n# ifdef USR_GVIMRC_FILE3\\n version_msg(_(\\\"3rd user gvimrc file: \\\\\\\"\\\"));\\n version_msg(USR_GVIMRC_FILE3);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# endif\\n#endif\\n version_msg(_(\\\" defaults file: \\\\\\\"\\\"));\\n version_msg(VIM_DEFAULTS_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#ifdef FEAT_GUI\\n# ifdef SYS_MENU_FILE\\n version_msg(_(\\\" system menu file: \\\\\\\"\\\"));\\n version_msg(SYS_MENU_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# endif\\n#endif\\n#ifdef HAVE_PATHDEF\\n if (*default_vim_dir != NUL)\\n {\\n\\tversion_msg(_(\\\" fall-back for $VIM: \\\\\\\"\\\"));\\n\\tversion_msg((char *)default_vim_dir);\\n\\tversion_msg(\\\"\\\\\\\"\\\\n\\\");\\n }\\n if (*default_vimruntime_dir != NUL)\\n {\\n\\tversion_msg(_(\\\" f-b for $VIMRUNTIME: \\\\\\\"\\\"));\\n\\tversion_msg((char *)default_vimruntime_dir);\\n\\tversion_msg(\\\"\\\\\\\"\\\\n\\\");\\n }\\n version_msg(_(\\\"Compilation: \\\"));\\n version_msg((char *)all_cflags);\\n version_msg(\\\"\\\\n\\\");\\n#ifdef VMS\\n if (*compiler_version != NUL)\\n {\\n\\tversion_msg(_(\\\"Compiler: \\\"));\\n\\tversion_msg((char *)compiler_version);\\n\\tversion_msg(\\\"\\\\n\\\");\\n }\\n#endif\\n version_msg(_(\\\"Linking: \\\"));\\n version_msg((char *)all_lflags);\\n#endif\\n#ifdef DEBUG\\n version_msg(\\\"\\\\n\\\");\\n version_msg(_(\\\" DEBUG BUILD\\\"));\\n#endif\\n}\",\n \"static void do_intro_line(int row, char_u *mesg, int add_version, int attr);\\nstatic void intro_message(int colon);\",\n \"/*\\n * Show the intro message when not editing a file.\\n */\\n void\\nmaybe_intro_message(void)\\n{\\n if (BUFEMPTY()\\n\\t && curbuf->b_fname == NULL\\n\\t && firstwin->w_next == NULL\\n\\t && vim_strchr(p_shm, SHM_INTRO) == NULL)\\n\\tintro_message(FALSE);\\n}\",\n \"/*\\n * Give an introductory message about Vim.\\n * Only used when starting Vim on an empty file, without a file name.\\n * Or with the \\\":intro\\\" command (for Sven :-).\\n */\\n static void\\nintro_message(\\n int\\t\\tcolon)\\t\\t// TRUE for \\\":intro\\\"\\n{\\n int\\t\\ti;\\n int\\t\\trow;\\n int\\t\\tblanklines;\\n int\\t\\tsponsor;\\n char\\t*p;\\n static char\\t*(lines[]) =\\n {\\n\\tN_(\\\"VIM - Vi IMproved\\\"),\\n\\t\\\"\\\",\\n\\tN_(\\\"version \\\"),\\n\\tN_(\\\"by Bram Moolenaar et al.\\\"),\\n#ifdef MODIFIED_BY\\n\\t\\\" \\\",\\n#endif\\n\\tN_(\\\"Vim is open source and freely distributable\\\"),\\n\\t\\\"\\\",\\n\\tN_(\\\"Help poor children in Uganda!\\\"),\\n\\tN_(\\\"type :help iccf<Enter> for information \\\"),\\n\\t\\\"\\\",\\n\\tN_(\\\"type :q<Enter> to exit \\\"),\\n\\tN_(\\\"type :help<Enter> or <F1> for on-line help\\\"),\\n\\tN_(\\\"type :help version8<Enter> for version info\\\"),\\n\\tNULL,\\n\\t\\\"\\\",\\n\\tN_(\\\"Running in Vi compatible mode\\\"),\\n\\tN_(\\\"type :set nocp<Enter> for Vim defaults\\\"),\\n\\tN_(\\\"type :help cp-default<Enter> for info on this\\\"),\\n };\\n#ifdef FEAT_GUI\\n static char\\t*(gui_lines[]) =\\n {\\n\\tNULL,\\n\\tNULL,\\n\\tNULL,\\n\\tNULL,\\n#ifdef MODIFIED_BY\\n\\tNULL,\\n#endif\\n\\tNULL,\\n\\tNULL,\\n\\tNULL,\\n\\tN_(\\\"menu Help->Orphans for information \\\"),\\n\\tNULL,\\n\\tN_(\\\"Running modeless, typed text is inserted\\\"),\\n\\tN_(\\\"menu Edit->Global Settings->Toggle Insert Mode \\\"),\\n\\tN_(\\\" for two modes \\\"),\\n\\tNULL,\\n\\tNULL,\\n\\tNULL,\\n\\tN_(\\\"menu Edit->Global Settings->Toggle Vi Compatible\\\"),\\n\\tN_(\\\" for Vim defaults \\\"),\\n };\\n#endif\",\n \" // blanklines = screen height - # message lines\\n blanklines = (int)Rows - (ARRAY_LENGTH(lines) - 1);\\n if (!p_cp)\\n\\tblanklines += 4; // add 4 for not showing \\\"Vi compatible\\\" message\",\n \" // Don't overwrite a statusline. Depends on 'cmdheight'.\\n if (p_ls > 1)\\n\\tblanklines -= Rows - topframe->fr_height;\\n if (blanklines < 0)\\n\\tblanklines = 0;\",\n \" // Show the sponsor and register message one out of four times, the Uganda\\n // message two out of four times.\\n sponsor = (int)time(NULL);\\n sponsor = ((sponsor & 2) == 0) - ((sponsor & 4) == 0);\",\n \" // start displaying the message lines after half of the blank lines\\n row = blanklines / 2;\\n if ((row >= 2 && Columns >= 50) || colon)\\n {\\n\\tfor (i = 0; i < (int)ARRAY_LENGTH(lines); ++i)\\n\\t{\\n\\t p = lines[i];\\n#ifdef FEAT_GUI\\n\\t if (p_im && gui.in_use && gui_lines[i] != NULL)\\n\\t\\tp = gui_lines[i];\\n#endif\\n\\t if (p == NULL)\\n\\t {\\n\\t\\tif (!p_cp)\\n\\t\\t break;\\n\\t\\tcontinue;\\n\\t }\\n\\t if (sponsor != 0)\\n\\t {\\n\\t\\tif (strstr(p, \\\"children\\\") != NULL)\\n\\t\\t p = sponsor < 0\\n\\t\\t\\t? N_(\\\"Sponsor Vim development!\\\")\\n\\t\\t\\t: N_(\\\"Become a registered Vim user!\\\");\\n\\t\\telse if (strstr(p, \\\"iccf\\\") != NULL)\\n\\t\\t p = sponsor < 0\\n\\t\\t\\t? N_(\\\"type :help sponsor<Enter> for information \\\")\\n\\t\\t\\t: N_(\\\"type :help register<Enter> for information \\\");\\n\\t\\telse if (strstr(p, \\\"Orphans\\\") != NULL)\\n\\t\\t p = N_(\\\"menu Help->Sponsor/Register for information \\\");\\n\\t }\\n\\t if (*p != NUL)\\n\\t\\tdo_intro_line(row, (char_u *)_(p), i == 2, 0);\\n\\t ++row;\\n\\t}\\n }\",\n \" // Make the wait-return message appear just below the text.\\n if (colon)\\n\\tmsg_row = row;\\n}\",\n \" static void\\ndo_intro_line(\\n int\\t\\trow,\\n char_u\\t*mesg,\\n int\\t\\tadd_version,\\n int\\t\\tattr)\\n{\\n char_u\\tvers[20];\\n int\\t\\tcol;\\n char_u\\t*p;\\n int\\t\\tl;\\n int\\t\\tclen;\\n#ifdef MODIFIED_BY\\n# define MODBY_LEN 150\\n char_u\\tmodby[MODBY_LEN];\",\n \" if (*mesg == ' ')\\n {\\n\\tvim_strncpy(modby, (char_u *)_(\\\"Modified by \\\"), MODBY_LEN - 1);\\n\\tl = (int)STRLEN(modby);\\n\\tvim_strncpy(modby + l, (char_u *)MODIFIED_BY, MODBY_LEN - l - 1);\\n\\tmesg = modby;\\n }\\n#endif\",\n \" // Center the message horizontally.\\n col = vim_strsize(mesg);\\n if (add_version)\\n {\\n\\tSTRCPY(vers, mediumVersion);\\n\\tif (highest_patch())\\n\\t{\\n\\t // Check for 9.9x or 9.9xx, alpha/beta version\\n\\t if (isalpha((int)vers[3]))\\n\\t {\\n\\t\\tint len = (isalpha((int)vers[4])) ? 5 : 4;\\n\\t\\tsprintf((char *)vers + len, \\\".%d%s\\\", highest_patch(),\\n\\t\\t\\t\\t\\t\\t\\t mediumVersion + len);\\n\\t }\\n\\t else\\n\\t\\tsprintf((char *)vers + 3, \\\".%d\\\", highest_patch());\\n\\t}\\n\\tcol += (int)STRLEN(vers);\\n }\\n col = (Columns - col) / 2;\\n if (col < 0)\\n\\tcol = 0;\",\n \" // Split up in parts to highlight <> items differently.\\n for (p = mesg; *p != NUL; p += l)\\n {\\n\\tclen = 0;\\n\\tfor (l = 0; p[l] != NUL\\n\\t\\t\\t && (l == 0 || (p[l] != '<' && p[l - 1] != '>')); ++l)\\n\\t{\\n\\t if (has_mbyte)\\n\\t {\\n\\t\\tclen += ptr2cells(p + l);\\n\\t\\tl += (*mb_ptr2len)(p + l) - 1;\\n\\t }\\n\\t else\\n\\t\\tclen += byte2cells(p[l]);\\n\\t}\\n\\tscreen_puts_len(p, l, row, col, *p == '<' ? HL_ATTR(HLF_8) : attr);\\n\\tcol += clen;\\n }\",\n \" // Add the version number to the version line.\\n if (add_version)\\n\\tscreen_puts(vers, row, col, 0);\\n}\",\n \"/*\\n * \\\":intro\\\": clear screen, display intro screen and wait for return.\\n */\\n void\\nex_intro(exarg_T *eap UNUSED)\\n{\\n screenclear();\\n intro_message(TRUE);\\n wait_return(TRUE);\\n}\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 0,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [3275, 4230, 6192, 782, 748], \"buggy_code_start_loc\": [3275, 4229, 4392, 782, 748], \"filenames\": [\"src/errors.h\", \"src/mbyte.c\", \"src/spellfile.c\", \"src/testdir/test_spell_utf8.vim\", \"src/version.c\"], \"fixing_code_end_loc\": [3280, 4230, 6203, 788, 751], \"fixing_code_start_loc\": [3276, 4229, 4393, 783, 749], \"message\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:vim:vim:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"CF072C31-D320-47CE-B39B-F45447D70BD9\", \"versionEndExcluding\": \"8.2.4919\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:debian:debian_linux:9.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"DEECE5FC-CACF-4496-A3E7-164736409252\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:debian:debian_linux:10.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"07B237A9-69A3-4A9C-9DA0-4E06BD37AE73\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:34:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"A930E247-0B43-43CB-98FF-6CE7B8189835\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:35:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"80E516C0-98A4-4ADE-B69F-66A772E2BAAA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:apple:macos:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"71E032AD-F827-4944-9699-BB1E6D4233FC\", \"versionEndExcluding\": \"13.0\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\"}, {\"lang\": \"es\", \"value\": \"Un Desbordamiento del b\\u00fafer de pila en vim_strncpy find_word en el repositorio de GitHub vim/vim versiones anteriores a 8.2.4919. Esta vulnerabilidad es capaz de bloquear el software, Omitir el Mecanismo de Protecci\\u00f3n, Modificar la Memoria y una posible ejecuci\\u00f3n remota\"}], \"evaluatorComment\": null, \"id\": \"CVE-2022-1621\", \"lastModified\": \"2023-05-03T12:15:21.913\", \"metrics\": {\"cvssMetricV2\": [{\"acInsufInfo\": false, \"baseSeverity\": \"MEDIUM\", \"cvssData\": {\"accessComplexity\": \"MEDIUM\", \"accessVector\": \"NETWORK\", \"authentication\": \"NONE\", \"availabilityImpact\": \"PARTIAL\", \"baseScore\": 6.8, \"confidentialityImpact\": \"PARTIAL\", \"integrityImpact\": \"PARTIAL\", \"vectorString\": \"AV:N/AC:M/Au:N/C:P/I:P/A:P\", \"version\": \"2.0\"}, \"exploitabilityScore\": 8.6, \"impactScore\": 6.4, \"obtainAllPrivilege\": false, \"obtainOtherPrivilege\": false, \"obtainUserPrivilege\": false, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\", \"userInteractionRequired\": true}], \"cvssMetricV30\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.3, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"LOW\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.0/AV:L/AC:L/PR:N/UI:R/S:U/C:L/I:H/A:H\", \"version\": \"3.0\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.5, \"source\": \"security@huntr.dev\", \"type\": \"Secondary\"}], \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.8, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.1/AV:L/AC:L/PR:N/UI:R/S:U/C:H/I:H/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.9, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2022-05-10T14:15:08.460\", \"references\": [{\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/28\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/41\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Exploit\", \"Third Party Advisory\"], \"url\": \"https://huntr.dev/bounties/520ce714-bfd2-4646-9458-f52cd22bb2fb\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/05/msg00022.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/11/msg00032.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/HIP7KG7TVS5YF3QREAY2GOGUT3YUBZAI/\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://security.gentoo.org/glsa/202208-32\"}, {\"source\": \"security@huntr.dev\", \"tags\": null, \"url\": \"https://security.gentoo.org/glsa/202305-16\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://support.apple.com/kb/HT213488\"}], \"sourceIdentifier\": \"security@huntr.dev\", \"vendorComments\": null, \"vulnStatus\": \"Modified\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-122\"}], \"source\": \"security@huntr.dev\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-787\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, \"type\": \"CWE-122\"}"},"index":{"kind":"number","value":464,"string":"464"}}},{"rowIdx":2897,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\t\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the Vim source code.\n */","#include \"vim.h\"","/*\n * Vim originated from Stevie version 3.6 (Fish disk 217) by GRWalter (Fred)\n * It has been changed beyond recognition since then.\n *\n * Differences between version 7.4 and 8.x can be found with \":help version8\".\n * Differences between version 6.4 and 7.x can be found with \":help version7\".\n * Differences between version 5.8 and 6.x can be found with \":help version6\".\n * Differences between version 4.x and 5.x can be found with \":help version5\".\n * Differences between version 3.0 and 4.x can be found with \":help version4\".\n * All the remarks about older versions have been removed, they are not very\n * interesting.\n */","#include \"version.h\"","char\t\t*Version = VIM_VERSION_SHORT;\nstatic char\t*mediumVersion = VIM_VERSION_MEDIUM;","#if defined(HAVE_DATE_TIME) || defined(PROTO)\n# if (defined(VMS) && defined(VAXC)) || defined(PROTO)\nchar\tlongVersion[sizeof(VIM_VERSION_LONG_DATE) + sizeof(__DATE__)\n\t\t\t\t\t\t + sizeof(__TIME__) + 3];"," void\ninit_longVersion(void)\n{\n /*\n * Construct the long version string. Necessary because\n * VAX C can't concatenate strings in the preprocessor.\n */\n strcpy(longVersion, VIM_VERSION_LONG_DATE);\n#ifdef BUILD_DATE\n strcat(longVersion, BUILD_DATE);\n#else\n strcat(longVersion, __DATE__);\n strcat(longVersion, \" \");\n strcat(longVersion, __TIME__);\n#endif\n strcat(longVersion, \")\");\n}","# else\nchar\t*longVersion = NULL;"," void\ninit_longVersion(void)\n{\n if (longVersion == NULL)\n {\n#ifdef BUILD_DATE\n\tchar *date_time = BUILD_DATE;\n#else\n\tchar *date_time = __DATE__ \" \" __TIME__;\n#endif\n\tchar *msg = _(\"%s (%s, compiled %s)\");\n\tsize_t len = strlen(msg)\n\t\t + strlen(VIM_VERSION_LONG_ONLY)\n\t\t + strlen(VIM_VERSION_DATE_ONLY)\n\t\t + strlen(date_time);","\tlongVersion = alloc(len);\n\tif (longVersion == NULL)\n\t longVersion = VIM_VERSION_LONG;\n\telse\n\t vim_snprintf(longVersion, len, msg,\n\t\t VIM_VERSION_LONG_ONLY, VIM_VERSION_DATE_ONLY, date_time);\n }\n}\n# endif\n#else\nchar\t*longVersion = VIM_VERSION_LONG;"," void\ninit_longVersion(void)\n{\n // nothing to do\n}\n#endif","static char *(features[]) =\n{\n#ifdef HAVE_ACL\n\t\"+acl\",\n#else\n\t\"-acl\",\n#endif\n#ifdef AMIGA\t\t// only for Amiga systems\n# ifdef FEAT_ARP\n\t\"+ARP\",\n# else\n\t\"-ARP\",\n# endif\n#endif\n#ifdef FEAT_ARABIC\n\t\"+arabic\",\n#else\n\t\"-arabic\",\n#endif\n\t\"+autocmd\",\n#ifdef FEAT_AUTOCHDIR\n \"+autochdir\",\n#else\n \"-autochdir\",\n#endif\n#ifdef FEAT_AUTOSERVERNAME\n\t\"+autoservername\",\n#else\n\t\"-autoservername\",\n#endif\n#ifdef FEAT_BEVAL_GUI\n\t\"+balloon_eval\",\n#else\n\t\"-balloon_eval\",\n#endif\n#ifdef FEAT_BEVAL_TERM\n\t\"+balloon_eval_term\",\n#else\n\t\"-balloon_eval_term\",\n#endif\n#ifdef FEAT_BROWSE\n\t\"+browse\",\n#else\n\t\"-browse\",\n#endif\n#ifdef NO_BUILTIN_TCAPS\n\t\"-builtin_terms\",\n#endif\n#ifdef SOME_BUILTIN_TCAPS\n\t\"+builtin_terms\",\n#endif\n#ifdef ALL_BUILTIN_TCAPS\n\t\"++builtin_terms\",\n#endif\n#ifdef FEAT_BYTEOFF\n\t\"+byte_offset\",\n#else\n\t\"-byte_offset\",\n#endif\n#ifdef FEAT_JOB_CHANNEL\n\t\"+channel\",\n#else\n\t\"-channel\",\n#endif\n#ifdef FEAT_CINDENT\n\t\"+cindent\",\n#else\n\t\"-cindent\",\n#endif\n#ifdef FEAT_CLIENTSERVER\n\t\"+clientserver\",\n#else\n\t\"-clientserver\",\n#endif\n#ifdef FEAT_CLIPBOARD\n\t\"+clipboard\",\n#else\n\t\"-clipboard\",\n#endif\n\t\"+cmdline_compl\",\n\t\"+cmdline_hist\",\n#ifdef FEAT_CMDL_INFO\n\t\"+cmdline_info\",\n#else\n\t\"-cmdline_info\",\n#endif\n\t\"+comments\",\n#ifdef FEAT_CONCEAL\n\t\"+conceal\",\n#else\n\t\"-conceal\",\n#endif\n#ifdef FEAT_CRYPT\n\t\"+cryptv\",\n#else\n\t\"-cryptv\",\n#endif\n#ifdef FEAT_CSCOPE\n\t\"+cscope\",\n#else\n\t\"-cscope\",\n#endif\n\t\"+cursorbind\",\n#ifdef CURSOR_SHAPE\n\t\"+cursorshape\",\n#else\n\t\"-cursorshape\",\n#endif\n#if defined(FEAT_CON_DIALOG) && defined(FEAT_GUI_DIALOG)\n\t\"+dialog_con_gui\",\n#else\n# if defined(FEAT_CON_DIALOG)\n\t\"+dialog_con\",\n# else\n# if defined(FEAT_GUI_DIALOG)\n\t\"+dialog_gui\",\n# else\n\t\"-dialog\",\n# endif\n# endif\n#endif\n#ifdef FEAT_DIFF\n\t\"+diff\",\n#else\n\t\"-diff\",\n#endif\n#ifdef FEAT_DIGRAPHS\n\t\"+digraphs\",\n#else\n\t\"-digraphs\",\n#endif\n#ifdef FEAT_GUI_MSWIN\n# ifdef FEAT_DIRECTX\n\t\"+directx\",\n# else\n\t\"-directx\",\n# endif\n#endif\n#ifdef FEAT_DND\n\t\"+dnd\",\n#else\n\t\"-dnd\",\n#endif\n\t\"-ebcdic\",\n#ifdef FEAT_EMACS_TAGS\n\t\"+emacs_tags\",\n#else\n\t\"-emacs_tags\",\n#endif\n#ifdef FEAT_EVAL\n\t\"+eval\",\n#else\n\t\"-eval\",\n#endif\n\t\"+ex_extra\",\n#ifdef FEAT_SEARCH_EXTRA\n\t\"+extra_search\",\n#else\n\t\"-extra_search\",\n#endif\n\t\"-farsi\",\n#ifdef FEAT_SEARCHPATH\n\t\"+file_in_path\",\n#else\n\t\"-file_in_path\",\n#endif\n#ifdef FEAT_FIND_ID\n\t\"+find_in_path\",\n#else\n\t\"-find_in_path\",\n#endif\n#ifdef FEAT_FLOAT\n\t\"+float\",\n#else\n\t\"-float\",\n#endif\n#ifdef FEAT_FOLDING\n\t\"+folding\",\n#else\n\t\"-folding\",\n#endif\n#ifdef FEAT_FOOTER\n\t\"+footer\",\n#else\n\t\"-footer\",\n#endif\n\t // only interesting on Unix systems\n#if !defined(USE_SYSTEM) && defined(UNIX)\n\t\"+fork()\",\n#endif\n#ifdef FEAT_GETTEXT\n# ifdef DYNAMIC_GETTEXT\n\t\"+gettext/dyn\",\n# else\n\t\"+gettext\",\n# endif\n#else\n\t\"-gettext\",\n#endif\n\t\"-hangul_input\",\n#if (defined(HAVE_ICONV_H) && defined(USE_ICONV)) || defined(DYNAMIC_ICONV)\n# ifdef DYNAMIC_ICONV\n\t\"+iconv/dyn\",\n# else\n\t\"+iconv\",\n# endif\n#else\n\t\"-iconv\",\n#endif\n\t\"+insert_expand\",\n#ifdef FEAT_IPV6\n\t\"+ipv6\",\n#else\n\t\"-ipv6\",\n#endif\n#ifdef FEAT_JOB_CHANNEL\n\t\"+job\",\n#else\n\t\"-job\",\n#endif\n\t\"+jumplist\",\n#ifdef FEAT_KEYMAP\n\t\"+keymap\",\n#else\n\t\"-keymap\",\n#endif\n#ifdef FEAT_EVAL\n\t\"+lambda\",\n#else\n\t\"-lambda\",\n#endif\n#ifdef FEAT_LANGMAP\n\t\"+langmap\",\n#else\n\t\"-langmap\",\n#endif\n#ifdef FEAT_LIBCALL\n\t\"+libcall\",\n#else\n\t\"-libcall\",\n#endif\n#ifdef FEAT_LINEBREAK\n\t\"+linebreak\",\n#else\n\t\"-linebreak\",\n#endif\n#ifdef FEAT_LISP\n\t\"+lispindent\",\n#else\n\t\"-lispindent\",\n#endif\n\t\"+listcmds\",\n\t\"+localmap\",\n#ifdef FEAT_LUA\n# ifdef DYNAMIC_LUA\n\t\"+lua/dyn\",\n# else\n\t\"+lua\",\n# endif\n#else\n\t\"-lua\",\n#endif\n#ifdef FEAT_MENU\n\t\"+menu\",\n#else\n\t\"-menu\",\n#endif\n#ifdef FEAT_SESSION\n\t\"+mksession\",\n#else\n\t\"-mksession\",\n#endif\n\t\"+modify_fname\",\n\t\"+mouse\",\n#ifdef FEAT_MOUSESHAPE\n\t\"+mouseshape\",\n#else\n\t\"-mouseshape\",\n#endif","#if defined(UNIX) || defined(VMS)\n# ifdef FEAT_MOUSE_DEC\n\t\"+mouse_dec\",\n# else\n\t\"-mouse_dec\",\n# endif\n# ifdef FEAT_MOUSE_GPM\n# ifdef DYNAMIC_GPM\n\t\"+mouse_gpm/dyn\",\n# else\n\t\"+mouse_gpm\",\n# endif\n# else\n\t\"-mouse_gpm\",\n# endif\n# ifdef FEAT_MOUSE_JSB\n\t\"+mouse_jsbterm\",\n# else\n\t\"-mouse_jsbterm\",\n# endif\n# ifdef FEAT_MOUSE_NET\n\t\"+mouse_netterm\",\n# else\n\t\"-mouse_netterm\",\n# endif\n#endif","#ifdef __QNX__\n# ifdef FEAT_MOUSE_PTERM\n\t\"+mouse_pterm\",\n# else\n\t\"-mouse_pterm\",\n# endif\n#endif","#if defined(UNIX) || defined(VMS)\n\t\"+mouse_sgr\",\n# ifdef FEAT_SYSMOUSE\n\t\"+mouse_sysmouse\",\n# else\n\t\"-mouse_sysmouse\",\n# endif\n# ifdef FEAT_MOUSE_URXVT\n\t\"+mouse_urxvt\",\n# else\n\t\"-mouse_urxvt\",\n# endif\n\t\"+mouse_xterm\",\n#endif","#ifdef FEAT_MBYTE_IME\n# ifdef DYNAMIC_IME\n\t\"+multi_byte_ime/dyn\",\n# else\n\t\"+multi_byte_ime\",\n# endif\n#else\n\t\"+multi_byte\",\n#endif\n#ifdef FEAT_MULTI_LANG\n\t\"+multi_lang\",\n#else\n\t\"-multi_lang\",\n#endif\n#ifdef FEAT_MZSCHEME\n# ifdef DYNAMIC_MZSCHEME\n\t\"+mzscheme/dyn\",\n# else\n\t\"+mzscheme\",\n# endif\n#else\n\t\"-mzscheme\",\n#endif\n#ifdef FEAT_NETBEANS_INTG\n\t\"+netbeans_intg\",\n#else\n\t\"-netbeans_intg\",\n#endif\n\t\"+num64\",\n#ifdef FEAT_GUI_MSWIN\n# ifdef FEAT_OLE\n\t\"+ole\",\n# else\n\t\"-ole\",\n# endif\n#endif\n#ifdef FEAT_EVAL\n\t\"+packages\",\n#else\n\t\"-packages\",\n#endif\n#ifdef FEAT_PATH_EXTRA\n\t\"+path_extra\",\n#else\n\t\"-path_extra\",\n#endif\n#ifdef FEAT_PERL\n# ifdef DYNAMIC_PERL\n\t\"+perl/dyn\",\n# else\n\t\"+perl\",\n# endif\n#else\n\t\"-perl\",\n#endif\n#ifdef FEAT_PERSISTENT_UNDO\n\t\"+persistent_undo\",\n#else\n\t\"-persistent_undo\",\n#endif\n#ifdef FEAT_PROP_POPUP\n\t\"+popupwin\",\n#else\n\t\"-popupwin\",\n#endif\n#ifdef FEAT_PRINTER\n# ifdef FEAT_POSTSCRIPT\n\t\"+postscript\",\n# else\n\t\"-postscript\",\n# endif\n\t\"+printer\",\n#else\n\t\"-printer\",\n#endif\n#ifdef FEAT_PROFILE\n\t\"+profile\",\n#else\n\t\"-profile\",\n#endif\n#ifdef FEAT_PYTHON\n# ifdef DYNAMIC_PYTHON\n\t\"+python/dyn\",\n# else\n\t\"+python\",\n# endif\n#else\n\t\"-python\",\n#endif\n#ifdef FEAT_PYTHON3\n# ifdef DYNAMIC_PYTHON3\n\t\"+python3/dyn\",\n# else\n\t\"+python3\",\n# endif\n#else\n\t\"-python3\",\n#endif\n#ifdef FEAT_QUICKFIX\n\t\"+quickfix\",\n#else\n\t\"-quickfix\",\n#endif\n#ifdef FEAT_RELTIME\n\t\"+reltime\",\n#else\n\t\"-reltime\",\n#endif\n#ifdef FEAT_RIGHTLEFT\n\t\"+rightleft\",\n#else\n\t\"-rightleft\",\n#endif\n#ifdef FEAT_RUBY\n# ifdef DYNAMIC_RUBY\n\t\"+ruby/dyn\",\n# else\n\t\"+ruby\",\n# endif\n#else\n\t\"-ruby\",\n#endif\n\t\"+scrollbind\",\n#ifdef FEAT_SIGNS\n\t\"+signs\",\n#else\n\t\"-signs\",\n#endif\n#ifdef FEAT_SMARTINDENT\n\t\"+smartindent\",\n#else\n\t\"-smartindent\",\n#endif\n#ifdef FEAT_SODIUM\n# ifdef DYNAMIC_SODIUM\n\t\"+sodium/dyn\",\n# else\n\t\"+sodium\",\n# endif\n#else\n\t\"-sodium\",\n#endif\n#ifdef FEAT_SOUND\n\t\"+sound\",\n#else\n\t\"-sound\",\n#endif\n#ifdef FEAT_SPELL\n\t\"+spell\",\n#else\n\t\"-spell\",\n#endif\n#ifdef STARTUPTIME\n\t\"+startuptime\",\n#else\n\t\"-startuptime\",\n#endif\n#ifdef FEAT_STL_OPT\n\t\"+statusline\",\n#else\n\t\"-statusline\",\n#endif\n\t\"-sun_workshop\",\n#ifdef FEAT_SYN_HL\n\t\"+syntax\",\n#else\n\t\"-syntax\",\n#endif\n\t // only interesting on Unix systems\n#if defined(USE_SYSTEM) && defined(UNIX)\n\t\"+system()\",\n#endif\n\t\"+tag_binary\",\n\t\"-tag_old_static\",\n\t\"-tag_any_white\",\n#ifdef FEAT_TCL\n# ifdef DYNAMIC_TCL\n\t\"+tcl/dyn\",\n# else\n\t\"+tcl\",\n# endif\n#else\n\t\"-tcl\",\n#endif\n#ifdef FEAT_TERMGUICOLORS\n\t\"+termguicolors\",\n#else\n\t\"-termguicolors\",\n#endif\n#ifdef FEAT_TERMINAL\n\t\"+terminal\",\n#else\n\t\"-terminal\",\n#endif\n#if defined(UNIX)\n// only Unix can have terminfo instead of termcap\n# ifdef TERMINFO\n\t\"+terminfo\",\n# else\n\t\"-terminfo\",\n# endif\n#endif\n#ifdef FEAT_TERMRESPONSE\n\t\"+termresponse\",\n#else\n\t\"-termresponse\",\n#endif\n#ifdef FEAT_TEXTOBJ\n\t\"+textobjects\",\n#else\n\t\"-textobjects\",\n#endif\n#ifdef FEAT_PROP_POPUP\n\t\"+textprop\",\n#else\n\t\"-textprop\",\n#endif\n#if !defined(UNIX)\n// unix always includes termcap support\n# ifdef HAVE_TGETENT\n\t\"+tgetent\",\n# else\n\t\"-tgetent\",\n# endif\n#endif\n#ifdef FEAT_TIMERS\n\t\"+timers\",\n#else\n\t\"-timers\",\n#endif\n\t\"+title\",\n#ifdef FEAT_TOOLBAR\n\t\"+toolbar\",\n#else\n\t\"-toolbar\",\n#endif\n\t\"+user_commands\",\n#ifdef FEAT_VARTABS\n\t\"+vartabs\",\n#else\n\t\"-vartabs\",\n#endif\n\t\"+vertsplit\",\n\t\"+vim9script\",\n#ifdef FEAT_VIMINFO\n\t\"+viminfo\",\n#else\n\t\"-viminfo\",\n#endif\n\t\"+virtualedit\",\n\t\"+visual\",\n\t\"+visualextra\",\n\t\"+vreplace\",\n#ifdef MSWIN\n# ifdef FEAT_VTP\n\t\"+vtp\",\n# else\n\t\"-vtp\",\n# endif\n#endif\n#ifdef FEAT_WILDIGN\n\t\"+wildignore\",\n#else\n\t\"-wildignore\",\n#endif\n#ifdef FEAT_WILDMENU\n\t\"+wildmenu\",\n#else\n\t\"-wildmenu\",\n#endif\n\t\"+windows\",\n#ifdef FEAT_WRITEBACKUP\n\t\"+writebackup\",\n#else\n\t\"-writebackup\",\n#endif\n#if defined(UNIX) || defined(VMS)\n# ifdef FEAT_X11\n\t\"+X11\",\n# else\n\t\"-X11\",\n# endif\n#endif\n#ifdef FEAT_XFONTSET\n\t\"+xfontset\",\n#else\n\t\"-xfontset\",\n#endif\n#ifdef FEAT_XIM\n\t\"+xim\",\n#else\n\t\"-xim\",\n#endif\n#if defined(MSWIN)\n# ifdef FEAT_XPM_W32\n\t\"+xpm_w32\",\n# else\n\t\"-xpm_w32\",\n# endif\n#elif defined(HAVE_XPM)\n\t\"+xpm\",\n#else\n\t\"-xpm\",\n#endif\n#if defined(UNIX) || defined(VMS)\n# if defined(USE_XSMP_INTERACT)\n\t\"+xsmp_interact\",\n# elif defined(USE_XSMP)\n\t\"+xsmp\",\n# else\n\t\"-xsmp\",\n# endif\n# ifdef FEAT_XCLIPBOARD\n\t\"+xterm_clipboard\",\n# else\n\t\"-xterm_clipboard\",\n# endif\n#endif\n#ifdef FEAT_XTERM_SAVE\n\t\"+xterm_save\",\n#else\n\t\"-xterm_save\",\n#endif\n\tNULL\n};","static int included_patches[] =\n{ /* Add new patch number below this line */","/**/\n 4919,","/**/\n 4918,\n/**/\n 4917,\n/**/\n 4916,\n/**/\n 4915,\n/**/\n 4914,\n/**/\n 4913,\n/**/\n 4912,\n/**/\n 4911,\n/**/\n 4910,\n/**/\n 4909,\n/**/\n 4908,\n/**/\n 4907,\n/**/\n 4906,\n/**/\n 4905,\n/**/\n 4904,\n/**/\n 4903,\n/**/\n 4902,\n/**/\n 4901,\n/**/\n 4900,\n/**/\n 4899,\n/**/\n 4898,\n/**/\n 4897,\n/**/\n 4896,\n/**/\n 4895,\n/**/\n 4894,\n/**/\n 4893,\n/**/\n 4892,\n/**/\n 4891,\n/**/\n 4890,\n/**/\n 4889,\n/**/\n 4888,\n/**/\n 4887,\n/**/\n 4886,\n/**/\n 4885,\n/**/\n 4884,\n/**/\n 4883,\n/**/\n 4882,\n/**/\n 4881,\n/**/\n 4880,\n/**/\n 4879,\n/**/\n 4878,\n/**/\n 4877,\n/**/\n 4876,\n/**/\n 4875,\n/**/\n 4874,\n/**/\n 4873,\n/**/\n 4872,\n/**/\n 4871,\n/**/\n 4870,\n/**/\n 4869,\n/**/\n 4868,\n/**/\n 4867,\n/**/\n 4866,\n/**/\n 4865,\n/**/\n 4864,\n/**/\n 4863,\n/**/\n 4862,\n/**/\n 4861,\n/**/\n 4860,\n/**/\n 4859,\n/**/\n 4858,\n/**/\n 4857,\n/**/\n 4856,\n/**/\n 4855,\n/**/\n 4854,\n/**/\n 4853,\n/**/\n 4852,\n/**/\n 4851,\n/**/\n 4850,\n/**/\n 4849,\n/**/\n 4848,\n/**/\n 4847,\n/**/\n 4846,\n/**/\n 4845,\n/**/\n 4844,\n/**/\n 4843,\n/**/\n 4842,\n/**/\n 4841,\n/**/\n 4840,\n/**/\n 4839,\n/**/\n 4838,\n/**/\n 4837,\n/**/\n 4836,\n/**/\n 4835,\n/**/\n 4834,\n/**/\n 4833,\n/**/\n 4832,\n/**/\n 4831,\n/**/\n 4830,\n/**/\n 4829,\n/**/\n 4828,\n/**/\n 4827,\n/**/\n 4826,\n/**/\n 4825,\n/**/\n 4824,\n/**/\n 4823,\n/**/\n 4822,\n/**/\n 4821,\n/**/\n 4820,\n/**/\n 4819,\n/**/\n 4818,\n/**/\n 4817,\n/**/\n 4816,\n/**/\n 4815,\n/**/\n 4814,\n/**/\n 4813,\n/**/\n 4812,\n/**/\n 4811,\n/**/\n 4810,\n/**/\n 4809,\n/**/\n 4808,\n/**/\n 4807,\n/**/\n 4806,\n/**/\n 4805,\n/**/\n 4804,\n/**/\n 4803,\n/**/\n 4802,\n/**/\n 4801,\n/**/\n 4800,\n/**/\n 4799,\n/**/\n 4798,\n/**/\n 4797,\n/**/\n 4796,\n/**/\n 4795,\n/**/\n 4794,\n/**/\n 4793,\n/**/\n 4792,\n/**/\n 4791,\n/**/\n 4790,\n/**/\n 4789,\n/**/\n 4788,\n/**/\n 4787,\n/**/\n 4786,\n/**/\n 4785,\n/**/\n 4784,\n/**/\n 4783,\n/**/\n 4782,\n/**/\n 4781,\n/**/\n 4780,\n/**/\n 4779,\n/**/\n 4778,\n/**/\n 4777,\n/**/\n 4776,\n/**/\n 4775,\n/**/\n 4774,\n/**/\n 4773,\n/**/\n 4772,\n/**/\n 4771,\n/**/\n 4770,\n/**/\n 4769,\n/**/\n 4768,\n/**/\n 4767,\n/**/\n 4766,\n/**/\n 4765,\n/**/\n 4764,\n/**/\n 4763,\n/**/\n 4762,\n/**/\n 4761,\n/**/\n 4760,\n/**/\n 4759,\n/**/\n 4758,\n/**/\n 4757,\n/**/\n 4756,\n/**/\n 4755,\n/**/\n 4754,\n/**/\n 4753,\n/**/\n 4752,\n/**/\n 4751,\n/**/\n 4750,\n/**/\n 4749,\n/**/\n 4748,\n/**/\n 4747,\n/**/\n 4746,\n/**/\n 4745,\n/**/\n 4744,\n/**/\n 4743,\n/**/\n 4742,\n/**/\n 4741,\n/**/\n 4740,\n/**/\n 4739,\n/**/\n 4738,\n/**/\n 4737,\n/**/\n 4736,\n/**/\n 4735,\n/**/\n 4734,\n/**/\n 4733,\n/**/\n 4732,\n/**/\n 4731,\n/**/\n 4730,\n/**/\n 4729,\n/**/\n 4728,\n/**/\n 4727,\n/**/\n 4726,\n/**/\n 4725,\n/**/\n 4724,\n/**/\n 4723,\n/**/\n 4722,\n/**/\n 4721,\n/**/\n 4720,\n/**/\n 4719,\n/**/\n 4718,\n/**/\n 4717,\n/**/\n 4716,\n/**/\n 4715,\n/**/\n 4714,\n/**/\n 4713,\n/**/\n 4712,\n/**/\n 4711,\n/**/\n 4710,\n/**/\n 4709,\n/**/\n 4708,\n/**/\n 4707,\n/**/\n 4706,\n/**/\n 4705,\n/**/\n 4704,\n/**/\n 4703,\n/**/\n 4702,\n/**/\n 4701,\n/**/\n 4700,\n/**/\n 4699,\n/**/\n 4698,\n/**/\n 4697,\n/**/\n 4696,\n/**/\n 4695,\n/**/\n 4694,\n/**/\n 4693,\n/**/\n 4692,\n/**/\n 4691,\n/**/\n 4690,\n/**/\n 4689,\n/**/\n 4688,\n/**/\n 4687,\n/**/\n 4686,\n/**/\n 4685,\n/**/\n 4684,\n/**/\n 4683,\n/**/\n 4682,\n/**/\n 4681,\n/**/\n 4680,\n/**/\n 4679,\n/**/\n 4678,\n/**/\n 4677,\n/**/\n 4676,\n/**/\n 4675,\n/**/\n 4674,\n/**/\n 4673,\n/**/\n 4672,\n/**/\n 4671,\n/**/\n 4670,\n/**/\n 4669,\n/**/\n 4668,\n/**/\n 4667,\n/**/\n 4666,\n/**/\n 4665,\n/**/\n 4664,\n/**/\n 4663,\n/**/\n 4662,\n/**/\n 4661,\n/**/\n 4660,\n/**/\n 4659,\n/**/\n 4658,\n/**/\n 4657,\n/**/\n 4656,\n/**/\n 4655,\n/**/\n 4654,\n/**/\n 4653,\n/**/\n 4652,\n/**/\n 4651,\n/**/\n 4650,\n/**/\n 4649,\n/**/\n 4648,\n/**/\n 4647,\n/**/\n 4646,\n/**/\n 4645,\n/**/\n 4644,\n/**/\n 4643,\n/**/\n 4642,\n/**/\n 4641,\n/**/\n 4640,\n/**/\n 4639,\n/**/\n 4638,\n/**/\n 4637,\n/**/\n 4636,\n/**/\n 4635,\n/**/\n 4634,\n/**/\n 4633,\n/**/\n 4632,\n/**/\n 4631,\n/**/\n 4630,\n/**/\n 4629,\n/**/\n 4628,\n/**/\n 4627,\n/**/\n 4626,\n/**/\n 4625,\n/**/\n 4624,\n/**/\n 4623,\n/**/\n 4622,\n/**/\n 4621,\n/**/\n 4620,\n/**/\n 4619,\n/**/\n 4618,\n/**/\n 4617,\n/**/\n 4616,\n/**/\n 4615,\n/**/\n 4614,\n/**/\n 4613,\n/**/\n 4612,\n/**/\n 4611,\n/**/\n 4610,\n/**/\n 4609,\n/**/\n 4608,\n/**/\n 4607,\n/**/\n 4606,\n/**/\n 4605,\n/**/\n 4604,\n/**/\n 4603,\n/**/\n 4602,\n/**/\n 4601,\n/**/\n 4600,\n/**/\n 4599,\n/**/\n 4598,\n/**/\n 4597,\n/**/\n 4596,\n/**/\n 4595,\n/**/\n 4594,\n/**/\n 4593,\n/**/\n 4592,\n/**/\n 4591,\n/**/\n 4590,\n/**/\n 4589,\n/**/\n 4588,\n/**/\n 4587,\n/**/\n 4586,\n/**/\n 4585,\n/**/\n 4584,\n/**/\n 4583,\n/**/\n 4582,\n/**/\n 4581,\n/**/\n 4580,\n/**/\n 4579,\n/**/\n 4578,\n/**/\n 4577,\n/**/\n 4576,\n/**/\n 4575,\n/**/\n 4574,\n/**/\n 4573,\n/**/\n 4572,\n/**/\n 4571,\n/**/\n 4570,\n/**/\n 4569,\n/**/\n 4568,\n/**/\n 4567,\n/**/\n 4566,\n/**/\n 4565,\n/**/\n 4564,\n/**/\n 4563,\n/**/\n 4562,\n/**/\n 4561,\n/**/\n 4560,\n/**/\n 4559,\n/**/\n 4558,\n/**/\n 4557,\n/**/\n 4556,\n/**/\n 4555,\n/**/\n 4554,\n/**/\n 4553,\n/**/\n 4552,\n/**/\n 4551,\n/**/\n 4550,\n/**/\n 4549,\n/**/\n 4548,\n/**/\n 4547,\n/**/\n 4546,\n/**/\n 4545,\n/**/\n 4544,\n/**/\n 4543,\n/**/\n 4542,\n/**/\n 4541,\n/**/\n 4540,\n/**/\n 4539,\n/**/\n 4538,\n/**/\n 4537,\n/**/\n 4536,\n/**/\n 4535,\n/**/\n 4534,\n/**/\n 4533,\n/**/\n 4532,\n/**/\n 4531,\n/**/\n 4530,\n/**/\n 4529,\n/**/\n 4528,\n/**/\n 4527,\n/**/\n 4526,\n/**/\n 4525,\n/**/\n 4524,\n/**/\n 4523,\n/**/\n 4522,\n/**/\n 4521,\n/**/\n 4520,\n/**/\n 4519,\n/**/\n 4518,\n/**/\n 4517,\n/**/\n 4516,\n/**/\n 4515,\n/**/\n 4514,\n/**/\n 4513,\n/**/\n 4512,\n/**/\n 4511,\n/**/\n 4510,\n/**/\n 4509,\n/**/\n 4508,\n/**/\n 4507,\n/**/\n 4506,\n/**/\n 4505,\n/**/\n 4504,\n/**/\n 4503,\n/**/\n 4502,\n/**/\n 4501,\n/**/\n 4500,\n/**/\n 4499,\n/**/\n 4498,\n/**/\n 4497,\n/**/\n 4496,\n/**/\n 4495,\n/**/\n 4494,\n/**/\n 4493,\n/**/\n 4492,\n/**/\n 4491,\n/**/\n 4490,\n/**/\n 4489,\n/**/\n 4488,\n/**/\n 4487,\n/**/\n 4486,\n/**/\n 4485,\n/**/\n 4484,\n/**/\n 4483,\n/**/\n 4482,\n/**/\n 4481,\n/**/\n 4480,\n/**/\n 4479,\n/**/\n 4478,\n/**/\n 4477,\n/**/\n 4476,\n/**/\n 4475,\n/**/\n 4474,\n/**/\n 4473,\n/**/\n 4472,\n/**/\n 4471,\n/**/\n 4470,\n/**/\n 4469,\n/**/\n 4468,\n/**/\n 4467,\n/**/\n 4466,\n/**/\n 4465,\n/**/\n 4464,\n/**/\n 4463,\n/**/\n 4462,\n/**/\n 4461,\n/**/\n 4460,\n/**/\n 4459,\n/**/\n 4458,\n/**/\n 4457,\n/**/\n 4456,\n/**/\n 4455,\n/**/\n 4454,\n/**/\n 4453,\n/**/\n 4452,\n/**/\n 4451,\n/**/\n 4450,\n/**/\n 4449,\n/**/\n 4448,\n/**/\n 4447,\n/**/\n 4446,\n/**/\n 4445,\n/**/\n 4444,\n/**/\n 4443,\n/**/\n 4442,\n/**/\n 4441,\n/**/\n 4440,\n/**/\n 4439,\n/**/\n 4438,\n/**/\n 4437,\n/**/\n 4436,\n/**/\n 4435,\n/**/\n 4434,\n/**/\n 4433,\n/**/\n 4432,\n/**/\n 4431,\n/**/\n 4430,\n/**/\n 4429,\n/**/\n 4428,\n/**/\n 4427,\n/**/\n 4426,\n/**/\n 4425,\n/**/\n 4424,\n/**/\n 4423,\n/**/\n 4422,\n/**/\n 4421,\n/**/\n 4420,\n/**/\n 4419,\n/**/\n 4418,\n/**/\n 4417,\n/**/\n 4416,\n/**/\n 4415,\n/**/\n 4414,\n/**/\n 4413,\n/**/\n 4412,\n/**/\n 4411,\n/**/\n 4410,\n/**/\n 4409,\n/**/\n 4408,\n/**/\n 4407,\n/**/\n 4406,\n/**/\n 4405,\n/**/\n 4404,\n/**/\n 4403,\n/**/\n 4402,\n/**/\n 4401,\n/**/\n 4400,\n/**/\n 4399,\n/**/\n 4398,\n/**/\n 4397,\n/**/\n 4396,\n/**/\n 4395,\n/**/\n 4394,\n/**/\n 4393,\n/**/\n 4392,\n/**/\n 4391,\n/**/\n 4390,\n/**/\n 4389,\n/**/\n 4388,\n/**/\n 4387,\n/**/\n 4386,\n/**/\n 4385,\n/**/\n 4384,\n/**/\n 4383,\n/**/\n 4382,\n/**/\n 4381,\n/**/\n 4380,\n/**/\n 4379,\n/**/\n 4378,\n/**/\n 4377,\n/**/\n 4376,\n/**/\n 4375,\n/**/\n 4374,\n/**/\n 4373,\n/**/\n 4372,\n/**/\n 4371,\n/**/\n 4370,\n/**/\n 4369,\n/**/\n 4368,\n/**/\n 4367,\n/**/\n 4366,\n/**/\n 4365,\n/**/\n 4364,\n/**/\n 4363,\n/**/\n 4362,\n/**/\n 4361,\n/**/\n 4360,\n/**/\n 4359,\n/**/\n 4358,\n/**/\n 4357,\n/**/\n 4356,\n/**/\n 4355,\n/**/\n 4354,\n/**/\n 4353,\n/**/\n 4352,\n/**/\n 4351,\n/**/\n 4350,\n/**/\n 4349,\n/**/\n 4348,\n/**/\n 4347,\n/**/\n 4346,\n/**/\n 4345,\n/**/\n 4344,\n/**/\n 4343,\n/**/\n 4342,\n/**/\n 4341,\n/**/\n 4340,\n/**/\n 4339,\n/**/\n 4338,\n/**/\n 4337,\n/**/\n 4336,\n/**/\n 4335,\n/**/\n 4334,\n/**/\n 4333,\n/**/\n 4332,\n/**/\n 4331,\n/**/\n 4330,\n/**/\n 4329,\n/**/\n 4328,\n/**/\n 4327,\n/**/\n 4326,\n/**/\n 4325,\n/**/\n 4324,\n/**/\n 4323,\n/**/\n 4322,\n/**/\n 4321,\n/**/\n 4320,\n/**/\n 4319,\n/**/\n 4318,\n/**/\n 4317,\n/**/\n 4316,\n/**/\n 4315,\n/**/\n 4314,\n/**/\n 4313,\n/**/\n 4312,\n/**/\n 4311,\n/**/\n 4310,\n/**/\n 4309,\n/**/\n 4308,\n/**/\n 4307,\n/**/\n 4306,\n/**/\n 4305,\n/**/\n 4304,\n/**/\n 4303,\n/**/\n 4302,\n/**/\n 4301,\n/**/\n 4300,\n/**/\n 4299,\n/**/\n 4298,\n/**/\n 4297,\n/**/\n 4296,\n/**/\n 4295,\n/**/\n 4294,\n/**/\n 4293,\n/**/\n 4292,\n/**/\n 4291,\n/**/\n 4290,\n/**/\n 4289,\n/**/\n 4288,\n/**/\n 4287,\n/**/\n 4286,\n/**/\n 4285,\n/**/\n 4284,\n/**/\n 4283,\n/**/\n 4282,\n/**/\n 4281,\n/**/\n 4280,\n/**/\n 4279,\n/**/\n 4278,\n/**/\n 4277,\n/**/\n 4276,\n/**/\n 4275,\n/**/\n 4274,\n/**/\n 4273,\n/**/\n 4272,\n/**/\n 4271,\n/**/\n 4270,\n/**/\n 4269,\n/**/\n 4268,\n/**/\n 4267,\n/**/\n 4266,\n/**/\n 4265,\n/**/\n 4264,\n/**/\n 4263,\n/**/\n 4262,\n/**/\n 4261,\n/**/\n 4260,\n/**/\n 4259,\n/**/\n 4258,\n/**/\n 4257,\n/**/\n 4256,\n/**/\n 4255,\n/**/\n 4254,\n/**/\n 4253,\n/**/\n 4252,\n/**/\n 4251,\n/**/\n 4250,\n/**/\n 4249,\n/**/\n 4248,\n/**/\n 4247,\n/**/\n 4246,\n/**/\n 4245,\n/**/\n 4244,\n/**/\n 4243,\n/**/\n 4242,\n/**/\n 4241,\n/**/\n 4240,\n/**/\n 4239,\n/**/\n 4238,\n/**/\n 4237,\n/**/\n 4236,\n/**/\n 4235,\n/**/\n 4234,\n/**/\n 4233,\n/**/\n 4232,\n/**/\n 4231,\n/**/\n 4230,\n/**/\n 4229,\n/**/\n 4228,\n/**/\n 4227,\n/**/\n 4226,\n/**/\n 4225,\n/**/\n 4224,\n/**/\n 4223,\n/**/\n 4222,\n/**/\n 4221,\n/**/\n 4220,\n/**/\n 4219,\n/**/\n 4218,\n/**/\n 4217,\n/**/\n 4216,\n/**/\n 4215,\n/**/\n 4214,\n/**/\n 4213,\n/**/\n 4212,\n/**/\n 4211,\n/**/\n 4210,\n/**/\n 4209,\n/**/\n 4208,\n/**/\n 4207,\n/**/\n 4206,\n/**/\n 4205,\n/**/\n 4204,\n/**/\n 4203,\n/**/\n 4202,\n/**/\n 4201,\n/**/\n 4200,\n/**/\n 4199,\n/**/\n 4198,\n/**/\n 4197,\n/**/\n 4196,\n/**/\n 4195,\n/**/\n 4194,\n/**/\n 4193,\n/**/\n 4192,\n/**/\n 4191,\n/**/\n 4190,\n/**/\n 4189,\n/**/\n 4188,\n/**/\n 4187,\n/**/\n 4186,\n/**/\n 4185,\n/**/\n 4184,\n/**/\n 4183,\n/**/\n 4182,\n/**/\n 4181,\n/**/\n 4180,\n/**/\n 4179,\n/**/\n 4178,\n/**/\n 4177,\n/**/\n 4176,\n/**/\n 4175,\n/**/\n 4174,\n/**/\n 4173,\n/**/\n 4172,\n/**/\n 4171,\n/**/\n 4170,\n/**/\n 4169,\n/**/\n 4168,\n/**/\n 4167,\n/**/\n 4166,\n/**/\n 4165,\n/**/\n 4164,\n/**/\n 4163,\n/**/\n 4162,\n/**/\n 4161,\n/**/\n 4160,\n/**/\n 4159,\n/**/\n 4158,\n/**/\n 4157,\n/**/\n 4156,\n/**/\n 4155,\n/**/\n 4154,\n/**/\n 4153,\n/**/\n 4152,\n/**/\n 4151,\n/**/\n 4150,\n/**/\n 4149,\n/**/\n 4148,\n/**/\n 4147,\n/**/\n 4146,\n/**/\n 4145,\n/**/\n 4144,\n/**/\n 4143,\n/**/\n 4142,\n/**/\n 4141,\n/**/\n 4140,\n/**/\n 4139,\n/**/\n 4138,\n/**/\n 4137,\n/**/\n 4136,\n/**/\n 4135,\n/**/\n 4134,\n/**/\n 4133,\n/**/\n 4132,\n/**/\n 4131,\n/**/\n 4130,\n/**/\n 4129,\n/**/\n 4128,\n/**/\n 4127,\n/**/\n 4126,\n/**/\n 4125,\n/**/\n 4124,\n/**/\n 4123,\n/**/\n 4122,\n/**/\n 4121,\n/**/\n 4120,\n/**/\n 4119,\n/**/\n 4118,\n/**/\n 4117,\n/**/\n 4116,\n/**/\n 4115,\n/**/\n 4114,\n/**/\n 4113,\n/**/\n 4112,\n/**/\n 4111,\n/**/\n 4110,\n/**/\n 4109,\n/**/\n 4108,\n/**/\n 4107,\n/**/\n 4106,\n/**/\n 4105,\n/**/\n 4104,\n/**/\n 4103,\n/**/\n 4102,\n/**/\n 4101,\n/**/\n 4100,\n/**/\n 4099,\n/**/\n 4098,\n/**/\n 4097,\n/**/\n 4096,\n/**/\n 4095,\n/**/\n 4094,\n/**/\n 4093,\n/**/\n 4092,\n/**/\n 4091,\n/**/\n 4090,\n/**/\n 4089,\n/**/\n 4088,\n/**/\n 4087,\n/**/\n 4086,\n/**/\n 4085,\n/**/\n 4084,\n/**/\n 4083,\n/**/\n 4082,\n/**/\n 4081,\n/**/\n 4080,\n/**/\n 4079,\n/**/\n 4078,\n/**/\n 4077,\n/**/\n 4076,\n/**/\n 4075,\n/**/\n 4074,\n/**/\n 4073,\n/**/\n 4072,\n/**/\n 4071,\n/**/\n 4070,\n/**/\n 4069,\n/**/\n 4068,\n/**/\n 4067,\n/**/\n 4066,\n/**/\n 4065,\n/**/\n 4064,\n/**/\n 4063,\n/**/\n 4062,\n/**/\n 4061,\n/**/\n 4060,\n/**/\n 4059,\n/**/\n 4058,\n/**/\n 4057,\n/**/\n 4056,\n/**/\n 4055,\n/**/\n 4054,\n/**/\n 4053,\n/**/\n 4052,\n/**/\n 4051,\n/**/\n 4050,\n/**/\n 4049,\n/**/\n 4048,\n/**/\n 4047,\n/**/\n 4046,\n/**/\n 4045,\n/**/\n 4044,\n/**/\n 4043,\n/**/\n 4042,\n/**/\n 4041,\n/**/\n 4040,\n/**/\n 4039,\n/**/\n 4038,\n/**/\n 4037,\n/**/\n 4036,\n/**/\n 4035,\n/**/\n 4034,\n/**/\n 4033,\n/**/\n 4032,\n/**/\n 4031,\n/**/\n 4030,\n/**/\n 4029,\n/**/\n 4028,\n/**/\n 4027,\n/**/\n 4026,\n/**/\n 4025,\n/**/\n 4024,\n/**/\n 4023,\n/**/\n 4022,\n/**/\n 4021,\n/**/\n 4020,\n/**/\n 4019,\n/**/\n 4018,\n/**/\n 4017,\n/**/\n 4016,\n/**/\n 4015,\n/**/\n 4014,\n/**/\n 4013,\n/**/\n 4012,\n/**/\n 4011,\n/**/\n 4010,\n/**/\n 4009,\n/**/\n 4008,\n/**/\n 4007,\n/**/\n 4006,\n/**/\n 4005,\n/**/\n 4004,\n/**/\n 4003,\n/**/\n 4002,\n/**/\n 4001,\n/**/\n 4000,\n/**/\n 3999,\n/**/\n 3998,\n/**/\n 3997,\n/**/\n 3996,\n/**/\n 3995,\n/**/\n 3994,\n/**/\n 3993,\n/**/\n 3992,\n/**/\n 3991,\n/**/\n 3990,\n/**/\n 3989,\n/**/\n 3988,\n/**/\n 3987,\n/**/\n 3986,\n/**/\n 3985,\n/**/\n 3984,\n/**/\n 3983,\n/**/\n 3982,\n/**/\n 3981,\n/**/\n 3980,\n/**/\n 3979,\n/**/\n 3978,\n/**/\n 3977,\n/**/\n 3976,\n/**/\n 3975,\n/**/\n 3974,\n/**/\n 3973,\n/**/\n 3972,\n/**/\n 3971,\n/**/\n 3970,\n/**/\n 3969,\n/**/\n 3968,\n/**/\n 3967,\n/**/\n 3966,\n/**/\n 3965,\n/**/\n 3964,\n/**/\n 3963,\n/**/\n 3962,\n/**/\n 3961,\n/**/\n 3960,\n/**/\n 3959,\n/**/\n 3958,\n/**/\n 3957,\n/**/\n 3956,\n/**/\n 3955,\n/**/\n 3954,\n/**/\n 3953,\n/**/\n 3952,\n/**/\n 3951,\n/**/\n 3950,\n/**/\n 3949,\n/**/\n 3948,\n/**/\n 3947,\n/**/\n 3946,\n/**/\n 3945,\n/**/\n 3944,\n/**/\n 3943,\n/**/\n 3942,\n/**/\n 3941,\n/**/\n 3940,\n/**/\n 3939,\n/**/\n 3938,\n/**/\n 3937,\n/**/\n 3936,\n/**/\n 3935,\n/**/\n 3934,\n/**/\n 3933,\n/**/\n 3932,\n/**/\n 3931,\n/**/\n 3930,\n/**/\n 3929,\n/**/\n 3928,\n/**/\n 3927,\n/**/\n 3926,\n/**/\n 3925,\n/**/\n 3924,\n/**/\n 3923,\n/**/\n 3922,\n/**/\n 3921,\n/**/\n 3920,\n/**/\n 3919,\n/**/\n 3918,\n/**/\n 3917,\n/**/\n 3916,\n/**/\n 3915,\n/**/\n 3914,\n/**/\n 3913,\n/**/\n 3912,\n/**/\n 3911,\n/**/\n 3910,\n/**/\n 3909,\n/**/\n 3908,\n/**/\n 3907,\n/**/\n 3906,\n/**/\n 3905,\n/**/\n 3904,\n/**/\n 3903,\n/**/\n 3902,\n/**/\n 3901,\n/**/\n 3900,\n/**/\n 3899,\n/**/\n 3898,\n/**/\n 3897,\n/**/\n 3896,\n/**/\n 3895,\n/**/\n 3894,\n/**/\n 3893,\n/**/\n 3892,\n/**/\n 3891,\n/**/\n 3890,\n/**/\n 3889,\n/**/\n 3888,\n/**/\n 3887,\n/**/\n 3886,\n/**/\n 3885,\n/**/\n 3884,\n/**/\n 3883,\n/**/\n 3882,\n/**/\n 3881,\n/**/\n 3880,\n/**/\n 3879,\n/**/\n 3878,\n/**/\n 3877,\n/**/\n 3876,\n/**/\n 3875,\n/**/\n 3874,\n/**/\n 3873,\n/**/\n 3872,\n/**/\n 3871,\n/**/\n 3870,\n/**/\n 3869,\n/**/\n 3868,\n/**/\n 3867,\n/**/\n 3866,\n/**/\n 3865,\n/**/\n 3864,\n/**/\n 3863,\n/**/\n 3862,\n/**/\n 3861,\n/**/\n 3860,\n/**/\n 3859,\n/**/\n 3858,\n/**/\n 3857,\n/**/\n 3856,\n/**/\n 3855,\n/**/\n 3854,\n/**/\n 3853,\n/**/\n 3852,\n/**/\n 3851,\n/**/\n 3850,\n/**/\n 3849,\n/**/\n 3848,\n/**/\n 3847,\n/**/\n 3846,\n/**/\n 3845,\n/**/\n 3844,\n/**/\n 3843,\n/**/\n 3842,\n/**/\n 3841,\n/**/\n 3840,\n/**/\n 3839,\n/**/\n 3838,\n/**/\n 3837,\n/**/\n 3836,\n/**/\n 3835,\n/**/\n 3834,\n/**/\n 3833,\n/**/\n 3832,\n/**/\n 3831,\n/**/\n 3830,\n/**/\n 3829,\n/**/\n 3828,\n/**/\n 3827,\n/**/\n 3826,\n/**/\n 3825,\n/**/\n 3824,\n/**/\n 3823,\n/**/\n 3822,\n/**/\n 3821,\n/**/\n 3820,\n/**/\n 3819,\n/**/\n 3818,\n/**/\n 3817,\n/**/\n 3816,\n/**/\n 3815,\n/**/\n 3814,\n/**/\n 3813,\n/**/\n 3812,\n/**/\n 3811,\n/**/\n 3810,\n/**/\n 3809,\n/**/\n 3808,\n/**/\n 3807,\n/**/\n 3806,\n/**/\n 3805,\n/**/\n 3804,\n/**/\n 3803,\n/**/\n 3802,\n/**/\n 3801,\n/**/\n 3800,\n/**/\n 3799,\n/**/\n 3798,\n/**/\n 3797,\n/**/\n 3796,\n/**/\n 3795,\n/**/\n 3794,\n/**/\n 3793,\n/**/\n 3792,\n/**/\n 3791,\n/**/\n 3790,\n/**/\n 3789,\n/**/\n 3788,\n/**/\n 3787,\n/**/\n 3786,\n/**/\n 3785,\n/**/\n 3784,\n/**/\n 3783,\n/**/\n 3782,\n/**/\n 3781,\n/**/\n 3780,\n/**/\n 3779,\n/**/\n 3778,\n/**/\n 3777,\n/**/\n 3776,\n/**/\n 3775,\n/**/\n 3774,\n/**/\n 3773,\n/**/\n 3772,\n/**/\n 3771,\n/**/\n 3770,\n/**/\n 3769,\n/**/\n 3768,\n/**/\n 3767,\n/**/\n 3766,\n/**/\n 3765,\n/**/\n 3764,\n/**/\n 3763,\n/**/\n 3762,\n/**/\n 3761,\n/**/\n 3760,\n/**/\n 3759,\n/**/\n 3758,\n/**/\n 3757,\n/**/\n 3756,\n/**/\n 3755,\n/**/\n 3754,\n/**/\n 3753,\n/**/\n 3752,\n/**/\n 3751,\n/**/\n 3750,\n/**/\n 3749,\n/**/\n 3748,\n/**/\n 3747,\n/**/\n 3746,\n/**/\n 3745,\n/**/\n 3744,\n/**/\n 3743,\n/**/\n 3742,\n/**/\n 3741,\n/**/\n 3740,\n/**/\n 3739,\n/**/\n 3738,\n/**/\n 3737,\n/**/\n 3736,\n/**/\n 3735,\n/**/\n 3734,\n/**/\n 3733,\n/**/\n 3732,\n/**/\n 3731,\n/**/\n 3730,\n/**/\n 3729,\n/**/\n 3728,\n/**/\n 3727,\n/**/\n 3726,\n/**/\n 3725,\n/**/\n 3724,\n/**/\n 3723,\n/**/\n 3722,\n/**/\n 3721,\n/**/\n 3720,\n/**/\n 3719,\n/**/\n 3718,\n/**/\n 3717,\n/**/\n 3716,\n/**/\n 3715,\n/**/\n 3714,\n/**/\n 3713,\n/**/\n 3712,\n/**/\n 3711,\n/**/\n 3710,\n/**/\n 3709,\n/**/\n 3708,\n/**/\n 3707,\n/**/\n 3706,\n/**/\n 3705,\n/**/\n 3704,\n/**/\n 3703,\n/**/\n 3702,\n/**/\n 3701,\n/**/\n 3700,\n/**/\n 3699,\n/**/\n 3698,\n/**/\n 3697,\n/**/\n 3696,\n/**/\n 3695,\n/**/\n 3694,\n/**/\n 3693,\n/**/\n 3692,\n/**/\n 3691,\n/**/\n 3690,\n/**/\n 3689,\n/**/\n 3688,\n/**/\n 3687,\n/**/\n 3686,\n/**/\n 3685,\n/**/\n 3684,\n/**/\n 3683,\n/**/\n 3682,\n/**/\n 3681,\n/**/\n 3680,\n/**/\n 3679,\n/**/\n 3678,\n/**/\n 3677,\n/**/\n 3676,\n/**/\n 3675,\n/**/\n 3674,\n/**/\n 3673,\n/**/\n 3672,\n/**/\n 3671,\n/**/\n 3670,\n/**/\n 3669,\n/**/\n 3668,\n/**/\n 3667,\n/**/\n 3666,\n/**/\n 3665,\n/**/\n 3664,\n/**/\n 3663,\n/**/\n 3662,\n/**/\n 3661,\n/**/\n 3660,\n/**/\n 3659,\n/**/\n 3658,\n/**/\n 3657,\n/**/\n 3656,\n/**/\n 3655,\n/**/\n 3654,\n/**/\n 3653,\n/**/\n 3652,\n/**/\n 3651,\n/**/\n 3650,\n/**/\n 3649,\n/**/\n 3648,\n/**/\n 3647,\n/**/\n 3646,\n/**/\n 3645,\n/**/\n 3644,\n/**/\n 3643,\n/**/\n 3642,\n/**/\n 3641,\n/**/\n 3640,\n/**/\n 3639,\n/**/\n 3638,\n/**/\n 3637,\n/**/\n 3636,\n/**/\n 3635,\n/**/\n 3634,\n/**/\n 3633,\n/**/\n 3632,\n/**/\n 3631,\n/**/\n 3630,\n/**/\n 3629,\n/**/\n 3628,\n/**/\n 3627,\n/**/\n 3626,\n/**/\n 3625,\n/**/\n 3624,\n/**/\n 3623,\n/**/\n 3622,\n/**/\n 3621,\n/**/\n 3620,\n/**/\n 3619,\n/**/\n 3618,\n/**/\n 3617,\n/**/\n 3616,\n/**/\n 3615,\n/**/\n 3614,\n/**/\n 3613,\n/**/\n 3612,\n/**/\n 3611,\n/**/\n 3610,\n/**/\n 3609,\n/**/\n 3608,\n/**/\n 3607,\n/**/\n 3606,\n/**/\n 3605,\n/**/\n 3604,\n/**/\n 3603,\n/**/\n 3602,\n/**/\n 3601,\n/**/\n 3600,\n/**/\n 3599,\n/**/\n 3598,\n/**/\n 3597,\n/**/\n 3596,\n/**/\n 3595,\n/**/\n 3594,\n/**/\n 3593,\n/**/\n 3592,\n/**/\n 3591,\n/**/\n 3590,\n/**/\n 3589,\n/**/\n 3588,\n/**/\n 3587,\n/**/\n 3586,\n/**/\n 3585,\n/**/\n 3584,\n/**/\n 3583,\n/**/\n 3582,\n/**/\n 3581,\n/**/\n 3580,\n/**/\n 3579,\n/**/\n 3578,\n/**/\n 3577,\n/**/\n 3576,\n/**/\n 3575,\n/**/\n 3574,\n/**/\n 3573,\n/**/\n 3572,\n/**/\n 3571,\n/**/\n 3570,\n/**/\n 3569,\n/**/\n 3568,\n/**/\n 3567,\n/**/\n 3566,\n/**/\n 3565,\n/**/\n 3564,\n/**/\n 3563,\n/**/\n 3562,\n/**/\n 3561,\n/**/\n 3560,\n/**/\n 3559,\n/**/\n 3558,\n/**/\n 3557,\n/**/\n 3556,\n/**/\n 3555,\n/**/\n 3554,\n/**/\n 3553,\n/**/\n 3552,\n/**/\n 3551,\n/**/\n 3550,\n/**/\n 3549,\n/**/\n 3548,\n/**/\n 3547,\n/**/\n 3546,\n/**/\n 3545,\n/**/\n 3544,\n/**/\n 3543,\n/**/\n 3542,\n/**/\n 3541,\n/**/\n 3540,\n/**/\n 3539,\n/**/\n 3538,\n/**/\n 3537,\n/**/\n 3536,\n/**/\n 3535,\n/**/\n 3534,\n/**/\n 3533,\n/**/\n 3532,\n/**/\n 3531,\n/**/\n 3530,\n/**/\n 3529,\n/**/\n 3528,\n/**/\n 3527,\n/**/\n 3526,\n/**/\n 3525,\n/**/\n 3524,\n/**/\n 3523,\n/**/\n 3522,\n/**/\n 3521,\n/**/\n 3520,\n/**/\n 3519,\n/**/\n 3518,\n/**/\n 3517,\n/**/\n 3516,\n/**/\n 3515,\n/**/\n 3514,\n/**/\n 3513,\n/**/\n 3512,\n/**/\n 3511,\n/**/\n 3510,\n/**/\n 3509,\n/**/\n 3508,\n/**/\n 3507,\n/**/\n 3506,\n/**/\n 3505,\n/**/\n 3504,\n/**/\n 3503,\n/**/\n 3502,\n/**/\n 3501,\n/**/\n 3500,\n/**/\n 3499,\n/**/\n 3498,\n/**/\n 3497,\n/**/\n 3496,\n/**/\n 3495,\n/**/\n 3494,\n/**/\n 3493,\n/**/\n 3492,\n/**/\n 3491,\n/**/\n 3490,\n/**/\n 3489,\n/**/\n 3488,\n/**/\n 3487,\n/**/\n 3486,\n/**/\n 3485,\n/**/\n 3484,\n/**/\n 3483,\n/**/\n 3482,\n/**/\n 3481,\n/**/\n 3480,\n/**/\n 3479,\n/**/\n 3478,\n/**/\n 3477,\n/**/\n 3476,\n/**/\n 3475,\n/**/\n 3474,\n/**/\n 3473,\n/**/\n 3472,\n/**/\n 3471,\n/**/\n 3470,\n/**/\n 3469,\n/**/\n 3468,\n/**/\n 3467,\n/**/\n 3466,\n/**/\n 3465,\n/**/\n 3464,\n/**/\n 3463,\n/**/\n 3462,\n/**/\n 3461,\n/**/\n 3460,\n/**/\n 3459,\n/**/\n 3458,\n/**/\n 3457,\n/**/\n 3456,\n/**/\n 3455,\n/**/\n 3454,\n/**/\n 3453,\n/**/\n 3452,\n/**/\n 3451,\n/**/\n 3450,\n/**/\n 3449,\n/**/\n 3448,\n/**/\n 3447,\n/**/\n 3446,\n/**/\n 3445,\n/**/\n 3444,\n/**/\n 3443,\n/**/\n 3442,\n/**/\n 3441,\n/**/\n 3440,\n/**/\n 3439,\n/**/\n 3438,\n/**/\n 3437,\n/**/\n 3436,\n/**/\n 3435,\n/**/\n 3434,\n/**/\n 3433,\n/**/\n 3432,\n/**/\n 3431,\n/**/\n 3430,\n/**/\n 3429,\n/**/\n 3428,\n/**/\n 3427,\n/**/\n 3426,\n/**/\n 3425,\n/**/\n 3424,\n/**/\n 3423,\n/**/\n 3422,\n/**/\n 3421,\n/**/\n 3420,\n/**/\n 3419,\n/**/\n 3418,\n/**/\n 3417,\n/**/\n 3416,\n/**/\n 3415,\n/**/\n 3414,\n/**/\n 3413,\n/**/\n 3412,\n/**/\n 3411,\n/**/\n 3410,\n/**/\n 3409,\n/**/\n 3408,\n/**/\n 3407,\n/**/\n 3406,\n/**/\n 3405,\n/**/\n 3404,\n/**/\n 3403,\n/**/\n 3402,\n/**/\n 3401,\n/**/\n 3400,\n/**/\n 3399,\n/**/\n 3398,\n/**/\n 3397,\n/**/\n 3396,\n/**/\n 3395,\n/**/\n 3394,\n/**/\n 3393,\n/**/\n 3392,\n/**/\n 3391,\n/**/\n 3390,\n/**/\n 3389,\n/**/\n 3388,\n/**/\n 3387,\n/**/\n 3386,\n/**/\n 3385,\n/**/\n 3384,\n/**/\n 3383,\n/**/\n 3382,\n/**/\n 3381,\n/**/\n 3380,\n/**/\n 3379,\n/**/\n 3378,\n/**/\n 3377,\n/**/\n 3376,\n/**/\n 3375,\n/**/\n 3374,\n/**/\n 3373,\n/**/\n 3372,\n/**/\n 3371,\n/**/\n 3370,\n/**/\n 3369,\n/**/\n 3368,\n/**/\n 3367,\n/**/\n 3366,\n/**/\n 3365,\n/**/\n 3364,\n/**/\n 3363,\n/**/\n 3362,\n/**/\n 3361,\n/**/\n 3360,\n/**/\n 3359,\n/**/\n 3358,\n/**/\n 3357,\n/**/\n 3356,\n/**/\n 3355,\n/**/\n 3354,\n/**/\n 3353,\n/**/\n 3352,\n/**/\n 3351,\n/**/\n 3350,\n/**/\n 3349,\n/**/\n 3348,\n/**/\n 3347,\n/**/\n 3346,\n/**/\n 3345,\n/**/\n 3344,\n/**/\n 3343,\n/**/\n 3342,\n/**/\n 3341,\n/**/\n 3340,\n/**/\n 3339,\n/**/\n 3338,\n/**/\n 3337,\n/**/\n 3336,\n/**/\n 3335,\n/**/\n 3334,\n/**/\n 3333,\n/**/\n 3332,\n/**/\n 3331,\n/**/\n 3330,\n/**/\n 3329,\n/**/\n 3328,\n/**/\n 3327,\n/**/\n 3326,\n/**/\n 3325,\n/**/\n 3324,\n/**/\n 3323,\n/**/\n 3322,\n/**/\n 3321,\n/**/\n 3320,\n/**/\n 3319,\n/**/\n 3318,\n/**/\n 3317,\n/**/\n 3316,\n/**/\n 3315,\n/**/\n 3314,\n/**/\n 3313,\n/**/\n 3312,\n/**/\n 3311,\n/**/\n 3310,\n/**/\n 3309,\n/**/\n 3308,\n/**/\n 3307,\n/**/\n 3306,\n/**/\n 3305,\n/**/\n 3304,\n/**/\n 3303,\n/**/\n 3302,\n/**/\n 3301,\n/**/\n 3300,\n/**/\n 3299,\n/**/\n 3298,\n/**/\n 3297,\n/**/\n 3296,\n/**/\n 3295,\n/**/\n 3294,\n/**/\n 3293,\n/**/\n 3292,\n/**/\n 3291,\n/**/\n 3290,\n/**/\n 3289,\n/**/\n 3288,\n/**/\n 3287,\n/**/\n 3286,\n/**/\n 3285,\n/**/\n 3284,\n/**/\n 3283,\n/**/\n 3282,\n/**/\n 3281,\n/**/\n 3280,\n/**/\n 3279,\n/**/\n 3278,\n/**/\n 3277,\n/**/\n 3276,\n/**/\n 3275,\n/**/\n 3274,\n/**/\n 3273,\n/**/\n 3272,\n/**/\n 3271,\n/**/\n 3270,\n/**/\n 3269,\n/**/\n 3268,\n/**/\n 3267,\n/**/\n 3266,\n/**/\n 3265,\n/**/\n 3264,\n/**/\n 3263,\n/**/\n 3262,\n/**/\n 3261,\n/**/\n 3260,\n/**/\n 3259,\n/**/\n 3258,\n/**/\n 3257,\n/**/\n 3256,\n/**/\n 3255,\n/**/\n 3254,\n/**/\n 3253,\n/**/\n 3252,\n/**/\n 3251,\n/**/\n 3250,\n/**/\n 3249,\n/**/\n 3248,\n/**/\n 3247,\n/**/\n 3246,\n/**/\n 3245,\n/**/\n 3244,\n/**/\n 3243,\n/**/\n 3242,\n/**/\n 3241,\n/**/\n 3240,\n/**/\n 3239,\n/**/\n 3238,\n/**/\n 3237,\n/**/\n 3236,\n/**/\n 3235,\n/**/\n 3234,\n/**/\n 3233,\n/**/\n 3232,\n/**/\n 3231,\n/**/\n 3230,\n/**/\n 3229,\n/**/\n 3228,\n/**/\n 3227,\n/**/\n 3226,\n/**/\n 3225,\n/**/\n 3224,\n/**/\n 3223,\n/**/\n 3222,\n/**/\n 3221,\n/**/\n 3220,\n/**/\n 3219,\n/**/\n 3218,\n/**/\n 3217,\n/**/\n 3216,\n/**/\n 3215,\n/**/\n 3214,\n/**/\n 3213,\n/**/\n 3212,\n/**/\n 3211,\n/**/\n 3210,\n/**/\n 3209,\n/**/\n 3208,\n/**/\n 3207,\n/**/\n 3206,\n/**/\n 3205,\n/**/\n 3204,\n/**/\n 3203,\n/**/\n 3202,\n/**/\n 3201,\n/**/\n 3200,\n/**/\n 3199,\n/**/\n 3198,\n/**/\n 3197,\n/**/\n 3196,\n/**/\n 3195,\n/**/\n 3194,\n/**/\n 3193,\n/**/\n 3192,\n/**/\n 3191,\n/**/\n 3190,\n/**/\n 3189,\n/**/\n 3188,\n/**/\n 3187,\n/**/\n 3186,\n/**/\n 3185,\n/**/\n 3184,\n/**/\n 3183,\n/**/\n 3182,\n/**/\n 3181,\n/**/\n 3180,\n/**/\n 3179,\n/**/\n 3178,\n/**/\n 3177,\n/**/\n 3176,\n/**/\n 3175,\n/**/\n 3174,\n/**/\n 3173,\n/**/\n 3172,\n/**/\n 3171,\n/**/\n 3170,\n/**/\n 3169,\n/**/\n 3168,\n/**/\n 3167,\n/**/\n 3166,\n/**/\n 3165,\n/**/\n 3164,\n/**/\n 3163,\n/**/\n 3162,\n/**/\n 3161,\n/**/\n 3160,\n/**/\n 3159,\n/**/\n 3158,\n/**/\n 3157,\n/**/\n 3156,\n/**/\n 3155,\n/**/\n 3154,\n/**/\n 3153,\n/**/\n 3152,\n/**/\n 3151,\n/**/\n 3150,\n/**/\n 3149,\n/**/\n 3148,\n/**/\n 3147,\n/**/\n 3146,\n/**/\n 3145,\n/**/\n 3144,\n/**/\n 3143,\n/**/\n 3142,\n/**/\n 3141,\n/**/\n 3140,\n/**/\n 3139,\n/**/\n 3138,\n/**/\n 3137,\n/**/\n 3136,\n/**/\n 3135,\n/**/\n 3134,\n/**/\n 3133,\n/**/\n 3132,\n/**/\n 3131,\n/**/\n 3130,\n/**/\n 3129,\n/**/\n 3128,\n/**/\n 3127,\n/**/\n 3126,\n/**/\n 3125,\n/**/\n 3124,\n/**/\n 3123,\n/**/\n 3122,\n/**/\n 3121,\n/**/\n 3120,\n/**/\n 3119,\n/**/\n 3118,\n/**/\n 3117,\n/**/\n 3116,\n/**/\n 3115,\n/**/\n 3114,\n/**/\n 3113,\n/**/\n 3112,\n/**/\n 3111,\n/**/\n 3110,\n/**/\n 3109,\n/**/\n 3108,\n/**/\n 3107,\n/**/\n 3106,\n/**/\n 3105,\n/**/\n 3104,\n/**/\n 3103,\n/**/\n 3102,\n/**/\n 3101,\n/**/\n 3100,\n/**/\n 3099,\n/**/\n 3098,\n/**/\n 3097,\n/**/\n 3096,\n/**/\n 3095,\n/**/\n 3094,\n/**/\n 3093,\n/**/\n 3092,\n/**/\n 3091,\n/**/\n 3090,\n/**/\n 3089,\n/**/\n 3088,\n/**/\n 3087,\n/**/\n 3086,\n/**/\n 3085,\n/**/\n 3084,\n/**/\n 3083,\n/**/\n 3082,\n/**/\n 3081,\n/**/\n 3080,\n/**/\n 3079,\n/**/\n 3078,\n/**/\n 3077,\n/**/\n 3076,\n/**/\n 3075,\n/**/\n 3074,\n/**/\n 3073,\n/**/\n 3072,\n/**/\n 3071,\n/**/\n 3070,\n/**/\n 3069,\n/**/\n 3068,\n/**/\n 3067,\n/**/\n 3066,\n/**/\n 3065,\n/**/\n 3064,\n/**/\n 3063,\n/**/\n 3062,\n/**/\n 3061,\n/**/\n 3060,\n/**/\n 3059,\n/**/\n 3058,\n/**/\n 3057,\n/**/\n 3056,\n/**/\n 3055,\n/**/\n 3054,\n/**/\n 3053,\n/**/\n 3052,\n/**/\n 3051,\n/**/\n 3050,\n/**/\n 3049,\n/**/\n 3048,\n/**/\n 3047,\n/**/\n 3046,\n/**/\n 3045,\n/**/\n 3044,\n/**/\n 3043,\n/**/\n 3042,\n/**/\n 3041,\n/**/\n 3040,\n/**/\n 3039,\n/**/\n 3038,\n/**/\n 3037,\n/**/\n 3036,\n/**/\n 3035,\n/**/\n 3034,\n/**/\n 3033,\n/**/\n 3032,\n/**/\n 3031,\n/**/\n 3030,\n/**/\n 3029,\n/**/\n 3028,\n/**/\n 3027,\n/**/\n 3026,\n/**/\n 3025,\n/**/\n 3024,\n/**/\n 3023,\n/**/\n 3022,\n/**/\n 3021,\n/**/\n 3020,\n/**/\n 3019,\n/**/\n 3018,\n/**/\n 3017,\n/**/\n 3016,\n/**/\n 3015,\n/**/\n 3014,\n/**/\n 3013,\n/**/\n 3012,\n/**/\n 3011,\n/**/\n 3010,\n/**/\n 3009,\n/**/\n 3008,\n/**/\n 3007,\n/**/\n 3006,\n/**/\n 3005,\n/**/\n 3004,\n/**/\n 3003,\n/**/\n 3002,\n/**/\n 3001,\n/**/\n 3000,\n/**/\n 2999,\n/**/\n 2998,\n/**/\n 2997,\n/**/\n 2996,\n/**/\n 2995,\n/**/\n 2994,\n/**/\n 2993,\n/**/\n 2992,\n/**/\n 2991,\n/**/\n 2990,\n/**/\n 2989,\n/**/\n 2988,\n/**/\n 2987,\n/**/\n 2986,\n/**/\n 2985,\n/**/\n 2984,\n/**/\n 2983,\n/**/\n 2982,\n/**/\n 2981,\n/**/\n 2980,\n/**/\n 2979,\n/**/\n 2978,\n/**/\n 2977,\n/**/\n 2976,\n/**/\n 2975,\n/**/\n 2974,\n/**/\n 2973,\n/**/\n 2972,\n/**/\n 2971,\n/**/\n 2970,\n/**/\n 2969,\n/**/\n 2968,\n/**/\n 2967,\n/**/\n 2966,\n/**/\n 2965,\n/**/\n 2964,\n/**/\n 2963,\n/**/\n 2962,\n/**/\n 2961,\n/**/\n 2960,\n/**/\n 2959,\n/**/\n 2958,\n/**/\n 2957,\n/**/\n 2956,\n/**/\n 2955,\n/**/\n 2954,\n/**/\n 2953,\n/**/\n 2952,\n/**/\n 2951,\n/**/\n 2950,\n/**/\n 2949,\n/**/\n 2948,\n/**/\n 2947,\n/**/\n 2946,\n/**/\n 2945,\n/**/\n 2944,\n/**/\n 2943,\n/**/\n 2942,\n/**/\n 2941,\n/**/\n 2940,\n/**/\n 2939,\n/**/\n 2938,\n/**/\n 2937,\n/**/\n 2936,\n/**/\n 2935,\n/**/\n 2934,\n/**/\n 2933,\n/**/\n 2932,\n/**/\n 2931,\n/**/\n 2930,\n/**/\n 2929,\n/**/\n 2928,\n/**/\n 2927,\n/**/\n 2926,\n/**/\n 2925,\n/**/\n 2924,\n/**/\n 2923,\n/**/\n 2922,\n/**/\n 2921,\n/**/\n 2920,\n/**/\n 2919,\n/**/\n 2918,\n/**/\n 2917,\n/**/\n 2916,\n/**/\n 2915,\n/**/\n 2914,\n/**/\n 2913,\n/**/\n 2912,\n/**/\n 2911,\n/**/\n 2910,\n/**/\n 2909,\n/**/\n 2908,\n/**/\n 2907,\n/**/\n 2906,\n/**/\n 2905,\n/**/\n 2904,\n/**/\n 2903,\n/**/\n 2902,\n/**/\n 2901,\n/**/\n 2900,\n/**/\n 2899,\n/**/\n 2898,\n/**/\n 2897,\n/**/\n 2896,\n/**/\n 2895,\n/**/\n 2894,\n/**/\n 2893,\n/**/\n 2892,\n/**/\n 2891,\n/**/\n 2890,\n/**/\n 2889,\n/**/\n 2888,\n/**/\n 2887,\n/**/\n 2886,\n/**/\n 2885,\n/**/\n 2884,\n/**/\n 2883,\n/**/\n 2882,\n/**/\n 2881,\n/**/\n 2880,\n/**/\n 2879,\n/**/\n 2878,\n/**/\n 2877,\n/**/\n 2876,\n/**/\n 2875,\n/**/\n 2874,\n/**/\n 2873,\n/**/\n 2872,\n/**/\n 2871,\n/**/\n 2870,\n/**/\n 2869,\n/**/\n 2868,\n/**/\n 2867,\n/**/\n 2866,\n/**/\n 2865,\n/**/\n 2864,\n/**/\n 2863,\n/**/\n 2862,\n/**/\n 2861,\n/**/\n 2860,\n/**/\n 2859,\n/**/\n 2858,\n/**/\n 2857,\n/**/\n 2856,\n/**/\n 2855,\n/**/\n 2854,\n/**/\n 2853,\n/**/\n 2852,\n/**/\n 2851,\n/**/\n 2850,\n/**/\n 2849,\n/**/\n 2848,\n/**/\n 2847,\n/**/\n 2846,\n/**/\n 2845,\n/**/\n 2844,\n/**/\n 2843,\n/**/\n 2842,\n/**/\n 2841,\n/**/\n 2840,\n/**/\n 2839,\n/**/\n 2838,\n/**/\n 2837,\n/**/\n 2836,\n/**/\n 2835,\n/**/\n 2834,\n/**/\n 2833,\n/**/\n 2832,\n/**/\n 2831,\n/**/\n 2830,\n/**/\n 2829,\n/**/\n 2828,\n/**/\n 2827,\n/**/\n 2826,\n/**/\n 2825,\n/**/\n 2824,\n/**/\n 2823,\n/**/\n 2822,\n/**/\n 2821,\n/**/\n 2820,\n/**/\n 2819,\n/**/\n 2818,\n/**/\n 2817,\n/**/\n 2816,\n/**/\n 2815,\n/**/\n 2814,\n/**/\n 2813,\n/**/\n 2812,\n/**/\n 2811,\n/**/\n 2810,\n/**/\n 2809,\n/**/\n 2808,\n/**/\n 2807,\n/**/\n 2806,\n/**/\n 2805,\n/**/\n 2804,\n/**/\n 2803,\n/**/\n 2802,\n/**/\n 2801,\n/**/\n 2800,\n/**/\n 2799,\n/**/\n 2798,\n/**/\n 2797,\n/**/\n 2796,\n/**/\n 2795,\n/**/\n 2794,\n/**/\n 2793,\n/**/\n 2792,\n/**/\n 2791,\n/**/\n 2790,\n/**/\n 2789,\n/**/\n 2788,\n/**/\n 2787,\n/**/\n 2786,\n/**/\n 2785,\n/**/\n 2784,\n/**/\n 2783,\n/**/\n 2782,\n/**/\n 2781,\n/**/\n 2780,\n/**/\n 2779,\n/**/\n 2778,\n/**/\n 2777,\n/**/\n 2776,\n/**/\n 2775,\n/**/\n 2774,\n/**/\n 2773,\n/**/\n 2772,\n/**/\n 2771,\n/**/\n 2770,\n/**/\n 2769,\n/**/\n 2768,\n/**/\n 2767,\n/**/\n 2766,\n/**/\n 2765,\n/**/\n 2764,\n/**/\n 2763,\n/**/\n 2762,\n/**/\n 2761,\n/**/\n 2760,\n/**/\n 2759,\n/**/\n 2758,\n/**/\n 2757,\n/**/\n 2756,\n/**/\n 2755,\n/**/\n 2754,\n/**/\n 2753,\n/**/\n 2752,\n/**/\n 2751,\n/**/\n 2750,\n/**/\n 2749,\n/**/\n 2748,\n/**/\n 2747,\n/**/\n 2746,\n/**/\n 2745,\n/**/\n 2744,\n/**/\n 2743,\n/**/\n 2742,\n/**/\n 2741,\n/**/\n 2740,\n/**/\n 2739,\n/**/\n 2738,\n/**/\n 2737,\n/**/\n 2736,\n/**/\n 2735,\n/**/\n 2734,\n/**/\n 2733,\n/**/\n 2732,\n/**/\n 2731,\n/**/\n 2730,\n/**/\n 2729,\n/**/\n 2728,\n/**/\n 2727,\n/**/\n 2726,\n/**/\n 2725,\n/**/\n 2724,\n/**/\n 2723,\n/**/\n 2722,\n/**/\n 2721,\n/**/\n 2720,\n/**/\n 2719,\n/**/\n 2718,\n/**/\n 2717,\n/**/\n 2716,\n/**/\n 2715,\n/**/\n 2714,\n/**/\n 2713,\n/**/\n 2712,\n/**/\n 2711,\n/**/\n 2710,\n/**/\n 2709,\n/**/\n 2708,\n/**/\n 2707,\n/**/\n 2706,\n/**/\n 2705,\n/**/\n 2704,\n/**/\n 2703,\n/**/\n 2702,\n/**/\n 2701,\n/**/\n 2700,\n/**/\n 2699,\n/**/\n 2698,\n/**/\n 2697,\n/**/\n 2696,\n/**/\n 2695,\n/**/\n 2694,\n/**/\n 2693,\n/**/\n 2692,\n/**/\n 2691,\n/**/\n 2690,\n/**/\n 2689,\n/**/\n 2688,\n/**/\n 2687,\n/**/\n 2686,\n/**/\n 2685,\n/**/\n 2684,\n/**/\n 2683,\n/**/\n 2682,\n/**/\n 2681,\n/**/\n 2680,\n/**/\n 2679,\n/**/\n 2678,\n/**/\n 2677,\n/**/\n 2676,\n/**/\n 2675,\n/**/\n 2674,\n/**/\n 2673,\n/**/\n 2672,\n/**/\n 2671,\n/**/\n 2670,\n/**/\n 2669,\n/**/\n 2668,\n/**/\n 2667,\n/**/\n 2666,\n/**/\n 2665,\n/**/\n 2664,\n/**/\n 2663,\n/**/\n 2662,\n/**/\n 2661,\n/**/\n 2660,\n/**/\n 2659,\n/**/\n 2658,\n/**/\n 2657,\n/**/\n 2656,\n/**/\n 2655,\n/**/\n 2654,\n/**/\n 2653,\n/**/\n 2652,\n/**/\n 2651,\n/**/\n 2650,\n/**/\n 2649,\n/**/\n 2648,\n/**/\n 2647,\n/**/\n 2646,\n/**/\n 2645,\n/**/\n 2644,\n/**/\n 2643,\n/**/\n 2642,\n/**/\n 2641,\n/**/\n 2640,\n/**/\n 2639,\n/**/\n 2638,\n/**/\n 2637,\n/**/\n 2636,\n/**/\n 2635,\n/**/\n 2634,\n/**/\n 2633,\n/**/\n 2632,\n/**/\n 2631,\n/**/\n 2630,\n/**/\n 2629,\n/**/\n 2628,\n/**/\n 2627,\n/**/\n 2626,\n/**/\n 2625,\n/**/\n 2624,\n/**/\n 2623,\n/**/\n 2622,\n/**/\n 2621,\n/**/\n 2620,\n/**/\n 2619,\n/**/\n 2618,\n/**/\n 2617,\n/**/\n 2616,\n/**/\n 2615,\n/**/\n 2614,\n/**/\n 2613,\n/**/\n 2612,\n/**/\n 2611,\n/**/\n 2610,\n/**/\n 2609,\n/**/\n 2608,\n/**/\n 2607,\n/**/\n 2606,\n/**/\n 2605,\n/**/\n 2604,\n/**/\n 2603,\n/**/\n 2602,\n/**/\n 2601,\n/**/\n 2600,\n/**/\n 2599,\n/**/\n 2598,\n/**/\n 2597,\n/**/\n 2596,\n/**/\n 2595,\n/**/\n 2594,\n/**/\n 2593,\n/**/\n 2592,\n/**/\n 2591,\n/**/\n 2590,\n/**/\n 2589,\n/**/\n 2588,\n/**/\n 2587,\n/**/\n 2586,\n/**/\n 2585,\n/**/\n 2584,\n/**/\n 2583,\n/**/\n 2582,\n/**/\n 2581,\n/**/\n 2580,\n/**/\n 2579,\n/**/\n 2578,\n/**/\n 2577,\n/**/\n 2576,\n/**/\n 2575,\n/**/\n 2574,\n/**/\n 2573,\n/**/\n 2572,\n/**/\n 2571,\n/**/\n 2570,\n/**/\n 2569,\n/**/\n 2568,\n/**/\n 2567,\n/**/\n 2566,\n/**/\n 2565,\n/**/\n 2564,\n/**/\n 2563,\n/**/\n 2562,\n/**/\n 2561,\n/**/\n 2560,\n/**/\n 2559,\n/**/\n 2558,\n/**/\n 2557,\n/**/\n 2556,\n/**/\n 2555,\n/**/\n 2554,\n/**/\n 2553,\n/**/\n 2552,\n/**/\n 2551,\n/**/\n 2550,\n/**/\n 2549,\n/**/\n 2548,\n/**/\n 2547,\n/**/\n 2546,\n/**/\n 2545,\n/**/\n 2544,\n/**/\n 2543,\n/**/\n 2542,\n/**/\n 2541,\n/**/\n 2540,\n/**/\n 2539,\n/**/\n 2538,\n/**/\n 2537,\n/**/\n 2536,\n/**/\n 2535,\n/**/\n 2534,\n/**/\n 2533,\n/**/\n 2532,\n/**/\n 2531,\n/**/\n 2530,\n/**/\n 2529,\n/**/\n 2528,\n/**/\n 2527,\n/**/\n 2526,\n/**/\n 2525,\n/**/\n 2524,\n/**/\n 2523,\n/**/\n 2522,\n/**/\n 2521,\n/**/\n 2520,\n/**/\n 2519,\n/**/\n 2518,\n/**/\n 2517,\n/**/\n 2516,\n/**/\n 2515,\n/**/\n 2514,\n/**/\n 2513,\n/**/\n 2512,\n/**/\n 2511,\n/**/\n 2510,\n/**/\n 2509,\n/**/\n 2508,\n/**/\n 2507,\n/**/\n 2506,\n/**/\n 2505,\n/**/\n 2504,\n/**/\n 2503,\n/**/\n 2502,\n/**/\n 2501,\n/**/\n 2500,\n/**/\n 2499,\n/**/\n 2498,\n/**/\n 2497,\n/**/\n 2496,\n/**/\n 2495,\n/**/\n 2494,\n/**/\n 2493,\n/**/\n 2492,\n/**/\n 2491,\n/**/\n 2490,\n/**/\n 2489,\n/**/\n 2488,\n/**/\n 2487,\n/**/\n 2486,\n/**/\n 2485,\n/**/\n 2484,\n/**/\n 2483,\n/**/\n 2482,\n/**/\n 2481,\n/**/\n 2480,\n/**/\n 2479,\n/**/\n 2478,\n/**/\n 2477,\n/**/\n 2476,\n/**/\n 2475,\n/**/\n 2474,\n/**/\n 2473,\n/**/\n 2472,\n/**/\n 2471,\n/**/\n 2470,\n/**/\n 2469,\n/**/\n 2468,\n/**/\n 2467,\n/**/\n 2466,\n/**/\n 2465,\n/**/\n 2464,\n/**/\n 2463,\n/**/\n 2462,\n/**/\n 2461,\n/**/\n 2460,\n/**/\n 2459,\n/**/\n 2458,\n/**/\n 2457,\n/**/\n 2456,\n/**/\n 2455,\n/**/\n 2454,\n/**/\n 2453,\n/**/\n 2452,\n/**/\n 2451,\n/**/\n 2450,\n/**/\n 2449,\n/**/\n 2448,\n/**/\n 2447,\n/**/\n 2446,\n/**/\n 2445,\n/**/\n 2444,\n/**/\n 2443,\n/**/\n 2442,\n/**/\n 2441,\n/**/\n 2440,\n/**/\n 2439,\n/**/\n 2438,\n/**/\n 2437,\n/**/\n 2436,\n/**/\n 2435,\n/**/\n 2434,\n/**/\n 2433,\n/**/\n 2432,\n/**/\n 2431,\n/**/\n 2430,\n/**/\n 2429,\n/**/\n 2428,\n/**/\n 2427,\n/**/\n 2426,\n/**/\n 2425,\n/**/\n 2424,\n/**/\n 2423,\n/**/\n 2422,\n/**/\n 2421,\n/**/\n 2420,\n/**/\n 2419,\n/**/\n 2418,\n/**/\n 2417,\n/**/\n 2416,\n/**/\n 2415,\n/**/\n 2414,\n/**/\n 2413,\n/**/\n 2412,\n/**/\n 2411,\n/**/\n 2410,\n/**/\n 2409,\n/**/\n 2408,\n/**/\n 2407,\n/**/\n 2406,\n/**/\n 2405,\n/**/\n 2404,\n/**/\n 2403,\n/**/\n 2402,\n/**/\n 2401,\n/**/\n 2400,\n/**/\n 2399,\n/**/\n 2398,\n/**/\n 2397,\n/**/\n 2396,\n/**/\n 2395,\n/**/\n 2394,\n/**/\n 2393,\n/**/\n 2392,\n/**/\n 2391,\n/**/\n 2390,\n/**/\n 2389,\n/**/\n 2388,\n/**/\n 2387,\n/**/\n 2386,\n/**/\n 2385,\n/**/\n 2384,\n/**/\n 2383,\n/**/\n 2382,\n/**/\n 2381,\n/**/\n 2380,\n/**/\n 2379,\n/**/\n 2378,\n/**/\n 2377,\n/**/\n 2376,\n/**/\n 2375,\n/**/\n 2374,\n/**/\n 2373,\n/**/\n 2372,\n/**/\n 2371,\n/**/\n 2370,\n/**/\n 2369,\n/**/\n 2368,\n/**/\n 2367,\n/**/\n 2366,\n/**/\n 2365,\n/**/\n 2364,\n/**/\n 2363,\n/**/\n 2362,\n/**/\n 2361,\n/**/\n 2360,\n/**/\n 2359,\n/**/\n 2358,\n/**/\n 2357,\n/**/\n 2356,\n/**/\n 2355,\n/**/\n 2354,\n/**/\n 2353,\n/**/\n 2352,\n/**/\n 2351,\n/**/\n 2350,\n/**/\n 2349,\n/**/\n 2348,\n/**/\n 2347,\n/**/\n 2346,\n/**/\n 2345,\n/**/\n 2344,\n/**/\n 2343,\n/**/\n 2342,\n/**/\n 2341,\n/**/\n 2340,\n/**/\n 2339,\n/**/\n 2338,\n/**/\n 2337,\n/**/\n 2336,\n/**/\n 2335,\n/**/\n 2334,\n/**/\n 2333,\n/**/\n 2332,\n/**/\n 2331,\n/**/\n 2330,\n/**/\n 2329,\n/**/\n 2328,\n/**/\n 2327,\n/**/\n 2326,\n/**/\n 2325,\n/**/\n 2324,\n/**/\n 2323,\n/**/\n 2322,\n/**/\n 2321,\n/**/\n 2320,\n/**/\n 2319,\n/**/\n 2318,\n/**/\n 2317,\n/**/\n 2316,\n/**/\n 2315,\n/**/\n 2314,\n/**/\n 2313,\n/**/\n 2312,\n/**/\n 2311,\n/**/\n 2310,\n/**/\n 2309,\n/**/\n 2308,\n/**/\n 2307,\n/**/\n 2306,\n/**/\n 2305,\n/**/\n 2304,\n/**/\n 2303,\n/**/\n 2302,\n/**/\n 2301,\n/**/\n 2300,\n/**/\n 2299,\n/**/\n 2298,\n/**/\n 2297,\n/**/\n 2296,\n/**/\n 2295,\n/**/\n 2294,\n/**/\n 2293,\n/**/\n 2292,\n/**/\n 2291,\n/**/\n 2290,\n/**/\n 2289,\n/**/\n 2288,\n/**/\n 2287,\n/**/\n 2286,\n/**/\n 2285,\n/**/\n 2284,\n/**/\n 2283,\n/**/\n 2282,\n/**/\n 2281,\n/**/\n 2280,\n/**/\n 2279,\n/**/\n 2278,\n/**/\n 2277,\n/**/\n 2276,\n/**/\n 2275,\n/**/\n 2274,\n/**/\n 2273,\n/**/\n 2272,\n/**/\n 2271,\n/**/\n 2270,\n/**/\n 2269,\n/**/\n 2268,\n/**/\n 2267,\n/**/\n 2266,\n/**/\n 2265,\n/**/\n 2264,\n/**/\n 2263,\n/**/\n 2262,\n/**/\n 2261,\n/**/\n 2260,\n/**/\n 2259,\n/**/\n 2258,\n/**/\n 2257,\n/**/\n 2256,\n/**/\n 2255,\n/**/\n 2254,\n/**/\n 2253,\n/**/\n 2252,\n/**/\n 2251,\n/**/\n 2250,\n/**/\n 2249,\n/**/\n 2248,\n/**/\n 2247,\n/**/\n 2246,\n/**/\n 2245,\n/**/\n 2244,\n/**/\n 2243,\n/**/\n 2242,\n/**/\n 2241,\n/**/\n 2240,\n/**/\n 2239,\n/**/\n 2238,\n/**/\n 2237,\n/**/\n 2236,\n/**/\n 2235,\n/**/\n 2234,\n/**/\n 2233,\n/**/\n 2232,\n/**/\n 2231,\n/**/\n 2230,\n/**/\n 2229,\n/**/\n 2228,\n/**/\n 2227,\n/**/\n 2226,\n/**/\n 2225,\n/**/\n 2224,\n/**/\n 2223,\n/**/\n 2222,\n/**/\n 2221,\n/**/\n 2220,\n/**/\n 2219,\n/**/\n 2218,\n/**/\n 2217,\n/**/\n 2216,\n/**/\n 2215,\n/**/\n 2214,\n/**/\n 2213,\n/**/\n 2212,\n/**/\n 2211,\n/**/\n 2210,\n/**/\n 2209,\n/**/\n 2208,\n/**/\n 2207,\n/**/\n 2206,\n/**/\n 2205,\n/**/\n 2204,\n/**/\n 2203,\n/**/\n 2202,\n/**/\n 2201,\n/**/\n 2200,\n/**/\n 2199,\n/**/\n 2198,\n/**/\n 2197,\n/**/\n 2196,\n/**/\n 2195,\n/**/\n 2194,\n/**/\n 2193,\n/**/\n 2192,\n/**/\n 2191,\n/**/\n 2190,\n/**/\n 2189,\n/**/\n 2188,\n/**/\n 2187,\n/**/\n 2186,\n/**/\n 2185,\n/**/\n 2184,\n/**/\n 2183,\n/**/\n 2182,\n/**/\n 2181,\n/**/\n 2180,\n/**/\n 2179,\n/**/\n 2178,\n/**/\n 2177,\n/**/\n 2176,\n/**/\n 2175,\n/**/\n 2174,\n/**/\n 2173,\n/**/\n 2172,\n/**/\n 2171,\n/**/\n 2170,\n/**/\n 2169,\n/**/\n 2168,\n/**/\n 2167,\n/**/\n 2166,\n/**/\n 2165,\n/**/\n 2164,\n/**/\n 2163,\n/**/\n 2162,\n/**/\n 2161,\n/**/\n 2160,\n/**/\n 2159,\n/**/\n 2158,\n/**/\n 2157,\n/**/\n 2156,\n/**/\n 2155,\n/**/\n 2154,\n/**/\n 2153,\n/**/\n 2152,\n/**/\n 2151,\n/**/\n 2150,\n/**/\n 2149,\n/**/\n 2148,\n/**/\n 2147,\n/**/\n 2146,\n/**/\n 2145,\n/**/\n 2144,\n/**/\n 2143,\n/**/\n 2142,\n/**/\n 2141,\n/**/\n 2140,\n/**/\n 2139,\n/**/\n 2138,\n/**/\n 2137,\n/**/\n 2136,\n/**/\n 2135,\n/**/\n 2134,\n/**/\n 2133,\n/**/\n 2132,\n/**/\n 2131,\n/**/\n 2130,\n/**/\n 2129,\n/**/\n 2128,\n/**/\n 2127,\n/**/\n 2126,\n/**/\n 2125,\n/**/\n 2124,\n/**/\n 2123,\n/**/\n 2122,\n/**/\n 2121,\n/**/\n 2120,\n/**/\n 2119,\n/**/\n 2118,\n/**/\n 2117,\n/**/\n 2116,\n/**/\n 2115,\n/**/\n 2114,\n/**/\n 2113,\n/**/\n 2112,\n/**/\n 2111,\n/**/\n 2110,\n/**/\n 2109,\n/**/\n 2108,\n/**/\n 2107,\n/**/\n 2106,\n/**/\n 2105,\n/**/\n 2104,\n/**/\n 2103,\n/**/\n 2102,\n/**/\n 2101,\n/**/\n 2100,\n/**/\n 2099,\n/**/\n 2098,\n/**/\n 2097,\n/**/\n 2096,\n/**/\n 2095,\n/**/\n 2094,\n/**/\n 2093,\n/**/\n 2092,\n/**/\n 2091,\n/**/\n 2090,\n/**/\n 2089,\n/**/\n 2088,\n/**/\n 2087,\n/**/\n 2086,\n/**/\n 2085,\n/**/\n 2084,\n/**/\n 2083,\n/**/\n 2082,\n/**/\n 2081,\n/**/\n 2080,\n/**/\n 2079,\n/**/\n 2078,\n/**/\n 2077,\n/**/\n 2076,\n/**/\n 2075,\n/**/\n 2074,\n/**/\n 2073,\n/**/\n 2072,\n/**/\n 2071,\n/**/\n 2070,\n/**/\n 2069,\n/**/\n 2068,\n/**/\n 2067,\n/**/\n 2066,\n/**/\n 2065,\n/**/\n 2064,\n/**/\n 2063,\n/**/\n 2062,\n/**/\n 2061,\n/**/\n 2060,\n/**/\n 2059,\n/**/\n 2058,\n/**/\n 2057,\n/**/\n 2056,\n/**/\n 2055,\n/**/\n 2054,\n/**/\n 2053,\n/**/\n 2052,\n/**/\n 2051,\n/**/\n 2050,\n/**/\n 2049,\n/**/\n 2048,\n/**/\n 2047,\n/**/\n 2046,\n/**/\n 2045,\n/**/\n 2044,\n/**/\n 2043,\n/**/\n 2042,\n/**/\n 2041,\n/**/\n 2040,\n/**/\n 2039,\n/**/\n 2038,\n/**/\n 2037,\n/**/\n 2036,\n/**/\n 2035,\n/**/\n 2034,\n/**/\n 2033,\n/**/\n 2032,\n/**/\n 2031,\n/**/\n 2030,\n/**/\n 2029,\n/**/\n 2028,\n/**/\n 2027,\n/**/\n 2026,\n/**/\n 2025,\n/**/\n 2024,\n/**/\n 2023,\n/**/\n 2022,\n/**/\n 2021,\n/**/\n 2020,\n/**/\n 2019,\n/**/\n 2018,\n/**/\n 2017,\n/**/\n 2016,\n/**/\n 2015,\n/**/\n 2014,\n/**/\n 2013,\n/**/\n 2012,\n/**/\n 2011,\n/**/\n 2010,\n/**/\n 2009,\n/**/\n 2008,\n/**/\n 2007,\n/**/\n 2006,\n/**/\n 2005,\n/**/\n 2004,\n/**/\n 2003,\n/**/\n 2002,\n/**/\n 2001,\n/**/\n 2000,\n/**/\n 1999,\n/**/\n 1998,\n/**/\n 1997,\n/**/\n 1996,\n/**/\n 1995,\n/**/\n 1994,\n/**/\n 1993,\n/**/\n 1992,\n/**/\n 1991,\n/**/\n 1990,\n/**/\n 1989,\n/**/\n 1988,\n/**/\n 1987,\n/**/\n 1986,\n/**/\n 1985,\n/**/\n 1984,\n/**/\n 1983,\n/**/\n 1982,\n/**/\n 1981,\n/**/\n 1980,\n/**/\n 1979,\n/**/\n 1978,\n/**/\n 1977,\n/**/\n 1976,\n/**/\n 1975,\n/**/\n 1974,\n/**/\n 1973,\n/**/\n 1972,\n/**/\n 1971,\n/**/\n 1970,\n/**/\n 1969,\n/**/\n 1968,\n/**/\n 1967,\n/**/\n 1966,\n/**/\n 1965,\n/**/\n 1964,\n/**/\n 1963,\n/**/\n 1962,\n/**/\n 1961,\n/**/\n 1960,\n/**/\n 1959,\n/**/\n 1958,\n/**/\n 1957,\n/**/\n 1956,\n/**/\n 1955,\n/**/\n 1954,\n/**/\n 1953,\n/**/\n 1952,\n/**/\n 1951,\n/**/\n 1950,\n/**/\n 1949,\n/**/\n 1948,\n/**/\n 1947,\n/**/\n 1946,\n/**/\n 1945,\n/**/\n 1944,\n/**/\n 1943,\n/**/\n 1942,\n/**/\n 1941,\n/**/\n 1940,\n/**/\n 1939,\n/**/\n 1938,\n/**/\n 1937,\n/**/\n 1936,\n/**/\n 1935,\n/**/\n 1934,\n/**/\n 1933,\n/**/\n 1932,\n/**/\n 1931,\n/**/\n 1930,\n/**/\n 1929,\n/**/\n 1928,\n/**/\n 1927,\n/**/\n 1926,\n/**/\n 1925,\n/**/\n 1924,\n/**/\n 1923,\n/**/\n 1922,\n/**/\n 1921,\n/**/\n 1920,\n/**/\n 1919,\n/**/\n 1918,\n/**/\n 1917,\n/**/\n 1916,\n/**/\n 1915,\n/**/\n 1914,\n/**/\n 1913,\n/**/\n 1912,\n/**/\n 1911,\n/**/\n 1910,\n/**/\n 1909,\n/**/\n 1908,\n/**/\n 1907,\n/**/\n 1906,\n/**/\n 1905,\n/**/\n 1904,\n/**/\n 1903,\n/**/\n 1902,\n/**/\n 1901,\n/**/\n 1900,\n/**/\n 1899,\n/**/\n 1898,\n/**/\n 1897,\n/**/\n 1896,\n/**/\n 1895,\n/**/\n 1894,\n/**/\n 1893,\n/**/\n 1892,\n/**/\n 1891,\n/**/\n 1890,\n/**/\n 1889,\n/**/\n 1888,\n/**/\n 1887,\n/**/\n 1886,\n/**/\n 1885,\n/**/\n 1884,\n/**/\n 1883,\n/**/\n 1882,\n/**/\n 1881,\n/**/\n 1880,\n/**/\n 1879,\n/**/\n 1878,\n/**/\n 1877,\n/**/\n 1876,\n/**/\n 1875,\n/**/\n 1874,\n/**/\n 1873,\n/**/\n 1872,\n/**/\n 1871,\n/**/\n 1870,\n/**/\n 1869,\n/**/\n 1868,\n/**/\n 1867,\n/**/\n 1866,\n/**/\n 1865,\n/**/\n 1864,\n/**/\n 1863,\n/**/\n 1862,\n/**/\n 1861,\n/**/\n 1860,\n/**/\n 1859,\n/**/\n 1858,\n/**/\n 1857,\n/**/\n 1856,\n/**/\n 1855,\n/**/\n 1854,\n/**/\n 1853,\n/**/\n 1852,\n/**/\n 1851,\n/**/\n 1850,\n/**/\n 1849,\n/**/\n 1848,\n/**/\n 1847,\n/**/\n 1846,\n/**/\n 1845,\n/**/\n 1844,\n/**/\n 1843,\n/**/\n 1842,\n/**/\n 1841,\n/**/\n 1840,\n/**/\n 1839,\n/**/\n 1838,\n/**/\n 1837,\n/**/\n 1836,\n/**/\n 1835,\n/**/\n 1834,\n/**/\n 1833,\n/**/\n 1832,\n/**/\n 1831,\n/**/\n 1830,\n/**/\n 1829,\n/**/\n 1828,\n/**/\n 1827,\n/**/\n 1826,\n/**/\n 1825,\n/**/\n 1824,\n/**/\n 1823,\n/**/\n 1822,\n/**/\n 1821,\n/**/\n 1820,\n/**/\n 1819,\n/**/\n 1818,\n/**/\n 1817,\n/**/\n 1816,\n/**/\n 1815,\n/**/\n 1814,\n/**/\n 1813,\n/**/\n 1812,\n/**/\n 1811,\n/**/\n 1810,\n/**/\n 1809,\n/**/\n 1808,\n/**/\n 1807,\n/**/\n 1806,\n/**/\n 1805,\n/**/\n 1804,\n/**/\n 1803,\n/**/\n 1802,\n/**/\n 1801,\n/**/\n 1800,\n/**/\n 1799,\n/**/\n 1798,\n/**/\n 1797,\n/**/\n 1796,\n/**/\n 1795,\n/**/\n 1794,\n/**/\n 1793,\n/**/\n 1792,\n/**/\n 1791,\n/**/\n 1790,\n/**/\n 1789,\n/**/\n 1788,\n/**/\n 1787,\n/**/\n 1786,\n/**/\n 1785,\n/**/\n 1784,\n/**/\n 1783,\n/**/\n 1782,\n/**/\n 1781,\n/**/\n 1780,\n/**/\n 1779,\n/**/\n 1778,\n/**/\n 1777,\n/**/\n 1776,\n/**/\n 1775,\n/**/\n 1774,\n/**/\n 1773,\n/**/\n 1772,\n/**/\n 1771,\n/**/\n 1770,\n/**/\n 1769,\n/**/\n 1768,\n/**/\n 1767,\n/**/\n 1766,\n/**/\n 1765,\n/**/\n 1764,\n/**/\n 1763,\n/**/\n 1762,\n/**/\n 1761,\n/**/\n 1760,\n/**/\n 1759,\n/**/\n 1758,\n/**/\n 1757,\n/**/\n 1756,\n/**/\n 1755,\n/**/\n 1754,\n/**/\n 1753,\n/**/\n 1752,\n/**/\n 1751,\n/**/\n 1750,\n/**/\n 1749,\n/**/\n 1748,\n/**/\n 1747,\n/**/\n 1746,\n/**/\n 1745,\n/**/\n 1744,\n/**/\n 1743,\n/**/\n 1742,\n/**/\n 1741,\n/**/\n 1740,\n/**/\n 1739,\n/**/\n 1738,\n/**/\n 1737,\n/**/\n 1736,\n/**/\n 1735,\n/**/\n 1734,\n/**/\n 1733,\n/**/\n 1732,\n/**/\n 1731,\n/**/\n 1730,\n/**/\n 1729,\n/**/\n 1728,\n/**/\n 1727,\n/**/\n 1726,\n/**/\n 1725,\n/**/\n 1724,\n/**/\n 1723,\n/**/\n 1722,\n/**/\n 1721,\n/**/\n 1720,\n/**/\n 1719,\n/**/\n 1718,\n/**/\n 1717,\n/**/\n 1716,\n/**/\n 1715,\n/**/\n 1714,\n/**/\n 1713,\n/**/\n 1712,\n/**/\n 1711,\n/**/\n 1710,\n/**/\n 1709,\n/**/\n 1708,\n/**/\n 1707,\n/**/\n 1706,\n/**/\n 1705,\n/**/\n 1704,\n/**/\n 1703,\n/**/\n 1702,\n/**/\n 1701,\n/**/\n 1700,\n/**/\n 1699,\n/**/\n 1698,\n/**/\n 1697,\n/**/\n 1696,\n/**/\n 1695,\n/**/\n 1694,\n/**/\n 1693,\n/**/\n 1692,\n/**/\n 1691,\n/**/\n 1690,\n/**/\n 1689,\n/**/\n 1688,\n/**/\n 1687,\n/**/\n 1686,\n/**/\n 1685,\n/**/\n 1684,\n/**/\n 1683,\n/**/\n 1682,\n/**/\n 1681,\n/**/\n 1680,\n/**/\n 1679,\n/**/\n 1678,\n/**/\n 1677,\n/**/\n 1676,\n/**/\n 1675,\n/**/\n 1674,\n/**/\n 1673,\n/**/\n 1672,\n/**/\n 1671,\n/**/\n 1670,\n/**/\n 1669,\n/**/\n 1668,\n/**/\n 1667,\n/**/\n 1666,\n/**/\n 1665,\n/**/\n 1664,\n/**/\n 1663,\n/**/\n 1662,\n/**/\n 1661,\n/**/\n 1660,\n/**/\n 1659,\n/**/\n 1658,\n/**/\n 1657,\n/**/\n 1656,\n/**/\n 1655,\n/**/\n 1654,\n/**/\n 1653,\n/**/\n 1652,\n/**/\n 1651,\n/**/\n 1650,\n/**/\n 1649,\n/**/\n 1648,\n/**/\n 1647,\n/**/\n 1646,\n/**/\n 1645,\n/**/\n 1644,\n/**/\n 1643,\n/**/\n 1642,\n/**/\n 1641,\n/**/\n 1640,\n/**/\n 1639,\n/**/\n 1638,\n/**/\n 1637,\n/**/\n 1636,\n/**/\n 1635,\n/**/\n 1634,\n/**/\n 1633,\n/**/\n 1632,\n/**/\n 1631,\n/**/\n 1630,\n/**/\n 1629,\n/**/\n 1628,\n/**/\n 1627,\n/**/\n 1626,\n/**/\n 1625,\n/**/\n 1624,\n/**/\n 1623,\n/**/\n 1622,\n/**/\n 1621,\n/**/\n 1620,\n/**/\n 1619,\n/**/\n 1618,\n/**/\n 1617,\n/**/\n 1616,\n/**/\n 1615,\n/**/\n 1614,\n/**/\n 1613,\n/**/\n 1612,\n/**/\n 1611,\n/**/\n 1610,\n/**/\n 1609,\n/**/\n 1608,\n/**/\n 1607,\n/**/\n 1606,\n/**/\n 1605,\n/**/\n 1604,\n/**/\n 1603,\n/**/\n 1602,\n/**/\n 1601,\n/**/\n 1600,\n/**/\n 1599,\n/**/\n 1598,\n/**/\n 1597,\n/**/\n 1596,\n/**/\n 1595,\n/**/\n 1594,\n/**/\n 1593,\n/**/\n 1592,\n/**/\n 1591,\n/**/\n 1590,\n/**/\n 1589,\n/**/\n 1588,\n/**/\n 1587,\n/**/\n 1586,\n/**/\n 1585,\n/**/\n 1584,\n/**/\n 1583,\n/**/\n 1582,\n/**/\n 1581,\n/**/\n 1580,\n/**/\n 1579,\n/**/\n 1578,\n/**/\n 1577,\n/**/\n 1576,\n/**/\n 1575,\n/**/\n 1574,\n/**/\n 1573,\n/**/\n 1572,\n/**/\n 1571,\n/**/\n 1570,\n/**/\n 1569,\n/**/\n 1568,\n/**/\n 1567,\n/**/\n 1566,\n/**/\n 1565,\n/**/\n 1564,\n/**/\n 1563,\n/**/\n 1562,\n/**/\n 1561,\n/**/\n 1560,\n/**/\n 1559,\n/**/\n 1558,\n/**/\n 1557,\n/**/\n 1556,\n/**/\n 1555,\n/**/\n 1554,\n/**/\n 1553,\n/**/\n 1552,\n/**/\n 1551,\n/**/\n 1550,\n/**/\n 1549,\n/**/\n 1548,\n/**/\n 1547,\n/**/\n 1546,\n/**/\n 1545,\n/**/\n 1544,\n/**/\n 1543,\n/**/\n 1542,\n/**/\n 1541,\n/**/\n 1540,\n/**/\n 1539,\n/**/\n 1538,\n/**/\n 1537,\n/**/\n 1536,\n/**/\n 1535,\n/**/\n 1534,\n/**/\n 1533,\n/**/\n 1532,\n/**/\n 1531,\n/**/\n 1530,\n/**/\n 1529,\n/**/\n 1528,\n/**/\n 1527,\n/**/\n 1526,\n/**/\n 1525,\n/**/\n 1524,\n/**/\n 1523,\n/**/\n 1522,\n/**/\n 1521,\n/**/\n 1520,\n/**/\n 1519,\n/**/\n 1518,\n/**/\n 1517,\n/**/\n 1516,\n/**/\n 1515,\n/**/\n 1514,\n/**/\n 1513,\n/**/\n 1512,\n/**/\n 1511,\n/**/\n 1510,\n/**/\n 1509,\n/**/\n 1508,\n/**/\n 1507,\n/**/\n 1506,\n/**/\n 1505,\n/**/\n 1504,\n/**/\n 1503,\n/**/\n 1502,\n/**/\n 1501,\n/**/\n 1500,\n/**/\n 1499,\n/**/\n 1498,\n/**/\n 1497,\n/**/\n 1496,\n/**/\n 1495,\n/**/\n 1494,\n/**/\n 1493,\n/**/\n 1492,\n/**/\n 1491,\n/**/\n 1490,\n/**/\n 1489,\n/**/\n 1488,\n/**/\n 1487,\n/**/\n 1486,\n/**/\n 1485,\n/**/\n 1484,\n/**/\n 1483,\n/**/\n 1482,\n/**/\n 1481,\n/**/\n 1480,\n/**/\n 1479,\n/**/\n 1478,\n/**/\n 1477,\n/**/\n 1476,\n/**/\n 1475,\n/**/\n 1474,\n/**/\n 1473,\n/**/\n 1472,\n/**/\n 1471,\n/**/\n 1470,\n/**/\n 1469,\n/**/\n 1468,\n/**/\n 1467,\n/**/\n 1466,\n/**/\n 1465,\n/**/\n 1464,\n/**/\n 1463,\n/**/\n 1462,\n/**/\n 1461,\n/**/\n 1460,\n/**/\n 1459,\n/**/\n 1458,\n/**/\n 1457,\n/**/\n 1456,\n/**/\n 1455,\n/**/\n 1454,\n/**/\n 1453,\n/**/\n 1452,\n/**/\n 1451,\n/**/\n 1450,\n/**/\n 1449,\n/**/\n 1448,\n/**/\n 1447,\n/**/\n 1446,\n/**/\n 1445,\n/**/\n 1444,\n/**/\n 1443,\n/**/\n 1442,\n/**/\n 1441,\n/**/\n 1440,\n/**/\n 1439,\n/**/\n 1438,\n/**/\n 1437,\n/**/\n 1436,\n/**/\n 1435,\n/**/\n 1434,\n/**/\n 1433,\n/**/\n 1432,\n/**/\n 1431,\n/**/\n 1430,\n/**/\n 1429,\n/**/\n 1428,\n/**/\n 1427,\n/**/\n 1426,\n/**/\n 1425,\n/**/\n 1424,\n/**/\n 1423,\n/**/\n 1422,\n/**/\n 1421,\n/**/\n 1420,\n/**/\n 1419,\n/**/\n 1418,\n/**/\n 1417,\n/**/\n 1416,\n/**/\n 1415,\n/**/\n 1414,\n/**/\n 1413,\n/**/\n 1412,\n/**/\n 1411,\n/**/\n 1410,\n/**/\n 1409,\n/**/\n 1408,\n/**/\n 1407,\n/**/\n 1406,\n/**/\n 1405,\n/**/\n 1404,\n/**/\n 1403,\n/**/\n 1402,\n/**/\n 1401,\n/**/\n 1400,\n/**/\n 1399,\n/**/\n 1398,\n/**/\n 1397,\n/**/\n 1396,\n/**/\n 1395,\n/**/\n 1394,\n/**/\n 1393,\n/**/\n 1392,\n/**/\n 1391,\n/**/\n 1390,\n/**/\n 1389,\n/**/\n 1388,\n/**/\n 1387,\n/**/\n 1386,\n/**/\n 1385,\n/**/\n 1384,\n/**/\n 1383,\n/**/\n 1382,\n/**/\n 1381,\n/**/\n 1380,\n/**/\n 1379,\n/**/\n 1378,\n/**/\n 1377,\n/**/\n 1376,\n/**/\n 1375,\n/**/\n 1374,\n/**/\n 1373,\n/**/\n 1372,\n/**/\n 1371,\n/**/\n 1370,\n/**/\n 1369,\n/**/\n 1368,\n/**/\n 1367,\n/**/\n 1366,\n/**/\n 1365,\n/**/\n 1364,\n/**/\n 1363,\n/**/\n 1362,\n/**/\n 1361,\n/**/\n 1360,\n/**/\n 1359,\n/**/\n 1358,\n/**/\n 1357,\n/**/\n 1356,\n/**/\n 1355,\n/**/\n 1354,\n/**/\n 1353,\n/**/\n 1352,\n/**/\n 1351,\n/**/\n 1350,\n/**/\n 1349,\n/**/\n 1348,\n/**/\n 1347,\n/**/\n 1346,\n/**/\n 1345,\n/**/\n 1344,\n/**/\n 1343,\n/**/\n 1342,\n/**/\n 1341,\n/**/\n 1340,\n/**/\n 1339,\n/**/\n 1338,\n/**/\n 1337,\n/**/\n 1336,\n/**/\n 1335,\n/**/\n 1334,\n/**/\n 1333,\n/**/\n 1332,\n/**/\n 1331,\n/**/\n 1330,\n/**/\n 1329,\n/**/\n 1328,\n/**/\n 1327,\n/**/\n 1326,\n/**/\n 1325,\n/**/\n 1324,\n/**/\n 1323,\n/**/\n 1322,\n/**/\n 1321,\n/**/\n 1320,\n/**/\n 1319,\n/**/\n 1318,\n/**/\n 1317,\n/**/\n 1316,\n/**/\n 1315,\n/**/\n 1314,\n/**/\n 1313,\n/**/\n 1312,\n/**/\n 1311,\n/**/\n 1310,\n/**/\n 1309,\n/**/\n 1308,\n/**/\n 1307,\n/**/\n 1306,\n/**/\n 1305,\n/**/\n 1304,\n/**/\n 1303,\n/**/\n 1302,\n/**/\n 1301,\n/**/\n 1300,\n/**/\n 1299,\n/**/\n 1298,\n/**/\n 1297,\n/**/\n 1296,\n/**/\n 1295,\n/**/\n 1294,\n/**/\n 1293,\n/**/\n 1292,\n/**/\n 1291,\n/**/\n 1290,\n/**/\n 1289,\n/**/\n 1288,\n/**/\n 1287,\n/**/\n 1286,\n/**/\n 1285,\n/**/\n 1284,\n/**/\n 1283,\n/**/\n 1282,\n/**/\n 1281,\n/**/\n 1280,\n/**/\n 1279,\n/**/\n 1278,\n/**/\n 1277,\n/**/\n 1276,\n/**/\n 1275,\n/**/\n 1274,\n/**/\n 1273,\n/**/\n 1272,\n/**/\n 1271,\n/**/\n 1270,\n/**/\n 1269,\n/**/\n 1268,\n/**/\n 1267,\n/**/\n 1266,\n/**/\n 1265,\n/**/\n 1264,\n/**/\n 1263,\n/**/\n 1262,\n/**/\n 1261,\n/**/\n 1260,\n/**/\n 1259,\n/**/\n 1258,\n/**/\n 1257,\n/**/\n 1256,\n/**/\n 1255,\n/**/\n 1254,\n/**/\n 1253,\n/**/\n 1252,\n/**/\n 1251,\n/**/\n 1250,\n/**/\n 1249,\n/**/\n 1248,\n/**/\n 1247,\n/**/\n 1246,\n/**/\n 1245,\n/**/\n 1244,\n/**/\n 1243,\n/**/\n 1242,\n/**/\n 1241,\n/**/\n 1240,\n/**/\n 1239,\n/**/\n 1238,\n/**/\n 1237,\n/**/\n 1236,\n/**/\n 1235,\n/**/\n 1234,\n/**/\n 1233,\n/**/\n 1232,\n/**/\n 1231,\n/**/\n 1230,\n/**/\n 1229,\n/**/\n 1228,\n/**/\n 1227,\n/**/\n 1226,\n/**/\n 1225,\n/**/\n 1224,\n/**/\n 1223,\n/**/\n 1222,\n/**/\n 1221,\n/**/\n 1220,\n/**/\n 1219,\n/**/\n 1218,\n/**/\n 1217,\n/**/\n 1216,\n/**/\n 1215,\n/**/\n 1214,\n/**/\n 1213,\n/**/\n 1212,\n/**/\n 1211,\n/**/\n 1210,\n/**/\n 1209,\n/**/\n 1208,\n/**/\n 1207,\n/**/\n 1206,\n/**/\n 1205,\n/**/\n 1204,\n/**/\n 1203,\n/**/\n 1202,\n/**/\n 1201,\n/**/\n 1200,\n/**/\n 1199,\n/**/\n 1198,\n/**/\n 1197,\n/**/\n 1196,\n/**/\n 1195,\n/**/\n 1194,\n/**/\n 1193,\n/**/\n 1192,\n/**/\n 1191,\n/**/\n 1190,\n/**/\n 1189,\n/**/\n 1188,\n/**/\n 1187,\n/**/\n 1186,\n/**/\n 1185,\n/**/\n 1184,\n/**/\n 1183,\n/**/\n 1182,\n/**/\n 1181,\n/**/\n 1180,\n/**/\n 1179,\n/**/\n 1178,\n/**/\n 1177,\n/**/\n 1176,\n/**/\n 1175,\n/**/\n 1174,\n/**/\n 1173,\n/**/\n 1172,\n/**/\n 1171,\n/**/\n 1170,\n/**/\n 1169,\n/**/\n 1168,\n/**/\n 1167,\n/**/\n 1166,\n/**/\n 1165,\n/**/\n 1164,\n/**/\n 1163,\n/**/\n 1162,\n/**/\n 1161,\n/**/\n 1160,\n/**/\n 1159,\n/**/\n 1158,\n/**/\n 1157,\n/**/\n 1156,\n/**/\n 1155,\n/**/\n 1154,\n/**/\n 1153,\n/**/\n 1152,\n/**/\n 1151,\n/**/\n 1150,\n/**/\n 1149,\n/**/\n 1148,\n/**/\n 1147,\n/**/\n 1146,\n/**/\n 1145,\n/**/\n 1144,\n/**/\n 1143,\n/**/\n 1142,\n/**/\n 1141,\n/**/\n 1140,\n/**/\n 1139,\n/**/\n 1138,\n/**/\n 1137,\n/**/\n 1136,\n/**/\n 1135,\n/**/\n 1134,\n/**/\n 1133,\n/**/\n 1132,\n/**/\n 1131,\n/**/\n 1130,\n/**/\n 1129,\n/**/\n 1128,\n/**/\n 1127,\n/**/\n 1126,\n/**/\n 1125,\n/**/\n 1124,\n/**/\n 1123,\n/**/\n 1122,\n/**/\n 1121,\n/**/\n 1120,\n/**/\n 1119,\n/**/\n 1118,\n/**/\n 1117,\n/**/\n 1116,\n/**/\n 1115,\n/**/\n 1114,\n/**/\n 1113,\n/**/\n 1112,\n/**/\n 1111,\n/**/\n 1110,\n/**/\n 1109,\n/**/\n 1108,\n/**/\n 1107,\n/**/\n 1106,\n/**/\n 1105,\n/**/\n 1104,\n/**/\n 1103,\n/**/\n 1102,\n/**/\n 1101,\n/**/\n 1100,\n/**/\n 1099,\n/**/\n 1098,\n/**/\n 1097,\n/**/\n 1096,\n/**/\n 1095,\n/**/\n 1094,\n/**/\n 1093,\n/**/\n 1092,\n/**/\n 1091,\n/**/\n 1090,\n/**/\n 1089,\n/**/\n 1088,\n/**/\n 1087,\n/**/\n 1086,\n/**/\n 1085,\n/**/\n 1084,\n/**/\n 1083,\n/**/\n 1082,\n/**/\n 1081,\n/**/\n 1080,\n/**/\n 1079,\n/**/\n 1078,\n/**/\n 1077,\n/**/\n 1076,\n/**/\n 1075,\n/**/\n 1074,\n/**/\n 1073,\n/**/\n 1072,\n/**/\n 1071,\n/**/\n 1070,\n/**/\n 1069,\n/**/\n 1068,\n/**/\n 1067,\n/**/\n 1066,\n/**/\n 1065,\n/**/\n 1064,\n/**/\n 1063,\n/**/\n 1062,\n/**/\n 1061,\n/**/\n 1060,\n/**/\n 1059,\n/**/\n 1058,\n/**/\n 1057,\n/**/\n 1056,\n/**/\n 1055,\n/**/\n 1054,\n/**/\n 1053,\n/**/\n 1052,\n/**/\n 1051,\n/**/\n 1050,\n/**/\n 1049,\n/**/\n 1048,\n/**/\n 1047,\n/**/\n 1046,\n/**/\n 1045,\n/**/\n 1044,\n/**/\n 1043,\n/**/\n 1042,\n/**/\n 1041,\n/**/\n 1040,\n/**/\n 1039,\n/**/\n 1038,\n/**/\n 1037,\n/**/\n 1036,\n/**/\n 1035,\n/**/\n 1034,\n/**/\n 1033,\n/**/\n 1032,\n/**/\n 1031,\n/**/\n 1030,\n/**/\n 1029,\n/**/\n 1028,\n/**/\n 1027,\n/**/\n 1026,\n/**/\n 1025,\n/**/\n 1024,\n/**/\n 1023,\n/**/\n 1022,\n/**/\n 1021,\n/**/\n 1020,\n/**/\n 1019,\n/**/\n 1018,\n/**/\n 1017,\n/**/\n 1016,\n/**/\n 1015,\n/**/\n 1014,\n/**/\n 1013,\n/**/\n 1012,\n/**/\n 1011,\n/**/\n 1010,\n/**/\n 1009,\n/**/\n 1008,\n/**/\n 1007,\n/**/\n 1006,\n/**/\n 1005,\n/**/\n 1004,\n/**/\n 1003,\n/**/\n 1002,\n/**/\n 1001,\n/**/\n 1000,\n/**/\n 999,\n/**/\n 998,\n/**/\n 997,\n/**/\n 996,\n/**/\n 995,\n/**/\n 994,\n/**/\n 993,\n/**/\n 992,\n/**/\n 991,\n/**/\n 990,\n/**/\n 989,\n/**/\n 988,\n/**/\n 987,\n/**/\n 986,\n/**/\n 985,\n/**/\n 984,\n/**/\n 983,\n/**/\n 982,\n/**/\n 981,\n/**/\n 980,\n/**/\n 979,\n/**/\n 978,\n/**/\n 977,\n/**/\n 976,\n/**/\n 975,\n/**/\n 974,\n/**/\n 973,\n/**/\n 972,\n/**/\n 971,\n/**/\n 970,\n/**/\n 969,\n/**/\n 968,\n/**/\n 967,\n/**/\n 966,\n/**/\n 965,\n/**/\n 964,\n/**/\n 963,\n/**/\n 962,\n/**/\n 961,\n/**/\n 960,\n/**/\n 959,\n/**/\n 958,\n/**/\n 957,\n/**/\n 956,\n/**/\n 955,\n/**/\n 954,\n/**/\n 953,\n/**/\n 952,\n/**/\n 951,\n/**/\n 950,\n/**/\n 949,\n/**/\n 948,\n/**/\n 947,\n/**/\n 946,\n/**/\n 945,\n/**/\n 944,\n/**/\n 943,\n/**/\n 942,\n/**/\n 941,\n/**/\n 940,\n/**/\n 939,\n/**/\n 938,\n/**/\n 937,\n/**/\n 936,\n/**/\n 935,\n/**/\n 934,\n/**/\n 933,\n/**/\n 932,\n/**/\n 931,\n/**/\n 930,\n/**/\n 929,\n/**/\n 928,\n/**/\n 927,\n/**/\n 926,\n/**/\n 925,\n/**/\n 924,\n/**/\n 923,\n/**/\n 922,\n/**/\n 921,\n/**/\n 920,\n/**/\n 919,\n/**/\n 918,\n/**/\n 917,\n/**/\n 916,\n/**/\n 915,\n/**/\n 914,\n/**/\n 913,\n/**/\n 912,\n/**/\n 911,\n/**/\n 910,\n/**/\n 909,\n/**/\n 908,\n/**/\n 907,\n/**/\n 906,\n/**/\n 905,\n/**/\n 904,\n/**/\n 903,\n/**/\n 902,\n/**/\n 901,\n/**/\n 900,\n/**/\n 899,\n/**/\n 898,\n/**/\n 897,\n/**/\n 896,\n/**/\n 895,\n/**/\n 894,\n/**/\n 893,\n/**/\n 892,\n/**/\n 891,\n/**/\n 890,\n/**/\n 889,\n/**/\n 888,\n/**/\n 887,\n/**/\n 886,\n/**/\n 885,\n/**/\n 884,\n/**/\n 883,\n/**/\n 882,\n/**/\n 881,\n/**/\n 880,\n/**/\n 879,\n/**/\n 878,\n/**/\n 877,\n/**/\n 876,\n/**/\n 875,\n/**/\n 874,\n/**/\n 873,\n/**/\n 872,\n/**/\n 871,\n/**/\n 870,\n/**/\n 869,\n/**/\n 868,\n/**/\n 867,\n/**/\n 866,\n/**/\n 865,\n/**/\n 864,\n/**/\n 863,\n/**/\n 862,\n/**/\n 861,\n/**/\n 860,\n/**/\n 859,\n/**/\n 858,\n/**/\n 857,\n/**/\n 856,\n/**/\n 855,\n/**/\n 854,\n/**/\n 853,\n/**/\n 852,\n/**/\n 851,\n/**/\n 850,\n/**/\n 849,\n/**/\n 848,\n/**/\n 847,\n/**/\n 846,\n/**/\n 845,\n/**/\n 844,\n/**/\n 843,\n/**/\n 842,\n/**/\n 841,\n/**/\n 840,\n/**/\n 839,\n/**/\n 838,\n/**/\n 837,\n/**/\n 836,\n/**/\n 835,\n/**/\n 834,\n/**/\n 833,\n/**/\n 832,\n/**/\n 831,\n/**/\n 830,\n/**/\n 829,\n/**/\n 828,\n/**/\n 827,\n/**/\n 826,\n/**/\n 825,\n/**/\n 824,\n/**/\n 823,\n/**/\n 822,\n/**/\n 821,\n/**/\n 820,\n/**/\n 819,\n/**/\n 818,\n/**/\n 817,\n/**/\n 816,\n/**/\n 815,\n/**/\n 814,\n/**/\n 813,\n/**/\n 812,\n/**/\n 811,\n/**/\n 810,\n/**/\n 809,\n/**/\n 808,\n/**/\n 807,\n/**/\n 806,\n/**/\n 805,\n/**/\n 804,\n/**/\n 803,\n/**/\n 802,\n/**/\n 801,\n/**/\n 800,\n/**/\n 799,\n/**/\n 798,\n/**/\n 797,\n/**/\n 796,\n/**/\n 795,\n/**/\n 794,\n/**/\n 793,\n/**/\n 792,\n/**/\n 791,\n/**/\n 790,\n/**/\n 789,\n/**/\n 788,\n/**/\n 787,\n/**/\n 786,\n/**/\n 785,\n/**/\n 784,\n/**/\n 783,\n/**/\n 782,\n/**/\n 781,\n/**/\n 780,\n/**/\n 779,\n/**/\n 778,\n/**/\n 777,\n/**/\n 776,\n/**/\n 775,\n/**/\n 774,\n/**/\n 773,\n/**/\n 772,\n/**/\n 771,\n/**/\n 770,\n/**/\n 769,\n/**/\n 768,\n/**/\n 767,\n/**/\n 766,\n/**/\n 765,\n/**/\n 764,\n/**/\n 763,\n/**/\n 762,\n/**/\n 761,\n/**/\n 760,\n/**/\n 759,\n/**/\n 758,\n/**/\n 757,\n/**/\n 756,\n/**/\n 755,\n/**/\n 754,\n/**/\n 753,\n/**/\n 752,\n/**/\n 751,\n/**/\n 750,\n/**/\n 749,\n/**/\n 748,\n/**/\n 747,\n/**/\n 746,\n/**/\n 745,\n/**/\n 744,\n/**/\n 743,\n/**/\n 742,\n/**/\n 741,\n/**/\n 740,\n/**/\n 739,\n/**/\n 738,\n/**/\n 737,\n/**/\n 736,\n/**/\n 735,\n/**/\n 734,\n/**/\n 733,\n/**/\n 732,\n/**/\n 731,\n/**/\n 730,\n/**/\n 729,\n/**/\n 728,\n/**/\n 727,\n/**/\n 726,\n/**/\n 725,\n/**/\n 724,\n/**/\n 723,\n/**/\n 722,\n/**/\n 721,\n/**/\n 720,\n/**/\n 719,\n/**/\n 718,\n/**/\n 717,\n/**/\n 716,\n/**/\n 715,\n/**/\n 714,\n/**/\n 713,\n/**/\n 712,\n/**/\n 711,\n/**/\n 710,\n/**/\n 709,\n/**/\n 708,\n/**/\n 707,\n/**/\n 706,\n/**/\n 705,\n/**/\n 704,\n/**/\n 703,\n/**/\n 702,\n/**/\n 701,\n/**/\n 700,\n/**/\n 699,\n/**/\n 698,\n/**/\n 697,\n/**/\n 696,\n/**/\n 695,\n/**/\n 694,\n/**/\n 693,\n/**/\n 692,\n/**/\n 691,\n/**/\n 690,\n/**/\n 689,\n/**/\n 688,\n/**/\n 687,\n/**/\n 686,\n/**/\n 685,\n/**/\n 684,\n/**/\n 683,\n/**/\n 682,\n/**/\n 681,\n/**/\n 680,\n/**/\n 679,\n/**/\n 678,\n/**/\n 677,\n/**/\n 676,\n/**/\n 675,\n/**/\n 674,\n/**/\n 673,\n/**/\n 672,\n/**/\n 671,\n/**/\n 670,\n/**/\n 669,\n/**/\n 668,\n/**/\n 667,\n/**/\n 666,\n/**/\n 665,\n/**/\n 664,\n/**/\n 663,\n/**/\n 662,\n/**/\n 661,\n/**/\n 660,\n/**/\n 659,\n/**/\n 658,\n/**/\n 657,\n/**/\n 656,\n/**/\n 655,\n/**/\n 654,\n/**/\n 653,\n/**/\n 652,\n/**/\n 651,\n/**/\n 650,\n/**/\n 649,\n/**/\n 648,\n/**/\n 647,\n/**/\n 646,\n/**/\n 645,\n/**/\n 644,\n/**/\n 643,\n/**/\n 642,\n/**/\n 641,\n/**/\n 640,\n/**/\n 639,\n/**/\n 638,\n/**/\n 637,\n/**/\n 636,\n/**/\n 635,\n/**/\n 634,\n/**/\n 633,\n/**/\n 632,\n/**/\n 631,\n/**/\n 630,\n/**/\n 629,\n/**/\n 628,\n/**/\n 627,\n/**/\n 626,\n/**/\n 625,\n/**/\n 624,\n/**/\n 623,\n/**/\n 622,\n/**/\n 621,\n/**/\n 620,\n/**/\n 619,\n/**/\n 618,\n/**/\n 617,\n/**/\n 616,\n/**/\n 615,\n/**/\n 614,\n/**/\n 613,\n/**/\n 612,\n/**/\n 611,\n/**/\n 610,\n/**/\n 609,\n/**/\n 608,\n/**/\n 607,\n/**/\n 606,\n/**/\n 605,\n/**/\n 604,\n/**/\n 603,\n/**/\n 602,\n/**/\n 601,\n/**/\n 600,\n/**/\n 599,\n/**/\n 598,\n/**/\n 597,\n/**/\n 596,\n/**/\n 595,\n/**/\n 594,\n/**/\n 593,\n/**/\n 592,\n/**/\n 591,\n/**/\n 590,\n/**/\n 589,\n/**/\n 588,\n/**/\n 587,\n/**/\n 586,\n/**/\n 585,\n/**/\n 584,\n/**/\n 583,\n/**/\n 582,\n/**/\n 581,\n/**/\n 580,\n/**/\n 579,\n/**/\n 578,\n/**/\n 577,\n/**/\n 576,\n/**/\n 575,\n/**/\n 574,\n/**/\n 573,\n/**/\n 572,\n/**/\n 571,\n/**/\n 570,\n/**/\n 569,\n/**/\n 568,\n/**/\n 567,\n/**/\n 566,\n/**/\n 565,\n/**/\n 564,\n/**/\n 563,\n/**/\n 562,\n/**/\n 561,\n/**/\n 560,\n/**/\n 559,\n/**/\n 558,\n/**/\n 557,\n/**/\n 556,\n/**/\n 555,\n/**/\n 554,\n/**/\n 553,\n/**/\n 552,\n/**/\n 551,\n/**/\n 550,\n/**/\n 549,\n/**/\n 548,\n/**/\n 547,\n/**/\n 546,\n/**/\n 545,\n/**/\n 544,\n/**/\n 543,\n/**/\n 542,\n/**/\n 541,\n/**/\n 540,\n/**/\n 539,\n/**/\n 538,\n/**/\n 537,\n/**/\n 536,\n/**/\n 535,\n/**/\n 534,\n/**/\n 533,\n/**/\n 532,\n/**/\n 531,\n/**/\n 530,\n/**/\n 529,\n/**/\n 528,\n/**/\n 527,\n/**/\n 526,\n/**/\n 525,\n/**/\n 524,\n/**/\n 523,\n/**/\n 522,\n/**/\n 521,\n/**/\n 520,\n/**/\n 519,\n/**/\n 518,\n/**/\n 517,\n/**/\n 516,\n/**/\n 515,\n/**/\n 514,\n/**/\n 513,\n/**/\n 512,\n/**/\n 511,\n/**/\n 510,\n/**/\n 509,\n/**/\n 508,\n/**/\n 507,\n/**/\n 506,\n/**/\n 505,\n/**/\n 504,\n/**/\n 503,\n/**/\n 502,\n/**/\n 501,\n/**/\n 500,\n/**/\n 499,\n/**/\n 498,\n/**/\n 497,\n/**/\n 496,\n/**/\n 495,\n/**/\n 494,\n/**/\n 493,\n/**/\n 492,\n/**/\n 491,\n/**/\n 490,\n/**/\n 489,\n/**/\n 488,\n/**/\n 487,\n/**/\n 486,\n/**/\n 485,\n/**/\n 484,\n/**/\n 483,\n/**/\n 482,\n/**/\n 481,\n/**/\n 480,\n/**/\n 479,\n/**/\n 478,\n/**/\n 477,\n/**/\n 476,\n/**/\n 475,\n/**/\n 474,\n/**/\n 473,\n/**/\n 472,\n/**/\n 471,\n/**/\n 470,\n/**/\n 469,\n/**/\n 468,\n/**/\n 467,\n/**/\n 466,\n/**/\n 465,\n/**/\n 464,\n/**/\n 463,\n/**/\n 462,\n/**/\n 461,\n/**/\n 460,\n/**/\n 459,\n/**/\n 458,\n/**/\n 457,\n/**/\n 456,\n/**/\n 455,\n/**/\n 454,\n/**/\n 453,\n/**/\n 452,\n/**/\n 451,\n/**/\n 450,\n/**/\n 449,\n/**/\n 448,\n/**/\n 447,\n/**/\n 446,\n/**/\n 445,\n/**/\n 444,\n/**/\n 443,\n/**/\n 442,\n/**/\n 441,\n/**/\n 440,\n/**/\n 439,\n/**/\n 438,\n/**/\n 437,\n/**/\n 436,\n/**/\n 435,\n/**/\n 434,\n/**/\n 433,\n/**/\n 432,\n/**/\n 431,\n/**/\n 430,\n/**/\n 429,\n/**/\n 428,\n/**/\n 427,\n/**/\n 426,\n/**/\n 425,\n/**/\n 424,\n/**/\n 423,\n/**/\n 422,\n/**/\n 421,\n/**/\n 420,\n/**/\n 419,\n/**/\n 418,\n/**/\n 417,\n/**/\n 416,\n/**/\n 415,\n/**/\n 414,\n/**/\n 413,\n/**/\n 412,\n/**/\n 411,\n/**/\n 410,\n/**/\n 409,\n/**/\n 408,\n/**/\n 407,\n/**/\n 406,\n/**/\n 405,\n/**/\n 404,\n/**/\n 403,\n/**/\n 402,\n/**/\n 401,\n/**/\n 400,\n/**/\n 399,\n/**/\n 398,\n/**/\n 397,\n/**/\n 396,\n/**/\n 395,\n/**/\n 394,\n/**/\n 393,\n/**/\n 392,\n/**/\n 391,\n/**/\n 390,\n/**/\n 389,\n/**/\n 388,\n/**/\n 387,\n/**/\n 386,\n/**/\n 385,\n/**/\n 384,\n/**/\n 383,\n/**/\n 382,\n/**/\n 381,\n/**/\n 380,\n/**/\n 379,\n/**/\n 378,\n/**/\n 377,\n/**/\n 376,\n/**/\n 375,\n/**/\n 374,\n/**/\n 373,\n/**/\n 372,\n/**/\n 371,\n/**/\n 370,\n/**/\n 369,\n/**/\n 368,\n/**/\n 367,\n/**/\n 366,\n/**/\n 365,\n/**/\n 364,\n/**/\n 363,\n/**/\n 362,\n/**/\n 361,\n/**/\n 360,\n/**/\n 359,\n/**/\n 358,\n/**/\n 357,\n/**/\n 356,\n/**/\n 355,\n/**/\n 354,\n/**/\n 353,\n/**/\n 352,\n/**/\n 351,\n/**/\n 350,\n/**/\n 349,\n/**/\n 348,\n/**/\n 347,\n/**/\n 346,\n/**/\n 345,\n/**/\n 344,\n/**/\n 343,\n/**/\n 342,\n/**/\n 341,\n/**/\n 340,\n/**/\n 339,\n/**/\n 338,\n/**/\n 337,\n/**/\n 336,\n/**/\n 335,\n/**/\n 334,\n/**/\n 333,\n/**/\n 332,\n/**/\n 331,\n/**/\n 330,\n/**/\n 329,\n/**/\n 328,\n/**/\n 327,\n/**/\n 326,\n/**/\n 325,\n/**/\n 324,\n/**/\n 323,\n/**/\n 322,\n/**/\n 321,\n/**/\n 320,\n/**/\n 319,\n/**/\n 318,\n/**/\n 317,\n/**/\n 316,\n/**/\n 315,\n/**/\n 314,\n/**/\n 313,\n/**/\n 312,\n/**/\n 311,\n/**/\n 310,\n/**/\n 309,\n/**/\n 308,\n/**/\n 307,\n/**/\n 306,\n/**/\n 305,\n/**/\n 304,\n/**/\n 303,\n/**/\n 302,\n/**/\n 301,\n/**/\n 300,\n/**/\n 299,\n/**/\n 298,\n/**/\n 297,\n/**/\n 296,\n/**/\n 295,\n/**/\n 294,\n/**/\n 293,\n/**/\n 292,\n/**/\n 291,\n/**/\n 290,\n/**/\n 289,\n/**/\n 288,\n/**/\n 287,\n/**/\n 286,\n/**/\n 285,\n/**/\n 284,\n/**/\n 283,\n/**/\n 282,\n/**/\n 281,\n/**/\n 280,\n/**/\n 279,\n/**/\n 278,\n/**/\n 277,\n/**/\n 276,\n/**/\n 275,\n/**/\n 274,\n/**/\n 273,\n/**/\n 272,\n/**/\n 271,\n/**/\n 270,\n/**/\n 269,\n/**/\n 268,\n/**/\n 267,\n/**/\n 266,\n/**/\n 265,\n/**/\n 264,\n/**/\n 263,\n/**/\n 262,\n/**/\n 261,\n/**/\n 260,\n/**/\n 259,\n/**/\n 258,\n/**/\n 257,\n/**/\n 256,\n/**/\n 255,\n/**/\n 254,\n/**/\n 253,\n/**/\n 252,\n/**/\n 251,\n/**/\n 250,\n/**/\n 249,\n/**/\n 248,\n/**/\n 247,\n/**/\n 246,\n/**/\n 245,\n/**/\n 244,\n/**/\n 243,\n/**/\n 242,\n/**/\n 241,\n/**/\n 240,\n/**/\n 239,\n/**/\n 238,\n/**/\n 237,\n/**/\n 236,\n/**/\n 235,\n/**/\n 234,\n/**/\n 233,\n/**/\n 232,\n/**/\n 231,\n/**/\n 230,\n/**/\n 229,\n/**/\n 228,\n/**/\n 227,\n/**/\n 226,\n/**/\n 225,\n/**/\n 224,\n/**/\n 223,\n/**/\n 222,\n/**/\n 221,\n/**/\n 220,\n/**/\n 219,\n/**/\n 218,\n/**/\n 217,\n/**/\n 216,\n/**/\n 215,\n/**/\n 214,\n/**/\n 213,\n/**/\n 212,\n/**/\n 211,\n/**/\n 210,\n/**/\n 209,\n/**/\n 208,\n/**/\n 207,\n/**/\n 206,\n/**/\n 205,\n/**/\n 204,\n/**/\n 203,\n/**/\n 202,\n/**/\n 201,\n/**/\n 200,\n/**/\n 199,\n/**/\n 198,\n/**/\n 197,\n/**/\n 196,\n/**/\n 195,\n/**/\n 194,\n/**/\n 193,\n/**/\n 192,\n/**/\n 191,\n/**/\n 190,\n/**/\n 189,\n/**/\n 188,\n/**/\n 187,\n/**/\n 186,\n/**/\n 185,\n/**/\n 184,\n/**/\n 183,\n/**/\n 182,\n/**/\n 181,\n/**/\n 180,\n/**/\n 179,\n/**/\n 178,\n/**/\n 177,\n/**/\n 176,\n/**/\n 175,\n/**/\n 174,\n/**/\n 173,\n/**/\n 172,\n/**/\n 171,\n/**/\n 170,\n/**/\n 169,\n/**/\n 168,\n/**/\n 167,\n/**/\n 166,\n/**/\n 165,\n/**/\n 164,\n/**/\n 163,\n/**/\n 162,\n/**/\n 161,\n/**/\n 160,\n/**/\n 159,\n/**/\n 158,\n/**/\n 157,\n/**/\n 156,\n/**/\n 155,\n/**/\n 154,\n/**/\n 153,\n/**/\n 152,\n/**/\n 151,\n/**/\n 150,\n/**/\n 149,\n/**/\n 148,\n/**/\n 147,\n/**/\n 146,\n/**/\n 145,\n/**/\n 144,\n/**/\n 143,\n/**/\n 142,\n/**/\n 141,\n/**/\n 140,\n/**/\n 139,\n/**/\n 138,\n/**/\n 137,\n/**/\n 136,\n/**/\n 135,\n/**/\n 134,\n/**/\n 133,\n/**/\n 132,\n/**/\n 131,\n/**/\n 130,\n/**/\n 129,\n/**/\n 128,\n/**/\n 127,\n/**/\n 126,\n/**/\n 125,\n/**/\n 124,\n/**/\n 123,\n/**/\n 122,\n/**/\n 121,\n/**/\n 120,\n/**/\n 119,\n/**/\n 118,\n/**/\n 117,\n/**/\n 116,\n/**/\n 115,\n/**/\n 114,\n/**/\n 113,\n/**/\n 112,\n/**/\n 111,\n/**/\n 110,\n/**/\n 109,\n/**/\n 108,\n/**/\n 107,\n/**/\n 106,\n/**/\n 105,\n/**/\n 104,\n/**/\n 103,\n/**/\n 102,\n/**/\n 101,\n/**/\n 100,\n/**/\n 99,\n/**/\n 98,\n/**/\n 97,\n/**/\n 96,\n/**/\n 95,\n/**/\n 94,\n/**/\n 93,\n/**/\n 92,\n/**/\n 91,\n/**/\n 90,\n/**/\n 89,\n/**/\n 88,\n/**/\n 87,\n/**/\n 86,\n/**/\n 85,\n/**/\n 84,\n/**/\n 83,\n/**/\n 82,\n/**/\n 81,\n/**/\n 80,\n/**/\n 79,\n/**/\n 78,\n/**/\n 77,\n/**/\n 76,\n/**/\n 75,\n/**/\n 74,\n/**/\n 73,\n/**/\n 72,\n/**/\n 71,\n/**/\n 70,\n/**/\n 69,\n/**/\n 68,\n/**/\n 67,\n/**/\n 66,\n/**/\n 65,\n/**/\n 64,\n/**/\n 63,\n/**/\n 62,\n/**/\n 61,\n/**/\n 60,\n/**/\n 59,\n/**/\n 58,\n/**/\n 57,\n/**/\n 56,\n/**/\n 55,\n/**/\n 54,\n/**/\n 53,\n/**/\n 52,\n/**/\n 51,\n/**/\n 50,\n/**/\n 49,\n/**/\n 48,\n/**/\n 47,\n/**/\n 46,\n/**/\n 45,\n/**/\n 44,\n/**/\n 43,\n/**/\n 42,\n/**/\n 41,\n/**/\n 40,\n/**/\n 39,\n/**/\n 38,\n/**/\n 37,\n/**/\n 36,\n/**/\n 35,\n/**/\n 34,\n/**/\n 33,\n/**/\n 32,\n/**/\n 31,\n/**/\n 30,\n/**/\n 29,\n/**/\n 28,\n/**/\n 27,\n/**/\n 26,\n/**/\n 25,\n/**/\n 24,\n/**/\n 23,\n/**/\n 22,\n/**/\n 21,\n/**/\n 20,\n/**/\n 19,\n/**/\n 18,\n/**/\n 17,\n/**/\n 16,\n/**/\n 15,\n/**/\n 14,\n/**/\n 13,\n/**/\n 12,\n/**/\n 11,\n/**/\n 10,\n/**/\n 9,\n/**/\n 8,\n/**/\n 7,\n/**/\n 6,\n/**/\n 5,\n/**/\n 4,\n/**/\n 3,\n/**/\n 2,\n/**/\n 1,\n/**/\n 0\n};","/*\n * Place to put a short description when adding a feature with a patch.\n * Keep it short, e.g.,: \"relative numbers\", \"persistent undo\".\n * Also add a comment marker to separate the lines.\n * See the official Vim patches for the diff format: It must use a context of\n * one line only. Create it by hand or use \"diff -C2\" and edit the patch.\n */\nstatic char *(extra_patches[]) =\n{ /* Add your patch description below this line */\n/**/\n NULL\n};"," int\nhighest_patch(void)\n{\n // this relies on the highest patch number to be the first entry\n return included_patches[0];\n}","#if defined(FEAT_EVAL) || defined(PROTO)\n/*\n * Return TRUE if patch \"n\" has been included.\n */\n int\nhas_patch(int n)\n{\n int\t\th, m, l;"," // Perform a binary search.\n l = 0;\n h = (int)ARRAY_LENGTH(included_patches) - 1;\n while (l < h)\n {\n\tm = (l + h) / 2;\n\tif (included_patches[m] == n)\n\t return TRUE;\n\tif (included_patches[m] < n)\n\t h = m;\n\telse\n\t l = m + 1;\n }\n return FALSE;\n}\n#endif"," void\nex_version(exarg_T *eap)\n{\n /*\n * Ignore a \":version 9.99\" command.\n */\n if (*eap->arg == NUL)\n {\n\tmsg_putchar('\\n');\n\tlist_version();\n }\n}","/*\n * Output a string for the version message. If it's going to wrap, output a\n * newline, unless the message is too long to fit on the screen anyway.\n * When \"wrap\" is TRUE wrap the string in [].\n */\n static void\nversion_msg_wrap(char_u *s, int wrap)\n{\n int\t\tlen = vim_strsize(s) + (wrap ? 2 : 0);"," if (!got_int && len < (int)Columns && msg_col + len >= (int)Columns\n\t\t\t\t\t\t\t\t&& *s != '\\n')\n\tmsg_putchar('\\n');\n if (!got_int)\n {\n\tif (wrap)\n\t msg_puts(\"[\");\n\tmsg_puts((char *)s);\n\tif (wrap)\n\t msg_puts(\"]\");\n }\n}"," static void\nversion_msg(char *s)\n{\n version_msg_wrap((char_u *)s, FALSE);\n}","/*\n * List all features aligned in columns, dictionary style.\n */\n static void\nlist_features(void)\n{\n list_in_columns((char_u **)features, -1, -1);\n}","/*\n * List string items nicely aligned in columns.\n * When \"size\" is < 0 then the last entry is marked with NULL.\n * The entry with index \"current\" is inclosed in [].\n */\n void\nlist_in_columns(char_u **items, int size, int current)\n{\n int\t\ti;\n int\t\tncol;\n int\t\tnrow;\n int\t\tcur_row = 1;\n int\t\titem_count = 0;\n int\t\twidth = 0;\n#ifdef FEAT_SYN_HL\n int\t\tuse_highlight = (items == (char_u **)features);\n#endif"," // Find the length of the longest item, use that + 1 as the column\n // width.\n for (i = 0; size < 0 ? items[i] != NULL : i < size; ++i)\n {\n\tint l = vim_strsize(items[i]) + (i == current ? 2 : 0);","\tif (l > width)\n\t width = l;\n\t++item_count;\n }\n width += 1;"," if (Columns < width)\n {\n\t// Not enough screen columns - show one per line\n\tfor (i = 0; i < item_count; ++i)\n\t{\n\t version_msg_wrap(items[i], i == current);\n\t if (msg_col > 0 && i < item_count - 1)\n\t\tmsg_putchar('\\n');\n\t}\n\treturn;\n }"," // The rightmost column doesn't need a separator.\n // Sacrifice it to fit in one more column if possible.\n ncol = (int) (Columns + 1) / width;\n nrow = item_count / ncol + ((item_count % ncol) ? 1 : 0);"," // \"i\" counts columns then rows. \"idx\" counts rows then columns.\n for (i = 0; !got_int && i < nrow * ncol; ++i)\n {\n\tint idx = (i / ncol) + (i % ncol) * nrow;","\tif (idx < item_count)\n\t{\n\t int last_col = (i + 1) % ncol == 0;","\t if (idx == current)\n\t\tmsg_putchar('[');\n#ifdef FEAT_SYN_HL\n\t if (use_highlight && items[idx][0] == '-')\n\t\tmsg_puts_attr((char *)items[idx], HL_ATTR(HLF_W));\n\t else\n#endif\n\t\tmsg_puts((char *)items[idx]);\n\t if (idx == current)\n\t\tmsg_putchar(']');\n\t if (last_col)\n\t {\n\t\tif (msg_col > 0 && cur_row < nrow)\n\t\t msg_putchar('\\n');\n\t\t++cur_row;\n\t }\n\t else\n\t {\n\t\twhile (msg_col % width)\n\t\t msg_putchar(' ');\n\t }\n\t}\n\telse\n\t{\n\t // this row is out of items, thus at the end of the row\n\t if (msg_col > 0)\n\t {\n\t\tif (cur_row < nrow)\n\t\t msg_putchar('\\n');\n\t\t++cur_row;\n\t }\n\t}\n }\n}"," void\nlist_version(void)\n{\n int\t\ti;\n int\t\tfirst;\n char\t*s = \"\";"," /*\n * When adding features here, don't forget to update the list of\n * internal variables in eval.c!\n */\n init_longVersion();\n msg(longVersion);\n#ifdef MSWIN\n# ifdef FEAT_GUI_MSWIN\n# ifdef VIMDLL\n# ifdef _WIN64\n msg_puts(_(\"\\nMS-Windows 64-bit GUI/console version\"));\n# else\n msg_puts(_(\"\\nMS-Windows 32-bit GUI/console version\"));\n# endif\n# else\n# ifdef _WIN64\n msg_puts(_(\"\\nMS-Windows 64-bit GUI version\"));\n# else\n msg_puts(_(\"\\nMS-Windows 32-bit GUI version\"));\n# endif\n# endif\n# ifdef FEAT_OLE\n msg_puts(_(\" with OLE support\"));\n# endif\n# else\n# ifdef _WIN64\n msg_puts(_(\"\\nMS-Windows 64-bit console version\"));\n# else\n msg_puts(_(\"\\nMS-Windows 32-bit console version\"));\n# endif\n# endif\n#endif\n#if defined(MACOS_X)\n# if defined(MACOS_X_DARWIN)\n msg_puts(_(\"\\nmacOS version\"));\n# else\n msg_puts(_(\"\\nmacOS version w/o darwin feat.\"));\n# endif\n# if defined(__arm64__)\n msg_puts(\" - arm64\");\n# elif defined(__x86_64__)\n msg_puts(\" - x86_64\");\n# endif\n#endif","#ifdef VMS\n msg_puts(_(\"\\nOpenVMS version\"));\n# ifdef HAVE_PATHDEF\n if (*compiled_arch != NUL)\n {\n\tmsg_puts(\" - \");\n\tmsg_puts((char *)compiled_arch);\n }\n# endif","#endif"," // Print the list of patch numbers if there is at least one.\n // Print a range when patches are consecutive: \"1-10, 12, 15-40, 42-45\"\n if (included_patches[0] != 0)\n {\n\tmsg_puts(_(\"\\nIncluded patches: \"));\n\tfirst = -1;\n\ti = (int)ARRAY_LENGTH(included_patches) - 1;\n\twhile (--i >= 0)\n\t{\n\t if (first < 0)\n\t\tfirst = included_patches[i];\n\t if (i == 0 || included_patches[i - 1] != included_patches[i] + 1)\n\t {\n\t\tmsg_puts(s);\n\t\ts = \", \";\n\t\tmsg_outnum((long)first);\n\t\tif (first != included_patches[i])\n\t\t{\n\t\t msg_puts(\"-\");\n\t\t msg_outnum((long)included_patches[i]);\n\t\t}\n\t\tfirst = -1;\n\t }\n\t}\n }"," // Print the list of extra patch descriptions if there is at least one.\n if (extra_patches[0] != NULL)\n {\n\tmsg_puts(_(\"\\nExtra patches: \"));\n\ts = \"\";\n\tfor (i = 0; extra_patches[i] != NULL; ++i)\n\t{\n\t msg_puts(s);\n\t s = \", \";\n\t msg_puts(extra_patches[i]);\n\t}\n }","#ifdef MODIFIED_BY\n msg_puts(\"\\n\");\n msg_puts(_(\"Modified by \"));\n msg_puts(MODIFIED_BY);\n#endif","#ifdef HAVE_PATHDEF\n if (*compiled_user != NUL || *compiled_sys != NUL)\n {\n\tmsg_puts(_(\"\\nCompiled \"));\n\tif (*compiled_user != NUL)\n\t{\n\t msg_puts(_(\"by \"));\n\t msg_puts((char *)compiled_user);\n\t}\n\tif (*compiled_sys != NUL)\n\t{\n\t msg_puts(\"@\");\n\t msg_puts((char *)compiled_sys);\n\t}\n }\n#endif","#if defined(FEAT_HUGE)\n msg_puts(_(\"\\nHuge version \"));\n#elif defined(FEAT_BIG)\n msg_puts(_(\"\\nBig version \"));\n#elif defined(FEAT_NORMAL)\n msg_puts(_(\"\\nNormal version \"));\n#elif defined(FEAT_SMALL)\n msg_puts(_(\"\\nSmall version \"));\n#else\n msg_puts(_(\"\\nTiny version \"));\n#endif\n#if !defined(FEAT_GUI)\n msg_puts(_(\"without GUI.\"));\n#elif defined(FEAT_GUI_GTK)\n# if defined(USE_GTK3)\n msg_puts(_(\"with GTK3 GUI.\"));\n# elif defined(FEAT_GUI_GNOME)\n msg_puts(_(\"with GTK2-GNOME GUI.\"));\n# else\n msg_puts(_(\"with GTK2 GUI.\"));\n# endif\n#elif defined(FEAT_GUI_MOTIF)\n msg_puts(_(\"with X11-Motif GUI.\"));\n#elif defined(FEAT_GUI_HAIKU)\n msg_puts(_(\"with Haiku GUI.\"));\n#elif defined(FEAT_GUI_PHOTON)\n msg_puts(_(\"with Photon GUI.\"));\n#elif defined(MSWIN)\n msg_puts(_(\"with GUI.\"));\n#endif\n version_msg(_(\" Features included (+) or not (-):\\n\"));"," list_features();\n if (msg_col > 0)\n\tmsg_putchar('\\n');","#ifdef SYS_VIMRC_FILE\n version_msg(_(\" system vimrc file: \\\"\"));\n version_msg(SYS_VIMRC_FILE);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_VIMRC_FILE\n version_msg(_(\" user vimrc file: \\\"\"));\n version_msg(USR_VIMRC_FILE);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_VIMRC_FILE2\n version_msg(_(\" 2nd user vimrc file: \\\"\"));\n version_msg(USR_VIMRC_FILE2);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_VIMRC_FILE3\n version_msg(_(\" 3rd user vimrc file: \\\"\"));\n version_msg(USR_VIMRC_FILE3);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_EXRC_FILE\n version_msg(_(\" user exrc file: \\\"\"));\n version_msg(USR_EXRC_FILE);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef USR_EXRC_FILE2\n version_msg(_(\" 2nd user exrc file: \\\"\"));\n version_msg(USR_EXRC_FILE2);\n version_msg(\"\\\"\\n\");\n#endif\n#ifdef FEAT_GUI\n# ifdef SYS_GVIMRC_FILE\n version_msg(_(\" system gvimrc file: \\\"\"));\n version_msg(SYS_GVIMRC_FILE);\n version_msg(\"\\\"\\n\");\n# endif\n version_msg(_(\" user gvimrc file: \\\"\"));\n version_msg(USR_GVIMRC_FILE);\n version_msg(\"\\\"\\n\");\n# ifdef USR_GVIMRC_FILE2\n version_msg(_(\"2nd user gvimrc file: \\\"\"));\n version_msg(USR_GVIMRC_FILE2);\n version_msg(\"\\\"\\n\");\n# endif\n# ifdef USR_GVIMRC_FILE3\n version_msg(_(\"3rd user gvimrc file: \\\"\"));\n version_msg(USR_GVIMRC_FILE3);\n version_msg(\"\\\"\\n\");\n# endif\n#endif\n version_msg(_(\" defaults file: \\\"\"));\n version_msg(VIM_DEFAULTS_FILE);\n version_msg(\"\\\"\\n\");\n#ifdef FEAT_GUI\n# ifdef SYS_MENU_FILE\n version_msg(_(\" system menu file: \\\"\"));\n version_msg(SYS_MENU_FILE);\n version_msg(\"\\\"\\n\");\n# endif\n#endif\n#ifdef HAVE_PATHDEF\n if (*default_vim_dir != NUL)\n {\n\tversion_msg(_(\" fall-back for $VIM: \\\"\"));\n\tversion_msg((char *)default_vim_dir);\n\tversion_msg(\"\\\"\\n\");\n }\n if (*default_vimruntime_dir != NUL)\n {\n\tversion_msg(_(\" f-b for $VIMRUNTIME: \\\"\"));\n\tversion_msg((char *)default_vimruntime_dir);\n\tversion_msg(\"\\\"\\n\");\n }\n version_msg(_(\"Compilation: \"));\n version_msg((char *)all_cflags);\n version_msg(\"\\n\");\n#ifdef VMS\n if (*compiler_version != NUL)\n {\n\tversion_msg(_(\"Compiler: \"));\n\tversion_msg((char *)compiler_version);\n\tversion_msg(\"\\n\");\n }\n#endif\n version_msg(_(\"Linking: \"));\n version_msg((char *)all_lflags);\n#endif\n#ifdef DEBUG\n version_msg(\"\\n\");\n version_msg(_(\" DEBUG BUILD\"));\n#endif\n}","static void do_intro_line(int row, char_u *mesg, int add_version, int attr);\nstatic void intro_message(int colon);","/*\n * Show the intro message when not editing a file.\n */\n void\nmaybe_intro_message(void)\n{\n if (BUFEMPTY()\n\t && curbuf->b_fname == NULL\n\t && firstwin->w_next == NULL\n\t && vim_strchr(p_shm, SHM_INTRO) == NULL)\n\tintro_message(FALSE);\n}","/*\n * Give an introductory message about Vim.\n * Only used when starting Vim on an empty file, without a file name.\n * Or with the \":intro\" command (for Sven :-).\n */\n static void\nintro_message(\n int\t\tcolon)\t\t// TRUE for \":intro\"\n{\n int\t\ti;\n int\t\trow;\n int\t\tblanklines;\n int\t\tsponsor;\n char\t*p;\n static char\t*(lines[]) =\n {\n\tN_(\"VIM - Vi IMproved\"),\n\t\"\",\n\tN_(\"version \"),\n\tN_(\"by Bram Moolenaar et al.\"),\n#ifdef MODIFIED_BY\n\t\" \",\n#endif\n\tN_(\"Vim is open source and freely distributable\"),\n\t\"\",\n\tN_(\"Help poor children in Uganda!\"),\n\tN_(\"type :help iccf<Enter> for information \"),\n\t\"\",\n\tN_(\"type :q<Enter> to exit \"),\n\tN_(\"type :help<Enter> or <F1> for on-line help\"),\n\tN_(\"type :help version8<Enter> for version info\"),\n\tNULL,\n\t\"\",\n\tN_(\"Running in Vi compatible mode\"),\n\tN_(\"type :set nocp<Enter> for Vim defaults\"),\n\tN_(\"type :help cp-default<Enter> for info on this\"),\n };\n#ifdef FEAT_GUI\n static char\t*(gui_lines[]) =\n {\n\tNULL,\n\tNULL,\n\tNULL,\n\tNULL,\n#ifdef MODIFIED_BY\n\tNULL,\n#endif\n\tNULL,\n\tNULL,\n\tNULL,\n\tN_(\"menu Help->Orphans for information \"),\n\tNULL,\n\tN_(\"Running modeless, typed text is inserted\"),\n\tN_(\"menu Edit->Global Settings->Toggle Insert Mode \"),\n\tN_(\" for two modes \"),\n\tNULL,\n\tNULL,\n\tNULL,\n\tN_(\"menu Edit->Global Settings->Toggle Vi Compatible\"),\n\tN_(\" for Vim defaults \"),\n };\n#endif"," // blanklines = screen height - # message lines\n blanklines = (int)Rows - (ARRAY_LENGTH(lines) - 1);\n if (!p_cp)\n\tblanklines += 4; // add 4 for not showing \"Vi compatible\" message"," // Don't overwrite a statusline. Depends on 'cmdheight'.\n if (p_ls > 1)\n\tblanklines -= Rows - topframe->fr_height;\n if (blanklines < 0)\n\tblanklines = 0;"," // Show the sponsor and register message one out of four times, the Uganda\n // message two out of four times.\n sponsor = (int)time(NULL);\n sponsor = ((sponsor & 2) == 0) - ((sponsor & 4) == 0);"," // start displaying the message lines after half of the blank lines\n row = blanklines / 2;\n if ((row >= 2 && Columns >= 50) || colon)\n {\n\tfor (i = 0; i < (int)ARRAY_LENGTH(lines); ++i)\n\t{\n\t p = lines[i];\n#ifdef FEAT_GUI\n\t if (p_im && gui.in_use && gui_lines[i] != NULL)\n\t\tp = gui_lines[i];\n#endif\n\t if (p == NULL)\n\t {\n\t\tif (!p_cp)\n\t\t break;\n\t\tcontinue;\n\t }\n\t if (sponsor != 0)\n\t {\n\t\tif (strstr(p, \"children\") != NULL)\n\t\t p = sponsor < 0\n\t\t\t? N_(\"Sponsor Vim development!\")\n\t\t\t: N_(\"Become a registered Vim user!\");\n\t\telse if (strstr(p, \"iccf\") != NULL)\n\t\t p = sponsor < 0\n\t\t\t? N_(\"type :help sponsor<Enter> for information \")\n\t\t\t: N_(\"type :help register<Enter> for information \");\n\t\telse if (strstr(p, \"Orphans\") != NULL)\n\t\t p = N_(\"menu Help->Sponsor/Register for information \");\n\t }\n\t if (*p != NUL)\n\t\tdo_intro_line(row, (char_u *)_(p), i == 2, 0);\n\t ++row;\n\t}\n }"," // Make the wait-return message appear just below the text.\n if (colon)\n\tmsg_row = row;\n}"," static void\ndo_intro_line(\n int\t\trow,\n char_u\t*mesg,\n int\t\tadd_version,\n int\t\tattr)\n{\n char_u\tvers[20];\n int\t\tcol;\n char_u\t*p;\n int\t\tl;\n int\t\tclen;\n#ifdef MODIFIED_BY\n# define MODBY_LEN 150\n char_u\tmodby[MODBY_LEN];"," if (*mesg == ' ')\n {\n\tvim_strncpy(modby, (char_u *)_(\"Modified by \"), MODBY_LEN - 1);\n\tl = (int)STRLEN(modby);\n\tvim_strncpy(modby + l, (char_u *)MODIFIED_BY, MODBY_LEN - l - 1);\n\tmesg = modby;\n }\n#endif"," // Center the message horizontally.\n col = vim_strsize(mesg);\n if (add_version)\n {\n\tSTRCPY(vers, mediumVersion);\n\tif (highest_patch())\n\t{\n\t // Check for 9.9x or 9.9xx, alpha/beta version\n\t if (isalpha((int)vers[3]))\n\t {\n\t\tint len = (isalpha((int)vers[4])) ? 5 : 4;\n\t\tsprintf((char *)vers + len, \".%d%s\", highest_patch(),\n\t\t\t\t\t\t\t mediumVersion + len);\n\t }\n\t else\n\t\tsprintf((char *)vers + 3, \".%d\", highest_patch());\n\t}\n\tcol += (int)STRLEN(vers);\n }\n col = (Columns - col) / 2;\n if (col < 0)\n\tcol = 0;"," // Split up in parts to highlight <> items differently.\n for (p = mesg; *p != NUL; p += l)\n {\n\tclen = 0;\n\tfor (l = 0; p[l] != NUL\n\t\t\t && (l == 0 || (p[l] != '<' && p[l - 1] != '>')); ++l)\n\t{\n\t if (has_mbyte)\n\t {\n\t\tclen += ptr2cells(p + l);\n\t\tl += (*mb_ptr2len)(p + l) - 1;\n\t }\n\t else\n\t\tclen += byte2cells(p[l]);\n\t}\n\tscreen_puts_len(p, l, row, col, *p == '<' ? HL_ATTR(HLF_8) : attr);\n\tcol += clen;\n }"," // Add the version number to the version line.\n if (add_version)\n\tscreen_puts(vers, row, col, 0);\n}","/*\n * \":intro\": clear screen, display intro screen and wait for return.\n */\n void\nex_intro(exarg_T *eap UNUSED)\n{\n screenclear();\n intro_message(TRUE);\n wait_return(TRUE);\n}"],"string":"[\n \"/* vi:set ts=8 sts=4 sw=4 noet:\\n *\\n * VIM - Vi IMproved\\t\\tby Bram Moolenaar\\n *\\n * Do \\\":help uganda\\\" in Vim to read copying and usage conditions.\\n * Do \\\":help credits\\\" in Vim to see a list of people who contributed.\\n * See README.txt for an overview of the Vim source code.\\n */\",\n \"#include \\\"vim.h\\\"\",\n \"/*\\n * Vim originated from Stevie version 3.6 (Fish disk 217) by GRWalter (Fred)\\n * It has been changed beyond recognition since then.\\n *\\n * Differences between version 7.4 and 8.x can be found with \\\":help version8\\\".\\n * Differences between version 6.4 and 7.x can be found with \\\":help version7\\\".\\n * Differences between version 5.8 and 6.x can be found with \\\":help version6\\\".\\n * Differences between version 4.x and 5.x can be found with \\\":help version5\\\".\\n * Differences between version 3.0 and 4.x can be found with \\\":help version4\\\".\\n * All the remarks about older versions have been removed, they are not very\\n * interesting.\\n */\",\n \"#include \\\"version.h\\\"\",\n \"char\\t\\t*Version = VIM_VERSION_SHORT;\\nstatic char\\t*mediumVersion = VIM_VERSION_MEDIUM;\",\n \"#if defined(HAVE_DATE_TIME) || defined(PROTO)\\n# if (defined(VMS) && defined(VAXC)) || defined(PROTO)\\nchar\\tlongVersion[sizeof(VIM_VERSION_LONG_DATE) + sizeof(__DATE__)\\n\\t\\t\\t\\t\\t\\t + sizeof(__TIME__) + 3];\",\n \" void\\ninit_longVersion(void)\\n{\\n /*\\n * Construct the long version string. Necessary because\\n * VAX C can't concatenate strings in the preprocessor.\\n */\\n strcpy(longVersion, VIM_VERSION_LONG_DATE);\\n#ifdef BUILD_DATE\\n strcat(longVersion, BUILD_DATE);\\n#else\\n strcat(longVersion, __DATE__);\\n strcat(longVersion, \\\" \\\");\\n strcat(longVersion, __TIME__);\\n#endif\\n strcat(longVersion, \\\")\\\");\\n}\",\n \"# else\\nchar\\t*longVersion = NULL;\",\n \" void\\ninit_longVersion(void)\\n{\\n if (longVersion == NULL)\\n {\\n#ifdef BUILD_DATE\\n\\tchar *date_time = BUILD_DATE;\\n#else\\n\\tchar *date_time = __DATE__ \\\" \\\" __TIME__;\\n#endif\\n\\tchar *msg = _(\\\"%s (%s, compiled %s)\\\");\\n\\tsize_t len = strlen(msg)\\n\\t\\t + strlen(VIM_VERSION_LONG_ONLY)\\n\\t\\t + strlen(VIM_VERSION_DATE_ONLY)\\n\\t\\t + strlen(date_time);\",\n \"\\tlongVersion = alloc(len);\\n\\tif (longVersion == NULL)\\n\\t longVersion = VIM_VERSION_LONG;\\n\\telse\\n\\t vim_snprintf(longVersion, len, msg,\\n\\t\\t VIM_VERSION_LONG_ONLY, VIM_VERSION_DATE_ONLY, date_time);\\n }\\n}\\n# endif\\n#else\\nchar\\t*longVersion = VIM_VERSION_LONG;\",\n \" void\\ninit_longVersion(void)\\n{\\n // nothing to do\\n}\\n#endif\",\n \"static char *(features[]) =\\n{\\n#ifdef HAVE_ACL\\n\\t\\\"+acl\\\",\\n#else\\n\\t\\\"-acl\\\",\\n#endif\\n#ifdef AMIGA\\t\\t// only for Amiga systems\\n# ifdef FEAT_ARP\\n\\t\\\"+ARP\\\",\\n# else\\n\\t\\\"-ARP\\\",\\n# endif\\n#endif\\n#ifdef FEAT_ARABIC\\n\\t\\\"+arabic\\\",\\n#else\\n\\t\\\"-arabic\\\",\\n#endif\\n\\t\\\"+autocmd\\\",\\n#ifdef FEAT_AUTOCHDIR\\n \\\"+autochdir\\\",\\n#else\\n \\\"-autochdir\\\",\\n#endif\\n#ifdef FEAT_AUTOSERVERNAME\\n\\t\\\"+autoservername\\\",\\n#else\\n\\t\\\"-autoservername\\\",\\n#endif\\n#ifdef FEAT_BEVAL_GUI\\n\\t\\\"+balloon_eval\\\",\\n#else\\n\\t\\\"-balloon_eval\\\",\\n#endif\\n#ifdef FEAT_BEVAL_TERM\\n\\t\\\"+balloon_eval_term\\\",\\n#else\\n\\t\\\"-balloon_eval_term\\\",\\n#endif\\n#ifdef FEAT_BROWSE\\n\\t\\\"+browse\\\",\\n#else\\n\\t\\\"-browse\\\",\\n#endif\\n#ifdef NO_BUILTIN_TCAPS\\n\\t\\\"-builtin_terms\\\",\\n#endif\\n#ifdef SOME_BUILTIN_TCAPS\\n\\t\\\"+builtin_terms\\\",\\n#endif\\n#ifdef ALL_BUILTIN_TCAPS\\n\\t\\\"++builtin_terms\\\",\\n#endif\\n#ifdef FEAT_BYTEOFF\\n\\t\\\"+byte_offset\\\",\\n#else\\n\\t\\\"-byte_offset\\\",\\n#endif\\n#ifdef FEAT_JOB_CHANNEL\\n\\t\\\"+channel\\\",\\n#else\\n\\t\\\"-channel\\\",\\n#endif\\n#ifdef FEAT_CINDENT\\n\\t\\\"+cindent\\\",\\n#else\\n\\t\\\"-cindent\\\",\\n#endif\\n#ifdef FEAT_CLIENTSERVER\\n\\t\\\"+clientserver\\\",\\n#else\\n\\t\\\"-clientserver\\\",\\n#endif\\n#ifdef FEAT_CLIPBOARD\\n\\t\\\"+clipboard\\\",\\n#else\\n\\t\\\"-clipboard\\\",\\n#endif\\n\\t\\\"+cmdline_compl\\\",\\n\\t\\\"+cmdline_hist\\\",\\n#ifdef FEAT_CMDL_INFO\\n\\t\\\"+cmdline_info\\\",\\n#else\\n\\t\\\"-cmdline_info\\\",\\n#endif\\n\\t\\\"+comments\\\",\\n#ifdef FEAT_CONCEAL\\n\\t\\\"+conceal\\\",\\n#else\\n\\t\\\"-conceal\\\",\\n#endif\\n#ifdef FEAT_CRYPT\\n\\t\\\"+cryptv\\\",\\n#else\\n\\t\\\"-cryptv\\\",\\n#endif\\n#ifdef FEAT_CSCOPE\\n\\t\\\"+cscope\\\",\\n#else\\n\\t\\\"-cscope\\\",\\n#endif\\n\\t\\\"+cursorbind\\\",\\n#ifdef CURSOR_SHAPE\\n\\t\\\"+cursorshape\\\",\\n#else\\n\\t\\\"-cursorshape\\\",\\n#endif\\n#if defined(FEAT_CON_DIALOG) && defined(FEAT_GUI_DIALOG)\\n\\t\\\"+dialog_con_gui\\\",\\n#else\\n# if defined(FEAT_CON_DIALOG)\\n\\t\\\"+dialog_con\\\",\\n# else\\n# if defined(FEAT_GUI_DIALOG)\\n\\t\\\"+dialog_gui\\\",\\n# else\\n\\t\\\"-dialog\\\",\\n# endif\\n# endif\\n#endif\\n#ifdef FEAT_DIFF\\n\\t\\\"+diff\\\",\\n#else\\n\\t\\\"-diff\\\",\\n#endif\\n#ifdef FEAT_DIGRAPHS\\n\\t\\\"+digraphs\\\",\\n#else\\n\\t\\\"-digraphs\\\",\\n#endif\\n#ifdef FEAT_GUI_MSWIN\\n# ifdef FEAT_DIRECTX\\n\\t\\\"+directx\\\",\\n# else\\n\\t\\\"-directx\\\",\\n# endif\\n#endif\\n#ifdef FEAT_DND\\n\\t\\\"+dnd\\\",\\n#else\\n\\t\\\"-dnd\\\",\\n#endif\\n\\t\\\"-ebcdic\\\",\\n#ifdef FEAT_EMACS_TAGS\\n\\t\\\"+emacs_tags\\\",\\n#else\\n\\t\\\"-emacs_tags\\\",\\n#endif\\n#ifdef FEAT_EVAL\\n\\t\\\"+eval\\\",\\n#else\\n\\t\\\"-eval\\\",\\n#endif\\n\\t\\\"+ex_extra\\\",\\n#ifdef FEAT_SEARCH_EXTRA\\n\\t\\\"+extra_search\\\",\\n#else\\n\\t\\\"-extra_search\\\",\\n#endif\\n\\t\\\"-farsi\\\",\\n#ifdef FEAT_SEARCHPATH\\n\\t\\\"+file_in_path\\\",\\n#else\\n\\t\\\"-file_in_path\\\",\\n#endif\\n#ifdef FEAT_FIND_ID\\n\\t\\\"+find_in_path\\\",\\n#else\\n\\t\\\"-find_in_path\\\",\\n#endif\\n#ifdef FEAT_FLOAT\\n\\t\\\"+float\\\",\\n#else\\n\\t\\\"-float\\\",\\n#endif\\n#ifdef FEAT_FOLDING\\n\\t\\\"+folding\\\",\\n#else\\n\\t\\\"-folding\\\",\\n#endif\\n#ifdef FEAT_FOOTER\\n\\t\\\"+footer\\\",\\n#else\\n\\t\\\"-footer\\\",\\n#endif\\n\\t // only interesting on Unix systems\\n#if !defined(USE_SYSTEM) && defined(UNIX)\\n\\t\\\"+fork()\\\",\\n#endif\\n#ifdef FEAT_GETTEXT\\n# ifdef DYNAMIC_GETTEXT\\n\\t\\\"+gettext/dyn\\\",\\n# else\\n\\t\\\"+gettext\\\",\\n# endif\\n#else\\n\\t\\\"-gettext\\\",\\n#endif\\n\\t\\\"-hangul_input\\\",\\n#if (defined(HAVE_ICONV_H) && defined(USE_ICONV)) || defined(DYNAMIC_ICONV)\\n# ifdef DYNAMIC_ICONV\\n\\t\\\"+iconv/dyn\\\",\\n# else\\n\\t\\\"+iconv\\\",\\n# endif\\n#else\\n\\t\\\"-iconv\\\",\\n#endif\\n\\t\\\"+insert_expand\\\",\\n#ifdef FEAT_IPV6\\n\\t\\\"+ipv6\\\",\\n#else\\n\\t\\\"-ipv6\\\",\\n#endif\\n#ifdef FEAT_JOB_CHANNEL\\n\\t\\\"+job\\\",\\n#else\\n\\t\\\"-job\\\",\\n#endif\\n\\t\\\"+jumplist\\\",\\n#ifdef FEAT_KEYMAP\\n\\t\\\"+keymap\\\",\\n#else\\n\\t\\\"-keymap\\\",\\n#endif\\n#ifdef FEAT_EVAL\\n\\t\\\"+lambda\\\",\\n#else\\n\\t\\\"-lambda\\\",\\n#endif\\n#ifdef FEAT_LANGMAP\\n\\t\\\"+langmap\\\",\\n#else\\n\\t\\\"-langmap\\\",\\n#endif\\n#ifdef FEAT_LIBCALL\\n\\t\\\"+libcall\\\",\\n#else\\n\\t\\\"-libcall\\\",\\n#endif\\n#ifdef FEAT_LINEBREAK\\n\\t\\\"+linebreak\\\",\\n#else\\n\\t\\\"-linebreak\\\",\\n#endif\\n#ifdef FEAT_LISP\\n\\t\\\"+lispindent\\\",\\n#else\\n\\t\\\"-lispindent\\\",\\n#endif\\n\\t\\\"+listcmds\\\",\\n\\t\\\"+localmap\\\",\\n#ifdef FEAT_LUA\\n# ifdef DYNAMIC_LUA\\n\\t\\\"+lua/dyn\\\",\\n# else\\n\\t\\\"+lua\\\",\\n# endif\\n#else\\n\\t\\\"-lua\\\",\\n#endif\\n#ifdef FEAT_MENU\\n\\t\\\"+menu\\\",\\n#else\\n\\t\\\"-menu\\\",\\n#endif\\n#ifdef FEAT_SESSION\\n\\t\\\"+mksession\\\",\\n#else\\n\\t\\\"-mksession\\\",\\n#endif\\n\\t\\\"+modify_fname\\\",\\n\\t\\\"+mouse\\\",\\n#ifdef FEAT_MOUSESHAPE\\n\\t\\\"+mouseshape\\\",\\n#else\\n\\t\\\"-mouseshape\\\",\\n#endif\",\n \"#if defined(UNIX) || defined(VMS)\\n# ifdef FEAT_MOUSE_DEC\\n\\t\\\"+mouse_dec\\\",\\n# else\\n\\t\\\"-mouse_dec\\\",\\n# endif\\n# ifdef FEAT_MOUSE_GPM\\n# ifdef DYNAMIC_GPM\\n\\t\\\"+mouse_gpm/dyn\\\",\\n# else\\n\\t\\\"+mouse_gpm\\\",\\n# endif\\n# else\\n\\t\\\"-mouse_gpm\\\",\\n# endif\\n# ifdef FEAT_MOUSE_JSB\\n\\t\\\"+mouse_jsbterm\\\",\\n# else\\n\\t\\\"-mouse_jsbterm\\\",\\n# endif\\n# ifdef FEAT_MOUSE_NET\\n\\t\\\"+mouse_netterm\\\",\\n# else\\n\\t\\\"-mouse_netterm\\\",\\n# endif\\n#endif\",\n \"#ifdef __QNX__\\n# ifdef FEAT_MOUSE_PTERM\\n\\t\\\"+mouse_pterm\\\",\\n# else\\n\\t\\\"-mouse_pterm\\\",\\n# endif\\n#endif\",\n \"#if defined(UNIX) || defined(VMS)\\n\\t\\\"+mouse_sgr\\\",\\n# ifdef FEAT_SYSMOUSE\\n\\t\\\"+mouse_sysmouse\\\",\\n# else\\n\\t\\\"-mouse_sysmouse\\\",\\n# endif\\n# ifdef FEAT_MOUSE_URXVT\\n\\t\\\"+mouse_urxvt\\\",\\n# else\\n\\t\\\"-mouse_urxvt\\\",\\n# endif\\n\\t\\\"+mouse_xterm\\\",\\n#endif\",\n \"#ifdef FEAT_MBYTE_IME\\n# ifdef DYNAMIC_IME\\n\\t\\\"+multi_byte_ime/dyn\\\",\\n# else\\n\\t\\\"+multi_byte_ime\\\",\\n# endif\\n#else\\n\\t\\\"+multi_byte\\\",\\n#endif\\n#ifdef FEAT_MULTI_LANG\\n\\t\\\"+multi_lang\\\",\\n#else\\n\\t\\\"-multi_lang\\\",\\n#endif\\n#ifdef FEAT_MZSCHEME\\n# ifdef DYNAMIC_MZSCHEME\\n\\t\\\"+mzscheme/dyn\\\",\\n# else\\n\\t\\\"+mzscheme\\\",\\n# endif\\n#else\\n\\t\\\"-mzscheme\\\",\\n#endif\\n#ifdef FEAT_NETBEANS_INTG\\n\\t\\\"+netbeans_intg\\\",\\n#else\\n\\t\\\"-netbeans_intg\\\",\\n#endif\\n\\t\\\"+num64\\\",\\n#ifdef FEAT_GUI_MSWIN\\n# ifdef FEAT_OLE\\n\\t\\\"+ole\\\",\\n# else\\n\\t\\\"-ole\\\",\\n# endif\\n#endif\\n#ifdef FEAT_EVAL\\n\\t\\\"+packages\\\",\\n#else\\n\\t\\\"-packages\\\",\\n#endif\\n#ifdef FEAT_PATH_EXTRA\\n\\t\\\"+path_extra\\\",\\n#else\\n\\t\\\"-path_extra\\\",\\n#endif\\n#ifdef FEAT_PERL\\n# ifdef DYNAMIC_PERL\\n\\t\\\"+perl/dyn\\\",\\n# else\\n\\t\\\"+perl\\\",\\n# endif\\n#else\\n\\t\\\"-perl\\\",\\n#endif\\n#ifdef FEAT_PERSISTENT_UNDO\\n\\t\\\"+persistent_undo\\\",\\n#else\\n\\t\\\"-persistent_undo\\\",\\n#endif\\n#ifdef FEAT_PROP_POPUP\\n\\t\\\"+popupwin\\\",\\n#else\\n\\t\\\"-popupwin\\\",\\n#endif\\n#ifdef FEAT_PRINTER\\n# ifdef FEAT_POSTSCRIPT\\n\\t\\\"+postscript\\\",\\n# else\\n\\t\\\"-postscript\\\",\\n# endif\\n\\t\\\"+printer\\\",\\n#else\\n\\t\\\"-printer\\\",\\n#endif\\n#ifdef FEAT_PROFILE\\n\\t\\\"+profile\\\",\\n#else\\n\\t\\\"-profile\\\",\\n#endif\\n#ifdef FEAT_PYTHON\\n# ifdef DYNAMIC_PYTHON\\n\\t\\\"+python/dyn\\\",\\n# else\\n\\t\\\"+python\\\",\\n# endif\\n#else\\n\\t\\\"-python\\\",\\n#endif\\n#ifdef FEAT_PYTHON3\\n# ifdef DYNAMIC_PYTHON3\\n\\t\\\"+python3/dyn\\\",\\n# else\\n\\t\\\"+python3\\\",\\n# endif\\n#else\\n\\t\\\"-python3\\\",\\n#endif\\n#ifdef FEAT_QUICKFIX\\n\\t\\\"+quickfix\\\",\\n#else\\n\\t\\\"-quickfix\\\",\\n#endif\\n#ifdef FEAT_RELTIME\\n\\t\\\"+reltime\\\",\\n#else\\n\\t\\\"-reltime\\\",\\n#endif\\n#ifdef FEAT_RIGHTLEFT\\n\\t\\\"+rightleft\\\",\\n#else\\n\\t\\\"-rightleft\\\",\\n#endif\\n#ifdef FEAT_RUBY\\n# ifdef DYNAMIC_RUBY\\n\\t\\\"+ruby/dyn\\\",\\n# else\\n\\t\\\"+ruby\\\",\\n# endif\\n#else\\n\\t\\\"-ruby\\\",\\n#endif\\n\\t\\\"+scrollbind\\\",\\n#ifdef FEAT_SIGNS\\n\\t\\\"+signs\\\",\\n#else\\n\\t\\\"-signs\\\",\\n#endif\\n#ifdef FEAT_SMARTINDENT\\n\\t\\\"+smartindent\\\",\\n#else\\n\\t\\\"-smartindent\\\",\\n#endif\\n#ifdef FEAT_SODIUM\\n# ifdef DYNAMIC_SODIUM\\n\\t\\\"+sodium/dyn\\\",\\n# else\\n\\t\\\"+sodium\\\",\\n# endif\\n#else\\n\\t\\\"-sodium\\\",\\n#endif\\n#ifdef FEAT_SOUND\\n\\t\\\"+sound\\\",\\n#else\\n\\t\\\"-sound\\\",\\n#endif\\n#ifdef FEAT_SPELL\\n\\t\\\"+spell\\\",\\n#else\\n\\t\\\"-spell\\\",\\n#endif\\n#ifdef STARTUPTIME\\n\\t\\\"+startuptime\\\",\\n#else\\n\\t\\\"-startuptime\\\",\\n#endif\\n#ifdef FEAT_STL_OPT\\n\\t\\\"+statusline\\\",\\n#else\\n\\t\\\"-statusline\\\",\\n#endif\\n\\t\\\"-sun_workshop\\\",\\n#ifdef FEAT_SYN_HL\\n\\t\\\"+syntax\\\",\\n#else\\n\\t\\\"-syntax\\\",\\n#endif\\n\\t // only interesting on Unix systems\\n#if defined(USE_SYSTEM) && defined(UNIX)\\n\\t\\\"+system()\\\",\\n#endif\\n\\t\\\"+tag_binary\\\",\\n\\t\\\"-tag_old_static\\\",\\n\\t\\\"-tag_any_white\\\",\\n#ifdef FEAT_TCL\\n# ifdef DYNAMIC_TCL\\n\\t\\\"+tcl/dyn\\\",\\n# else\\n\\t\\\"+tcl\\\",\\n# endif\\n#else\\n\\t\\\"-tcl\\\",\\n#endif\\n#ifdef FEAT_TERMGUICOLORS\\n\\t\\\"+termguicolors\\\",\\n#else\\n\\t\\\"-termguicolors\\\",\\n#endif\\n#ifdef FEAT_TERMINAL\\n\\t\\\"+terminal\\\",\\n#else\\n\\t\\\"-terminal\\\",\\n#endif\\n#if defined(UNIX)\\n// only Unix can have terminfo instead of termcap\\n# ifdef TERMINFO\\n\\t\\\"+terminfo\\\",\\n# else\\n\\t\\\"-terminfo\\\",\\n# endif\\n#endif\\n#ifdef FEAT_TERMRESPONSE\\n\\t\\\"+termresponse\\\",\\n#else\\n\\t\\\"-termresponse\\\",\\n#endif\\n#ifdef FEAT_TEXTOBJ\\n\\t\\\"+textobjects\\\",\\n#else\\n\\t\\\"-textobjects\\\",\\n#endif\\n#ifdef FEAT_PROP_POPUP\\n\\t\\\"+textprop\\\",\\n#else\\n\\t\\\"-textprop\\\",\\n#endif\\n#if !defined(UNIX)\\n// unix always includes termcap support\\n# ifdef HAVE_TGETENT\\n\\t\\\"+tgetent\\\",\\n# else\\n\\t\\\"-tgetent\\\",\\n# endif\\n#endif\\n#ifdef FEAT_TIMERS\\n\\t\\\"+timers\\\",\\n#else\\n\\t\\\"-timers\\\",\\n#endif\\n\\t\\\"+title\\\",\\n#ifdef FEAT_TOOLBAR\\n\\t\\\"+toolbar\\\",\\n#else\\n\\t\\\"-toolbar\\\",\\n#endif\\n\\t\\\"+user_commands\\\",\\n#ifdef FEAT_VARTABS\\n\\t\\\"+vartabs\\\",\\n#else\\n\\t\\\"-vartabs\\\",\\n#endif\\n\\t\\\"+vertsplit\\\",\\n\\t\\\"+vim9script\\\",\\n#ifdef FEAT_VIMINFO\\n\\t\\\"+viminfo\\\",\\n#else\\n\\t\\\"-viminfo\\\",\\n#endif\\n\\t\\\"+virtualedit\\\",\\n\\t\\\"+visual\\\",\\n\\t\\\"+visualextra\\\",\\n\\t\\\"+vreplace\\\",\\n#ifdef MSWIN\\n# ifdef FEAT_VTP\\n\\t\\\"+vtp\\\",\\n# else\\n\\t\\\"-vtp\\\",\\n# endif\\n#endif\\n#ifdef FEAT_WILDIGN\\n\\t\\\"+wildignore\\\",\\n#else\\n\\t\\\"-wildignore\\\",\\n#endif\\n#ifdef FEAT_WILDMENU\\n\\t\\\"+wildmenu\\\",\\n#else\\n\\t\\\"-wildmenu\\\",\\n#endif\\n\\t\\\"+windows\\\",\\n#ifdef FEAT_WRITEBACKUP\\n\\t\\\"+writebackup\\\",\\n#else\\n\\t\\\"-writebackup\\\",\\n#endif\\n#if defined(UNIX) || defined(VMS)\\n# ifdef FEAT_X11\\n\\t\\\"+X11\\\",\\n# else\\n\\t\\\"-X11\\\",\\n# endif\\n#endif\\n#ifdef FEAT_XFONTSET\\n\\t\\\"+xfontset\\\",\\n#else\\n\\t\\\"-xfontset\\\",\\n#endif\\n#ifdef FEAT_XIM\\n\\t\\\"+xim\\\",\\n#else\\n\\t\\\"-xim\\\",\\n#endif\\n#if defined(MSWIN)\\n# ifdef FEAT_XPM_W32\\n\\t\\\"+xpm_w32\\\",\\n# else\\n\\t\\\"-xpm_w32\\\",\\n# endif\\n#elif defined(HAVE_XPM)\\n\\t\\\"+xpm\\\",\\n#else\\n\\t\\\"-xpm\\\",\\n#endif\\n#if defined(UNIX) || defined(VMS)\\n# if defined(USE_XSMP_INTERACT)\\n\\t\\\"+xsmp_interact\\\",\\n# elif defined(USE_XSMP)\\n\\t\\\"+xsmp\\\",\\n# else\\n\\t\\\"-xsmp\\\",\\n# endif\\n# ifdef FEAT_XCLIPBOARD\\n\\t\\\"+xterm_clipboard\\\",\\n# else\\n\\t\\\"-xterm_clipboard\\\",\\n# endif\\n#endif\\n#ifdef FEAT_XTERM_SAVE\\n\\t\\\"+xterm_save\\\",\\n#else\\n\\t\\\"-xterm_save\\\",\\n#endif\\n\\tNULL\\n};\",\n \"static int included_patches[] =\\n{ /* Add new patch number below this line */\",\n \"/**/\\n 4919,\",\n \"/**/\\n 4918,\\n/**/\\n 4917,\\n/**/\\n 4916,\\n/**/\\n 4915,\\n/**/\\n 4914,\\n/**/\\n 4913,\\n/**/\\n 4912,\\n/**/\\n 4911,\\n/**/\\n 4910,\\n/**/\\n 4909,\\n/**/\\n 4908,\\n/**/\\n 4907,\\n/**/\\n 4906,\\n/**/\\n 4905,\\n/**/\\n 4904,\\n/**/\\n 4903,\\n/**/\\n 4902,\\n/**/\\n 4901,\\n/**/\\n 4900,\\n/**/\\n 4899,\\n/**/\\n 4898,\\n/**/\\n 4897,\\n/**/\\n 4896,\\n/**/\\n 4895,\\n/**/\\n 4894,\\n/**/\\n 4893,\\n/**/\\n 4892,\\n/**/\\n 4891,\\n/**/\\n 4890,\\n/**/\\n 4889,\\n/**/\\n 4888,\\n/**/\\n 4887,\\n/**/\\n 4886,\\n/**/\\n 4885,\\n/**/\\n 4884,\\n/**/\\n 4883,\\n/**/\\n 4882,\\n/**/\\n 4881,\\n/**/\\n 4880,\\n/**/\\n 4879,\\n/**/\\n 4878,\\n/**/\\n 4877,\\n/**/\\n 4876,\\n/**/\\n 4875,\\n/**/\\n 4874,\\n/**/\\n 4873,\\n/**/\\n 4872,\\n/**/\\n 4871,\\n/**/\\n 4870,\\n/**/\\n 4869,\\n/**/\\n 4868,\\n/**/\\n 4867,\\n/**/\\n 4866,\\n/**/\\n 4865,\\n/**/\\n 4864,\\n/**/\\n 4863,\\n/**/\\n 4862,\\n/**/\\n 4861,\\n/**/\\n 4860,\\n/**/\\n 4859,\\n/**/\\n 4858,\\n/**/\\n 4857,\\n/**/\\n 4856,\\n/**/\\n 4855,\\n/**/\\n 4854,\\n/**/\\n 4853,\\n/**/\\n 4852,\\n/**/\\n 4851,\\n/**/\\n 4850,\\n/**/\\n 4849,\\n/**/\\n 4848,\\n/**/\\n 4847,\\n/**/\\n 4846,\\n/**/\\n 4845,\\n/**/\\n 4844,\\n/**/\\n 4843,\\n/**/\\n 4842,\\n/**/\\n 4841,\\n/**/\\n 4840,\\n/**/\\n 4839,\\n/**/\\n 4838,\\n/**/\\n 4837,\\n/**/\\n 4836,\\n/**/\\n 4835,\\n/**/\\n 4834,\\n/**/\\n 4833,\\n/**/\\n 4832,\\n/**/\\n 4831,\\n/**/\\n 4830,\\n/**/\\n 4829,\\n/**/\\n 4828,\\n/**/\\n 4827,\\n/**/\\n 4826,\\n/**/\\n 4825,\\n/**/\\n 4824,\\n/**/\\n 4823,\\n/**/\\n 4822,\\n/**/\\n 4821,\\n/**/\\n 4820,\\n/**/\\n 4819,\\n/**/\\n 4818,\\n/**/\\n 4817,\\n/**/\\n 4816,\\n/**/\\n 4815,\\n/**/\\n 4814,\\n/**/\\n 4813,\\n/**/\\n 4812,\\n/**/\\n 4811,\\n/**/\\n 4810,\\n/**/\\n 4809,\\n/**/\\n 4808,\\n/**/\\n 4807,\\n/**/\\n 4806,\\n/**/\\n 4805,\\n/**/\\n 4804,\\n/**/\\n 4803,\\n/**/\\n 4802,\\n/**/\\n 4801,\\n/**/\\n 4800,\\n/**/\\n 4799,\\n/**/\\n 4798,\\n/**/\\n 4797,\\n/**/\\n 4796,\\n/**/\\n 4795,\\n/**/\\n 4794,\\n/**/\\n 4793,\\n/**/\\n 4792,\\n/**/\\n 4791,\\n/**/\\n 4790,\\n/**/\\n 4789,\\n/**/\\n 4788,\\n/**/\\n 4787,\\n/**/\\n 4786,\\n/**/\\n 4785,\\n/**/\\n 4784,\\n/**/\\n 4783,\\n/**/\\n 4782,\\n/**/\\n 4781,\\n/**/\\n 4780,\\n/**/\\n 4779,\\n/**/\\n 4778,\\n/**/\\n 4777,\\n/**/\\n 4776,\\n/**/\\n 4775,\\n/**/\\n 4774,\\n/**/\\n 4773,\\n/**/\\n 4772,\\n/**/\\n 4771,\\n/**/\\n 4770,\\n/**/\\n 4769,\\n/**/\\n 4768,\\n/**/\\n 4767,\\n/**/\\n 4766,\\n/**/\\n 4765,\\n/**/\\n 4764,\\n/**/\\n 4763,\\n/**/\\n 4762,\\n/**/\\n 4761,\\n/**/\\n 4760,\\n/**/\\n 4759,\\n/**/\\n 4758,\\n/**/\\n 4757,\\n/**/\\n 4756,\\n/**/\\n 4755,\\n/**/\\n 4754,\\n/**/\\n 4753,\\n/**/\\n 4752,\\n/**/\\n 4751,\\n/**/\\n 4750,\\n/**/\\n 4749,\\n/**/\\n 4748,\\n/**/\\n 4747,\\n/**/\\n 4746,\\n/**/\\n 4745,\\n/**/\\n 4744,\\n/**/\\n 4743,\\n/**/\\n 4742,\\n/**/\\n 4741,\\n/**/\\n 4740,\\n/**/\\n 4739,\\n/**/\\n 4738,\\n/**/\\n 4737,\\n/**/\\n 4736,\\n/**/\\n 4735,\\n/**/\\n 4734,\\n/**/\\n 4733,\\n/**/\\n 4732,\\n/**/\\n 4731,\\n/**/\\n 4730,\\n/**/\\n 4729,\\n/**/\\n 4728,\\n/**/\\n 4727,\\n/**/\\n 4726,\\n/**/\\n 4725,\\n/**/\\n 4724,\\n/**/\\n 4723,\\n/**/\\n 4722,\\n/**/\\n 4721,\\n/**/\\n 4720,\\n/**/\\n 4719,\\n/**/\\n 4718,\\n/**/\\n 4717,\\n/**/\\n 4716,\\n/**/\\n 4715,\\n/**/\\n 4714,\\n/**/\\n 4713,\\n/**/\\n 4712,\\n/**/\\n 4711,\\n/**/\\n 4710,\\n/**/\\n 4709,\\n/**/\\n 4708,\\n/**/\\n 4707,\\n/**/\\n 4706,\\n/**/\\n 4705,\\n/**/\\n 4704,\\n/**/\\n 4703,\\n/**/\\n 4702,\\n/**/\\n 4701,\\n/**/\\n 4700,\\n/**/\\n 4699,\\n/**/\\n 4698,\\n/**/\\n 4697,\\n/**/\\n 4696,\\n/**/\\n 4695,\\n/**/\\n 4694,\\n/**/\\n 4693,\\n/**/\\n 4692,\\n/**/\\n 4691,\\n/**/\\n 4690,\\n/**/\\n 4689,\\n/**/\\n 4688,\\n/**/\\n 4687,\\n/**/\\n 4686,\\n/**/\\n 4685,\\n/**/\\n 4684,\\n/**/\\n 4683,\\n/**/\\n 4682,\\n/**/\\n 4681,\\n/**/\\n 4680,\\n/**/\\n 4679,\\n/**/\\n 4678,\\n/**/\\n 4677,\\n/**/\\n 4676,\\n/**/\\n 4675,\\n/**/\\n 4674,\\n/**/\\n 4673,\\n/**/\\n 4672,\\n/**/\\n 4671,\\n/**/\\n 4670,\\n/**/\\n 4669,\\n/**/\\n 4668,\\n/**/\\n 4667,\\n/**/\\n 4666,\\n/**/\\n 4665,\\n/**/\\n 4664,\\n/**/\\n 4663,\\n/**/\\n 4662,\\n/**/\\n 4661,\\n/**/\\n 4660,\\n/**/\\n 4659,\\n/**/\\n 4658,\\n/**/\\n 4657,\\n/**/\\n 4656,\\n/**/\\n 4655,\\n/**/\\n 4654,\\n/**/\\n 4653,\\n/**/\\n 4652,\\n/**/\\n 4651,\\n/**/\\n 4650,\\n/**/\\n 4649,\\n/**/\\n 4648,\\n/**/\\n 4647,\\n/**/\\n 4646,\\n/**/\\n 4645,\\n/**/\\n 4644,\\n/**/\\n 4643,\\n/**/\\n 4642,\\n/**/\\n 4641,\\n/**/\\n 4640,\\n/**/\\n 4639,\\n/**/\\n 4638,\\n/**/\\n 4637,\\n/**/\\n 4636,\\n/**/\\n 4635,\\n/**/\\n 4634,\\n/**/\\n 4633,\\n/**/\\n 4632,\\n/**/\\n 4631,\\n/**/\\n 4630,\\n/**/\\n 4629,\\n/**/\\n 4628,\\n/**/\\n 4627,\\n/**/\\n 4626,\\n/**/\\n 4625,\\n/**/\\n 4624,\\n/**/\\n 4623,\\n/**/\\n 4622,\\n/**/\\n 4621,\\n/**/\\n 4620,\\n/**/\\n 4619,\\n/**/\\n 4618,\\n/**/\\n 4617,\\n/**/\\n 4616,\\n/**/\\n 4615,\\n/**/\\n 4614,\\n/**/\\n 4613,\\n/**/\\n 4612,\\n/**/\\n 4611,\\n/**/\\n 4610,\\n/**/\\n 4609,\\n/**/\\n 4608,\\n/**/\\n 4607,\\n/**/\\n 4606,\\n/**/\\n 4605,\\n/**/\\n 4604,\\n/**/\\n 4603,\\n/**/\\n 4602,\\n/**/\\n 4601,\\n/**/\\n 4600,\\n/**/\\n 4599,\\n/**/\\n 4598,\\n/**/\\n 4597,\\n/**/\\n 4596,\\n/**/\\n 4595,\\n/**/\\n 4594,\\n/**/\\n 4593,\\n/**/\\n 4592,\\n/**/\\n 4591,\\n/**/\\n 4590,\\n/**/\\n 4589,\\n/**/\\n 4588,\\n/**/\\n 4587,\\n/**/\\n 4586,\\n/**/\\n 4585,\\n/**/\\n 4584,\\n/**/\\n 4583,\\n/**/\\n 4582,\\n/**/\\n 4581,\\n/**/\\n 4580,\\n/**/\\n 4579,\\n/**/\\n 4578,\\n/**/\\n 4577,\\n/**/\\n 4576,\\n/**/\\n 4575,\\n/**/\\n 4574,\\n/**/\\n 4573,\\n/**/\\n 4572,\\n/**/\\n 4571,\\n/**/\\n 4570,\\n/**/\\n 4569,\\n/**/\\n 4568,\\n/**/\\n 4567,\\n/**/\\n 4566,\\n/**/\\n 4565,\\n/**/\\n 4564,\\n/**/\\n 4563,\\n/**/\\n 4562,\\n/**/\\n 4561,\\n/**/\\n 4560,\\n/**/\\n 4559,\\n/**/\\n 4558,\\n/**/\\n 4557,\\n/**/\\n 4556,\\n/**/\\n 4555,\\n/**/\\n 4554,\\n/**/\\n 4553,\\n/**/\\n 4552,\\n/**/\\n 4551,\\n/**/\\n 4550,\\n/**/\\n 4549,\\n/**/\\n 4548,\\n/**/\\n 4547,\\n/**/\\n 4546,\\n/**/\\n 4545,\\n/**/\\n 4544,\\n/**/\\n 4543,\\n/**/\\n 4542,\\n/**/\\n 4541,\\n/**/\\n 4540,\\n/**/\\n 4539,\\n/**/\\n 4538,\\n/**/\\n 4537,\\n/**/\\n 4536,\\n/**/\\n 4535,\\n/**/\\n 4534,\\n/**/\\n 4533,\\n/**/\\n 4532,\\n/**/\\n 4531,\\n/**/\\n 4530,\\n/**/\\n 4529,\\n/**/\\n 4528,\\n/**/\\n 4527,\\n/**/\\n 4526,\\n/**/\\n 4525,\\n/**/\\n 4524,\\n/**/\\n 4523,\\n/**/\\n 4522,\\n/**/\\n 4521,\\n/**/\\n 4520,\\n/**/\\n 4519,\\n/**/\\n 4518,\\n/**/\\n 4517,\\n/**/\\n 4516,\\n/**/\\n 4515,\\n/**/\\n 4514,\\n/**/\\n 4513,\\n/**/\\n 4512,\\n/**/\\n 4511,\\n/**/\\n 4510,\\n/**/\\n 4509,\\n/**/\\n 4508,\\n/**/\\n 4507,\\n/**/\\n 4506,\\n/**/\\n 4505,\\n/**/\\n 4504,\\n/**/\\n 4503,\\n/**/\\n 4502,\\n/**/\\n 4501,\\n/**/\\n 4500,\\n/**/\\n 4499,\\n/**/\\n 4498,\\n/**/\\n 4497,\\n/**/\\n 4496,\\n/**/\\n 4495,\\n/**/\\n 4494,\\n/**/\\n 4493,\\n/**/\\n 4492,\\n/**/\\n 4491,\\n/**/\\n 4490,\\n/**/\\n 4489,\\n/**/\\n 4488,\\n/**/\\n 4487,\\n/**/\\n 4486,\\n/**/\\n 4485,\\n/**/\\n 4484,\\n/**/\\n 4483,\\n/**/\\n 4482,\\n/**/\\n 4481,\\n/**/\\n 4480,\\n/**/\\n 4479,\\n/**/\\n 4478,\\n/**/\\n 4477,\\n/**/\\n 4476,\\n/**/\\n 4475,\\n/**/\\n 4474,\\n/**/\\n 4473,\\n/**/\\n 4472,\\n/**/\\n 4471,\\n/**/\\n 4470,\\n/**/\\n 4469,\\n/**/\\n 4468,\\n/**/\\n 4467,\\n/**/\\n 4466,\\n/**/\\n 4465,\\n/**/\\n 4464,\\n/**/\\n 4463,\\n/**/\\n 4462,\\n/**/\\n 4461,\\n/**/\\n 4460,\\n/**/\\n 4459,\\n/**/\\n 4458,\\n/**/\\n 4457,\\n/**/\\n 4456,\\n/**/\\n 4455,\\n/**/\\n 4454,\\n/**/\\n 4453,\\n/**/\\n 4452,\\n/**/\\n 4451,\\n/**/\\n 4450,\\n/**/\\n 4449,\\n/**/\\n 4448,\\n/**/\\n 4447,\\n/**/\\n 4446,\\n/**/\\n 4445,\\n/**/\\n 4444,\\n/**/\\n 4443,\\n/**/\\n 4442,\\n/**/\\n 4441,\\n/**/\\n 4440,\\n/**/\\n 4439,\\n/**/\\n 4438,\\n/**/\\n 4437,\\n/**/\\n 4436,\\n/**/\\n 4435,\\n/**/\\n 4434,\\n/**/\\n 4433,\\n/**/\\n 4432,\\n/**/\\n 4431,\\n/**/\\n 4430,\\n/**/\\n 4429,\\n/**/\\n 4428,\\n/**/\\n 4427,\\n/**/\\n 4426,\\n/**/\\n 4425,\\n/**/\\n 4424,\\n/**/\\n 4423,\\n/**/\\n 4422,\\n/**/\\n 4421,\\n/**/\\n 4420,\\n/**/\\n 4419,\\n/**/\\n 4418,\\n/**/\\n 4417,\\n/**/\\n 4416,\\n/**/\\n 4415,\\n/**/\\n 4414,\\n/**/\\n 4413,\\n/**/\\n 4412,\\n/**/\\n 4411,\\n/**/\\n 4410,\\n/**/\\n 4409,\\n/**/\\n 4408,\\n/**/\\n 4407,\\n/**/\\n 4406,\\n/**/\\n 4405,\\n/**/\\n 4404,\\n/**/\\n 4403,\\n/**/\\n 4402,\\n/**/\\n 4401,\\n/**/\\n 4400,\\n/**/\\n 4399,\\n/**/\\n 4398,\\n/**/\\n 4397,\\n/**/\\n 4396,\\n/**/\\n 4395,\\n/**/\\n 4394,\\n/**/\\n 4393,\\n/**/\\n 4392,\\n/**/\\n 4391,\\n/**/\\n 4390,\\n/**/\\n 4389,\\n/**/\\n 4388,\\n/**/\\n 4387,\\n/**/\\n 4386,\\n/**/\\n 4385,\\n/**/\\n 4384,\\n/**/\\n 4383,\\n/**/\\n 4382,\\n/**/\\n 4381,\\n/**/\\n 4380,\\n/**/\\n 4379,\\n/**/\\n 4378,\\n/**/\\n 4377,\\n/**/\\n 4376,\\n/**/\\n 4375,\\n/**/\\n 4374,\\n/**/\\n 4373,\\n/**/\\n 4372,\\n/**/\\n 4371,\\n/**/\\n 4370,\\n/**/\\n 4369,\\n/**/\\n 4368,\\n/**/\\n 4367,\\n/**/\\n 4366,\\n/**/\\n 4365,\\n/**/\\n 4364,\\n/**/\\n 4363,\\n/**/\\n 4362,\\n/**/\\n 4361,\\n/**/\\n 4360,\\n/**/\\n 4359,\\n/**/\\n 4358,\\n/**/\\n 4357,\\n/**/\\n 4356,\\n/**/\\n 4355,\\n/**/\\n 4354,\\n/**/\\n 4353,\\n/**/\\n 4352,\\n/**/\\n 4351,\\n/**/\\n 4350,\\n/**/\\n 4349,\\n/**/\\n 4348,\\n/**/\\n 4347,\\n/**/\\n 4346,\\n/**/\\n 4345,\\n/**/\\n 4344,\\n/**/\\n 4343,\\n/**/\\n 4342,\\n/**/\\n 4341,\\n/**/\\n 4340,\\n/**/\\n 4339,\\n/**/\\n 4338,\\n/**/\\n 4337,\\n/**/\\n 4336,\\n/**/\\n 4335,\\n/**/\\n 4334,\\n/**/\\n 4333,\\n/**/\\n 4332,\\n/**/\\n 4331,\\n/**/\\n 4330,\\n/**/\\n 4329,\\n/**/\\n 4328,\\n/**/\\n 4327,\\n/**/\\n 4326,\\n/**/\\n 4325,\\n/**/\\n 4324,\\n/**/\\n 4323,\\n/**/\\n 4322,\\n/**/\\n 4321,\\n/**/\\n 4320,\\n/**/\\n 4319,\\n/**/\\n 4318,\\n/**/\\n 4317,\\n/**/\\n 4316,\\n/**/\\n 4315,\\n/**/\\n 4314,\\n/**/\\n 4313,\\n/**/\\n 4312,\\n/**/\\n 4311,\\n/**/\\n 4310,\\n/**/\\n 4309,\\n/**/\\n 4308,\\n/**/\\n 4307,\\n/**/\\n 4306,\\n/**/\\n 4305,\\n/**/\\n 4304,\\n/**/\\n 4303,\\n/**/\\n 4302,\\n/**/\\n 4301,\\n/**/\\n 4300,\\n/**/\\n 4299,\\n/**/\\n 4298,\\n/**/\\n 4297,\\n/**/\\n 4296,\\n/**/\\n 4295,\\n/**/\\n 4294,\\n/**/\\n 4293,\\n/**/\\n 4292,\\n/**/\\n 4291,\\n/**/\\n 4290,\\n/**/\\n 4289,\\n/**/\\n 4288,\\n/**/\\n 4287,\\n/**/\\n 4286,\\n/**/\\n 4285,\\n/**/\\n 4284,\\n/**/\\n 4283,\\n/**/\\n 4282,\\n/**/\\n 4281,\\n/**/\\n 4280,\\n/**/\\n 4279,\\n/**/\\n 4278,\\n/**/\\n 4277,\\n/**/\\n 4276,\\n/**/\\n 4275,\\n/**/\\n 4274,\\n/**/\\n 4273,\\n/**/\\n 4272,\\n/**/\\n 4271,\\n/**/\\n 4270,\\n/**/\\n 4269,\\n/**/\\n 4268,\\n/**/\\n 4267,\\n/**/\\n 4266,\\n/**/\\n 4265,\\n/**/\\n 4264,\\n/**/\\n 4263,\\n/**/\\n 4262,\\n/**/\\n 4261,\\n/**/\\n 4260,\\n/**/\\n 4259,\\n/**/\\n 4258,\\n/**/\\n 4257,\\n/**/\\n 4256,\\n/**/\\n 4255,\\n/**/\\n 4254,\\n/**/\\n 4253,\\n/**/\\n 4252,\\n/**/\\n 4251,\\n/**/\\n 4250,\\n/**/\\n 4249,\\n/**/\\n 4248,\\n/**/\\n 4247,\\n/**/\\n 4246,\\n/**/\\n 4245,\\n/**/\\n 4244,\\n/**/\\n 4243,\\n/**/\\n 4242,\\n/**/\\n 4241,\\n/**/\\n 4240,\\n/**/\\n 4239,\\n/**/\\n 4238,\\n/**/\\n 4237,\\n/**/\\n 4236,\\n/**/\\n 4235,\\n/**/\\n 4234,\\n/**/\\n 4233,\\n/**/\\n 4232,\\n/**/\\n 4231,\\n/**/\\n 4230,\\n/**/\\n 4229,\\n/**/\\n 4228,\\n/**/\\n 4227,\\n/**/\\n 4226,\\n/**/\\n 4225,\\n/**/\\n 4224,\\n/**/\\n 4223,\\n/**/\\n 4222,\\n/**/\\n 4221,\\n/**/\\n 4220,\\n/**/\\n 4219,\\n/**/\\n 4218,\\n/**/\\n 4217,\\n/**/\\n 4216,\\n/**/\\n 4215,\\n/**/\\n 4214,\\n/**/\\n 4213,\\n/**/\\n 4212,\\n/**/\\n 4211,\\n/**/\\n 4210,\\n/**/\\n 4209,\\n/**/\\n 4208,\\n/**/\\n 4207,\\n/**/\\n 4206,\\n/**/\\n 4205,\\n/**/\\n 4204,\\n/**/\\n 4203,\\n/**/\\n 4202,\\n/**/\\n 4201,\\n/**/\\n 4200,\\n/**/\\n 4199,\\n/**/\\n 4198,\\n/**/\\n 4197,\\n/**/\\n 4196,\\n/**/\\n 4195,\\n/**/\\n 4194,\\n/**/\\n 4193,\\n/**/\\n 4192,\\n/**/\\n 4191,\\n/**/\\n 4190,\\n/**/\\n 4189,\\n/**/\\n 4188,\\n/**/\\n 4187,\\n/**/\\n 4186,\\n/**/\\n 4185,\\n/**/\\n 4184,\\n/**/\\n 4183,\\n/**/\\n 4182,\\n/**/\\n 4181,\\n/**/\\n 4180,\\n/**/\\n 4179,\\n/**/\\n 4178,\\n/**/\\n 4177,\\n/**/\\n 4176,\\n/**/\\n 4175,\\n/**/\\n 4174,\\n/**/\\n 4173,\\n/**/\\n 4172,\\n/**/\\n 4171,\\n/**/\\n 4170,\\n/**/\\n 4169,\\n/**/\\n 4168,\\n/**/\\n 4167,\\n/**/\\n 4166,\\n/**/\\n 4165,\\n/**/\\n 4164,\\n/**/\\n 4163,\\n/**/\\n 4162,\\n/**/\\n 4161,\\n/**/\\n 4160,\\n/**/\\n 4159,\\n/**/\\n 4158,\\n/**/\\n 4157,\\n/**/\\n 4156,\\n/**/\\n 4155,\\n/**/\\n 4154,\\n/**/\\n 4153,\\n/**/\\n 4152,\\n/**/\\n 4151,\\n/**/\\n 4150,\\n/**/\\n 4149,\\n/**/\\n 4148,\\n/**/\\n 4147,\\n/**/\\n 4146,\\n/**/\\n 4145,\\n/**/\\n 4144,\\n/**/\\n 4143,\\n/**/\\n 4142,\\n/**/\\n 4141,\\n/**/\\n 4140,\\n/**/\\n 4139,\\n/**/\\n 4138,\\n/**/\\n 4137,\\n/**/\\n 4136,\\n/**/\\n 4135,\\n/**/\\n 4134,\\n/**/\\n 4133,\\n/**/\\n 4132,\\n/**/\\n 4131,\\n/**/\\n 4130,\\n/**/\\n 4129,\\n/**/\\n 4128,\\n/**/\\n 4127,\\n/**/\\n 4126,\\n/**/\\n 4125,\\n/**/\\n 4124,\\n/**/\\n 4123,\\n/**/\\n 4122,\\n/**/\\n 4121,\\n/**/\\n 4120,\\n/**/\\n 4119,\\n/**/\\n 4118,\\n/**/\\n 4117,\\n/**/\\n 4116,\\n/**/\\n 4115,\\n/**/\\n 4114,\\n/**/\\n 4113,\\n/**/\\n 4112,\\n/**/\\n 4111,\\n/**/\\n 4110,\\n/**/\\n 4109,\\n/**/\\n 4108,\\n/**/\\n 4107,\\n/**/\\n 4106,\\n/**/\\n 4105,\\n/**/\\n 4104,\\n/**/\\n 4103,\\n/**/\\n 4102,\\n/**/\\n 4101,\\n/**/\\n 4100,\\n/**/\\n 4099,\\n/**/\\n 4098,\\n/**/\\n 4097,\\n/**/\\n 4096,\\n/**/\\n 4095,\\n/**/\\n 4094,\\n/**/\\n 4093,\\n/**/\\n 4092,\\n/**/\\n 4091,\\n/**/\\n 4090,\\n/**/\\n 4089,\\n/**/\\n 4088,\\n/**/\\n 4087,\\n/**/\\n 4086,\\n/**/\\n 4085,\\n/**/\\n 4084,\\n/**/\\n 4083,\\n/**/\\n 4082,\\n/**/\\n 4081,\\n/**/\\n 4080,\\n/**/\\n 4079,\\n/**/\\n 4078,\\n/**/\\n 4077,\\n/**/\\n 4076,\\n/**/\\n 4075,\\n/**/\\n 4074,\\n/**/\\n 4073,\\n/**/\\n 4072,\\n/**/\\n 4071,\\n/**/\\n 4070,\\n/**/\\n 4069,\\n/**/\\n 4068,\\n/**/\\n 4067,\\n/**/\\n 4066,\\n/**/\\n 4065,\\n/**/\\n 4064,\\n/**/\\n 4063,\\n/**/\\n 4062,\\n/**/\\n 4061,\\n/**/\\n 4060,\\n/**/\\n 4059,\\n/**/\\n 4058,\\n/**/\\n 4057,\\n/**/\\n 4056,\\n/**/\\n 4055,\\n/**/\\n 4054,\\n/**/\\n 4053,\\n/**/\\n 4052,\\n/**/\\n 4051,\\n/**/\\n 4050,\\n/**/\\n 4049,\\n/**/\\n 4048,\\n/**/\\n 4047,\\n/**/\\n 4046,\\n/**/\\n 4045,\\n/**/\\n 4044,\\n/**/\\n 4043,\\n/**/\\n 4042,\\n/**/\\n 4041,\\n/**/\\n 4040,\\n/**/\\n 4039,\\n/**/\\n 4038,\\n/**/\\n 4037,\\n/**/\\n 4036,\\n/**/\\n 4035,\\n/**/\\n 4034,\\n/**/\\n 4033,\\n/**/\\n 4032,\\n/**/\\n 4031,\\n/**/\\n 4030,\\n/**/\\n 4029,\\n/**/\\n 4028,\\n/**/\\n 4027,\\n/**/\\n 4026,\\n/**/\\n 4025,\\n/**/\\n 4024,\\n/**/\\n 4023,\\n/**/\\n 4022,\\n/**/\\n 4021,\\n/**/\\n 4020,\\n/**/\\n 4019,\\n/**/\\n 4018,\\n/**/\\n 4017,\\n/**/\\n 4016,\\n/**/\\n 4015,\\n/**/\\n 4014,\\n/**/\\n 4013,\\n/**/\\n 4012,\\n/**/\\n 4011,\\n/**/\\n 4010,\\n/**/\\n 4009,\\n/**/\\n 4008,\\n/**/\\n 4007,\\n/**/\\n 4006,\\n/**/\\n 4005,\\n/**/\\n 4004,\\n/**/\\n 4003,\\n/**/\\n 4002,\\n/**/\\n 4001,\\n/**/\\n 4000,\\n/**/\\n 3999,\\n/**/\\n 3998,\\n/**/\\n 3997,\\n/**/\\n 3996,\\n/**/\\n 3995,\\n/**/\\n 3994,\\n/**/\\n 3993,\\n/**/\\n 3992,\\n/**/\\n 3991,\\n/**/\\n 3990,\\n/**/\\n 3989,\\n/**/\\n 3988,\\n/**/\\n 3987,\\n/**/\\n 3986,\\n/**/\\n 3985,\\n/**/\\n 3984,\\n/**/\\n 3983,\\n/**/\\n 3982,\\n/**/\\n 3981,\\n/**/\\n 3980,\\n/**/\\n 3979,\\n/**/\\n 3978,\\n/**/\\n 3977,\\n/**/\\n 3976,\\n/**/\\n 3975,\\n/**/\\n 3974,\\n/**/\\n 3973,\\n/**/\\n 3972,\\n/**/\\n 3971,\\n/**/\\n 3970,\\n/**/\\n 3969,\\n/**/\\n 3968,\\n/**/\\n 3967,\\n/**/\\n 3966,\\n/**/\\n 3965,\\n/**/\\n 3964,\\n/**/\\n 3963,\\n/**/\\n 3962,\\n/**/\\n 3961,\\n/**/\\n 3960,\\n/**/\\n 3959,\\n/**/\\n 3958,\\n/**/\\n 3957,\\n/**/\\n 3956,\\n/**/\\n 3955,\\n/**/\\n 3954,\\n/**/\\n 3953,\\n/**/\\n 3952,\\n/**/\\n 3951,\\n/**/\\n 3950,\\n/**/\\n 3949,\\n/**/\\n 3948,\\n/**/\\n 3947,\\n/**/\\n 3946,\\n/**/\\n 3945,\\n/**/\\n 3944,\\n/**/\\n 3943,\\n/**/\\n 3942,\\n/**/\\n 3941,\\n/**/\\n 3940,\\n/**/\\n 3939,\\n/**/\\n 3938,\\n/**/\\n 3937,\\n/**/\\n 3936,\\n/**/\\n 3935,\\n/**/\\n 3934,\\n/**/\\n 3933,\\n/**/\\n 3932,\\n/**/\\n 3931,\\n/**/\\n 3930,\\n/**/\\n 3929,\\n/**/\\n 3928,\\n/**/\\n 3927,\\n/**/\\n 3926,\\n/**/\\n 3925,\\n/**/\\n 3924,\\n/**/\\n 3923,\\n/**/\\n 3922,\\n/**/\\n 3921,\\n/**/\\n 3920,\\n/**/\\n 3919,\\n/**/\\n 3918,\\n/**/\\n 3917,\\n/**/\\n 3916,\\n/**/\\n 3915,\\n/**/\\n 3914,\\n/**/\\n 3913,\\n/**/\\n 3912,\\n/**/\\n 3911,\\n/**/\\n 3910,\\n/**/\\n 3909,\\n/**/\\n 3908,\\n/**/\\n 3907,\\n/**/\\n 3906,\\n/**/\\n 3905,\\n/**/\\n 3904,\\n/**/\\n 3903,\\n/**/\\n 3902,\\n/**/\\n 3901,\\n/**/\\n 3900,\\n/**/\\n 3899,\\n/**/\\n 3898,\\n/**/\\n 3897,\\n/**/\\n 3896,\\n/**/\\n 3895,\\n/**/\\n 3894,\\n/**/\\n 3893,\\n/**/\\n 3892,\\n/**/\\n 3891,\\n/**/\\n 3890,\\n/**/\\n 3889,\\n/**/\\n 3888,\\n/**/\\n 3887,\\n/**/\\n 3886,\\n/**/\\n 3885,\\n/**/\\n 3884,\\n/**/\\n 3883,\\n/**/\\n 3882,\\n/**/\\n 3881,\\n/**/\\n 3880,\\n/**/\\n 3879,\\n/**/\\n 3878,\\n/**/\\n 3877,\\n/**/\\n 3876,\\n/**/\\n 3875,\\n/**/\\n 3874,\\n/**/\\n 3873,\\n/**/\\n 3872,\\n/**/\\n 3871,\\n/**/\\n 3870,\\n/**/\\n 3869,\\n/**/\\n 3868,\\n/**/\\n 3867,\\n/**/\\n 3866,\\n/**/\\n 3865,\\n/**/\\n 3864,\\n/**/\\n 3863,\\n/**/\\n 3862,\\n/**/\\n 3861,\\n/**/\\n 3860,\\n/**/\\n 3859,\\n/**/\\n 3858,\\n/**/\\n 3857,\\n/**/\\n 3856,\\n/**/\\n 3855,\\n/**/\\n 3854,\\n/**/\\n 3853,\\n/**/\\n 3852,\\n/**/\\n 3851,\\n/**/\\n 3850,\\n/**/\\n 3849,\\n/**/\\n 3848,\\n/**/\\n 3847,\\n/**/\\n 3846,\\n/**/\\n 3845,\\n/**/\\n 3844,\\n/**/\\n 3843,\\n/**/\\n 3842,\\n/**/\\n 3841,\\n/**/\\n 3840,\\n/**/\\n 3839,\\n/**/\\n 3838,\\n/**/\\n 3837,\\n/**/\\n 3836,\\n/**/\\n 3835,\\n/**/\\n 3834,\\n/**/\\n 3833,\\n/**/\\n 3832,\\n/**/\\n 3831,\\n/**/\\n 3830,\\n/**/\\n 3829,\\n/**/\\n 3828,\\n/**/\\n 3827,\\n/**/\\n 3826,\\n/**/\\n 3825,\\n/**/\\n 3824,\\n/**/\\n 3823,\\n/**/\\n 3822,\\n/**/\\n 3821,\\n/**/\\n 3820,\\n/**/\\n 3819,\\n/**/\\n 3818,\\n/**/\\n 3817,\\n/**/\\n 3816,\\n/**/\\n 3815,\\n/**/\\n 3814,\\n/**/\\n 3813,\\n/**/\\n 3812,\\n/**/\\n 3811,\\n/**/\\n 3810,\\n/**/\\n 3809,\\n/**/\\n 3808,\\n/**/\\n 3807,\\n/**/\\n 3806,\\n/**/\\n 3805,\\n/**/\\n 3804,\\n/**/\\n 3803,\\n/**/\\n 3802,\\n/**/\\n 3801,\\n/**/\\n 3800,\\n/**/\\n 3799,\\n/**/\\n 3798,\\n/**/\\n 3797,\\n/**/\\n 3796,\\n/**/\\n 3795,\\n/**/\\n 3794,\\n/**/\\n 3793,\\n/**/\\n 3792,\\n/**/\\n 3791,\\n/**/\\n 3790,\\n/**/\\n 3789,\\n/**/\\n 3788,\\n/**/\\n 3787,\\n/**/\\n 3786,\\n/**/\\n 3785,\\n/**/\\n 3784,\\n/**/\\n 3783,\\n/**/\\n 3782,\\n/**/\\n 3781,\\n/**/\\n 3780,\\n/**/\\n 3779,\\n/**/\\n 3778,\\n/**/\\n 3777,\\n/**/\\n 3776,\\n/**/\\n 3775,\\n/**/\\n 3774,\\n/**/\\n 3773,\\n/**/\\n 3772,\\n/**/\\n 3771,\\n/**/\\n 3770,\\n/**/\\n 3769,\\n/**/\\n 3768,\\n/**/\\n 3767,\\n/**/\\n 3766,\\n/**/\\n 3765,\\n/**/\\n 3764,\\n/**/\\n 3763,\\n/**/\\n 3762,\\n/**/\\n 3761,\\n/**/\\n 3760,\\n/**/\\n 3759,\\n/**/\\n 3758,\\n/**/\\n 3757,\\n/**/\\n 3756,\\n/**/\\n 3755,\\n/**/\\n 3754,\\n/**/\\n 3753,\\n/**/\\n 3752,\\n/**/\\n 3751,\\n/**/\\n 3750,\\n/**/\\n 3749,\\n/**/\\n 3748,\\n/**/\\n 3747,\\n/**/\\n 3746,\\n/**/\\n 3745,\\n/**/\\n 3744,\\n/**/\\n 3743,\\n/**/\\n 3742,\\n/**/\\n 3741,\\n/**/\\n 3740,\\n/**/\\n 3739,\\n/**/\\n 3738,\\n/**/\\n 3737,\\n/**/\\n 3736,\\n/**/\\n 3735,\\n/**/\\n 3734,\\n/**/\\n 3733,\\n/**/\\n 3732,\\n/**/\\n 3731,\\n/**/\\n 3730,\\n/**/\\n 3729,\\n/**/\\n 3728,\\n/**/\\n 3727,\\n/**/\\n 3726,\\n/**/\\n 3725,\\n/**/\\n 3724,\\n/**/\\n 3723,\\n/**/\\n 3722,\\n/**/\\n 3721,\\n/**/\\n 3720,\\n/**/\\n 3719,\\n/**/\\n 3718,\\n/**/\\n 3717,\\n/**/\\n 3716,\\n/**/\\n 3715,\\n/**/\\n 3714,\\n/**/\\n 3713,\\n/**/\\n 3712,\\n/**/\\n 3711,\\n/**/\\n 3710,\\n/**/\\n 3709,\\n/**/\\n 3708,\\n/**/\\n 3707,\\n/**/\\n 3706,\\n/**/\\n 3705,\\n/**/\\n 3704,\\n/**/\\n 3703,\\n/**/\\n 3702,\\n/**/\\n 3701,\\n/**/\\n 3700,\\n/**/\\n 3699,\\n/**/\\n 3698,\\n/**/\\n 3697,\\n/**/\\n 3696,\\n/**/\\n 3695,\\n/**/\\n 3694,\\n/**/\\n 3693,\\n/**/\\n 3692,\\n/**/\\n 3691,\\n/**/\\n 3690,\\n/**/\\n 3689,\\n/**/\\n 3688,\\n/**/\\n 3687,\\n/**/\\n 3686,\\n/**/\\n 3685,\\n/**/\\n 3684,\\n/**/\\n 3683,\\n/**/\\n 3682,\\n/**/\\n 3681,\\n/**/\\n 3680,\\n/**/\\n 3679,\\n/**/\\n 3678,\\n/**/\\n 3677,\\n/**/\\n 3676,\\n/**/\\n 3675,\\n/**/\\n 3674,\\n/**/\\n 3673,\\n/**/\\n 3672,\\n/**/\\n 3671,\\n/**/\\n 3670,\\n/**/\\n 3669,\\n/**/\\n 3668,\\n/**/\\n 3667,\\n/**/\\n 3666,\\n/**/\\n 3665,\\n/**/\\n 3664,\\n/**/\\n 3663,\\n/**/\\n 3662,\\n/**/\\n 3661,\\n/**/\\n 3660,\\n/**/\\n 3659,\\n/**/\\n 3658,\\n/**/\\n 3657,\\n/**/\\n 3656,\\n/**/\\n 3655,\\n/**/\\n 3654,\\n/**/\\n 3653,\\n/**/\\n 3652,\\n/**/\\n 3651,\\n/**/\\n 3650,\\n/**/\\n 3649,\\n/**/\\n 3648,\\n/**/\\n 3647,\\n/**/\\n 3646,\\n/**/\\n 3645,\\n/**/\\n 3644,\\n/**/\\n 3643,\\n/**/\\n 3642,\\n/**/\\n 3641,\\n/**/\\n 3640,\\n/**/\\n 3639,\\n/**/\\n 3638,\\n/**/\\n 3637,\\n/**/\\n 3636,\\n/**/\\n 3635,\\n/**/\\n 3634,\\n/**/\\n 3633,\\n/**/\\n 3632,\\n/**/\\n 3631,\\n/**/\\n 3630,\\n/**/\\n 3629,\\n/**/\\n 3628,\\n/**/\\n 3627,\\n/**/\\n 3626,\\n/**/\\n 3625,\\n/**/\\n 3624,\\n/**/\\n 3623,\\n/**/\\n 3622,\\n/**/\\n 3621,\\n/**/\\n 3620,\\n/**/\\n 3619,\\n/**/\\n 3618,\\n/**/\\n 3617,\\n/**/\\n 3616,\\n/**/\\n 3615,\\n/**/\\n 3614,\\n/**/\\n 3613,\\n/**/\\n 3612,\\n/**/\\n 3611,\\n/**/\\n 3610,\\n/**/\\n 3609,\\n/**/\\n 3608,\\n/**/\\n 3607,\\n/**/\\n 3606,\\n/**/\\n 3605,\\n/**/\\n 3604,\\n/**/\\n 3603,\\n/**/\\n 3602,\\n/**/\\n 3601,\\n/**/\\n 3600,\\n/**/\\n 3599,\\n/**/\\n 3598,\\n/**/\\n 3597,\\n/**/\\n 3596,\\n/**/\\n 3595,\\n/**/\\n 3594,\\n/**/\\n 3593,\\n/**/\\n 3592,\\n/**/\\n 3591,\\n/**/\\n 3590,\\n/**/\\n 3589,\\n/**/\\n 3588,\\n/**/\\n 3587,\\n/**/\\n 3586,\\n/**/\\n 3585,\\n/**/\\n 3584,\\n/**/\\n 3583,\\n/**/\\n 3582,\\n/**/\\n 3581,\\n/**/\\n 3580,\\n/**/\\n 3579,\\n/**/\\n 3578,\\n/**/\\n 3577,\\n/**/\\n 3576,\\n/**/\\n 3575,\\n/**/\\n 3574,\\n/**/\\n 3573,\\n/**/\\n 3572,\\n/**/\\n 3571,\\n/**/\\n 3570,\\n/**/\\n 3569,\\n/**/\\n 3568,\\n/**/\\n 3567,\\n/**/\\n 3566,\\n/**/\\n 3565,\\n/**/\\n 3564,\\n/**/\\n 3563,\\n/**/\\n 3562,\\n/**/\\n 3561,\\n/**/\\n 3560,\\n/**/\\n 3559,\\n/**/\\n 3558,\\n/**/\\n 3557,\\n/**/\\n 3556,\\n/**/\\n 3555,\\n/**/\\n 3554,\\n/**/\\n 3553,\\n/**/\\n 3552,\\n/**/\\n 3551,\\n/**/\\n 3550,\\n/**/\\n 3549,\\n/**/\\n 3548,\\n/**/\\n 3547,\\n/**/\\n 3546,\\n/**/\\n 3545,\\n/**/\\n 3544,\\n/**/\\n 3543,\\n/**/\\n 3542,\\n/**/\\n 3541,\\n/**/\\n 3540,\\n/**/\\n 3539,\\n/**/\\n 3538,\\n/**/\\n 3537,\\n/**/\\n 3536,\\n/**/\\n 3535,\\n/**/\\n 3534,\\n/**/\\n 3533,\\n/**/\\n 3532,\\n/**/\\n 3531,\\n/**/\\n 3530,\\n/**/\\n 3529,\\n/**/\\n 3528,\\n/**/\\n 3527,\\n/**/\\n 3526,\\n/**/\\n 3525,\\n/**/\\n 3524,\\n/**/\\n 3523,\\n/**/\\n 3522,\\n/**/\\n 3521,\\n/**/\\n 3520,\\n/**/\\n 3519,\\n/**/\\n 3518,\\n/**/\\n 3517,\\n/**/\\n 3516,\\n/**/\\n 3515,\\n/**/\\n 3514,\\n/**/\\n 3513,\\n/**/\\n 3512,\\n/**/\\n 3511,\\n/**/\\n 3510,\\n/**/\\n 3509,\\n/**/\\n 3508,\\n/**/\\n 3507,\\n/**/\\n 3506,\\n/**/\\n 3505,\\n/**/\\n 3504,\\n/**/\\n 3503,\\n/**/\\n 3502,\\n/**/\\n 3501,\\n/**/\\n 3500,\\n/**/\\n 3499,\\n/**/\\n 3498,\\n/**/\\n 3497,\\n/**/\\n 3496,\\n/**/\\n 3495,\\n/**/\\n 3494,\\n/**/\\n 3493,\\n/**/\\n 3492,\\n/**/\\n 3491,\\n/**/\\n 3490,\\n/**/\\n 3489,\\n/**/\\n 3488,\\n/**/\\n 3487,\\n/**/\\n 3486,\\n/**/\\n 3485,\\n/**/\\n 3484,\\n/**/\\n 3483,\\n/**/\\n 3482,\\n/**/\\n 3481,\\n/**/\\n 3480,\\n/**/\\n 3479,\\n/**/\\n 3478,\\n/**/\\n 3477,\\n/**/\\n 3476,\\n/**/\\n 3475,\\n/**/\\n 3474,\\n/**/\\n 3473,\\n/**/\\n 3472,\\n/**/\\n 3471,\\n/**/\\n 3470,\\n/**/\\n 3469,\\n/**/\\n 3468,\\n/**/\\n 3467,\\n/**/\\n 3466,\\n/**/\\n 3465,\\n/**/\\n 3464,\\n/**/\\n 3463,\\n/**/\\n 3462,\\n/**/\\n 3461,\\n/**/\\n 3460,\\n/**/\\n 3459,\\n/**/\\n 3458,\\n/**/\\n 3457,\\n/**/\\n 3456,\\n/**/\\n 3455,\\n/**/\\n 3454,\\n/**/\\n 3453,\\n/**/\\n 3452,\\n/**/\\n 3451,\\n/**/\\n 3450,\\n/**/\\n 3449,\\n/**/\\n 3448,\\n/**/\\n 3447,\\n/**/\\n 3446,\\n/**/\\n 3445,\\n/**/\\n 3444,\\n/**/\\n 3443,\\n/**/\\n 3442,\\n/**/\\n 3441,\\n/**/\\n 3440,\\n/**/\\n 3439,\\n/**/\\n 3438,\\n/**/\\n 3437,\\n/**/\\n 3436,\\n/**/\\n 3435,\\n/**/\\n 3434,\\n/**/\\n 3433,\\n/**/\\n 3432,\\n/**/\\n 3431,\\n/**/\\n 3430,\\n/**/\\n 3429,\\n/**/\\n 3428,\\n/**/\\n 3427,\\n/**/\\n 3426,\\n/**/\\n 3425,\\n/**/\\n 3424,\\n/**/\\n 3423,\\n/**/\\n 3422,\\n/**/\\n 3421,\\n/**/\\n 3420,\\n/**/\\n 3419,\\n/**/\\n 3418,\\n/**/\\n 3417,\\n/**/\\n 3416,\\n/**/\\n 3415,\\n/**/\\n 3414,\\n/**/\\n 3413,\\n/**/\\n 3412,\\n/**/\\n 3411,\\n/**/\\n 3410,\\n/**/\\n 3409,\\n/**/\\n 3408,\\n/**/\\n 3407,\\n/**/\\n 3406,\\n/**/\\n 3405,\\n/**/\\n 3404,\\n/**/\\n 3403,\\n/**/\\n 3402,\\n/**/\\n 3401,\\n/**/\\n 3400,\\n/**/\\n 3399,\\n/**/\\n 3398,\\n/**/\\n 3397,\\n/**/\\n 3396,\\n/**/\\n 3395,\\n/**/\\n 3394,\\n/**/\\n 3393,\\n/**/\\n 3392,\\n/**/\\n 3391,\\n/**/\\n 3390,\\n/**/\\n 3389,\\n/**/\\n 3388,\\n/**/\\n 3387,\\n/**/\\n 3386,\\n/**/\\n 3385,\\n/**/\\n 3384,\\n/**/\\n 3383,\\n/**/\\n 3382,\\n/**/\\n 3381,\\n/**/\\n 3380,\\n/**/\\n 3379,\\n/**/\\n 3378,\\n/**/\\n 3377,\\n/**/\\n 3376,\\n/**/\\n 3375,\\n/**/\\n 3374,\\n/**/\\n 3373,\\n/**/\\n 3372,\\n/**/\\n 3371,\\n/**/\\n 3370,\\n/**/\\n 3369,\\n/**/\\n 3368,\\n/**/\\n 3367,\\n/**/\\n 3366,\\n/**/\\n 3365,\\n/**/\\n 3364,\\n/**/\\n 3363,\\n/**/\\n 3362,\\n/**/\\n 3361,\\n/**/\\n 3360,\\n/**/\\n 3359,\\n/**/\\n 3358,\\n/**/\\n 3357,\\n/**/\\n 3356,\\n/**/\\n 3355,\\n/**/\\n 3354,\\n/**/\\n 3353,\\n/**/\\n 3352,\\n/**/\\n 3351,\\n/**/\\n 3350,\\n/**/\\n 3349,\\n/**/\\n 3348,\\n/**/\\n 3347,\\n/**/\\n 3346,\\n/**/\\n 3345,\\n/**/\\n 3344,\\n/**/\\n 3343,\\n/**/\\n 3342,\\n/**/\\n 3341,\\n/**/\\n 3340,\\n/**/\\n 3339,\\n/**/\\n 3338,\\n/**/\\n 3337,\\n/**/\\n 3336,\\n/**/\\n 3335,\\n/**/\\n 3334,\\n/**/\\n 3333,\\n/**/\\n 3332,\\n/**/\\n 3331,\\n/**/\\n 3330,\\n/**/\\n 3329,\\n/**/\\n 3328,\\n/**/\\n 3327,\\n/**/\\n 3326,\\n/**/\\n 3325,\\n/**/\\n 3324,\\n/**/\\n 3323,\\n/**/\\n 3322,\\n/**/\\n 3321,\\n/**/\\n 3320,\\n/**/\\n 3319,\\n/**/\\n 3318,\\n/**/\\n 3317,\\n/**/\\n 3316,\\n/**/\\n 3315,\\n/**/\\n 3314,\\n/**/\\n 3313,\\n/**/\\n 3312,\\n/**/\\n 3311,\\n/**/\\n 3310,\\n/**/\\n 3309,\\n/**/\\n 3308,\\n/**/\\n 3307,\\n/**/\\n 3306,\\n/**/\\n 3305,\\n/**/\\n 3304,\\n/**/\\n 3303,\\n/**/\\n 3302,\\n/**/\\n 3301,\\n/**/\\n 3300,\\n/**/\\n 3299,\\n/**/\\n 3298,\\n/**/\\n 3297,\\n/**/\\n 3296,\\n/**/\\n 3295,\\n/**/\\n 3294,\\n/**/\\n 3293,\\n/**/\\n 3292,\\n/**/\\n 3291,\\n/**/\\n 3290,\\n/**/\\n 3289,\\n/**/\\n 3288,\\n/**/\\n 3287,\\n/**/\\n 3286,\\n/**/\\n 3285,\\n/**/\\n 3284,\\n/**/\\n 3283,\\n/**/\\n 3282,\\n/**/\\n 3281,\\n/**/\\n 3280,\\n/**/\\n 3279,\\n/**/\\n 3278,\\n/**/\\n 3277,\\n/**/\\n 3276,\\n/**/\\n 3275,\\n/**/\\n 3274,\\n/**/\\n 3273,\\n/**/\\n 3272,\\n/**/\\n 3271,\\n/**/\\n 3270,\\n/**/\\n 3269,\\n/**/\\n 3268,\\n/**/\\n 3267,\\n/**/\\n 3266,\\n/**/\\n 3265,\\n/**/\\n 3264,\\n/**/\\n 3263,\\n/**/\\n 3262,\\n/**/\\n 3261,\\n/**/\\n 3260,\\n/**/\\n 3259,\\n/**/\\n 3258,\\n/**/\\n 3257,\\n/**/\\n 3256,\\n/**/\\n 3255,\\n/**/\\n 3254,\\n/**/\\n 3253,\\n/**/\\n 3252,\\n/**/\\n 3251,\\n/**/\\n 3250,\\n/**/\\n 3249,\\n/**/\\n 3248,\\n/**/\\n 3247,\\n/**/\\n 3246,\\n/**/\\n 3245,\\n/**/\\n 3244,\\n/**/\\n 3243,\\n/**/\\n 3242,\\n/**/\\n 3241,\\n/**/\\n 3240,\\n/**/\\n 3239,\\n/**/\\n 3238,\\n/**/\\n 3237,\\n/**/\\n 3236,\\n/**/\\n 3235,\\n/**/\\n 3234,\\n/**/\\n 3233,\\n/**/\\n 3232,\\n/**/\\n 3231,\\n/**/\\n 3230,\\n/**/\\n 3229,\\n/**/\\n 3228,\\n/**/\\n 3227,\\n/**/\\n 3226,\\n/**/\\n 3225,\\n/**/\\n 3224,\\n/**/\\n 3223,\\n/**/\\n 3222,\\n/**/\\n 3221,\\n/**/\\n 3220,\\n/**/\\n 3219,\\n/**/\\n 3218,\\n/**/\\n 3217,\\n/**/\\n 3216,\\n/**/\\n 3215,\\n/**/\\n 3214,\\n/**/\\n 3213,\\n/**/\\n 3212,\\n/**/\\n 3211,\\n/**/\\n 3210,\\n/**/\\n 3209,\\n/**/\\n 3208,\\n/**/\\n 3207,\\n/**/\\n 3206,\\n/**/\\n 3205,\\n/**/\\n 3204,\\n/**/\\n 3203,\\n/**/\\n 3202,\\n/**/\\n 3201,\\n/**/\\n 3200,\\n/**/\\n 3199,\\n/**/\\n 3198,\\n/**/\\n 3197,\\n/**/\\n 3196,\\n/**/\\n 3195,\\n/**/\\n 3194,\\n/**/\\n 3193,\\n/**/\\n 3192,\\n/**/\\n 3191,\\n/**/\\n 3190,\\n/**/\\n 3189,\\n/**/\\n 3188,\\n/**/\\n 3187,\\n/**/\\n 3186,\\n/**/\\n 3185,\\n/**/\\n 3184,\\n/**/\\n 3183,\\n/**/\\n 3182,\\n/**/\\n 3181,\\n/**/\\n 3180,\\n/**/\\n 3179,\\n/**/\\n 3178,\\n/**/\\n 3177,\\n/**/\\n 3176,\\n/**/\\n 3175,\\n/**/\\n 3174,\\n/**/\\n 3173,\\n/**/\\n 3172,\\n/**/\\n 3171,\\n/**/\\n 3170,\\n/**/\\n 3169,\\n/**/\\n 3168,\\n/**/\\n 3167,\\n/**/\\n 3166,\\n/**/\\n 3165,\\n/**/\\n 3164,\\n/**/\\n 3163,\\n/**/\\n 3162,\\n/**/\\n 3161,\\n/**/\\n 3160,\\n/**/\\n 3159,\\n/**/\\n 3158,\\n/**/\\n 3157,\\n/**/\\n 3156,\\n/**/\\n 3155,\\n/**/\\n 3154,\\n/**/\\n 3153,\\n/**/\\n 3152,\\n/**/\\n 3151,\\n/**/\\n 3150,\\n/**/\\n 3149,\\n/**/\\n 3148,\\n/**/\\n 3147,\\n/**/\\n 3146,\\n/**/\\n 3145,\\n/**/\\n 3144,\\n/**/\\n 3143,\\n/**/\\n 3142,\\n/**/\\n 3141,\\n/**/\\n 3140,\\n/**/\\n 3139,\\n/**/\\n 3138,\\n/**/\\n 3137,\\n/**/\\n 3136,\\n/**/\\n 3135,\\n/**/\\n 3134,\\n/**/\\n 3133,\\n/**/\\n 3132,\\n/**/\\n 3131,\\n/**/\\n 3130,\\n/**/\\n 3129,\\n/**/\\n 3128,\\n/**/\\n 3127,\\n/**/\\n 3126,\\n/**/\\n 3125,\\n/**/\\n 3124,\\n/**/\\n 3123,\\n/**/\\n 3122,\\n/**/\\n 3121,\\n/**/\\n 3120,\\n/**/\\n 3119,\\n/**/\\n 3118,\\n/**/\\n 3117,\\n/**/\\n 3116,\\n/**/\\n 3115,\\n/**/\\n 3114,\\n/**/\\n 3113,\\n/**/\\n 3112,\\n/**/\\n 3111,\\n/**/\\n 3110,\\n/**/\\n 3109,\\n/**/\\n 3108,\\n/**/\\n 3107,\\n/**/\\n 3106,\\n/**/\\n 3105,\\n/**/\\n 3104,\\n/**/\\n 3103,\\n/**/\\n 3102,\\n/**/\\n 3101,\\n/**/\\n 3100,\\n/**/\\n 3099,\\n/**/\\n 3098,\\n/**/\\n 3097,\\n/**/\\n 3096,\\n/**/\\n 3095,\\n/**/\\n 3094,\\n/**/\\n 3093,\\n/**/\\n 3092,\\n/**/\\n 3091,\\n/**/\\n 3090,\\n/**/\\n 3089,\\n/**/\\n 3088,\\n/**/\\n 3087,\\n/**/\\n 3086,\\n/**/\\n 3085,\\n/**/\\n 3084,\\n/**/\\n 3083,\\n/**/\\n 3082,\\n/**/\\n 3081,\\n/**/\\n 3080,\\n/**/\\n 3079,\\n/**/\\n 3078,\\n/**/\\n 3077,\\n/**/\\n 3076,\\n/**/\\n 3075,\\n/**/\\n 3074,\\n/**/\\n 3073,\\n/**/\\n 3072,\\n/**/\\n 3071,\\n/**/\\n 3070,\\n/**/\\n 3069,\\n/**/\\n 3068,\\n/**/\\n 3067,\\n/**/\\n 3066,\\n/**/\\n 3065,\\n/**/\\n 3064,\\n/**/\\n 3063,\\n/**/\\n 3062,\\n/**/\\n 3061,\\n/**/\\n 3060,\\n/**/\\n 3059,\\n/**/\\n 3058,\\n/**/\\n 3057,\\n/**/\\n 3056,\\n/**/\\n 3055,\\n/**/\\n 3054,\\n/**/\\n 3053,\\n/**/\\n 3052,\\n/**/\\n 3051,\\n/**/\\n 3050,\\n/**/\\n 3049,\\n/**/\\n 3048,\\n/**/\\n 3047,\\n/**/\\n 3046,\\n/**/\\n 3045,\\n/**/\\n 3044,\\n/**/\\n 3043,\\n/**/\\n 3042,\\n/**/\\n 3041,\\n/**/\\n 3040,\\n/**/\\n 3039,\\n/**/\\n 3038,\\n/**/\\n 3037,\\n/**/\\n 3036,\\n/**/\\n 3035,\\n/**/\\n 3034,\\n/**/\\n 3033,\\n/**/\\n 3032,\\n/**/\\n 3031,\\n/**/\\n 3030,\\n/**/\\n 3029,\\n/**/\\n 3028,\\n/**/\\n 3027,\\n/**/\\n 3026,\\n/**/\\n 3025,\\n/**/\\n 3024,\\n/**/\\n 3023,\\n/**/\\n 3022,\\n/**/\\n 3021,\\n/**/\\n 3020,\\n/**/\\n 3019,\\n/**/\\n 3018,\\n/**/\\n 3017,\\n/**/\\n 3016,\\n/**/\\n 3015,\\n/**/\\n 3014,\\n/**/\\n 3013,\\n/**/\\n 3012,\\n/**/\\n 3011,\\n/**/\\n 3010,\\n/**/\\n 3009,\\n/**/\\n 3008,\\n/**/\\n 3007,\\n/**/\\n 3006,\\n/**/\\n 3005,\\n/**/\\n 3004,\\n/**/\\n 3003,\\n/**/\\n 3002,\\n/**/\\n 3001,\\n/**/\\n 3000,\\n/**/\\n 2999,\\n/**/\\n 2998,\\n/**/\\n 2997,\\n/**/\\n 2996,\\n/**/\\n 2995,\\n/**/\\n 2994,\\n/**/\\n 2993,\\n/**/\\n 2992,\\n/**/\\n 2991,\\n/**/\\n 2990,\\n/**/\\n 2989,\\n/**/\\n 2988,\\n/**/\\n 2987,\\n/**/\\n 2986,\\n/**/\\n 2985,\\n/**/\\n 2984,\\n/**/\\n 2983,\\n/**/\\n 2982,\\n/**/\\n 2981,\\n/**/\\n 2980,\\n/**/\\n 2979,\\n/**/\\n 2978,\\n/**/\\n 2977,\\n/**/\\n 2976,\\n/**/\\n 2975,\\n/**/\\n 2974,\\n/**/\\n 2973,\\n/**/\\n 2972,\\n/**/\\n 2971,\\n/**/\\n 2970,\\n/**/\\n 2969,\\n/**/\\n 2968,\\n/**/\\n 2967,\\n/**/\\n 2966,\\n/**/\\n 2965,\\n/**/\\n 2964,\\n/**/\\n 2963,\\n/**/\\n 2962,\\n/**/\\n 2961,\\n/**/\\n 2960,\\n/**/\\n 2959,\\n/**/\\n 2958,\\n/**/\\n 2957,\\n/**/\\n 2956,\\n/**/\\n 2955,\\n/**/\\n 2954,\\n/**/\\n 2953,\\n/**/\\n 2952,\\n/**/\\n 2951,\\n/**/\\n 2950,\\n/**/\\n 2949,\\n/**/\\n 2948,\\n/**/\\n 2947,\\n/**/\\n 2946,\\n/**/\\n 2945,\\n/**/\\n 2944,\\n/**/\\n 2943,\\n/**/\\n 2942,\\n/**/\\n 2941,\\n/**/\\n 2940,\\n/**/\\n 2939,\\n/**/\\n 2938,\\n/**/\\n 2937,\\n/**/\\n 2936,\\n/**/\\n 2935,\\n/**/\\n 2934,\\n/**/\\n 2933,\\n/**/\\n 2932,\\n/**/\\n 2931,\\n/**/\\n 2930,\\n/**/\\n 2929,\\n/**/\\n 2928,\\n/**/\\n 2927,\\n/**/\\n 2926,\\n/**/\\n 2925,\\n/**/\\n 2924,\\n/**/\\n 2923,\\n/**/\\n 2922,\\n/**/\\n 2921,\\n/**/\\n 2920,\\n/**/\\n 2919,\\n/**/\\n 2918,\\n/**/\\n 2917,\\n/**/\\n 2916,\\n/**/\\n 2915,\\n/**/\\n 2914,\\n/**/\\n 2913,\\n/**/\\n 2912,\\n/**/\\n 2911,\\n/**/\\n 2910,\\n/**/\\n 2909,\\n/**/\\n 2908,\\n/**/\\n 2907,\\n/**/\\n 2906,\\n/**/\\n 2905,\\n/**/\\n 2904,\\n/**/\\n 2903,\\n/**/\\n 2902,\\n/**/\\n 2901,\\n/**/\\n 2900,\\n/**/\\n 2899,\\n/**/\\n 2898,\\n/**/\\n 2897,\\n/**/\\n 2896,\\n/**/\\n 2895,\\n/**/\\n 2894,\\n/**/\\n 2893,\\n/**/\\n 2892,\\n/**/\\n 2891,\\n/**/\\n 2890,\\n/**/\\n 2889,\\n/**/\\n 2888,\\n/**/\\n 2887,\\n/**/\\n 2886,\\n/**/\\n 2885,\\n/**/\\n 2884,\\n/**/\\n 2883,\\n/**/\\n 2882,\\n/**/\\n 2881,\\n/**/\\n 2880,\\n/**/\\n 2879,\\n/**/\\n 2878,\\n/**/\\n 2877,\\n/**/\\n 2876,\\n/**/\\n 2875,\\n/**/\\n 2874,\\n/**/\\n 2873,\\n/**/\\n 2872,\\n/**/\\n 2871,\\n/**/\\n 2870,\\n/**/\\n 2869,\\n/**/\\n 2868,\\n/**/\\n 2867,\\n/**/\\n 2866,\\n/**/\\n 2865,\\n/**/\\n 2864,\\n/**/\\n 2863,\\n/**/\\n 2862,\\n/**/\\n 2861,\\n/**/\\n 2860,\\n/**/\\n 2859,\\n/**/\\n 2858,\\n/**/\\n 2857,\\n/**/\\n 2856,\\n/**/\\n 2855,\\n/**/\\n 2854,\\n/**/\\n 2853,\\n/**/\\n 2852,\\n/**/\\n 2851,\\n/**/\\n 2850,\\n/**/\\n 2849,\\n/**/\\n 2848,\\n/**/\\n 2847,\\n/**/\\n 2846,\\n/**/\\n 2845,\\n/**/\\n 2844,\\n/**/\\n 2843,\\n/**/\\n 2842,\\n/**/\\n 2841,\\n/**/\\n 2840,\\n/**/\\n 2839,\\n/**/\\n 2838,\\n/**/\\n 2837,\\n/**/\\n 2836,\\n/**/\\n 2835,\\n/**/\\n 2834,\\n/**/\\n 2833,\\n/**/\\n 2832,\\n/**/\\n 2831,\\n/**/\\n 2830,\\n/**/\\n 2829,\\n/**/\\n 2828,\\n/**/\\n 2827,\\n/**/\\n 2826,\\n/**/\\n 2825,\\n/**/\\n 2824,\\n/**/\\n 2823,\\n/**/\\n 2822,\\n/**/\\n 2821,\\n/**/\\n 2820,\\n/**/\\n 2819,\\n/**/\\n 2818,\\n/**/\\n 2817,\\n/**/\\n 2816,\\n/**/\\n 2815,\\n/**/\\n 2814,\\n/**/\\n 2813,\\n/**/\\n 2812,\\n/**/\\n 2811,\\n/**/\\n 2810,\\n/**/\\n 2809,\\n/**/\\n 2808,\\n/**/\\n 2807,\\n/**/\\n 2806,\\n/**/\\n 2805,\\n/**/\\n 2804,\\n/**/\\n 2803,\\n/**/\\n 2802,\\n/**/\\n 2801,\\n/**/\\n 2800,\\n/**/\\n 2799,\\n/**/\\n 2798,\\n/**/\\n 2797,\\n/**/\\n 2796,\\n/**/\\n 2795,\\n/**/\\n 2794,\\n/**/\\n 2793,\\n/**/\\n 2792,\\n/**/\\n 2791,\\n/**/\\n 2790,\\n/**/\\n 2789,\\n/**/\\n 2788,\\n/**/\\n 2787,\\n/**/\\n 2786,\\n/**/\\n 2785,\\n/**/\\n 2784,\\n/**/\\n 2783,\\n/**/\\n 2782,\\n/**/\\n 2781,\\n/**/\\n 2780,\\n/**/\\n 2779,\\n/**/\\n 2778,\\n/**/\\n 2777,\\n/**/\\n 2776,\\n/**/\\n 2775,\\n/**/\\n 2774,\\n/**/\\n 2773,\\n/**/\\n 2772,\\n/**/\\n 2771,\\n/**/\\n 2770,\\n/**/\\n 2769,\\n/**/\\n 2768,\\n/**/\\n 2767,\\n/**/\\n 2766,\\n/**/\\n 2765,\\n/**/\\n 2764,\\n/**/\\n 2763,\\n/**/\\n 2762,\\n/**/\\n 2761,\\n/**/\\n 2760,\\n/**/\\n 2759,\\n/**/\\n 2758,\\n/**/\\n 2757,\\n/**/\\n 2756,\\n/**/\\n 2755,\\n/**/\\n 2754,\\n/**/\\n 2753,\\n/**/\\n 2752,\\n/**/\\n 2751,\\n/**/\\n 2750,\\n/**/\\n 2749,\\n/**/\\n 2748,\\n/**/\\n 2747,\\n/**/\\n 2746,\\n/**/\\n 2745,\\n/**/\\n 2744,\\n/**/\\n 2743,\\n/**/\\n 2742,\\n/**/\\n 2741,\\n/**/\\n 2740,\\n/**/\\n 2739,\\n/**/\\n 2738,\\n/**/\\n 2737,\\n/**/\\n 2736,\\n/**/\\n 2735,\\n/**/\\n 2734,\\n/**/\\n 2733,\\n/**/\\n 2732,\\n/**/\\n 2731,\\n/**/\\n 2730,\\n/**/\\n 2729,\\n/**/\\n 2728,\\n/**/\\n 2727,\\n/**/\\n 2726,\\n/**/\\n 2725,\\n/**/\\n 2724,\\n/**/\\n 2723,\\n/**/\\n 2722,\\n/**/\\n 2721,\\n/**/\\n 2720,\\n/**/\\n 2719,\\n/**/\\n 2718,\\n/**/\\n 2717,\\n/**/\\n 2716,\\n/**/\\n 2715,\\n/**/\\n 2714,\\n/**/\\n 2713,\\n/**/\\n 2712,\\n/**/\\n 2711,\\n/**/\\n 2710,\\n/**/\\n 2709,\\n/**/\\n 2708,\\n/**/\\n 2707,\\n/**/\\n 2706,\\n/**/\\n 2705,\\n/**/\\n 2704,\\n/**/\\n 2703,\\n/**/\\n 2702,\\n/**/\\n 2701,\\n/**/\\n 2700,\\n/**/\\n 2699,\\n/**/\\n 2698,\\n/**/\\n 2697,\\n/**/\\n 2696,\\n/**/\\n 2695,\\n/**/\\n 2694,\\n/**/\\n 2693,\\n/**/\\n 2692,\\n/**/\\n 2691,\\n/**/\\n 2690,\\n/**/\\n 2689,\\n/**/\\n 2688,\\n/**/\\n 2687,\\n/**/\\n 2686,\\n/**/\\n 2685,\\n/**/\\n 2684,\\n/**/\\n 2683,\\n/**/\\n 2682,\\n/**/\\n 2681,\\n/**/\\n 2680,\\n/**/\\n 2679,\\n/**/\\n 2678,\\n/**/\\n 2677,\\n/**/\\n 2676,\\n/**/\\n 2675,\\n/**/\\n 2674,\\n/**/\\n 2673,\\n/**/\\n 2672,\\n/**/\\n 2671,\\n/**/\\n 2670,\\n/**/\\n 2669,\\n/**/\\n 2668,\\n/**/\\n 2667,\\n/**/\\n 2666,\\n/**/\\n 2665,\\n/**/\\n 2664,\\n/**/\\n 2663,\\n/**/\\n 2662,\\n/**/\\n 2661,\\n/**/\\n 2660,\\n/**/\\n 2659,\\n/**/\\n 2658,\\n/**/\\n 2657,\\n/**/\\n 2656,\\n/**/\\n 2655,\\n/**/\\n 2654,\\n/**/\\n 2653,\\n/**/\\n 2652,\\n/**/\\n 2651,\\n/**/\\n 2650,\\n/**/\\n 2649,\\n/**/\\n 2648,\\n/**/\\n 2647,\\n/**/\\n 2646,\\n/**/\\n 2645,\\n/**/\\n 2644,\\n/**/\\n 2643,\\n/**/\\n 2642,\\n/**/\\n 2641,\\n/**/\\n 2640,\\n/**/\\n 2639,\\n/**/\\n 2638,\\n/**/\\n 2637,\\n/**/\\n 2636,\\n/**/\\n 2635,\\n/**/\\n 2634,\\n/**/\\n 2633,\\n/**/\\n 2632,\\n/**/\\n 2631,\\n/**/\\n 2630,\\n/**/\\n 2629,\\n/**/\\n 2628,\\n/**/\\n 2627,\\n/**/\\n 2626,\\n/**/\\n 2625,\\n/**/\\n 2624,\\n/**/\\n 2623,\\n/**/\\n 2622,\\n/**/\\n 2621,\\n/**/\\n 2620,\\n/**/\\n 2619,\\n/**/\\n 2618,\\n/**/\\n 2617,\\n/**/\\n 2616,\\n/**/\\n 2615,\\n/**/\\n 2614,\\n/**/\\n 2613,\\n/**/\\n 2612,\\n/**/\\n 2611,\\n/**/\\n 2610,\\n/**/\\n 2609,\\n/**/\\n 2608,\\n/**/\\n 2607,\\n/**/\\n 2606,\\n/**/\\n 2605,\\n/**/\\n 2604,\\n/**/\\n 2603,\\n/**/\\n 2602,\\n/**/\\n 2601,\\n/**/\\n 2600,\\n/**/\\n 2599,\\n/**/\\n 2598,\\n/**/\\n 2597,\\n/**/\\n 2596,\\n/**/\\n 2595,\\n/**/\\n 2594,\\n/**/\\n 2593,\\n/**/\\n 2592,\\n/**/\\n 2591,\\n/**/\\n 2590,\\n/**/\\n 2589,\\n/**/\\n 2588,\\n/**/\\n 2587,\\n/**/\\n 2586,\\n/**/\\n 2585,\\n/**/\\n 2584,\\n/**/\\n 2583,\\n/**/\\n 2582,\\n/**/\\n 2581,\\n/**/\\n 2580,\\n/**/\\n 2579,\\n/**/\\n 2578,\\n/**/\\n 2577,\\n/**/\\n 2576,\\n/**/\\n 2575,\\n/**/\\n 2574,\\n/**/\\n 2573,\\n/**/\\n 2572,\\n/**/\\n 2571,\\n/**/\\n 2570,\\n/**/\\n 2569,\\n/**/\\n 2568,\\n/**/\\n 2567,\\n/**/\\n 2566,\\n/**/\\n 2565,\\n/**/\\n 2564,\\n/**/\\n 2563,\\n/**/\\n 2562,\\n/**/\\n 2561,\\n/**/\\n 2560,\\n/**/\\n 2559,\\n/**/\\n 2558,\\n/**/\\n 2557,\\n/**/\\n 2556,\\n/**/\\n 2555,\\n/**/\\n 2554,\\n/**/\\n 2553,\\n/**/\\n 2552,\\n/**/\\n 2551,\\n/**/\\n 2550,\\n/**/\\n 2549,\\n/**/\\n 2548,\\n/**/\\n 2547,\\n/**/\\n 2546,\\n/**/\\n 2545,\\n/**/\\n 2544,\\n/**/\\n 2543,\\n/**/\\n 2542,\\n/**/\\n 2541,\\n/**/\\n 2540,\\n/**/\\n 2539,\\n/**/\\n 2538,\\n/**/\\n 2537,\\n/**/\\n 2536,\\n/**/\\n 2535,\\n/**/\\n 2534,\\n/**/\\n 2533,\\n/**/\\n 2532,\\n/**/\\n 2531,\\n/**/\\n 2530,\\n/**/\\n 2529,\\n/**/\\n 2528,\\n/**/\\n 2527,\\n/**/\\n 2526,\\n/**/\\n 2525,\\n/**/\\n 2524,\\n/**/\\n 2523,\\n/**/\\n 2522,\\n/**/\\n 2521,\\n/**/\\n 2520,\\n/**/\\n 2519,\\n/**/\\n 2518,\\n/**/\\n 2517,\\n/**/\\n 2516,\\n/**/\\n 2515,\\n/**/\\n 2514,\\n/**/\\n 2513,\\n/**/\\n 2512,\\n/**/\\n 2511,\\n/**/\\n 2510,\\n/**/\\n 2509,\\n/**/\\n 2508,\\n/**/\\n 2507,\\n/**/\\n 2506,\\n/**/\\n 2505,\\n/**/\\n 2504,\\n/**/\\n 2503,\\n/**/\\n 2502,\\n/**/\\n 2501,\\n/**/\\n 2500,\\n/**/\\n 2499,\\n/**/\\n 2498,\\n/**/\\n 2497,\\n/**/\\n 2496,\\n/**/\\n 2495,\\n/**/\\n 2494,\\n/**/\\n 2493,\\n/**/\\n 2492,\\n/**/\\n 2491,\\n/**/\\n 2490,\\n/**/\\n 2489,\\n/**/\\n 2488,\\n/**/\\n 2487,\\n/**/\\n 2486,\\n/**/\\n 2485,\\n/**/\\n 2484,\\n/**/\\n 2483,\\n/**/\\n 2482,\\n/**/\\n 2481,\\n/**/\\n 2480,\\n/**/\\n 2479,\\n/**/\\n 2478,\\n/**/\\n 2477,\\n/**/\\n 2476,\\n/**/\\n 2475,\\n/**/\\n 2474,\\n/**/\\n 2473,\\n/**/\\n 2472,\\n/**/\\n 2471,\\n/**/\\n 2470,\\n/**/\\n 2469,\\n/**/\\n 2468,\\n/**/\\n 2467,\\n/**/\\n 2466,\\n/**/\\n 2465,\\n/**/\\n 2464,\\n/**/\\n 2463,\\n/**/\\n 2462,\\n/**/\\n 2461,\\n/**/\\n 2460,\\n/**/\\n 2459,\\n/**/\\n 2458,\\n/**/\\n 2457,\\n/**/\\n 2456,\\n/**/\\n 2455,\\n/**/\\n 2454,\\n/**/\\n 2453,\\n/**/\\n 2452,\\n/**/\\n 2451,\\n/**/\\n 2450,\\n/**/\\n 2449,\\n/**/\\n 2448,\\n/**/\\n 2447,\\n/**/\\n 2446,\\n/**/\\n 2445,\\n/**/\\n 2444,\\n/**/\\n 2443,\\n/**/\\n 2442,\\n/**/\\n 2441,\\n/**/\\n 2440,\\n/**/\\n 2439,\\n/**/\\n 2438,\\n/**/\\n 2437,\\n/**/\\n 2436,\\n/**/\\n 2435,\\n/**/\\n 2434,\\n/**/\\n 2433,\\n/**/\\n 2432,\\n/**/\\n 2431,\\n/**/\\n 2430,\\n/**/\\n 2429,\\n/**/\\n 2428,\\n/**/\\n 2427,\\n/**/\\n 2426,\\n/**/\\n 2425,\\n/**/\\n 2424,\\n/**/\\n 2423,\\n/**/\\n 2422,\\n/**/\\n 2421,\\n/**/\\n 2420,\\n/**/\\n 2419,\\n/**/\\n 2418,\\n/**/\\n 2417,\\n/**/\\n 2416,\\n/**/\\n 2415,\\n/**/\\n 2414,\\n/**/\\n 2413,\\n/**/\\n 2412,\\n/**/\\n 2411,\\n/**/\\n 2410,\\n/**/\\n 2409,\\n/**/\\n 2408,\\n/**/\\n 2407,\\n/**/\\n 2406,\\n/**/\\n 2405,\\n/**/\\n 2404,\\n/**/\\n 2403,\\n/**/\\n 2402,\\n/**/\\n 2401,\\n/**/\\n 2400,\\n/**/\\n 2399,\\n/**/\\n 2398,\\n/**/\\n 2397,\\n/**/\\n 2396,\\n/**/\\n 2395,\\n/**/\\n 2394,\\n/**/\\n 2393,\\n/**/\\n 2392,\\n/**/\\n 2391,\\n/**/\\n 2390,\\n/**/\\n 2389,\\n/**/\\n 2388,\\n/**/\\n 2387,\\n/**/\\n 2386,\\n/**/\\n 2385,\\n/**/\\n 2384,\\n/**/\\n 2383,\\n/**/\\n 2382,\\n/**/\\n 2381,\\n/**/\\n 2380,\\n/**/\\n 2379,\\n/**/\\n 2378,\\n/**/\\n 2377,\\n/**/\\n 2376,\\n/**/\\n 2375,\\n/**/\\n 2374,\\n/**/\\n 2373,\\n/**/\\n 2372,\\n/**/\\n 2371,\\n/**/\\n 2370,\\n/**/\\n 2369,\\n/**/\\n 2368,\\n/**/\\n 2367,\\n/**/\\n 2366,\\n/**/\\n 2365,\\n/**/\\n 2364,\\n/**/\\n 2363,\\n/**/\\n 2362,\\n/**/\\n 2361,\\n/**/\\n 2360,\\n/**/\\n 2359,\\n/**/\\n 2358,\\n/**/\\n 2357,\\n/**/\\n 2356,\\n/**/\\n 2355,\\n/**/\\n 2354,\\n/**/\\n 2353,\\n/**/\\n 2352,\\n/**/\\n 2351,\\n/**/\\n 2350,\\n/**/\\n 2349,\\n/**/\\n 2348,\\n/**/\\n 2347,\\n/**/\\n 2346,\\n/**/\\n 2345,\\n/**/\\n 2344,\\n/**/\\n 2343,\\n/**/\\n 2342,\\n/**/\\n 2341,\\n/**/\\n 2340,\\n/**/\\n 2339,\\n/**/\\n 2338,\\n/**/\\n 2337,\\n/**/\\n 2336,\\n/**/\\n 2335,\\n/**/\\n 2334,\\n/**/\\n 2333,\\n/**/\\n 2332,\\n/**/\\n 2331,\\n/**/\\n 2330,\\n/**/\\n 2329,\\n/**/\\n 2328,\\n/**/\\n 2327,\\n/**/\\n 2326,\\n/**/\\n 2325,\\n/**/\\n 2324,\\n/**/\\n 2323,\\n/**/\\n 2322,\\n/**/\\n 2321,\\n/**/\\n 2320,\\n/**/\\n 2319,\\n/**/\\n 2318,\\n/**/\\n 2317,\\n/**/\\n 2316,\\n/**/\\n 2315,\\n/**/\\n 2314,\\n/**/\\n 2313,\\n/**/\\n 2312,\\n/**/\\n 2311,\\n/**/\\n 2310,\\n/**/\\n 2309,\\n/**/\\n 2308,\\n/**/\\n 2307,\\n/**/\\n 2306,\\n/**/\\n 2305,\\n/**/\\n 2304,\\n/**/\\n 2303,\\n/**/\\n 2302,\\n/**/\\n 2301,\\n/**/\\n 2300,\\n/**/\\n 2299,\\n/**/\\n 2298,\\n/**/\\n 2297,\\n/**/\\n 2296,\\n/**/\\n 2295,\\n/**/\\n 2294,\\n/**/\\n 2293,\\n/**/\\n 2292,\\n/**/\\n 2291,\\n/**/\\n 2290,\\n/**/\\n 2289,\\n/**/\\n 2288,\\n/**/\\n 2287,\\n/**/\\n 2286,\\n/**/\\n 2285,\\n/**/\\n 2284,\\n/**/\\n 2283,\\n/**/\\n 2282,\\n/**/\\n 2281,\\n/**/\\n 2280,\\n/**/\\n 2279,\\n/**/\\n 2278,\\n/**/\\n 2277,\\n/**/\\n 2276,\\n/**/\\n 2275,\\n/**/\\n 2274,\\n/**/\\n 2273,\\n/**/\\n 2272,\\n/**/\\n 2271,\\n/**/\\n 2270,\\n/**/\\n 2269,\\n/**/\\n 2268,\\n/**/\\n 2267,\\n/**/\\n 2266,\\n/**/\\n 2265,\\n/**/\\n 2264,\\n/**/\\n 2263,\\n/**/\\n 2262,\\n/**/\\n 2261,\\n/**/\\n 2260,\\n/**/\\n 2259,\\n/**/\\n 2258,\\n/**/\\n 2257,\\n/**/\\n 2256,\\n/**/\\n 2255,\\n/**/\\n 2254,\\n/**/\\n 2253,\\n/**/\\n 2252,\\n/**/\\n 2251,\\n/**/\\n 2250,\\n/**/\\n 2249,\\n/**/\\n 2248,\\n/**/\\n 2247,\\n/**/\\n 2246,\\n/**/\\n 2245,\\n/**/\\n 2244,\\n/**/\\n 2243,\\n/**/\\n 2242,\\n/**/\\n 2241,\\n/**/\\n 2240,\\n/**/\\n 2239,\\n/**/\\n 2238,\\n/**/\\n 2237,\\n/**/\\n 2236,\\n/**/\\n 2235,\\n/**/\\n 2234,\\n/**/\\n 2233,\\n/**/\\n 2232,\\n/**/\\n 2231,\\n/**/\\n 2230,\\n/**/\\n 2229,\\n/**/\\n 2228,\\n/**/\\n 2227,\\n/**/\\n 2226,\\n/**/\\n 2225,\\n/**/\\n 2224,\\n/**/\\n 2223,\\n/**/\\n 2222,\\n/**/\\n 2221,\\n/**/\\n 2220,\\n/**/\\n 2219,\\n/**/\\n 2218,\\n/**/\\n 2217,\\n/**/\\n 2216,\\n/**/\\n 2215,\\n/**/\\n 2214,\\n/**/\\n 2213,\\n/**/\\n 2212,\\n/**/\\n 2211,\\n/**/\\n 2210,\\n/**/\\n 2209,\\n/**/\\n 2208,\\n/**/\\n 2207,\\n/**/\\n 2206,\\n/**/\\n 2205,\\n/**/\\n 2204,\\n/**/\\n 2203,\\n/**/\\n 2202,\\n/**/\\n 2201,\\n/**/\\n 2200,\\n/**/\\n 2199,\\n/**/\\n 2198,\\n/**/\\n 2197,\\n/**/\\n 2196,\\n/**/\\n 2195,\\n/**/\\n 2194,\\n/**/\\n 2193,\\n/**/\\n 2192,\\n/**/\\n 2191,\\n/**/\\n 2190,\\n/**/\\n 2189,\\n/**/\\n 2188,\\n/**/\\n 2187,\\n/**/\\n 2186,\\n/**/\\n 2185,\\n/**/\\n 2184,\\n/**/\\n 2183,\\n/**/\\n 2182,\\n/**/\\n 2181,\\n/**/\\n 2180,\\n/**/\\n 2179,\\n/**/\\n 2178,\\n/**/\\n 2177,\\n/**/\\n 2176,\\n/**/\\n 2175,\\n/**/\\n 2174,\\n/**/\\n 2173,\\n/**/\\n 2172,\\n/**/\\n 2171,\\n/**/\\n 2170,\\n/**/\\n 2169,\\n/**/\\n 2168,\\n/**/\\n 2167,\\n/**/\\n 2166,\\n/**/\\n 2165,\\n/**/\\n 2164,\\n/**/\\n 2163,\\n/**/\\n 2162,\\n/**/\\n 2161,\\n/**/\\n 2160,\\n/**/\\n 2159,\\n/**/\\n 2158,\\n/**/\\n 2157,\\n/**/\\n 2156,\\n/**/\\n 2155,\\n/**/\\n 2154,\\n/**/\\n 2153,\\n/**/\\n 2152,\\n/**/\\n 2151,\\n/**/\\n 2150,\\n/**/\\n 2149,\\n/**/\\n 2148,\\n/**/\\n 2147,\\n/**/\\n 2146,\\n/**/\\n 2145,\\n/**/\\n 2144,\\n/**/\\n 2143,\\n/**/\\n 2142,\\n/**/\\n 2141,\\n/**/\\n 2140,\\n/**/\\n 2139,\\n/**/\\n 2138,\\n/**/\\n 2137,\\n/**/\\n 2136,\\n/**/\\n 2135,\\n/**/\\n 2134,\\n/**/\\n 2133,\\n/**/\\n 2132,\\n/**/\\n 2131,\\n/**/\\n 2130,\\n/**/\\n 2129,\\n/**/\\n 2128,\\n/**/\\n 2127,\\n/**/\\n 2126,\\n/**/\\n 2125,\\n/**/\\n 2124,\\n/**/\\n 2123,\\n/**/\\n 2122,\\n/**/\\n 2121,\\n/**/\\n 2120,\\n/**/\\n 2119,\\n/**/\\n 2118,\\n/**/\\n 2117,\\n/**/\\n 2116,\\n/**/\\n 2115,\\n/**/\\n 2114,\\n/**/\\n 2113,\\n/**/\\n 2112,\\n/**/\\n 2111,\\n/**/\\n 2110,\\n/**/\\n 2109,\\n/**/\\n 2108,\\n/**/\\n 2107,\\n/**/\\n 2106,\\n/**/\\n 2105,\\n/**/\\n 2104,\\n/**/\\n 2103,\\n/**/\\n 2102,\\n/**/\\n 2101,\\n/**/\\n 2100,\\n/**/\\n 2099,\\n/**/\\n 2098,\\n/**/\\n 2097,\\n/**/\\n 2096,\\n/**/\\n 2095,\\n/**/\\n 2094,\\n/**/\\n 2093,\\n/**/\\n 2092,\\n/**/\\n 2091,\\n/**/\\n 2090,\\n/**/\\n 2089,\\n/**/\\n 2088,\\n/**/\\n 2087,\\n/**/\\n 2086,\\n/**/\\n 2085,\\n/**/\\n 2084,\\n/**/\\n 2083,\\n/**/\\n 2082,\\n/**/\\n 2081,\\n/**/\\n 2080,\\n/**/\\n 2079,\\n/**/\\n 2078,\\n/**/\\n 2077,\\n/**/\\n 2076,\\n/**/\\n 2075,\\n/**/\\n 2074,\\n/**/\\n 2073,\\n/**/\\n 2072,\\n/**/\\n 2071,\\n/**/\\n 2070,\\n/**/\\n 2069,\\n/**/\\n 2068,\\n/**/\\n 2067,\\n/**/\\n 2066,\\n/**/\\n 2065,\\n/**/\\n 2064,\\n/**/\\n 2063,\\n/**/\\n 2062,\\n/**/\\n 2061,\\n/**/\\n 2060,\\n/**/\\n 2059,\\n/**/\\n 2058,\\n/**/\\n 2057,\\n/**/\\n 2056,\\n/**/\\n 2055,\\n/**/\\n 2054,\\n/**/\\n 2053,\\n/**/\\n 2052,\\n/**/\\n 2051,\\n/**/\\n 2050,\\n/**/\\n 2049,\\n/**/\\n 2048,\\n/**/\\n 2047,\\n/**/\\n 2046,\\n/**/\\n 2045,\\n/**/\\n 2044,\\n/**/\\n 2043,\\n/**/\\n 2042,\\n/**/\\n 2041,\\n/**/\\n 2040,\\n/**/\\n 2039,\\n/**/\\n 2038,\\n/**/\\n 2037,\\n/**/\\n 2036,\\n/**/\\n 2035,\\n/**/\\n 2034,\\n/**/\\n 2033,\\n/**/\\n 2032,\\n/**/\\n 2031,\\n/**/\\n 2030,\\n/**/\\n 2029,\\n/**/\\n 2028,\\n/**/\\n 2027,\\n/**/\\n 2026,\\n/**/\\n 2025,\\n/**/\\n 2024,\\n/**/\\n 2023,\\n/**/\\n 2022,\\n/**/\\n 2021,\\n/**/\\n 2020,\\n/**/\\n 2019,\\n/**/\\n 2018,\\n/**/\\n 2017,\\n/**/\\n 2016,\\n/**/\\n 2015,\\n/**/\\n 2014,\\n/**/\\n 2013,\\n/**/\\n 2012,\\n/**/\\n 2011,\\n/**/\\n 2010,\\n/**/\\n 2009,\\n/**/\\n 2008,\\n/**/\\n 2007,\\n/**/\\n 2006,\\n/**/\\n 2005,\\n/**/\\n 2004,\\n/**/\\n 2003,\\n/**/\\n 2002,\\n/**/\\n 2001,\\n/**/\\n 2000,\\n/**/\\n 1999,\\n/**/\\n 1998,\\n/**/\\n 1997,\\n/**/\\n 1996,\\n/**/\\n 1995,\\n/**/\\n 1994,\\n/**/\\n 1993,\\n/**/\\n 1992,\\n/**/\\n 1991,\\n/**/\\n 1990,\\n/**/\\n 1989,\\n/**/\\n 1988,\\n/**/\\n 1987,\\n/**/\\n 1986,\\n/**/\\n 1985,\\n/**/\\n 1984,\\n/**/\\n 1983,\\n/**/\\n 1982,\\n/**/\\n 1981,\\n/**/\\n 1980,\\n/**/\\n 1979,\\n/**/\\n 1978,\\n/**/\\n 1977,\\n/**/\\n 1976,\\n/**/\\n 1975,\\n/**/\\n 1974,\\n/**/\\n 1973,\\n/**/\\n 1972,\\n/**/\\n 1971,\\n/**/\\n 1970,\\n/**/\\n 1969,\\n/**/\\n 1968,\\n/**/\\n 1967,\\n/**/\\n 1966,\\n/**/\\n 1965,\\n/**/\\n 1964,\\n/**/\\n 1963,\\n/**/\\n 1962,\\n/**/\\n 1961,\\n/**/\\n 1960,\\n/**/\\n 1959,\\n/**/\\n 1958,\\n/**/\\n 1957,\\n/**/\\n 1956,\\n/**/\\n 1955,\\n/**/\\n 1954,\\n/**/\\n 1953,\\n/**/\\n 1952,\\n/**/\\n 1951,\\n/**/\\n 1950,\\n/**/\\n 1949,\\n/**/\\n 1948,\\n/**/\\n 1947,\\n/**/\\n 1946,\\n/**/\\n 1945,\\n/**/\\n 1944,\\n/**/\\n 1943,\\n/**/\\n 1942,\\n/**/\\n 1941,\\n/**/\\n 1940,\\n/**/\\n 1939,\\n/**/\\n 1938,\\n/**/\\n 1937,\\n/**/\\n 1936,\\n/**/\\n 1935,\\n/**/\\n 1934,\\n/**/\\n 1933,\\n/**/\\n 1932,\\n/**/\\n 1931,\\n/**/\\n 1930,\\n/**/\\n 1929,\\n/**/\\n 1928,\\n/**/\\n 1927,\\n/**/\\n 1926,\\n/**/\\n 1925,\\n/**/\\n 1924,\\n/**/\\n 1923,\\n/**/\\n 1922,\\n/**/\\n 1921,\\n/**/\\n 1920,\\n/**/\\n 1919,\\n/**/\\n 1918,\\n/**/\\n 1917,\\n/**/\\n 1916,\\n/**/\\n 1915,\\n/**/\\n 1914,\\n/**/\\n 1913,\\n/**/\\n 1912,\\n/**/\\n 1911,\\n/**/\\n 1910,\\n/**/\\n 1909,\\n/**/\\n 1908,\\n/**/\\n 1907,\\n/**/\\n 1906,\\n/**/\\n 1905,\\n/**/\\n 1904,\\n/**/\\n 1903,\\n/**/\\n 1902,\\n/**/\\n 1901,\\n/**/\\n 1900,\\n/**/\\n 1899,\\n/**/\\n 1898,\\n/**/\\n 1897,\\n/**/\\n 1896,\\n/**/\\n 1895,\\n/**/\\n 1894,\\n/**/\\n 1893,\\n/**/\\n 1892,\\n/**/\\n 1891,\\n/**/\\n 1890,\\n/**/\\n 1889,\\n/**/\\n 1888,\\n/**/\\n 1887,\\n/**/\\n 1886,\\n/**/\\n 1885,\\n/**/\\n 1884,\\n/**/\\n 1883,\\n/**/\\n 1882,\\n/**/\\n 1881,\\n/**/\\n 1880,\\n/**/\\n 1879,\\n/**/\\n 1878,\\n/**/\\n 1877,\\n/**/\\n 1876,\\n/**/\\n 1875,\\n/**/\\n 1874,\\n/**/\\n 1873,\\n/**/\\n 1872,\\n/**/\\n 1871,\\n/**/\\n 1870,\\n/**/\\n 1869,\\n/**/\\n 1868,\\n/**/\\n 1867,\\n/**/\\n 1866,\\n/**/\\n 1865,\\n/**/\\n 1864,\\n/**/\\n 1863,\\n/**/\\n 1862,\\n/**/\\n 1861,\\n/**/\\n 1860,\\n/**/\\n 1859,\\n/**/\\n 1858,\\n/**/\\n 1857,\\n/**/\\n 1856,\\n/**/\\n 1855,\\n/**/\\n 1854,\\n/**/\\n 1853,\\n/**/\\n 1852,\\n/**/\\n 1851,\\n/**/\\n 1850,\\n/**/\\n 1849,\\n/**/\\n 1848,\\n/**/\\n 1847,\\n/**/\\n 1846,\\n/**/\\n 1845,\\n/**/\\n 1844,\\n/**/\\n 1843,\\n/**/\\n 1842,\\n/**/\\n 1841,\\n/**/\\n 1840,\\n/**/\\n 1839,\\n/**/\\n 1838,\\n/**/\\n 1837,\\n/**/\\n 1836,\\n/**/\\n 1835,\\n/**/\\n 1834,\\n/**/\\n 1833,\\n/**/\\n 1832,\\n/**/\\n 1831,\\n/**/\\n 1830,\\n/**/\\n 1829,\\n/**/\\n 1828,\\n/**/\\n 1827,\\n/**/\\n 1826,\\n/**/\\n 1825,\\n/**/\\n 1824,\\n/**/\\n 1823,\\n/**/\\n 1822,\\n/**/\\n 1821,\\n/**/\\n 1820,\\n/**/\\n 1819,\\n/**/\\n 1818,\\n/**/\\n 1817,\\n/**/\\n 1816,\\n/**/\\n 1815,\\n/**/\\n 1814,\\n/**/\\n 1813,\\n/**/\\n 1812,\\n/**/\\n 1811,\\n/**/\\n 1810,\\n/**/\\n 1809,\\n/**/\\n 1808,\\n/**/\\n 1807,\\n/**/\\n 1806,\\n/**/\\n 1805,\\n/**/\\n 1804,\\n/**/\\n 1803,\\n/**/\\n 1802,\\n/**/\\n 1801,\\n/**/\\n 1800,\\n/**/\\n 1799,\\n/**/\\n 1798,\\n/**/\\n 1797,\\n/**/\\n 1796,\\n/**/\\n 1795,\\n/**/\\n 1794,\\n/**/\\n 1793,\\n/**/\\n 1792,\\n/**/\\n 1791,\\n/**/\\n 1790,\\n/**/\\n 1789,\\n/**/\\n 1788,\\n/**/\\n 1787,\\n/**/\\n 1786,\\n/**/\\n 1785,\\n/**/\\n 1784,\\n/**/\\n 1783,\\n/**/\\n 1782,\\n/**/\\n 1781,\\n/**/\\n 1780,\\n/**/\\n 1779,\\n/**/\\n 1778,\\n/**/\\n 1777,\\n/**/\\n 1776,\\n/**/\\n 1775,\\n/**/\\n 1774,\\n/**/\\n 1773,\\n/**/\\n 1772,\\n/**/\\n 1771,\\n/**/\\n 1770,\\n/**/\\n 1769,\\n/**/\\n 1768,\\n/**/\\n 1767,\\n/**/\\n 1766,\\n/**/\\n 1765,\\n/**/\\n 1764,\\n/**/\\n 1763,\\n/**/\\n 1762,\\n/**/\\n 1761,\\n/**/\\n 1760,\\n/**/\\n 1759,\\n/**/\\n 1758,\\n/**/\\n 1757,\\n/**/\\n 1756,\\n/**/\\n 1755,\\n/**/\\n 1754,\\n/**/\\n 1753,\\n/**/\\n 1752,\\n/**/\\n 1751,\\n/**/\\n 1750,\\n/**/\\n 1749,\\n/**/\\n 1748,\\n/**/\\n 1747,\\n/**/\\n 1746,\\n/**/\\n 1745,\\n/**/\\n 1744,\\n/**/\\n 1743,\\n/**/\\n 1742,\\n/**/\\n 1741,\\n/**/\\n 1740,\\n/**/\\n 1739,\\n/**/\\n 1738,\\n/**/\\n 1737,\\n/**/\\n 1736,\\n/**/\\n 1735,\\n/**/\\n 1734,\\n/**/\\n 1733,\\n/**/\\n 1732,\\n/**/\\n 1731,\\n/**/\\n 1730,\\n/**/\\n 1729,\\n/**/\\n 1728,\\n/**/\\n 1727,\\n/**/\\n 1726,\\n/**/\\n 1725,\\n/**/\\n 1724,\\n/**/\\n 1723,\\n/**/\\n 1722,\\n/**/\\n 1721,\\n/**/\\n 1720,\\n/**/\\n 1719,\\n/**/\\n 1718,\\n/**/\\n 1717,\\n/**/\\n 1716,\\n/**/\\n 1715,\\n/**/\\n 1714,\\n/**/\\n 1713,\\n/**/\\n 1712,\\n/**/\\n 1711,\\n/**/\\n 1710,\\n/**/\\n 1709,\\n/**/\\n 1708,\\n/**/\\n 1707,\\n/**/\\n 1706,\\n/**/\\n 1705,\\n/**/\\n 1704,\\n/**/\\n 1703,\\n/**/\\n 1702,\\n/**/\\n 1701,\\n/**/\\n 1700,\\n/**/\\n 1699,\\n/**/\\n 1698,\\n/**/\\n 1697,\\n/**/\\n 1696,\\n/**/\\n 1695,\\n/**/\\n 1694,\\n/**/\\n 1693,\\n/**/\\n 1692,\\n/**/\\n 1691,\\n/**/\\n 1690,\\n/**/\\n 1689,\\n/**/\\n 1688,\\n/**/\\n 1687,\\n/**/\\n 1686,\\n/**/\\n 1685,\\n/**/\\n 1684,\\n/**/\\n 1683,\\n/**/\\n 1682,\\n/**/\\n 1681,\\n/**/\\n 1680,\\n/**/\\n 1679,\\n/**/\\n 1678,\\n/**/\\n 1677,\\n/**/\\n 1676,\\n/**/\\n 1675,\\n/**/\\n 1674,\\n/**/\\n 1673,\\n/**/\\n 1672,\\n/**/\\n 1671,\\n/**/\\n 1670,\\n/**/\\n 1669,\\n/**/\\n 1668,\\n/**/\\n 1667,\\n/**/\\n 1666,\\n/**/\\n 1665,\\n/**/\\n 1664,\\n/**/\\n 1663,\\n/**/\\n 1662,\\n/**/\\n 1661,\\n/**/\\n 1660,\\n/**/\\n 1659,\\n/**/\\n 1658,\\n/**/\\n 1657,\\n/**/\\n 1656,\\n/**/\\n 1655,\\n/**/\\n 1654,\\n/**/\\n 1653,\\n/**/\\n 1652,\\n/**/\\n 1651,\\n/**/\\n 1650,\\n/**/\\n 1649,\\n/**/\\n 1648,\\n/**/\\n 1647,\\n/**/\\n 1646,\\n/**/\\n 1645,\\n/**/\\n 1644,\\n/**/\\n 1643,\\n/**/\\n 1642,\\n/**/\\n 1641,\\n/**/\\n 1640,\\n/**/\\n 1639,\\n/**/\\n 1638,\\n/**/\\n 1637,\\n/**/\\n 1636,\\n/**/\\n 1635,\\n/**/\\n 1634,\\n/**/\\n 1633,\\n/**/\\n 1632,\\n/**/\\n 1631,\\n/**/\\n 1630,\\n/**/\\n 1629,\\n/**/\\n 1628,\\n/**/\\n 1627,\\n/**/\\n 1626,\\n/**/\\n 1625,\\n/**/\\n 1624,\\n/**/\\n 1623,\\n/**/\\n 1622,\\n/**/\\n 1621,\\n/**/\\n 1620,\\n/**/\\n 1619,\\n/**/\\n 1618,\\n/**/\\n 1617,\\n/**/\\n 1616,\\n/**/\\n 1615,\\n/**/\\n 1614,\\n/**/\\n 1613,\\n/**/\\n 1612,\\n/**/\\n 1611,\\n/**/\\n 1610,\\n/**/\\n 1609,\\n/**/\\n 1608,\\n/**/\\n 1607,\\n/**/\\n 1606,\\n/**/\\n 1605,\\n/**/\\n 1604,\\n/**/\\n 1603,\\n/**/\\n 1602,\\n/**/\\n 1601,\\n/**/\\n 1600,\\n/**/\\n 1599,\\n/**/\\n 1598,\\n/**/\\n 1597,\\n/**/\\n 1596,\\n/**/\\n 1595,\\n/**/\\n 1594,\\n/**/\\n 1593,\\n/**/\\n 1592,\\n/**/\\n 1591,\\n/**/\\n 1590,\\n/**/\\n 1589,\\n/**/\\n 1588,\\n/**/\\n 1587,\\n/**/\\n 1586,\\n/**/\\n 1585,\\n/**/\\n 1584,\\n/**/\\n 1583,\\n/**/\\n 1582,\\n/**/\\n 1581,\\n/**/\\n 1580,\\n/**/\\n 1579,\\n/**/\\n 1578,\\n/**/\\n 1577,\\n/**/\\n 1576,\\n/**/\\n 1575,\\n/**/\\n 1574,\\n/**/\\n 1573,\\n/**/\\n 1572,\\n/**/\\n 1571,\\n/**/\\n 1570,\\n/**/\\n 1569,\\n/**/\\n 1568,\\n/**/\\n 1567,\\n/**/\\n 1566,\\n/**/\\n 1565,\\n/**/\\n 1564,\\n/**/\\n 1563,\\n/**/\\n 1562,\\n/**/\\n 1561,\\n/**/\\n 1560,\\n/**/\\n 1559,\\n/**/\\n 1558,\\n/**/\\n 1557,\\n/**/\\n 1556,\\n/**/\\n 1555,\\n/**/\\n 1554,\\n/**/\\n 1553,\\n/**/\\n 1552,\\n/**/\\n 1551,\\n/**/\\n 1550,\\n/**/\\n 1549,\\n/**/\\n 1548,\\n/**/\\n 1547,\\n/**/\\n 1546,\\n/**/\\n 1545,\\n/**/\\n 1544,\\n/**/\\n 1543,\\n/**/\\n 1542,\\n/**/\\n 1541,\\n/**/\\n 1540,\\n/**/\\n 1539,\\n/**/\\n 1538,\\n/**/\\n 1537,\\n/**/\\n 1536,\\n/**/\\n 1535,\\n/**/\\n 1534,\\n/**/\\n 1533,\\n/**/\\n 1532,\\n/**/\\n 1531,\\n/**/\\n 1530,\\n/**/\\n 1529,\\n/**/\\n 1528,\\n/**/\\n 1527,\\n/**/\\n 1526,\\n/**/\\n 1525,\\n/**/\\n 1524,\\n/**/\\n 1523,\\n/**/\\n 1522,\\n/**/\\n 1521,\\n/**/\\n 1520,\\n/**/\\n 1519,\\n/**/\\n 1518,\\n/**/\\n 1517,\\n/**/\\n 1516,\\n/**/\\n 1515,\\n/**/\\n 1514,\\n/**/\\n 1513,\\n/**/\\n 1512,\\n/**/\\n 1511,\\n/**/\\n 1510,\\n/**/\\n 1509,\\n/**/\\n 1508,\\n/**/\\n 1507,\\n/**/\\n 1506,\\n/**/\\n 1505,\\n/**/\\n 1504,\\n/**/\\n 1503,\\n/**/\\n 1502,\\n/**/\\n 1501,\\n/**/\\n 1500,\\n/**/\\n 1499,\\n/**/\\n 1498,\\n/**/\\n 1497,\\n/**/\\n 1496,\\n/**/\\n 1495,\\n/**/\\n 1494,\\n/**/\\n 1493,\\n/**/\\n 1492,\\n/**/\\n 1491,\\n/**/\\n 1490,\\n/**/\\n 1489,\\n/**/\\n 1488,\\n/**/\\n 1487,\\n/**/\\n 1486,\\n/**/\\n 1485,\\n/**/\\n 1484,\\n/**/\\n 1483,\\n/**/\\n 1482,\\n/**/\\n 1481,\\n/**/\\n 1480,\\n/**/\\n 1479,\\n/**/\\n 1478,\\n/**/\\n 1477,\\n/**/\\n 1476,\\n/**/\\n 1475,\\n/**/\\n 1474,\\n/**/\\n 1473,\\n/**/\\n 1472,\\n/**/\\n 1471,\\n/**/\\n 1470,\\n/**/\\n 1469,\\n/**/\\n 1468,\\n/**/\\n 1467,\\n/**/\\n 1466,\\n/**/\\n 1465,\\n/**/\\n 1464,\\n/**/\\n 1463,\\n/**/\\n 1462,\\n/**/\\n 1461,\\n/**/\\n 1460,\\n/**/\\n 1459,\\n/**/\\n 1458,\\n/**/\\n 1457,\\n/**/\\n 1456,\\n/**/\\n 1455,\\n/**/\\n 1454,\\n/**/\\n 1453,\\n/**/\\n 1452,\\n/**/\\n 1451,\\n/**/\\n 1450,\\n/**/\\n 1449,\\n/**/\\n 1448,\\n/**/\\n 1447,\\n/**/\\n 1446,\\n/**/\\n 1445,\\n/**/\\n 1444,\\n/**/\\n 1443,\\n/**/\\n 1442,\\n/**/\\n 1441,\\n/**/\\n 1440,\\n/**/\\n 1439,\\n/**/\\n 1438,\\n/**/\\n 1437,\\n/**/\\n 1436,\\n/**/\\n 1435,\\n/**/\\n 1434,\\n/**/\\n 1433,\\n/**/\\n 1432,\\n/**/\\n 1431,\\n/**/\\n 1430,\\n/**/\\n 1429,\\n/**/\\n 1428,\\n/**/\\n 1427,\\n/**/\\n 1426,\\n/**/\\n 1425,\\n/**/\\n 1424,\\n/**/\\n 1423,\\n/**/\\n 1422,\\n/**/\\n 1421,\\n/**/\\n 1420,\\n/**/\\n 1419,\\n/**/\\n 1418,\\n/**/\\n 1417,\\n/**/\\n 1416,\\n/**/\\n 1415,\\n/**/\\n 1414,\\n/**/\\n 1413,\\n/**/\\n 1412,\\n/**/\\n 1411,\\n/**/\\n 1410,\\n/**/\\n 1409,\\n/**/\\n 1408,\\n/**/\\n 1407,\\n/**/\\n 1406,\\n/**/\\n 1405,\\n/**/\\n 1404,\\n/**/\\n 1403,\\n/**/\\n 1402,\\n/**/\\n 1401,\\n/**/\\n 1400,\\n/**/\\n 1399,\\n/**/\\n 1398,\\n/**/\\n 1397,\\n/**/\\n 1396,\\n/**/\\n 1395,\\n/**/\\n 1394,\\n/**/\\n 1393,\\n/**/\\n 1392,\\n/**/\\n 1391,\\n/**/\\n 1390,\\n/**/\\n 1389,\\n/**/\\n 1388,\\n/**/\\n 1387,\\n/**/\\n 1386,\\n/**/\\n 1385,\\n/**/\\n 1384,\\n/**/\\n 1383,\\n/**/\\n 1382,\\n/**/\\n 1381,\\n/**/\\n 1380,\\n/**/\\n 1379,\\n/**/\\n 1378,\\n/**/\\n 1377,\\n/**/\\n 1376,\\n/**/\\n 1375,\\n/**/\\n 1374,\\n/**/\\n 1373,\\n/**/\\n 1372,\\n/**/\\n 1371,\\n/**/\\n 1370,\\n/**/\\n 1369,\\n/**/\\n 1368,\\n/**/\\n 1367,\\n/**/\\n 1366,\\n/**/\\n 1365,\\n/**/\\n 1364,\\n/**/\\n 1363,\\n/**/\\n 1362,\\n/**/\\n 1361,\\n/**/\\n 1360,\\n/**/\\n 1359,\\n/**/\\n 1358,\\n/**/\\n 1357,\\n/**/\\n 1356,\\n/**/\\n 1355,\\n/**/\\n 1354,\\n/**/\\n 1353,\\n/**/\\n 1352,\\n/**/\\n 1351,\\n/**/\\n 1350,\\n/**/\\n 1349,\\n/**/\\n 1348,\\n/**/\\n 1347,\\n/**/\\n 1346,\\n/**/\\n 1345,\\n/**/\\n 1344,\\n/**/\\n 1343,\\n/**/\\n 1342,\\n/**/\\n 1341,\\n/**/\\n 1340,\\n/**/\\n 1339,\\n/**/\\n 1338,\\n/**/\\n 1337,\\n/**/\\n 1336,\\n/**/\\n 1335,\\n/**/\\n 1334,\\n/**/\\n 1333,\\n/**/\\n 1332,\\n/**/\\n 1331,\\n/**/\\n 1330,\\n/**/\\n 1329,\\n/**/\\n 1328,\\n/**/\\n 1327,\\n/**/\\n 1326,\\n/**/\\n 1325,\\n/**/\\n 1324,\\n/**/\\n 1323,\\n/**/\\n 1322,\\n/**/\\n 1321,\\n/**/\\n 1320,\\n/**/\\n 1319,\\n/**/\\n 1318,\\n/**/\\n 1317,\\n/**/\\n 1316,\\n/**/\\n 1315,\\n/**/\\n 1314,\\n/**/\\n 1313,\\n/**/\\n 1312,\\n/**/\\n 1311,\\n/**/\\n 1310,\\n/**/\\n 1309,\\n/**/\\n 1308,\\n/**/\\n 1307,\\n/**/\\n 1306,\\n/**/\\n 1305,\\n/**/\\n 1304,\\n/**/\\n 1303,\\n/**/\\n 1302,\\n/**/\\n 1301,\\n/**/\\n 1300,\\n/**/\\n 1299,\\n/**/\\n 1298,\\n/**/\\n 1297,\\n/**/\\n 1296,\\n/**/\\n 1295,\\n/**/\\n 1294,\\n/**/\\n 1293,\\n/**/\\n 1292,\\n/**/\\n 1291,\\n/**/\\n 1290,\\n/**/\\n 1289,\\n/**/\\n 1288,\\n/**/\\n 1287,\\n/**/\\n 1286,\\n/**/\\n 1285,\\n/**/\\n 1284,\\n/**/\\n 1283,\\n/**/\\n 1282,\\n/**/\\n 1281,\\n/**/\\n 1280,\\n/**/\\n 1279,\\n/**/\\n 1278,\\n/**/\\n 1277,\\n/**/\\n 1276,\\n/**/\\n 1275,\\n/**/\\n 1274,\\n/**/\\n 1273,\\n/**/\\n 1272,\\n/**/\\n 1271,\\n/**/\\n 1270,\\n/**/\\n 1269,\\n/**/\\n 1268,\\n/**/\\n 1267,\\n/**/\\n 1266,\\n/**/\\n 1265,\\n/**/\\n 1264,\\n/**/\\n 1263,\\n/**/\\n 1262,\\n/**/\\n 1261,\\n/**/\\n 1260,\\n/**/\\n 1259,\\n/**/\\n 1258,\\n/**/\\n 1257,\\n/**/\\n 1256,\\n/**/\\n 1255,\\n/**/\\n 1254,\\n/**/\\n 1253,\\n/**/\\n 1252,\\n/**/\\n 1251,\\n/**/\\n 1250,\\n/**/\\n 1249,\\n/**/\\n 1248,\\n/**/\\n 1247,\\n/**/\\n 1246,\\n/**/\\n 1245,\\n/**/\\n 1244,\\n/**/\\n 1243,\\n/**/\\n 1242,\\n/**/\\n 1241,\\n/**/\\n 1240,\\n/**/\\n 1239,\\n/**/\\n 1238,\\n/**/\\n 1237,\\n/**/\\n 1236,\\n/**/\\n 1235,\\n/**/\\n 1234,\\n/**/\\n 1233,\\n/**/\\n 1232,\\n/**/\\n 1231,\\n/**/\\n 1230,\\n/**/\\n 1229,\\n/**/\\n 1228,\\n/**/\\n 1227,\\n/**/\\n 1226,\\n/**/\\n 1225,\\n/**/\\n 1224,\\n/**/\\n 1223,\\n/**/\\n 1222,\\n/**/\\n 1221,\\n/**/\\n 1220,\\n/**/\\n 1219,\\n/**/\\n 1218,\\n/**/\\n 1217,\\n/**/\\n 1216,\\n/**/\\n 1215,\\n/**/\\n 1214,\\n/**/\\n 1213,\\n/**/\\n 1212,\\n/**/\\n 1211,\\n/**/\\n 1210,\\n/**/\\n 1209,\\n/**/\\n 1208,\\n/**/\\n 1207,\\n/**/\\n 1206,\\n/**/\\n 1205,\\n/**/\\n 1204,\\n/**/\\n 1203,\\n/**/\\n 1202,\\n/**/\\n 1201,\\n/**/\\n 1200,\\n/**/\\n 1199,\\n/**/\\n 1198,\\n/**/\\n 1197,\\n/**/\\n 1196,\\n/**/\\n 1195,\\n/**/\\n 1194,\\n/**/\\n 1193,\\n/**/\\n 1192,\\n/**/\\n 1191,\\n/**/\\n 1190,\\n/**/\\n 1189,\\n/**/\\n 1188,\\n/**/\\n 1187,\\n/**/\\n 1186,\\n/**/\\n 1185,\\n/**/\\n 1184,\\n/**/\\n 1183,\\n/**/\\n 1182,\\n/**/\\n 1181,\\n/**/\\n 1180,\\n/**/\\n 1179,\\n/**/\\n 1178,\\n/**/\\n 1177,\\n/**/\\n 1176,\\n/**/\\n 1175,\\n/**/\\n 1174,\\n/**/\\n 1173,\\n/**/\\n 1172,\\n/**/\\n 1171,\\n/**/\\n 1170,\\n/**/\\n 1169,\\n/**/\\n 1168,\\n/**/\\n 1167,\\n/**/\\n 1166,\\n/**/\\n 1165,\\n/**/\\n 1164,\\n/**/\\n 1163,\\n/**/\\n 1162,\\n/**/\\n 1161,\\n/**/\\n 1160,\\n/**/\\n 1159,\\n/**/\\n 1158,\\n/**/\\n 1157,\\n/**/\\n 1156,\\n/**/\\n 1155,\\n/**/\\n 1154,\\n/**/\\n 1153,\\n/**/\\n 1152,\\n/**/\\n 1151,\\n/**/\\n 1150,\\n/**/\\n 1149,\\n/**/\\n 1148,\\n/**/\\n 1147,\\n/**/\\n 1146,\\n/**/\\n 1145,\\n/**/\\n 1144,\\n/**/\\n 1143,\\n/**/\\n 1142,\\n/**/\\n 1141,\\n/**/\\n 1140,\\n/**/\\n 1139,\\n/**/\\n 1138,\\n/**/\\n 1137,\\n/**/\\n 1136,\\n/**/\\n 1135,\\n/**/\\n 1134,\\n/**/\\n 1133,\\n/**/\\n 1132,\\n/**/\\n 1131,\\n/**/\\n 1130,\\n/**/\\n 1129,\\n/**/\\n 1128,\\n/**/\\n 1127,\\n/**/\\n 1126,\\n/**/\\n 1125,\\n/**/\\n 1124,\\n/**/\\n 1123,\\n/**/\\n 1122,\\n/**/\\n 1121,\\n/**/\\n 1120,\\n/**/\\n 1119,\\n/**/\\n 1118,\\n/**/\\n 1117,\\n/**/\\n 1116,\\n/**/\\n 1115,\\n/**/\\n 1114,\\n/**/\\n 1113,\\n/**/\\n 1112,\\n/**/\\n 1111,\\n/**/\\n 1110,\\n/**/\\n 1109,\\n/**/\\n 1108,\\n/**/\\n 1107,\\n/**/\\n 1106,\\n/**/\\n 1105,\\n/**/\\n 1104,\\n/**/\\n 1103,\\n/**/\\n 1102,\\n/**/\\n 1101,\\n/**/\\n 1100,\\n/**/\\n 1099,\\n/**/\\n 1098,\\n/**/\\n 1097,\\n/**/\\n 1096,\\n/**/\\n 1095,\\n/**/\\n 1094,\\n/**/\\n 1093,\\n/**/\\n 1092,\\n/**/\\n 1091,\\n/**/\\n 1090,\\n/**/\\n 1089,\\n/**/\\n 1088,\\n/**/\\n 1087,\\n/**/\\n 1086,\\n/**/\\n 1085,\\n/**/\\n 1084,\\n/**/\\n 1083,\\n/**/\\n 1082,\\n/**/\\n 1081,\\n/**/\\n 1080,\\n/**/\\n 1079,\\n/**/\\n 1078,\\n/**/\\n 1077,\\n/**/\\n 1076,\\n/**/\\n 1075,\\n/**/\\n 1074,\\n/**/\\n 1073,\\n/**/\\n 1072,\\n/**/\\n 1071,\\n/**/\\n 1070,\\n/**/\\n 1069,\\n/**/\\n 1068,\\n/**/\\n 1067,\\n/**/\\n 1066,\\n/**/\\n 1065,\\n/**/\\n 1064,\\n/**/\\n 1063,\\n/**/\\n 1062,\\n/**/\\n 1061,\\n/**/\\n 1060,\\n/**/\\n 1059,\\n/**/\\n 1058,\\n/**/\\n 1057,\\n/**/\\n 1056,\\n/**/\\n 1055,\\n/**/\\n 1054,\\n/**/\\n 1053,\\n/**/\\n 1052,\\n/**/\\n 1051,\\n/**/\\n 1050,\\n/**/\\n 1049,\\n/**/\\n 1048,\\n/**/\\n 1047,\\n/**/\\n 1046,\\n/**/\\n 1045,\\n/**/\\n 1044,\\n/**/\\n 1043,\\n/**/\\n 1042,\\n/**/\\n 1041,\\n/**/\\n 1040,\\n/**/\\n 1039,\\n/**/\\n 1038,\\n/**/\\n 1037,\\n/**/\\n 1036,\\n/**/\\n 1035,\\n/**/\\n 1034,\\n/**/\\n 1033,\\n/**/\\n 1032,\\n/**/\\n 1031,\\n/**/\\n 1030,\\n/**/\\n 1029,\\n/**/\\n 1028,\\n/**/\\n 1027,\\n/**/\\n 1026,\\n/**/\\n 1025,\\n/**/\\n 1024,\\n/**/\\n 1023,\\n/**/\\n 1022,\\n/**/\\n 1021,\\n/**/\\n 1020,\\n/**/\\n 1019,\\n/**/\\n 1018,\\n/**/\\n 1017,\\n/**/\\n 1016,\\n/**/\\n 1015,\\n/**/\\n 1014,\\n/**/\\n 1013,\\n/**/\\n 1012,\\n/**/\\n 1011,\\n/**/\\n 1010,\\n/**/\\n 1009,\\n/**/\\n 1008,\\n/**/\\n 1007,\\n/**/\\n 1006,\\n/**/\\n 1005,\\n/**/\\n 1004,\\n/**/\\n 1003,\\n/**/\\n 1002,\\n/**/\\n 1001,\\n/**/\\n 1000,\\n/**/\\n 999,\\n/**/\\n 998,\\n/**/\\n 997,\\n/**/\\n 996,\\n/**/\\n 995,\\n/**/\\n 994,\\n/**/\\n 993,\\n/**/\\n 992,\\n/**/\\n 991,\\n/**/\\n 990,\\n/**/\\n 989,\\n/**/\\n 988,\\n/**/\\n 987,\\n/**/\\n 986,\\n/**/\\n 985,\\n/**/\\n 984,\\n/**/\\n 983,\\n/**/\\n 982,\\n/**/\\n 981,\\n/**/\\n 980,\\n/**/\\n 979,\\n/**/\\n 978,\\n/**/\\n 977,\\n/**/\\n 976,\\n/**/\\n 975,\\n/**/\\n 974,\\n/**/\\n 973,\\n/**/\\n 972,\\n/**/\\n 971,\\n/**/\\n 970,\\n/**/\\n 969,\\n/**/\\n 968,\\n/**/\\n 967,\\n/**/\\n 966,\\n/**/\\n 965,\\n/**/\\n 964,\\n/**/\\n 963,\\n/**/\\n 962,\\n/**/\\n 961,\\n/**/\\n 960,\\n/**/\\n 959,\\n/**/\\n 958,\\n/**/\\n 957,\\n/**/\\n 956,\\n/**/\\n 955,\\n/**/\\n 954,\\n/**/\\n 953,\\n/**/\\n 952,\\n/**/\\n 951,\\n/**/\\n 950,\\n/**/\\n 949,\\n/**/\\n 948,\\n/**/\\n 947,\\n/**/\\n 946,\\n/**/\\n 945,\\n/**/\\n 944,\\n/**/\\n 943,\\n/**/\\n 942,\\n/**/\\n 941,\\n/**/\\n 940,\\n/**/\\n 939,\\n/**/\\n 938,\\n/**/\\n 937,\\n/**/\\n 936,\\n/**/\\n 935,\\n/**/\\n 934,\\n/**/\\n 933,\\n/**/\\n 932,\\n/**/\\n 931,\\n/**/\\n 930,\\n/**/\\n 929,\\n/**/\\n 928,\\n/**/\\n 927,\\n/**/\\n 926,\\n/**/\\n 925,\\n/**/\\n 924,\\n/**/\\n 923,\\n/**/\\n 922,\\n/**/\\n 921,\\n/**/\\n 920,\\n/**/\\n 919,\\n/**/\\n 918,\\n/**/\\n 917,\\n/**/\\n 916,\\n/**/\\n 915,\\n/**/\\n 914,\\n/**/\\n 913,\\n/**/\\n 912,\\n/**/\\n 911,\\n/**/\\n 910,\\n/**/\\n 909,\\n/**/\\n 908,\\n/**/\\n 907,\\n/**/\\n 906,\\n/**/\\n 905,\\n/**/\\n 904,\\n/**/\\n 903,\\n/**/\\n 902,\\n/**/\\n 901,\\n/**/\\n 900,\\n/**/\\n 899,\\n/**/\\n 898,\\n/**/\\n 897,\\n/**/\\n 896,\\n/**/\\n 895,\\n/**/\\n 894,\\n/**/\\n 893,\\n/**/\\n 892,\\n/**/\\n 891,\\n/**/\\n 890,\\n/**/\\n 889,\\n/**/\\n 888,\\n/**/\\n 887,\\n/**/\\n 886,\\n/**/\\n 885,\\n/**/\\n 884,\\n/**/\\n 883,\\n/**/\\n 882,\\n/**/\\n 881,\\n/**/\\n 880,\\n/**/\\n 879,\\n/**/\\n 878,\\n/**/\\n 877,\\n/**/\\n 876,\\n/**/\\n 875,\\n/**/\\n 874,\\n/**/\\n 873,\\n/**/\\n 872,\\n/**/\\n 871,\\n/**/\\n 870,\\n/**/\\n 869,\\n/**/\\n 868,\\n/**/\\n 867,\\n/**/\\n 866,\\n/**/\\n 865,\\n/**/\\n 864,\\n/**/\\n 863,\\n/**/\\n 862,\\n/**/\\n 861,\\n/**/\\n 860,\\n/**/\\n 859,\\n/**/\\n 858,\\n/**/\\n 857,\\n/**/\\n 856,\\n/**/\\n 855,\\n/**/\\n 854,\\n/**/\\n 853,\\n/**/\\n 852,\\n/**/\\n 851,\\n/**/\\n 850,\\n/**/\\n 849,\\n/**/\\n 848,\\n/**/\\n 847,\\n/**/\\n 846,\\n/**/\\n 845,\\n/**/\\n 844,\\n/**/\\n 843,\\n/**/\\n 842,\\n/**/\\n 841,\\n/**/\\n 840,\\n/**/\\n 839,\\n/**/\\n 838,\\n/**/\\n 837,\\n/**/\\n 836,\\n/**/\\n 835,\\n/**/\\n 834,\\n/**/\\n 833,\\n/**/\\n 832,\\n/**/\\n 831,\\n/**/\\n 830,\\n/**/\\n 829,\\n/**/\\n 828,\\n/**/\\n 827,\\n/**/\\n 826,\\n/**/\\n 825,\\n/**/\\n 824,\\n/**/\\n 823,\\n/**/\\n 822,\\n/**/\\n 821,\\n/**/\\n 820,\\n/**/\\n 819,\\n/**/\\n 818,\\n/**/\\n 817,\\n/**/\\n 816,\\n/**/\\n 815,\\n/**/\\n 814,\\n/**/\\n 813,\\n/**/\\n 812,\\n/**/\\n 811,\\n/**/\\n 810,\\n/**/\\n 809,\\n/**/\\n 808,\\n/**/\\n 807,\\n/**/\\n 806,\\n/**/\\n 805,\\n/**/\\n 804,\\n/**/\\n 803,\\n/**/\\n 802,\\n/**/\\n 801,\\n/**/\\n 800,\\n/**/\\n 799,\\n/**/\\n 798,\\n/**/\\n 797,\\n/**/\\n 796,\\n/**/\\n 795,\\n/**/\\n 794,\\n/**/\\n 793,\\n/**/\\n 792,\\n/**/\\n 791,\\n/**/\\n 790,\\n/**/\\n 789,\\n/**/\\n 788,\\n/**/\\n 787,\\n/**/\\n 786,\\n/**/\\n 785,\\n/**/\\n 784,\\n/**/\\n 783,\\n/**/\\n 782,\\n/**/\\n 781,\\n/**/\\n 780,\\n/**/\\n 779,\\n/**/\\n 778,\\n/**/\\n 777,\\n/**/\\n 776,\\n/**/\\n 775,\\n/**/\\n 774,\\n/**/\\n 773,\\n/**/\\n 772,\\n/**/\\n 771,\\n/**/\\n 770,\\n/**/\\n 769,\\n/**/\\n 768,\\n/**/\\n 767,\\n/**/\\n 766,\\n/**/\\n 765,\\n/**/\\n 764,\\n/**/\\n 763,\\n/**/\\n 762,\\n/**/\\n 761,\\n/**/\\n 760,\\n/**/\\n 759,\\n/**/\\n 758,\\n/**/\\n 757,\\n/**/\\n 756,\\n/**/\\n 755,\\n/**/\\n 754,\\n/**/\\n 753,\\n/**/\\n 752,\\n/**/\\n 751,\\n/**/\\n 750,\\n/**/\\n 749,\\n/**/\\n 748,\\n/**/\\n 747,\\n/**/\\n 746,\\n/**/\\n 745,\\n/**/\\n 744,\\n/**/\\n 743,\\n/**/\\n 742,\\n/**/\\n 741,\\n/**/\\n 740,\\n/**/\\n 739,\\n/**/\\n 738,\\n/**/\\n 737,\\n/**/\\n 736,\\n/**/\\n 735,\\n/**/\\n 734,\\n/**/\\n 733,\\n/**/\\n 732,\\n/**/\\n 731,\\n/**/\\n 730,\\n/**/\\n 729,\\n/**/\\n 728,\\n/**/\\n 727,\\n/**/\\n 726,\\n/**/\\n 725,\\n/**/\\n 724,\\n/**/\\n 723,\\n/**/\\n 722,\\n/**/\\n 721,\\n/**/\\n 720,\\n/**/\\n 719,\\n/**/\\n 718,\\n/**/\\n 717,\\n/**/\\n 716,\\n/**/\\n 715,\\n/**/\\n 714,\\n/**/\\n 713,\\n/**/\\n 712,\\n/**/\\n 711,\\n/**/\\n 710,\\n/**/\\n 709,\\n/**/\\n 708,\\n/**/\\n 707,\\n/**/\\n 706,\\n/**/\\n 705,\\n/**/\\n 704,\\n/**/\\n 703,\\n/**/\\n 702,\\n/**/\\n 701,\\n/**/\\n 700,\\n/**/\\n 699,\\n/**/\\n 698,\\n/**/\\n 697,\\n/**/\\n 696,\\n/**/\\n 695,\\n/**/\\n 694,\\n/**/\\n 693,\\n/**/\\n 692,\\n/**/\\n 691,\\n/**/\\n 690,\\n/**/\\n 689,\\n/**/\\n 688,\\n/**/\\n 687,\\n/**/\\n 686,\\n/**/\\n 685,\\n/**/\\n 684,\\n/**/\\n 683,\\n/**/\\n 682,\\n/**/\\n 681,\\n/**/\\n 680,\\n/**/\\n 679,\\n/**/\\n 678,\\n/**/\\n 677,\\n/**/\\n 676,\\n/**/\\n 675,\\n/**/\\n 674,\\n/**/\\n 673,\\n/**/\\n 672,\\n/**/\\n 671,\\n/**/\\n 670,\\n/**/\\n 669,\\n/**/\\n 668,\\n/**/\\n 667,\\n/**/\\n 666,\\n/**/\\n 665,\\n/**/\\n 664,\\n/**/\\n 663,\\n/**/\\n 662,\\n/**/\\n 661,\\n/**/\\n 660,\\n/**/\\n 659,\\n/**/\\n 658,\\n/**/\\n 657,\\n/**/\\n 656,\\n/**/\\n 655,\\n/**/\\n 654,\\n/**/\\n 653,\\n/**/\\n 652,\\n/**/\\n 651,\\n/**/\\n 650,\\n/**/\\n 649,\\n/**/\\n 648,\\n/**/\\n 647,\\n/**/\\n 646,\\n/**/\\n 645,\\n/**/\\n 644,\\n/**/\\n 643,\\n/**/\\n 642,\\n/**/\\n 641,\\n/**/\\n 640,\\n/**/\\n 639,\\n/**/\\n 638,\\n/**/\\n 637,\\n/**/\\n 636,\\n/**/\\n 635,\\n/**/\\n 634,\\n/**/\\n 633,\\n/**/\\n 632,\\n/**/\\n 631,\\n/**/\\n 630,\\n/**/\\n 629,\\n/**/\\n 628,\\n/**/\\n 627,\\n/**/\\n 626,\\n/**/\\n 625,\\n/**/\\n 624,\\n/**/\\n 623,\\n/**/\\n 622,\\n/**/\\n 621,\\n/**/\\n 620,\\n/**/\\n 619,\\n/**/\\n 618,\\n/**/\\n 617,\\n/**/\\n 616,\\n/**/\\n 615,\\n/**/\\n 614,\\n/**/\\n 613,\\n/**/\\n 612,\\n/**/\\n 611,\\n/**/\\n 610,\\n/**/\\n 609,\\n/**/\\n 608,\\n/**/\\n 607,\\n/**/\\n 606,\\n/**/\\n 605,\\n/**/\\n 604,\\n/**/\\n 603,\\n/**/\\n 602,\\n/**/\\n 601,\\n/**/\\n 600,\\n/**/\\n 599,\\n/**/\\n 598,\\n/**/\\n 597,\\n/**/\\n 596,\\n/**/\\n 595,\\n/**/\\n 594,\\n/**/\\n 593,\\n/**/\\n 592,\\n/**/\\n 591,\\n/**/\\n 590,\\n/**/\\n 589,\\n/**/\\n 588,\\n/**/\\n 587,\\n/**/\\n 586,\\n/**/\\n 585,\\n/**/\\n 584,\\n/**/\\n 583,\\n/**/\\n 582,\\n/**/\\n 581,\\n/**/\\n 580,\\n/**/\\n 579,\\n/**/\\n 578,\\n/**/\\n 577,\\n/**/\\n 576,\\n/**/\\n 575,\\n/**/\\n 574,\\n/**/\\n 573,\\n/**/\\n 572,\\n/**/\\n 571,\\n/**/\\n 570,\\n/**/\\n 569,\\n/**/\\n 568,\\n/**/\\n 567,\\n/**/\\n 566,\\n/**/\\n 565,\\n/**/\\n 564,\\n/**/\\n 563,\\n/**/\\n 562,\\n/**/\\n 561,\\n/**/\\n 560,\\n/**/\\n 559,\\n/**/\\n 558,\\n/**/\\n 557,\\n/**/\\n 556,\\n/**/\\n 555,\\n/**/\\n 554,\\n/**/\\n 553,\\n/**/\\n 552,\\n/**/\\n 551,\\n/**/\\n 550,\\n/**/\\n 549,\\n/**/\\n 548,\\n/**/\\n 547,\\n/**/\\n 546,\\n/**/\\n 545,\\n/**/\\n 544,\\n/**/\\n 543,\\n/**/\\n 542,\\n/**/\\n 541,\\n/**/\\n 540,\\n/**/\\n 539,\\n/**/\\n 538,\\n/**/\\n 537,\\n/**/\\n 536,\\n/**/\\n 535,\\n/**/\\n 534,\\n/**/\\n 533,\\n/**/\\n 532,\\n/**/\\n 531,\\n/**/\\n 530,\\n/**/\\n 529,\\n/**/\\n 528,\\n/**/\\n 527,\\n/**/\\n 526,\\n/**/\\n 525,\\n/**/\\n 524,\\n/**/\\n 523,\\n/**/\\n 522,\\n/**/\\n 521,\\n/**/\\n 520,\\n/**/\\n 519,\\n/**/\\n 518,\\n/**/\\n 517,\\n/**/\\n 516,\\n/**/\\n 515,\\n/**/\\n 514,\\n/**/\\n 513,\\n/**/\\n 512,\\n/**/\\n 511,\\n/**/\\n 510,\\n/**/\\n 509,\\n/**/\\n 508,\\n/**/\\n 507,\\n/**/\\n 506,\\n/**/\\n 505,\\n/**/\\n 504,\\n/**/\\n 503,\\n/**/\\n 502,\\n/**/\\n 501,\\n/**/\\n 500,\\n/**/\\n 499,\\n/**/\\n 498,\\n/**/\\n 497,\\n/**/\\n 496,\\n/**/\\n 495,\\n/**/\\n 494,\\n/**/\\n 493,\\n/**/\\n 492,\\n/**/\\n 491,\\n/**/\\n 490,\\n/**/\\n 489,\\n/**/\\n 488,\\n/**/\\n 487,\\n/**/\\n 486,\\n/**/\\n 485,\\n/**/\\n 484,\\n/**/\\n 483,\\n/**/\\n 482,\\n/**/\\n 481,\\n/**/\\n 480,\\n/**/\\n 479,\\n/**/\\n 478,\\n/**/\\n 477,\\n/**/\\n 476,\\n/**/\\n 475,\\n/**/\\n 474,\\n/**/\\n 473,\\n/**/\\n 472,\\n/**/\\n 471,\\n/**/\\n 470,\\n/**/\\n 469,\\n/**/\\n 468,\\n/**/\\n 467,\\n/**/\\n 466,\\n/**/\\n 465,\\n/**/\\n 464,\\n/**/\\n 463,\\n/**/\\n 462,\\n/**/\\n 461,\\n/**/\\n 460,\\n/**/\\n 459,\\n/**/\\n 458,\\n/**/\\n 457,\\n/**/\\n 456,\\n/**/\\n 455,\\n/**/\\n 454,\\n/**/\\n 453,\\n/**/\\n 452,\\n/**/\\n 451,\\n/**/\\n 450,\\n/**/\\n 449,\\n/**/\\n 448,\\n/**/\\n 447,\\n/**/\\n 446,\\n/**/\\n 445,\\n/**/\\n 444,\\n/**/\\n 443,\\n/**/\\n 442,\\n/**/\\n 441,\\n/**/\\n 440,\\n/**/\\n 439,\\n/**/\\n 438,\\n/**/\\n 437,\\n/**/\\n 436,\\n/**/\\n 435,\\n/**/\\n 434,\\n/**/\\n 433,\\n/**/\\n 432,\\n/**/\\n 431,\\n/**/\\n 430,\\n/**/\\n 429,\\n/**/\\n 428,\\n/**/\\n 427,\\n/**/\\n 426,\\n/**/\\n 425,\\n/**/\\n 424,\\n/**/\\n 423,\\n/**/\\n 422,\\n/**/\\n 421,\\n/**/\\n 420,\\n/**/\\n 419,\\n/**/\\n 418,\\n/**/\\n 417,\\n/**/\\n 416,\\n/**/\\n 415,\\n/**/\\n 414,\\n/**/\\n 413,\\n/**/\\n 412,\\n/**/\\n 411,\\n/**/\\n 410,\\n/**/\\n 409,\\n/**/\\n 408,\\n/**/\\n 407,\\n/**/\\n 406,\\n/**/\\n 405,\\n/**/\\n 404,\\n/**/\\n 403,\\n/**/\\n 402,\\n/**/\\n 401,\\n/**/\\n 400,\\n/**/\\n 399,\\n/**/\\n 398,\\n/**/\\n 397,\\n/**/\\n 396,\\n/**/\\n 395,\\n/**/\\n 394,\\n/**/\\n 393,\\n/**/\\n 392,\\n/**/\\n 391,\\n/**/\\n 390,\\n/**/\\n 389,\\n/**/\\n 388,\\n/**/\\n 387,\\n/**/\\n 386,\\n/**/\\n 385,\\n/**/\\n 384,\\n/**/\\n 383,\\n/**/\\n 382,\\n/**/\\n 381,\\n/**/\\n 380,\\n/**/\\n 379,\\n/**/\\n 378,\\n/**/\\n 377,\\n/**/\\n 376,\\n/**/\\n 375,\\n/**/\\n 374,\\n/**/\\n 373,\\n/**/\\n 372,\\n/**/\\n 371,\\n/**/\\n 370,\\n/**/\\n 369,\\n/**/\\n 368,\\n/**/\\n 367,\\n/**/\\n 366,\\n/**/\\n 365,\\n/**/\\n 364,\\n/**/\\n 363,\\n/**/\\n 362,\\n/**/\\n 361,\\n/**/\\n 360,\\n/**/\\n 359,\\n/**/\\n 358,\\n/**/\\n 357,\\n/**/\\n 356,\\n/**/\\n 355,\\n/**/\\n 354,\\n/**/\\n 353,\\n/**/\\n 352,\\n/**/\\n 351,\\n/**/\\n 350,\\n/**/\\n 349,\\n/**/\\n 348,\\n/**/\\n 347,\\n/**/\\n 346,\\n/**/\\n 345,\\n/**/\\n 344,\\n/**/\\n 343,\\n/**/\\n 342,\\n/**/\\n 341,\\n/**/\\n 340,\\n/**/\\n 339,\\n/**/\\n 338,\\n/**/\\n 337,\\n/**/\\n 336,\\n/**/\\n 335,\\n/**/\\n 334,\\n/**/\\n 333,\\n/**/\\n 332,\\n/**/\\n 331,\\n/**/\\n 330,\\n/**/\\n 329,\\n/**/\\n 328,\\n/**/\\n 327,\\n/**/\\n 326,\\n/**/\\n 325,\\n/**/\\n 324,\\n/**/\\n 323,\\n/**/\\n 322,\\n/**/\\n 321,\\n/**/\\n 320,\\n/**/\\n 319,\\n/**/\\n 318,\\n/**/\\n 317,\\n/**/\\n 316,\\n/**/\\n 315,\\n/**/\\n 314,\\n/**/\\n 313,\\n/**/\\n 312,\\n/**/\\n 311,\\n/**/\\n 310,\\n/**/\\n 309,\\n/**/\\n 308,\\n/**/\\n 307,\\n/**/\\n 306,\\n/**/\\n 305,\\n/**/\\n 304,\\n/**/\\n 303,\\n/**/\\n 302,\\n/**/\\n 301,\\n/**/\\n 300,\\n/**/\\n 299,\\n/**/\\n 298,\\n/**/\\n 297,\\n/**/\\n 296,\\n/**/\\n 295,\\n/**/\\n 294,\\n/**/\\n 293,\\n/**/\\n 292,\\n/**/\\n 291,\\n/**/\\n 290,\\n/**/\\n 289,\\n/**/\\n 288,\\n/**/\\n 287,\\n/**/\\n 286,\\n/**/\\n 285,\\n/**/\\n 284,\\n/**/\\n 283,\\n/**/\\n 282,\\n/**/\\n 281,\\n/**/\\n 280,\\n/**/\\n 279,\\n/**/\\n 278,\\n/**/\\n 277,\\n/**/\\n 276,\\n/**/\\n 275,\\n/**/\\n 274,\\n/**/\\n 273,\\n/**/\\n 272,\\n/**/\\n 271,\\n/**/\\n 270,\\n/**/\\n 269,\\n/**/\\n 268,\\n/**/\\n 267,\\n/**/\\n 266,\\n/**/\\n 265,\\n/**/\\n 264,\\n/**/\\n 263,\\n/**/\\n 262,\\n/**/\\n 261,\\n/**/\\n 260,\\n/**/\\n 259,\\n/**/\\n 258,\\n/**/\\n 257,\\n/**/\\n 256,\\n/**/\\n 255,\\n/**/\\n 254,\\n/**/\\n 253,\\n/**/\\n 252,\\n/**/\\n 251,\\n/**/\\n 250,\\n/**/\\n 249,\\n/**/\\n 248,\\n/**/\\n 247,\\n/**/\\n 246,\\n/**/\\n 245,\\n/**/\\n 244,\\n/**/\\n 243,\\n/**/\\n 242,\\n/**/\\n 241,\\n/**/\\n 240,\\n/**/\\n 239,\\n/**/\\n 238,\\n/**/\\n 237,\\n/**/\\n 236,\\n/**/\\n 235,\\n/**/\\n 234,\\n/**/\\n 233,\\n/**/\\n 232,\\n/**/\\n 231,\\n/**/\\n 230,\\n/**/\\n 229,\\n/**/\\n 228,\\n/**/\\n 227,\\n/**/\\n 226,\\n/**/\\n 225,\\n/**/\\n 224,\\n/**/\\n 223,\\n/**/\\n 222,\\n/**/\\n 221,\\n/**/\\n 220,\\n/**/\\n 219,\\n/**/\\n 218,\\n/**/\\n 217,\\n/**/\\n 216,\\n/**/\\n 215,\\n/**/\\n 214,\\n/**/\\n 213,\\n/**/\\n 212,\\n/**/\\n 211,\\n/**/\\n 210,\\n/**/\\n 209,\\n/**/\\n 208,\\n/**/\\n 207,\\n/**/\\n 206,\\n/**/\\n 205,\\n/**/\\n 204,\\n/**/\\n 203,\\n/**/\\n 202,\\n/**/\\n 201,\\n/**/\\n 200,\\n/**/\\n 199,\\n/**/\\n 198,\\n/**/\\n 197,\\n/**/\\n 196,\\n/**/\\n 195,\\n/**/\\n 194,\\n/**/\\n 193,\\n/**/\\n 192,\\n/**/\\n 191,\\n/**/\\n 190,\\n/**/\\n 189,\\n/**/\\n 188,\\n/**/\\n 187,\\n/**/\\n 186,\\n/**/\\n 185,\\n/**/\\n 184,\\n/**/\\n 183,\\n/**/\\n 182,\\n/**/\\n 181,\\n/**/\\n 180,\\n/**/\\n 179,\\n/**/\\n 178,\\n/**/\\n 177,\\n/**/\\n 176,\\n/**/\\n 175,\\n/**/\\n 174,\\n/**/\\n 173,\\n/**/\\n 172,\\n/**/\\n 171,\\n/**/\\n 170,\\n/**/\\n 169,\\n/**/\\n 168,\\n/**/\\n 167,\\n/**/\\n 166,\\n/**/\\n 165,\\n/**/\\n 164,\\n/**/\\n 163,\\n/**/\\n 162,\\n/**/\\n 161,\\n/**/\\n 160,\\n/**/\\n 159,\\n/**/\\n 158,\\n/**/\\n 157,\\n/**/\\n 156,\\n/**/\\n 155,\\n/**/\\n 154,\\n/**/\\n 153,\\n/**/\\n 152,\\n/**/\\n 151,\\n/**/\\n 150,\\n/**/\\n 149,\\n/**/\\n 148,\\n/**/\\n 147,\\n/**/\\n 146,\\n/**/\\n 145,\\n/**/\\n 144,\\n/**/\\n 143,\\n/**/\\n 142,\\n/**/\\n 141,\\n/**/\\n 140,\\n/**/\\n 139,\\n/**/\\n 138,\\n/**/\\n 137,\\n/**/\\n 136,\\n/**/\\n 135,\\n/**/\\n 134,\\n/**/\\n 133,\\n/**/\\n 132,\\n/**/\\n 131,\\n/**/\\n 130,\\n/**/\\n 129,\\n/**/\\n 128,\\n/**/\\n 127,\\n/**/\\n 126,\\n/**/\\n 125,\\n/**/\\n 124,\\n/**/\\n 123,\\n/**/\\n 122,\\n/**/\\n 121,\\n/**/\\n 120,\\n/**/\\n 119,\\n/**/\\n 118,\\n/**/\\n 117,\\n/**/\\n 116,\\n/**/\\n 115,\\n/**/\\n 114,\\n/**/\\n 113,\\n/**/\\n 112,\\n/**/\\n 111,\\n/**/\\n 110,\\n/**/\\n 109,\\n/**/\\n 108,\\n/**/\\n 107,\\n/**/\\n 106,\\n/**/\\n 105,\\n/**/\\n 104,\\n/**/\\n 103,\\n/**/\\n 102,\\n/**/\\n 101,\\n/**/\\n 100,\\n/**/\\n 99,\\n/**/\\n 98,\\n/**/\\n 97,\\n/**/\\n 96,\\n/**/\\n 95,\\n/**/\\n 94,\\n/**/\\n 93,\\n/**/\\n 92,\\n/**/\\n 91,\\n/**/\\n 90,\\n/**/\\n 89,\\n/**/\\n 88,\\n/**/\\n 87,\\n/**/\\n 86,\\n/**/\\n 85,\\n/**/\\n 84,\\n/**/\\n 83,\\n/**/\\n 82,\\n/**/\\n 81,\\n/**/\\n 80,\\n/**/\\n 79,\\n/**/\\n 78,\\n/**/\\n 77,\\n/**/\\n 76,\\n/**/\\n 75,\\n/**/\\n 74,\\n/**/\\n 73,\\n/**/\\n 72,\\n/**/\\n 71,\\n/**/\\n 70,\\n/**/\\n 69,\\n/**/\\n 68,\\n/**/\\n 67,\\n/**/\\n 66,\\n/**/\\n 65,\\n/**/\\n 64,\\n/**/\\n 63,\\n/**/\\n 62,\\n/**/\\n 61,\\n/**/\\n 60,\\n/**/\\n 59,\\n/**/\\n 58,\\n/**/\\n 57,\\n/**/\\n 56,\\n/**/\\n 55,\\n/**/\\n 54,\\n/**/\\n 53,\\n/**/\\n 52,\\n/**/\\n 51,\\n/**/\\n 50,\\n/**/\\n 49,\\n/**/\\n 48,\\n/**/\\n 47,\\n/**/\\n 46,\\n/**/\\n 45,\\n/**/\\n 44,\\n/**/\\n 43,\\n/**/\\n 42,\\n/**/\\n 41,\\n/**/\\n 40,\\n/**/\\n 39,\\n/**/\\n 38,\\n/**/\\n 37,\\n/**/\\n 36,\\n/**/\\n 35,\\n/**/\\n 34,\\n/**/\\n 33,\\n/**/\\n 32,\\n/**/\\n 31,\\n/**/\\n 30,\\n/**/\\n 29,\\n/**/\\n 28,\\n/**/\\n 27,\\n/**/\\n 26,\\n/**/\\n 25,\\n/**/\\n 24,\\n/**/\\n 23,\\n/**/\\n 22,\\n/**/\\n 21,\\n/**/\\n 20,\\n/**/\\n 19,\\n/**/\\n 18,\\n/**/\\n 17,\\n/**/\\n 16,\\n/**/\\n 15,\\n/**/\\n 14,\\n/**/\\n 13,\\n/**/\\n 12,\\n/**/\\n 11,\\n/**/\\n 10,\\n/**/\\n 9,\\n/**/\\n 8,\\n/**/\\n 7,\\n/**/\\n 6,\\n/**/\\n 5,\\n/**/\\n 4,\\n/**/\\n 3,\\n/**/\\n 2,\\n/**/\\n 1,\\n/**/\\n 0\\n};\",\n \"/*\\n * Place to put a short description when adding a feature with a patch.\\n * Keep it short, e.g.,: \\\"relative numbers\\\", \\\"persistent undo\\\".\\n * Also add a comment marker to separate the lines.\\n * See the official Vim patches for the diff format: It must use a context of\\n * one line only. Create it by hand or use \\\"diff -C2\\\" and edit the patch.\\n */\\nstatic char *(extra_patches[]) =\\n{ /* Add your patch description below this line */\\n/**/\\n NULL\\n};\",\n \" int\\nhighest_patch(void)\\n{\\n // this relies on the highest patch number to be the first entry\\n return included_patches[0];\\n}\",\n \"#if defined(FEAT_EVAL) || defined(PROTO)\\n/*\\n * Return TRUE if patch \\\"n\\\" has been included.\\n */\\n int\\nhas_patch(int n)\\n{\\n int\\t\\th, m, l;\",\n \" // Perform a binary search.\\n l = 0;\\n h = (int)ARRAY_LENGTH(included_patches) - 1;\\n while (l < h)\\n {\\n\\tm = (l + h) / 2;\\n\\tif (included_patches[m] == n)\\n\\t return TRUE;\\n\\tif (included_patches[m] < n)\\n\\t h = m;\\n\\telse\\n\\t l = m + 1;\\n }\\n return FALSE;\\n}\\n#endif\",\n \" void\\nex_version(exarg_T *eap)\\n{\\n /*\\n * Ignore a \\\":version 9.99\\\" command.\\n */\\n if (*eap->arg == NUL)\\n {\\n\\tmsg_putchar('\\\\n');\\n\\tlist_version();\\n }\\n}\",\n \"/*\\n * Output a string for the version message. If it's going to wrap, output a\\n * newline, unless the message is too long to fit on the screen anyway.\\n * When \\\"wrap\\\" is TRUE wrap the string in [].\\n */\\n static void\\nversion_msg_wrap(char_u *s, int wrap)\\n{\\n int\\t\\tlen = vim_strsize(s) + (wrap ? 2 : 0);\",\n \" if (!got_int && len < (int)Columns && msg_col + len >= (int)Columns\\n\\t\\t\\t\\t\\t\\t\\t\\t&& *s != '\\\\n')\\n\\tmsg_putchar('\\\\n');\\n if (!got_int)\\n {\\n\\tif (wrap)\\n\\t msg_puts(\\\"[\\\");\\n\\tmsg_puts((char *)s);\\n\\tif (wrap)\\n\\t msg_puts(\\\"]\\\");\\n }\\n}\",\n \" static void\\nversion_msg(char *s)\\n{\\n version_msg_wrap((char_u *)s, FALSE);\\n}\",\n \"/*\\n * List all features aligned in columns, dictionary style.\\n */\\n static void\\nlist_features(void)\\n{\\n list_in_columns((char_u **)features, -1, -1);\\n}\",\n \"/*\\n * List string items nicely aligned in columns.\\n * When \\\"size\\\" is < 0 then the last entry is marked with NULL.\\n * The entry with index \\\"current\\\" is inclosed in [].\\n */\\n void\\nlist_in_columns(char_u **items, int size, int current)\\n{\\n int\\t\\ti;\\n int\\t\\tncol;\\n int\\t\\tnrow;\\n int\\t\\tcur_row = 1;\\n int\\t\\titem_count = 0;\\n int\\t\\twidth = 0;\\n#ifdef FEAT_SYN_HL\\n int\\t\\tuse_highlight = (items == (char_u **)features);\\n#endif\",\n \" // Find the length of the longest item, use that + 1 as the column\\n // width.\\n for (i = 0; size < 0 ? items[i] != NULL : i < size; ++i)\\n {\\n\\tint l = vim_strsize(items[i]) + (i == current ? 2 : 0);\",\n \"\\tif (l > width)\\n\\t width = l;\\n\\t++item_count;\\n }\\n width += 1;\",\n \" if (Columns < width)\\n {\\n\\t// Not enough screen columns - show one per line\\n\\tfor (i = 0; i < item_count; ++i)\\n\\t{\\n\\t version_msg_wrap(items[i], i == current);\\n\\t if (msg_col > 0 && i < item_count - 1)\\n\\t\\tmsg_putchar('\\\\n');\\n\\t}\\n\\treturn;\\n }\",\n \" // The rightmost column doesn't need a separator.\\n // Sacrifice it to fit in one more column if possible.\\n ncol = (int) (Columns + 1) / width;\\n nrow = item_count / ncol + ((item_count % ncol) ? 1 : 0);\",\n \" // \\\"i\\\" counts columns then rows. \\\"idx\\\" counts rows then columns.\\n for (i = 0; !got_int && i < nrow * ncol; ++i)\\n {\\n\\tint idx = (i / ncol) + (i % ncol) * nrow;\",\n \"\\tif (idx < item_count)\\n\\t{\\n\\t int last_col = (i + 1) % ncol == 0;\",\n \"\\t if (idx == current)\\n\\t\\tmsg_putchar('[');\\n#ifdef FEAT_SYN_HL\\n\\t if (use_highlight && items[idx][0] == '-')\\n\\t\\tmsg_puts_attr((char *)items[idx], HL_ATTR(HLF_W));\\n\\t else\\n#endif\\n\\t\\tmsg_puts((char *)items[idx]);\\n\\t if (idx == current)\\n\\t\\tmsg_putchar(']');\\n\\t if (last_col)\\n\\t {\\n\\t\\tif (msg_col > 0 && cur_row < nrow)\\n\\t\\t msg_putchar('\\\\n');\\n\\t\\t++cur_row;\\n\\t }\\n\\t else\\n\\t {\\n\\t\\twhile (msg_col % width)\\n\\t\\t msg_putchar(' ');\\n\\t }\\n\\t}\\n\\telse\\n\\t{\\n\\t // this row is out of items, thus at the end of the row\\n\\t if (msg_col > 0)\\n\\t {\\n\\t\\tif (cur_row < nrow)\\n\\t\\t msg_putchar('\\\\n');\\n\\t\\t++cur_row;\\n\\t }\\n\\t}\\n }\\n}\",\n \" void\\nlist_version(void)\\n{\\n int\\t\\ti;\\n int\\t\\tfirst;\\n char\\t*s = \\\"\\\";\",\n \" /*\\n * When adding features here, don't forget to update the list of\\n * internal variables in eval.c!\\n */\\n init_longVersion();\\n msg(longVersion);\\n#ifdef MSWIN\\n# ifdef FEAT_GUI_MSWIN\\n# ifdef VIMDLL\\n# ifdef _WIN64\\n msg_puts(_(\\\"\\\\nMS-Windows 64-bit GUI/console version\\\"));\\n# else\\n msg_puts(_(\\\"\\\\nMS-Windows 32-bit GUI/console version\\\"));\\n# endif\\n# else\\n# ifdef _WIN64\\n msg_puts(_(\\\"\\\\nMS-Windows 64-bit GUI version\\\"));\\n# else\\n msg_puts(_(\\\"\\\\nMS-Windows 32-bit GUI version\\\"));\\n# endif\\n# endif\\n# ifdef FEAT_OLE\\n msg_puts(_(\\\" with OLE support\\\"));\\n# endif\\n# else\\n# ifdef _WIN64\\n msg_puts(_(\\\"\\\\nMS-Windows 64-bit console version\\\"));\\n# else\\n msg_puts(_(\\\"\\\\nMS-Windows 32-bit console version\\\"));\\n# endif\\n# endif\\n#endif\\n#if defined(MACOS_X)\\n# if defined(MACOS_X_DARWIN)\\n msg_puts(_(\\\"\\\\nmacOS version\\\"));\\n# else\\n msg_puts(_(\\\"\\\\nmacOS version w/o darwin feat.\\\"));\\n# endif\\n# if defined(__arm64__)\\n msg_puts(\\\" - arm64\\\");\\n# elif defined(__x86_64__)\\n msg_puts(\\\" - x86_64\\\");\\n# endif\\n#endif\",\n \"#ifdef VMS\\n msg_puts(_(\\\"\\\\nOpenVMS version\\\"));\\n# ifdef HAVE_PATHDEF\\n if (*compiled_arch != NUL)\\n {\\n\\tmsg_puts(\\\" - \\\");\\n\\tmsg_puts((char *)compiled_arch);\\n }\\n# endif\",\n \"#endif\",\n \" // Print the list of patch numbers if there is at least one.\\n // Print a range when patches are consecutive: \\\"1-10, 12, 15-40, 42-45\\\"\\n if (included_patches[0] != 0)\\n {\\n\\tmsg_puts(_(\\\"\\\\nIncluded patches: \\\"));\\n\\tfirst = -1;\\n\\ti = (int)ARRAY_LENGTH(included_patches) - 1;\\n\\twhile (--i >= 0)\\n\\t{\\n\\t if (first < 0)\\n\\t\\tfirst = included_patches[i];\\n\\t if (i == 0 || included_patches[i - 1] != included_patches[i] + 1)\\n\\t {\\n\\t\\tmsg_puts(s);\\n\\t\\ts = \\\", \\\";\\n\\t\\tmsg_outnum((long)first);\\n\\t\\tif (first != included_patches[i])\\n\\t\\t{\\n\\t\\t msg_puts(\\\"-\\\");\\n\\t\\t msg_outnum((long)included_patches[i]);\\n\\t\\t}\\n\\t\\tfirst = -1;\\n\\t }\\n\\t}\\n }\",\n \" // Print the list of extra patch descriptions if there is at least one.\\n if (extra_patches[0] != NULL)\\n {\\n\\tmsg_puts(_(\\\"\\\\nExtra patches: \\\"));\\n\\ts = \\\"\\\";\\n\\tfor (i = 0; extra_patches[i] != NULL; ++i)\\n\\t{\\n\\t msg_puts(s);\\n\\t s = \\\", \\\";\\n\\t msg_puts(extra_patches[i]);\\n\\t}\\n }\",\n \"#ifdef MODIFIED_BY\\n msg_puts(\\\"\\\\n\\\");\\n msg_puts(_(\\\"Modified by \\\"));\\n msg_puts(MODIFIED_BY);\\n#endif\",\n \"#ifdef HAVE_PATHDEF\\n if (*compiled_user != NUL || *compiled_sys != NUL)\\n {\\n\\tmsg_puts(_(\\\"\\\\nCompiled \\\"));\\n\\tif (*compiled_user != NUL)\\n\\t{\\n\\t msg_puts(_(\\\"by \\\"));\\n\\t msg_puts((char *)compiled_user);\\n\\t}\\n\\tif (*compiled_sys != NUL)\\n\\t{\\n\\t msg_puts(\\\"@\\\");\\n\\t msg_puts((char *)compiled_sys);\\n\\t}\\n }\\n#endif\",\n \"#if defined(FEAT_HUGE)\\n msg_puts(_(\\\"\\\\nHuge version \\\"));\\n#elif defined(FEAT_BIG)\\n msg_puts(_(\\\"\\\\nBig version \\\"));\\n#elif defined(FEAT_NORMAL)\\n msg_puts(_(\\\"\\\\nNormal version \\\"));\\n#elif defined(FEAT_SMALL)\\n msg_puts(_(\\\"\\\\nSmall version \\\"));\\n#else\\n msg_puts(_(\\\"\\\\nTiny version \\\"));\\n#endif\\n#if !defined(FEAT_GUI)\\n msg_puts(_(\\\"without GUI.\\\"));\\n#elif defined(FEAT_GUI_GTK)\\n# if defined(USE_GTK3)\\n msg_puts(_(\\\"with GTK3 GUI.\\\"));\\n# elif defined(FEAT_GUI_GNOME)\\n msg_puts(_(\\\"with GTK2-GNOME GUI.\\\"));\\n# else\\n msg_puts(_(\\\"with GTK2 GUI.\\\"));\\n# endif\\n#elif defined(FEAT_GUI_MOTIF)\\n msg_puts(_(\\\"with X11-Motif GUI.\\\"));\\n#elif defined(FEAT_GUI_HAIKU)\\n msg_puts(_(\\\"with Haiku GUI.\\\"));\\n#elif defined(FEAT_GUI_PHOTON)\\n msg_puts(_(\\\"with Photon GUI.\\\"));\\n#elif defined(MSWIN)\\n msg_puts(_(\\\"with GUI.\\\"));\\n#endif\\n version_msg(_(\\\" Features included (+) or not (-):\\\\n\\\"));\",\n \" list_features();\\n if (msg_col > 0)\\n\\tmsg_putchar('\\\\n');\",\n \"#ifdef SYS_VIMRC_FILE\\n version_msg(_(\\\" system vimrc file: \\\\\\\"\\\"));\\n version_msg(SYS_VIMRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_VIMRC_FILE\\n version_msg(_(\\\" user vimrc file: \\\\\\\"\\\"));\\n version_msg(USR_VIMRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_VIMRC_FILE2\\n version_msg(_(\\\" 2nd user vimrc file: \\\\\\\"\\\"));\\n version_msg(USR_VIMRC_FILE2);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_VIMRC_FILE3\\n version_msg(_(\\\" 3rd user vimrc file: \\\\\\\"\\\"));\\n version_msg(USR_VIMRC_FILE3);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_EXRC_FILE\\n version_msg(_(\\\" user exrc file: \\\\\\\"\\\"));\\n version_msg(USR_EXRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef USR_EXRC_FILE2\\n version_msg(_(\\\" 2nd user exrc file: \\\\\\\"\\\"));\\n version_msg(USR_EXRC_FILE2);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#endif\\n#ifdef FEAT_GUI\\n# ifdef SYS_GVIMRC_FILE\\n version_msg(_(\\\" system gvimrc file: \\\\\\\"\\\"));\\n version_msg(SYS_GVIMRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# endif\\n version_msg(_(\\\" user gvimrc file: \\\\\\\"\\\"));\\n version_msg(USR_GVIMRC_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# ifdef USR_GVIMRC_FILE2\\n version_msg(_(\\\"2nd user gvimrc file: \\\\\\\"\\\"));\\n version_msg(USR_GVIMRC_FILE2);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# endif\\n# ifdef USR_GVIMRC_FILE3\\n version_msg(_(\\\"3rd user gvimrc file: \\\\\\\"\\\"));\\n version_msg(USR_GVIMRC_FILE3);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# endif\\n#endif\\n version_msg(_(\\\" defaults file: \\\\\\\"\\\"));\\n version_msg(VIM_DEFAULTS_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n#ifdef FEAT_GUI\\n# ifdef SYS_MENU_FILE\\n version_msg(_(\\\" system menu file: \\\\\\\"\\\"));\\n version_msg(SYS_MENU_FILE);\\n version_msg(\\\"\\\\\\\"\\\\n\\\");\\n# endif\\n#endif\\n#ifdef HAVE_PATHDEF\\n if (*default_vim_dir != NUL)\\n {\\n\\tversion_msg(_(\\\" fall-back for $VIM: \\\\\\\"\\\"));\\n\\tversion_msg((char *)default_vim_dir);\\n\\tversion_msg(\\\"\\\\\\\"\\\\n\\\");\\n }\\n if (*default_vimruntime_dir != NUL)\\n {\\n\\tversion_msg(_(\\\" f-b for $VIMRUNTIME: \\\\\\\"\\\"));\\n\\tversion_msg((char *)default_vimruntime_dir);\\n\\tversion_msg(\\\"\\\\\\\"\\\\n\\\");\\n }\\n version_msg(_(\\\"Compilation: \\\"));\\n version_msg((char *)all_cflags);\\n version_msg(\\\"\\\\n\\\");\\n#ifdef VMS\\n if (*compiler_version != NUL)\\n {\\n\\tversion_msg(_(\\\"Compiler: \\\"));\\n\\tversion_msg((char *)compiler_version);\\n\\tversion_msg(\\\"\\\\n\\\");\\n }\\n#endif\\n version_msg(_(\\\"Linking: \\\"));\\n version_msg((char *)all_lflags);\\n#endif\\n#ifdef DEBUG\\n version_msg(\\\"\\\\n\\\");\\n version_msg(_(\\\" DEBUG BUILD\\\"));\\n#endif\\n}\",\n \"static void do_intro_line(int row, char_u *mesg, int add_version, int attr);\\nstatic void intro_message(int colon);\",\n \"/*\\n * Show the intro message when not editing a file.\\n */\\n void\\nmaybe_intro_message(void)\\n{\\n if (BUFEMPTY()\\n\\t && curbuf->b_fname == NULL\\n\\t && firstwin->w_next == NULL\\n\\t && vim_strchr(p_shm, SHM_INTRO) == NULL)\\n\\tintro_message(FALSE);\\n}\",\n \"/*\\n * Give an introductory message about Vim.\\n * Only used when starting Vim on an empty file, without a file name.\\n * Or with the \\\":intro\\\" command (for Sven :-).\\n */\\n static void\\nintro_message(\\n int\\t\\tcolon)\\t\\t// TRUE for \\\":intro\\\"\\n{\\n int\\t\\ti;\\n int\\t\\trow;\\n int\\t\\tblanklines;\\n int\\t\\tsponsor;\\n char\\t*p;\\n static char\\t*(lines[]) =\\n {\\n\\tN_(\\\"VIM - Vi IMproved\\\"),\\n\\t\\\"\\\",\\n\\tN_(\\\"version \\\"),\\n\\tN_(\\\"by Bram Moolenaar et al.\\\"),\\n#ifdef MODIFIED_BY\\n\\t\\\" \\\",\\n#endif\\n\\tN_(\\\"Vim is open source and freely distributable\\\"),\\n\\t\\\"\\\",\\n\\tN_(\\\"Help poor children in Uganda!\\\"),\\n\\tN_(\\\"type :help iccf<Enter> for information \\\"),\\n\\t\\\"\\\",\\n\\tN_(\\\"type :q<Enter> to exit \\\"),\\n\\tN_(\\\"type :help<Enter> or <F1> for on-line help\\\"),\\n\\tN_(\\\"type :help version8<Enter> for version info\\\"),\\n\\tNULL,\\n\\t\\\"\\\",\\n\\tN_(\\\"Running in Vi compatible mode\\\"),\\n\\tN_(\\\"type :set nocp<Enter> for Vim defaults\\\"),\\n\\tN_(\\\"type :help cp-default<Enter> for info on this\\\"),\\n };\\n#ifdef FEAT_GUI\\n static char\\t*(gui_lines[]) =\\n {\\n\\tNULL,\\n\\tNULL,\\n\\tNULL,\\n\\tNULL,\\n#ifdef MODIFIED_BY\\n\\tNULL,\\n#endif\\n\\tNULL,\\n\\tNULL,\\n\\tNULL,\\n\\tN_(\\\"menu Help->Orphans for information \\\"),\\n\\tNULL,\\n\\tN_(\\\"Running modeless, typed text is inserted\\\"),\\n\\tN_(\\\"menu Edit->Global Settings->Toggle Insert Mode \\\"),\\n\\tN_(\\\" for two modes \\\"),\\n\\tNULL,\\n\\tNULL,\\n\\tNULL,\\n\\tN_(\\\"menu Edit->Global Settings->Toggle Vi Compatible\\\"),\\n\\tN_(\\\" for Vim defaults \\\"),\\n };\\n#endif\",\n \" // blanklines = screen height - # message lines\\n blanklines = (int)Rows - (ARRAY_LENGTH(lines) - 1);\\n if (!p_cp)\\n\\tblanklines += 4; // add 4 for not showing \\\"Vi compatible\\\" message\",\n \" // Don't overwrite a statusline. Depends on 'cmdheight'.\\n if (p_ls > 1)\\n\\tblanklines -= Rows - topframe->fr_height;\\n if (blanklines < 0)\\n\\tblanklines = 0;\",\n \" // Show the sponsor and register message one out of four times, the Uganda\\n // message two out of four times.\\n sponsor = (int)time(NULL);\\n sponsor = ((sponsor & 2) == 0) - ((sponsor & 4) == 0);\",\n \" // start displaying the message lines after half of the blank lines\\n row = blanklines / 2;\\n if ((row >= 2 && Columns >= 50) || colon)\\n {\\n\\tfor (i = 0; i < (int)ARRAY_LENGTH(lines); ++i)\\n\\t{\\n\\t p = lines[i];\\n#ifdef FEAT_GUI\\n\\t if (p_im && gui.in_use && gui_lines[i] != NULL)\\n\\t\\tp = gui_lines[i];\\n#endif\\n\\t if (p == NULL)\\n\\t {\\n\\t\\tif (!p_cp)\\n\\t\\t break;\\n\\t\\tcontinue;\\n\\t }\\n\\t if (sponsor != 0)\\n\\t {\\n\\t\\tif (strstr(p, \\\"children\\\") != NULL)\\n\\t\\t p = sponsor < 0\\n\\t\\t\\t? N_(\\\"Sponsor Vim development!\\\")\\n\\t\\t\\t: N_(\\\"Become a registered Vim user!\\\");\\n\\t\\telse if (strstr(p, \\\"iccf\\\") != NULL)\\n\\t\\t p = sponsor < 0\\n\\t\\t\\t? N_(\\\"type :help sponsor<Enter> for information \\\")\\n\\t\\t\\t: N_(\\\"type :help register<Enter> for information \\\");\\n\\t\\telse if (strstr(p, \\\"Orphans\\\") != NULL)\\n\\t\\t p = N_(\\\"menu Help->Sponsor/Register for information \\\");\\n\\t }\\n\\t if (*p != NUL)\\n\\t\\tdo_intro_line(row, (char_u *)_(p), i == 2, 0);\\n\\t ++row;\\n\\t}\\n }\",\n \" // Make the wait-return message appear just below the text.\\n if (colon)\\n\\tmsg_row = row;\\n}\",\n \" static void\\ndo_intro_line(\\n int\\t\\trow,\\n char_u\\t*mesg,\\n int\\t\\tadd_version,\\n int\\t\\tattr)\\n{\\n char_u\\tvers[20];\\n int\\t\\tcol;\\n char_u\\t*p;\\n int\\t\\tl;\\n int\\t\\tclen;\\n#ifdef MODIFIED_BY\\n# define MODBY_LEN 150\\n char_u\\tmodby[MODBY_LEN];\",\n \" if (*mesg == ' ')\\n {\\n\\tvim_strncpy(modby, (char_u *)_(\\\"Modified by \\\"), MODBY_LEN - 1);\\n\\tl = (int)STRLEN(modby);\\n\\tvim_strncpy(modby + l, (char_u *)MODIFIED_BY, MODBY_LEN - l - 1);\\n\\tmesg = modby;\\n }\\n#endif\",\n \" // Center the message horizontally.\\n col = vim_strsize(mesg);\\n if (add_version)\\n {\\n\\tSTRCPY(vers, mediumVersion);\\n\\tif (highest_patch())\\n\\t{\\n\\t // Check for 9.9x or 9.9xx, alpha/beta version\\n\\t if (isalpha((int)vers[3]))\\n\\t {\\n\\t\\tint len = (isalpha((int)vers[4])) ? 5 : 4;\\n\\t\\tsprintf((char *)vers + len, \\\".%d%s\\\", highest_patch(),\\n\\t\\t\\t\\t\\t\\t\\t mediumVersion + len);\\n\\t }\\n\\t else\\n\\t\\tsprintf((char *)vers + 3, \\\".%d\\\", highest_patch());\\n\\t}\\n\\tcol += (int)STRLEN(vers);\\n }\\n col = (Columns - col) / 2;\\n if (col < 0)\\n\\tcol = 0;\",\n \" // Split up in parts to highlight <> items differently.\\n for (p = mesg; *p != NUL; p += l)\\n {\\n\\tclen = 0;\\n\\tfor (l = 0; p[l] != NUL\\n\\t\\t\\t && (l == 0 || (p[l] != '<' && p[l - 1] != '>')); ++l)\\n\\t{\\n\\t if (has_mbyte)\\n\\t {\\n\\t\\tclen += ptr2cells(p + l);\\n\\t\\tl += (*mb_ptr2len)(p + l) - 1;\\n\\t }\\n\\t else\\n\\t\\tclen += byte2cells(p[l]);\\n\\t}\\n\\tscreen_puts_len(p, l, row, col, *p == '<' ? HL_ATTR(HLF_8) : attr);\\n\\tcol += clen;\\n }\",\n \" // Add the version number to the version line.\\n if (add_version)\\n\\tscreen_puts(vers, row, col, 0);\\n}\",\n \"/*\\n * \\\":intro\\\": clear screen, display intro screen and wait for return.\\n */\\n void\\nex_intro(exarg_T *eap UNUSED)\\n{\\n screenclear();\\n intro_message(TRUE);\\n wait_return(TRUE);\\n}\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [3275, 4230, 6192, 782, 748], \"buggy_code_start_loc\": [3275, 4229, 4392, 782, 748], \"filenames\": [\"src/errors.h\", \"src/mbyte.c\", \"src/spellfile.c\", \"src/testdir/test_spell_utf8.vim\", \"src/version.c\"], \"fixing_code_end_loc\": [3280, 4230, 6203, 788, 751], \"fixing_code_start_loc\": [3276, 4229, 4393, 783, 749], \"message\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:vim:vim:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"CF072C31-D320-47CE-B39B-F45447D70BD9\", \"versionEndExcluding\": \"8.2.4919\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:debian:debian_linux:9.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"DEECE5FC-CACF-4496-A3E7-164736409252\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:debian:debian_linux:10.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"07B237A9-69A3-4A9C-9DA0-4E06BD37AE73\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:34:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"A930E247-0B43-43CB-98FF-6CE7B8189835\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:35:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"80E516C0-98A4-4ADE-B69F-66A772E2BAAA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:apple:macos:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"71E032AD-F827-4944-9699-BB1E6D4233FC\", \"versionEndExcluding\": \"13.0\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"Heap buffer overflow in vim_strncpy find_word in GitHub repository vim/vim prior to 8.2.4919. This vulnerability is capable of crashing software, Bypass Protection Mechanism, Modify Memory, and possible remote execution\"}, {\"lang\": \"es\", \"value\": \"Un Desbordamiento del b\\u00fafer de pila en vim_strncpy find_word en el repositorio de GitHub vim/vim versiones anteriores a 8.2.4919. Esta vulnerabilidad es capaz de bloquear el software, Omitir el Mecanismo de Protecci\\u00f3n, Modificar la Memoria y una posible ejecuci\\u00f3n remota\"}], \"evaluatorComment\": null, \"id\": \"CVE-2022-1621\", \"lastModified\": \"2023-05-03T12:15:21.913\", \"metrics\": {\"cvssMetricV2\": [{\"acInsufInfo\": false, \"baseSeverity\": \"MEDIUM\", \"cvssData\": {\"accessComplexity\": \"MEDIUM\", \"accessVector\": \"NETWORK\", \"authentication\": \"NONE\", \"availabilityImpact\": \"PARTIAL\", \"baseScore\": 6.8, \"confidentialityImpact\": \"PARTIAL\", \"integrityImpact\": \"PARTIAL\", \"vectorString\": \"AV:N/AC:M/Au:N/C:P/I:P/A:P\", \"version\": \"2.0\"}, \"exploitabilityScore\": 8.6, \"impactScore\": 6.4, \"obtainAllPrivilege\": false, \"obtainOtherPrivilege\": false, \"obtainUserPrivilege\": false, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\", \"userInteractionRequired\": true}], \"cvssMetricV30\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.3, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"LOW\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.0/AV:L/AC:L/PR:N/UI:R/S:U/C:L/I:H/A:H\", \"version\": \"3.0\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.5, \"source\": \"security@huntr.dev\", \"type\": \"Secondary\"}], \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.8, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"REQUIRED\", \"vectorString\": \"CVSS:3.1/AV:L/AC:L/PR:N/UI:R/S:U/C:H/I:H/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 1.8, \"impactScore\": 5.9, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2022-05-10T14:15:08.460\", \"references\": [{\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/28\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"http://seclists.org/fulldisclosure/2022/Oct/41\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Exploit\", \"Third Party Advisory\"], \"url\": \"https://huntr.dev/bounties/520ce714-bfd2-4646-9458-f52cd22bb2fb\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/05/msg00022.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.debian.org/debian-lts-announce/2022/11/msg00032.html\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/HIP7KG7TVS5YF3QREAY2GOGUT3YUBZAI/\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://security.gentoo.org/glsa/202208-32\"}, {\"source\": \"security@huntr.dev\", \"tags\": null, \"url\": \"https://security.gentoo.org/glsa/202305-16\"}, {\"source\": \"security@huntr.dev\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://support.apple.com/kb/HT213488\"}], \"sourceIdentifier\": \"security@huntr.dev\", \"vendorComments\": null, \"vulnStatus\": \"Modified\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-122\"}], \"source\": \"security@huntr.dev\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-787\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/vim/vim/commit/7c824682d2028432ee082703ef0ab399867a089b\"}, \"type\": \"CWE-122\"}"},"index":{"kind":"number","value":464,"string":"464"}}},{"rowIdx":2898,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["/*\n * 32-bit Digest parameter name parser\n *\n * Copyright (C) 2001-2003 FhG Fokus\n *\n * This file is part of opensips, a free SIP server.\n *\n * opensips is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version\n *\n * opensips is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n */","#include \"param_parser.h\"\n#include \"digest_keys.h\"\n#include \"../../trim.h\"\n#include \"../../ut.h\"","#define LOWER_BYTE(b) ((b) | 0x20)\n#define LOWER_DWORD(d) ((d) | 0x20202020)","/*\n * Parse short (less than 4 bytes) parameter names\n */\n#define PARSE_SHORT \\\n\tswitch(LOWER_BYTE(*p)) { \\\n\tcase 'u': \\\n\t\tif (LOWER_BYTE(*(p + 1)) == 'r') { \\\n\t\t\tif (LOWER_BYTE(*(p + 2)) == 'i') { \\\n\t\t\t\t*_type = PAR_URI; \\\n p += 3; \\\n\t\t\t\tgoto end; \\\n\t\t\t} \\\n\t\t} \\\n\t\tbreak; \\\n \\\n\tcase 'q': \\\n\t\tif (LOWER_BYTE(*(p + 1)) == 'o') { \\\n\t\t\tif (LOWER_BYTE(*(p + 2)) == 'p') { \\\n\t\t\t\t*_type = PAR_QOP; \\\n p += 3; \\\n\t\t\t\tgoto end; \\\n\t\t\t} \\\n\t\t} \\\n\t\tbreak; \\\n \\\n\tcase 'n': \\\n\t\tif (LOWER_BYTE(*(p + 1)) == 'c') { \\\n\t\t\t*_type = PAR_NC; \\\n p += 2; \\\n\t\t\tgoto end; \\\n\t\t} \\\n\t\tbreak; \\\n\t}","\n/*\n * Read 4-bytes from memory and store them in an integer variable\n * Reading byte by byte ensures, that the code works also on HW which\n * does not allow reading 4-bytes at once from unaligned memory position\n * (Sparc for example)\n */\n#define READ(val) \\\n(*(val + 0) + (*(val + 1) << 8) + (*(val + 2) << 16) + (*(val + 3) << 24))\n","","\n#define name_CASE \\\n switch(LOWER_DWORD(val)) { \\\n case _name_: \\\n\t\t*_type = PAR_USERNAME; \\\n p += 4; \\\n\t\tgoto end; \\\n }","\n#define user_CASE \\"," p += 4; \\"," val = READ(p); \\\n name_CASE; \\\n goto other;","\n#define real_CASE \\"," p += 4; \\"," if (LOWER_BYTE(*p) == 'm') { \\\n\t\t*_type = PAR_REALM; \\\n p++; \\\n\t\tgoto end; \\","\t}","","#define nonc_CASE \\"," p += 4; \\"," if (LOWER_BYTE(*p) == 'e') { \\\n\t *_type = PAR_NONCE; \\\n p++; \\\n\t\tgoto end; \\","\t}","","#define onse_CASE \\\n switch(LOWER_DWORD(val)) { \\\n case _onse_: \\\n\t\t*_type = PAR_RESPONSE; \\\n p += 4; \\\n\t\tgoto end; \\\n }","\n#define resp_CASE \\"," p += 4; \\"," val = READ(p); \\\n onse_CASE; \\\n goto other;","\n#define cnon_CASE \\"," p += 4; \\"," if (LOWER_BYTE(*p) == 'c') { \\\n\t\tp++; \\\n\t\tif (LOWER_BYTE(*p) == 'e') { \\\n\t\t\t*_type = PAR_CNONCE; \\\n p++; \\\n\t\t\tgoto end; \\\n\t\t} \\\n\t} \\\n goto other;","\n#define opaq_CASE \\"," p += 4; \\"," if (LOWER_BYTE(*p) == 'u') { \\\n\t\tp++; \\\n\t\tif (LOWER_BYTE(*p) == 'e') { \\\n\t\t\t*_type = PAR_OPAQUE; \\\n p++; \\\n\t\t\tgoto end; \\\n\t\t} \\\n\t} \\\n goto other;","\n#define rith_CASE \\\n switch(LOWER_DWORD(val)) { \\\n\tcase _rith_: \\\n\t\tp += 4; \\\n\t\tif (LOWER_BYTE(*p) == 'm') { \\\n\t\t\t*_type = PAR_ALGORITHM; \\\n p++; \\\n\t\t\tgoto end; \\\n\t\t} \\\n\t\tgoto other; \\\n\t}","\n#define algo_CASE \\"," p += 4; \\"," val = READ(p); \\\n rith_CASE; \\\n goto other","\n#define FIRST_QUATERNIONS \\\n case _user_: user_CASE; \\\n case _real_: real_CASE; \\\n case _nonc_: nonc_CASE; \\\n case _resp_: resp_CASE; \\\n case _cnon_: cnon_CASE; \\\n case _opaq_: opaq_CASE; \\\n case _algo_: algo_CASE;","","\nint parse_param_name(str* _s, dig_par_t* _type)\n{\n register char* p;\n register int val;\n\tchar* end;","\tend = _s->s + _s->len;","\tp = _s->s;\n\tval = READ(p);","\tif (_s->len < 4) {\n\t\tgoto other;\n\t}"," switch(LOWER_DWORD(val)) {\n\tFIRST_QUATERNIONS;\n\tdefault:\n\t\tPARSE_SHORT;\n\t\tgoto other;\n }"," end:\n\t_s->len -= p - _s->s;\n\t_s->s = p;","\ttrim_leading(_s);\n\tif (_s->s[0] == '=') {\n\t\treturn 0;\n\t}"," other:\n\tp = q_memchr(p, '=', end - p);\n\tif (!p) {\n\t\treturn -1; /* Parse error */\n\t} else {\n\t\t*_type = PAR_OTHER;\n\t\t_s->len -= p - _s->s;\n\t\t_s->s = p;\n\t\treturn 0;\n\t}\n}"],"string":"[\n \"/*\\n * 32-bit Digest parameter name parser\\n *\\n * Copyright (C) 2001-2003 FhG Fokus\\n *\\n * This file is part of opensips, a free SIP server.\\n *\\n * opensips is free software; you can redistribute it and/or modify\\n * it under the terms of the GNU General Public License as published by\\n * the Free Software Foundation; either version 2 of the License, or\\n * (at your option) any later version\\n *\\n * opensips is distributed in the hope that it will be useful,\\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n * GNU General Public License for more details.\\n *\\n * You should have received a copy of the GNU General Public License\\n * along with this program; if not, write to the Free Software\\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\\n */\",\n \"#include \\\"param_parser.h\\\"\\n#include \\\"digest_keys.h\\\"\\n#include \\\"../../trim.h\\\"\\n#include \\\"../../ut.h\\\"\",\n \"#define LOWER_BYTE(b) ((b) | 0x20)\\n#define LOWER_DWORD(d) ((d) | 0x20202020)\",\n \"/*\\n * Parse short (less than 4 bytes) parameter names\\n */\\n#define PARSE_SHORT \\\\\\n\\tswitch(LOWER_BYTE(*p)) { \\\\\\n\\tcase 'u': \\\\\\n\\t\\tif (LOWER_BYTE(*(p + 1)) == 'r') { \\\\\\n\\t\\t\\tif (LOWER_BYTE(*(p + 2)) == 'i') { \\\\\\n\\t\\t\\t\\t*_type = PAR_URI; \\\\\\n p += 3; \\\\\\n\\t\\t\\t\\tgoto end; \\\\\\n\\t\\t\\t} \\\\\\n\\t\\t} \\\\\\n\\t\\tbreak; \\\\\\n \\\\\\n\\tcase 'q': \\\\\\n\\t\\tif (LOWER_BYTE(*(p + 1)) == 'o') { \\\\\\n\\t\\t\\tif (LOWER_BYTE(*(p + 2)) == 'p') { \\\\\\n\\t\\t\\t\\t*_type = PAR_QOP; \\\\\\n p += 3; \\\\\\n\\t\\t\\t\\tgoto end; \\\\\\n\\t\\t\\t} \\\\\\n\\t\\t} \\\\\\n\\t\\tbreak; \\\\\\n \\\\\\n\\tcase 'n': \\\\\\n\\t\\tif (LOWER_BYTE(*(p + 1)) == 'c') { \\\\\\n\\t\\t\\t*_type = PAR_NC; \\\\\\n p += 2; \\\\\\n\\t\\t\\tgoto end; \\\\\\n\\t\\t} \\\\\\n\\t\\tbreak; \\\\\\n\\t}\",\n \"\\n/*\\n * Read 4-bytes from memory and store them in an integer variable\\n * Reading byte by byte ensures, that the code works also on HW which\\n * does not allow reading 4-bytes at once from unaligned memory position\\n * (Sparc for example)\\n */\\n#define READ(val) \\\\\\n(*(val + 0) + (*(val + 1) << 8) + (*(val + 2) << 16) + (*(val + 3) << 24))\\n\",\n \"\",\n \"\\n#define name_CASE \\\\\\n switch(LOWER_DWORD(val)) { \\\\\\n case _name_: \\\\\\n\\t\\t*_type = PAR_USERNAME; \\\\\\n p += 4; \\\\\\n\\t\\tgoto end; \\\\\\n }\",\n \"\\n#define user_CASE \\\\\",\n \" p += 4; \\\\\",\n \" val = READ(p); \\\\\\n name_CASE; \\\\\\n goto other;\",\n \"\\n#define real_CASE \\\\\",\n \" p += 4; \\\\\",\n \" if (LOWER_BYTE(*p) == 'm') { \\\\\\n\\t\\t*_type = PAR_REALM; \\\\\\n p++; \\\\\\n\\t\\tgoto end; \\\\\",\n \"\\t}\",\n \"\",\n \"#define nonc_CASE \\\\\",\n \" p += 4; \\\\\",\n \" if (LOWER_BYTE(*p) == 'e') { \\\\\\n\\t *_type = PAR_NONCE; \\\\\\n p++; \\\\\\n\\t\\tgoto end; \\\\\",\n \"\\t}\",\n \"\",\n \"#define onse_CASE \\\\\\n switch(LOWER_DWORD(val)) { \\\\\\n case _onse_: \\\\\\n\\t\\t*_type = PAR_RESPONSE; \\\\\\n p += 4; \\\\\\n\\t\\tgoto end; \\\\\\n }\",\n \"\\n#define resp_CASE \\\\\",\n \" p += 4; \\\\\",\n \" val = READ(p); \\\\\\n onse_CASE; \\\\\\n goto other;\",\n \"\\n#define cnon_CASE \\\\\",\n \" p += 4; \\\\\",\n \" if (LOWER_BYTE(*p) == 'c') { \\\\\\n\\t\\tp++; \\\\\\n\\t\\tif (LOWER_BYTE(*p) == 'e') { \\\\\\n\\t\\t\\t*_type = PAR_CNONCE; \\\\\\n p++; \\\\\\n\\t\\t\\tgoto end; \\\\\\n\\t\\t} \\\\\\n\\t} \\\\\\n goto other;\",\n \"\\n#define opaq_CASE \\\\\",\n \" p += 4; \\\\\",\n \" if (LOWER_BYTE(*p) == 'u') { \\\\\\n\\t\\tp++; \\\\\\n\\t\\tif (LOWER_BYTE(*p) == 'e') { \\\\\\n\\t\\t\\t*_type = PAR_OPAQUE; \\\\\\n p++; \\\\\\n\\t\\t\\tgoto end; \\\\\\n\\t\\t} \\\\\\n\\t} \\\\\\n goto other;\",\n \"\\n#define rith_CASE \\\\\\n switch(LOWER_DWORD(val)) { \\\\\\n\\tcase _rith_: \\\\\\n\\t\\tp += 4; \\\\\\n\\t\\tif (LOWER_BYTE(*p) == 'm') { \\\\\\n\\t\\t\\t*_type = PAR_ALGORITHM; \\\\\\n p++; \\\\\\n\\t\\t\\tgoto end; \\\\\\n\\t\\t} \\\\\\n\\t\\tgoto other; \\\\\\n\\t}\",\n \"\\n#define algo_CASE \\\\\",\n \" p += 4; \\\\\",\n \" val = READ(p); \\\\\\n rith_CASE; \\\\\\n goto other\",\n \"\\n#define FIRST_QUATERNIONS \\\\\\n case _user_: user_CASE; \\\\\\n case _real_: real_CASE; \\\\\\n case _nonc_: nonc_CASE; \\\\\\n case _resp_: resp_CASE; \\\\\\n case _cnon_: cnon_CASE; \\\\\\n case _opaq_: opaq_CASE; \\\\\\n case _algo_: algo_CASE;\",\n \"\",\n \"\\nint parse_param_name(str* _s, dig_par_t* _type)\\n{\\n register char* p;\\n register int val;\\n\\tchar* end;\",\n \"\\tend = _s->s + _s->len;\",\n \"\\tp = _s->s;\\n\\tval = READ(p);\",\n \"\\tif (_s->len < 4) {\\n\\t\\tgoto other;\\n\\t}\",\n \" switch(LOWER_DWORD(val)) {\\n\\tFIRST_QUATERNIONS;\\n\\tdefault:\\n\\t\\tPARSE_SHORT;\\n\\t\\tgoto other;\\n }\",\n \" end:\\n\\t_s->len -= p - _s->s;\\n\\t_s->s = p;\",\n \"\\ttrim_leading(_s);\\n\\tif (_s->s[0] == '=') {\\n\\t\\treturn 0;\\n\\t}\",\n \" other:\\n\\tp = q_memchr(p, '=', end - p);\\n\\tif (!p) {\\n\\t\\treturn -1; /* Parse error */\\n\\t} else {\\n\\t\\t*_type = PAR_OTHER;\\n\\t\\t_s->len -= p - _s->s;\\n\\t\\t_s->s = p;\\n\\t\\treturn 0;\\n\\t}\\n}\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,0,1,1,0,1,1,0,1,0,1,1,0,1,0,1,1,1,0,1,1,0,1,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 0,\n 1,\n 1,\n 0,\n 1,\n 1,\n 0,\n 1,\n 0,\n 1,\n 1,\n 0,\n 1,\n 0,\n 1,\n 1,\n 1,\n 0,\n 1,\n 1,\n 0,\n 1,\n 1,\n 0,\n 1,\n 1,\n 1,\n 0,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [167], \"buggy_code_start_loc\": [74], \"filenames\": [\"parser/digest/param_parser.c\"], \"fixing_code_end_loc\": [170], \"fixing_code_start_loc\": [75], \"message\": \"OpenSIPS is a Session Initiation Protocol (SIP) server implementation. Prior to versions 3.1.7 and 3.2.4, a specially crafted Authorization header causes OpenSIPS to crash or behave in an unexpected way due to a bug in the function `parse_param_name()` . This issue was discovered while performing coverage guided fuzzing of the function parse_msg. The AddressSanitizer identified that the issue occurred in the function `q_memchr()` which is being called by the function `parse_param_name()`. This issue may cause erratic program behaviour or a server crash. It affects configurations containing functions that make use of the affected code, such as the function `www_authorize()` . Versions 3.1.7 and 3.2.4 contain a fix.\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:opensips:opensips:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"8EF642AA-D786-40DF-801D-515888AF89BE\", \"versionEndExcluding\": \"3.1.7\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:opensips:opensips:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"34713A76-CAED-43CF-A77C-73F1C36208AA\", \"versionEndExcluding\": \"3.2.4\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": \"3.2.0\", \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"OpenSIPS is a Session Initiation Protocol (SIP) server implementation. Prior to versions 3.1.7 and 3.2.4, a specially crafted Authorization header causes OpenSIPS to crash or behave in an unexpected way due to a bug in the function `parse_param_name()` . This issue was discovered while performing coverage guided fuzzing of the function parse_msg. The AddressSanitizer identified that the issue occurred in the function `q_memchr()` which is being called by the function `parse_param_name()`. This issue may cause erratic program behaviour or a server crash. It affects configurations containing functions that make use of the affected code, such as the function `www_authorize()` . Versions 3.1.7 and 3.2.4 contain a fix.\"}], \"evaluatorComment\": null, \"id\": \"CVE-2023-28098\", \"lastModified\": \"2023-03-21T22:39:28.990\", \"metrics\": {\"cvssMetricV2\": null, \"cvssMetricV30\": null, \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"NETWORK\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.5, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"NONE\", \"integrityImpact\": \"NONE\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 3.9, \"impactScore\": 3.6, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}, {\"cvssData\": {\"attackComplexity\": \"HIGH\", \"attackVector\": \"NETWORK\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 5.9, \"baseSeverity\": \"MEDIUM\", \"confidentialityImpact\": \"NONE\", \"integrityImpact\": \"NONE\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:N/AC:H/PR:N/UI:N/S:U/C:N/I:N/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 2.2, \"impactScore\": 3.6, \"source\": \"security-advisories@github.com\", \"type\": \"Secondary\"}]}, \"published\": \"2023-03-15T23:15:09.717\", \"references\": [{\"source\": \"security-advisories@github.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/OpenSIPS/opensips/commit/dd9141b6f67d7df4072f3430f628d4b73df5e102\"}, {\"source\": \"security-advisories@github.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://github.com/OpenSIPS/opensips/security/advisories/GHSA-jrqg-vppj-hr2h\"}, {\"source\": \"security-advisories@github.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://opensips.org/pub/audit-2022/opensips-audit-technical-report-full.pdf\"}], \"sourceIdentifier\": \"security-advisories@github.com\", \"vendorComments\": null, \"vulnStatus\": \"Analyzed\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"NVD-CWE-noinfo\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-20\"}], \"source\": \"security-advisories@github.com\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/OpenSIPS/opensips/commit/dd9141b6f67d7df4072f3430f628d4b73df5e102\"}, \"type\": \"NVD-CWE-noinfo\"}"},"index":{"kind":"number","value":465,"string":"465"}}},{"rowIdx":2899,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["/*\n * 32-bit Digest parameter name parser\n *\n * Copyright (C) 2001-2003 FhG Fokus\n *\n * This file is part of opensips, a free SIP server.\n *\n * opensips is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version\n *\n * opensips is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n */","#include \"param_parser.h\"\n#include \"digest_keys.h\"\n#include \"../../trim.h\"\n#include \"../../ut.h\"","#define LOWER_BYTE(b) ((b) | 0x20)\n#define LOWER_DWORD(d) ((d) | 0x20202020)","/*\n * Parse short (less than 4 bytes) parameter names\n */\n#define PARSE_SHORT \\\n\tswitch(LOWER_BYTE(*p)) { \\\n\tcase 'u': \\\n\t\tif (LOWER_BYTE(*(p + 1)) == 'r') { \\\n\t\t\tif (LOWER_BYTE(*(p + 2)) == 'i') { \\\n\t\t\t\t*_type = PAR_URI; \\\n p += 3; \\\n\t\t\t\tgoto end; \\\n\t\t\t} \\\n\t\t} \\\n\t\tbreak; \\\n \\\n\tcase 'q': \\\n\t\tif (LOWER_BYTE(*(p + 1)) == 'o') { \\\n\t\t\tif (LOWER_BYTE(*(p + 2)) == 'p') { \\\n\t\t\t\t*_type = PAR_QOP; \\\n p += 3; \\\n\t\t\t\tgoto end; \\\n\t\t\t} \\\n\t\t} \\\n\t\tbreak; \\\n \\\n\tcase 'n': \\\n\t\tif (LOWER_BYTE(*(p + 1)) == 'c') { \\\n\t\t\t*_type = PAR_NC; \\\n p += 2; \\\n\t\t\tgoto end; \\\n\t\t} \\\n\t\tbreak; \\\n\t}","\n/*\n * Read 4-bytes from memory and store them in an integer variable\n * Reading byte by byte ensures, that the code works also on HW which\n * does not allow reading 4-bytes at once from unaligned memory position\n * (Sparc for example)\n */\n#define READ(val) \\\n(*(val + 0) + (*(val + 1) << 8) + (*(val + 2) << 16) + (*(val + 3) << 24))\n","#define NEED(bytes) do { if (end - p < (bytes)) goto other; } while (0)","\n#define name_CASE \\\n switch(LOWER_DWORD(val)) { \\\n case _name_: \\\n\t\t*_type = PAR_USERNAME; \\\n p += 4; \\\n\t\tgoto end; \\\n }","\n#define user_CASE \\"," p += 4; NEED(4); \\"," val = READ(p); \\\n name_CASE; \\\n goto other;","\n#define real_CASE \\"," p += 4; NEED(1); \\"," if (LOWER_BYTE(*p) == 'm') { \\\n\t\t*_type = PAR_REALM; \\\n p++; \\\n\t\tgoto end; \\","\t} \\\n goto other;","","#define nonc_CASE \\"," p += 4; NEED(1); \\"," if (LOWER_BYTE(*p) == 'e') { \\\n\t *_type = PAR_NONCE; \\\n p++; \\\n\t\tgoto end; \\","\t} \\\n goto other;","","#define onse_CASE \\\n switch(LOWER_DWORD(val)) { \\\n case _onse_: \\\n\t\t*_type = PAR_RESPONSE; \\\n p += 4; \\\n\t\tgoto end; \\\n }","\n#define resp_CASE \\"," p += 4; NEED(4); \\"," val = READ(p); \\\n onse_CASE; \\\n goto other;","\n#define cnon_CASE \\"," p += 4; NEED(2); \\"," if (LOWER_BYTE(*p) == 'c') { \\\n\t\tp++; \\\n\t\tif (LOWER_BYTE(*p) == 'e') { \\\n\t\t\t*_type = PAR_CNONCE; \\\n p++; \\\n\t\t\tgoto end; \\\n\t\t} \\\n\t} \\\n goto other;","\n#define opaq_CASE \\"," p += 4; NEED(2); \\"," if (LOWER_BYTE(*p) == 'u') { \\\n\t\tp++; \\\n\t\tif (LOWER_BYTE(*p) == 'e') { \\\n\t\t\t*_type = PAR_OPAQUE; \\\n p++; \\\n\t\t\tgoto end; \\\n\t\t} \\\n\t} \\\n goto other;","\n#define rith_CASE \\\n switch(LOWER_DWORD(val)) { \\\n\tcase _rith_: \\\n\t\tp += 4; \\\n\t\tif (LOWER_BYTE(*p) == 'm') { \\\n\t\t\t*_type = PAR_ALGORITHM; \\\n p++; \\\n\t\t\tgoto end; \\\n\t\t} \\\n\t\tgoto other; \\\n\t}","\n#define algo_CASE \\"," p += 4; NEED(5); \\"," val = READ(p); \\\n rith_CASE; \\\n goto other","\n#define FIRST_QUATERNIONS \\\n case _user_: user_CASE; \\\n case _real_: real_CASE; \\\n case _nonc_: nonc_CASE; \\\n case _resp_: resp_CASE; \\\n case _cnon_: cnon_CASE; \\\n case _opaq_: opaq_CASE; \\\n case _algo_: algo_CASE;","","\nint parse_param_name(str* _s, dig_par_t* _type)\n{\n register char* p;\n register int val;\n\tchar* end;","\tend = _s->s + _s->len;","\tp = _s->s;\n\tval = READ(p);","\tif (_s->len < 4) {\n\t\tgoto other;\n\t}"," switch(LOWER_DWORD(val)) {\n\tFIRST_QUATERNIONS;\n\tdefault:\n\t\tPARSE_SHORT;\n\t\tgoto other;\n }"," end:\n\t_s->len -= p - _s->s;\n\t_s->s = p;","\ttrim_leading(_s);\n\tif (_s->s[0] == '=') {\n\t\treturn 0;\n\t}"," other:\n\tp = q_memchr(p, '=', end - p);\n\tif (!p) {\n\t\treturn -1; /* Parse error */\n\t} else {\n\t\t*_type = PAR_OTHER;\n\t\t_s->len -= p - _s->s;\n\t\t_s->s = p;\n\t\treturn 0;\n\t}\n}"],"string":"[\n \"/*\\n * 32-bit Digest parameter name parser\\n *\\n * Copyright (C) 2001-2003 FhG Fokus\\n *\\n * This file is part of opensips, a free SIP server.\\n *\\n * opensips is free software; you can redistribute it and/or modify\\n * it under the terms of the GNU General Public License as published by\\n * the Free Software Foundation; either version 2 of the License, or\\n * (at your option) any later version\\n *\\n * opensips is distributed in the hope that it will be useful,\\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n * GNU General Public License for more details.\\n *\\n * You should have received a copy of the GNU General Public License\\n * along with this program; if not, write to the Free Software\\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\\n */\",\n \"#include \\\"param_parser.h\\\"\\n#include \\\"digest_keys.h\\\"\\n#include \\\"../../trim.h\\\"\\n#include \\\"../../ut.h\\\"\",\n \"#define LOWER_BYTE(b) ((b) | 0x20)\\n#define LOWER_DWORD(d) ((d) | 0x20202020)\",\n \"/*\\n * Parse short (less than 4 bytes) parameter names\\n */\\n#define PARSE_SHORT \\\\\\n\\tswitch(LOWER_BYTE(*p)) { \\\\\\n\\tcase 'u': \\\\\\n\\t\\tif (LOWER_BYTE(*(p + 1)) == 'r') { \\\\\\n\\t\\t\\tif (LOWER_BYTE(*(p + 2)) == 'i') { \\\\\\n\\t\\t\\t\\t*_type = PAR_URI; \\\\\\n p += 3; \\\\\\n\\t\\t\\t\\tgoto end; \\\\\\n\\t\\t\\t} \\\\\\n\\t\\t} \\\\\\n\\t\\tbreak; \\\\\\n \\\\\\n\\tcase 'q': \\\\\\n\\t\\tif (LOWER_BYTE(*(p + 1)) == 'o') { \\\\\\n\\t\\t\\tif (LOWER_BYTE(*(p + 2)) == 'p') { \\\\\\n\\t\\t\\t\\t*_type = PAR_QOP; \\\\\\n p += 3; \\\\\\n\\t\\t\\t\\tgoto end; \\\\\\n\\t\\t\\t} \\\\\\n\\t\\t} \\\\\\n\\t\\tbreak; \\\\\\n \\\\\\n\\tcase 'n': \\\\\\n\\t\\tif (LOWER_BYTE(*(p + 1)) == 'c') { \\\\\\n\\t\\t\\t*_type = PAR_NC; \\\\\\n p += 2; \\\\\\n\\t\\t\\tgoto end; \\\\\\n\\t\\t} \\\\\\n\\t\\tbreak; \\\\\\n\\t}\",\n \"\\n/*\\n * Read 4-bytes from memory and store them in an integer variable\\n * Reading byte by byte ensures, that the code works also on HW which\\n * does not allow reading 4-bytes at once from unaligned memory position\\n * (Sparc for example)\\n */\\n#define READ(val) \\\\\\n(*(val + 0) + (*(val + 1) << 8) + (*(val + 2) << 16) + (*(val + 3) << 24))\\n\",\n \"#define NEED(bytes) do { if (end - p < (bytes)) goto other; } while (0)\",\n \"\\n#define name_CASE \\\\\\n switch(LOWER_DWORD(val)) { \\\\\\n case _name_: \\\\\\n\\t\\t*_type = PAR_USERNAME; \\\\\\n p += 4; \\\\\\n\\t\\tgoto end; \\\\\\n }\",\n \"\\n#define user_CASE \\\\\",\n \" p += 4; NEED(4); \\\\\",\n \" val = READ(p); \\\\\\n name_CASE; \\\\\\n goto other;\",\n \"\\n#define real_CASE \\\\\",\n \" p += 4; NEED(1); \\\\\",\n \" if (LOWER_BYTE(*p) == 'm') { \\\\\\n\\t\\t*_type = PAR_REALM; \\\\\\n p++; \\\\\\n\\t\\tgoto end; \\\\\",\n \"\\t} \\\\\\n goto other;\",\n \"\",\n \"#define nonc_CASE \\\\\",\n \" p += 4; NEED(1); \\\\\",\n \" if (LOWER_BYTE(*p) == 'e') { \\\\\\n\\t *_type = PAR_NONCE; \\\\\\n p++; \\\\\\n\\t\\tgoto end; \\\\\",\n \"\\t} \\\\\\n goto other;\",\n \"\",\n \"#define onse_CASE \\\\\\n switch(LOWER_DWORD(val)) { \\\\\\n case _onse_: \\\\\\n\\t\\t*_type = PAR_RESPONSE; \\\\\\n p += 4; \\\\\\n\\t\\tgoto end; \\\\\\n }\",\n \"\\n#define resp_CASE \\\\\",\n \" p += 4; NEED(4); \\\\\",\n \" val = READ(p); \\\\\\n onse_CASE; \\\\\\n goto other;\",\n \"\\n#define cnon_CASE \\\\\",\n \" p += 4; NEED(2); \\\\\",\n \" if (LOWER_BYTE(*p) == 'c') { \\\\\\n\\t\\tp++; \\\\\\n\\t\\tif (LOWER_BYTE(*p) == 'e') { \\\\\\n\\t\\t\\t*_type = PAR_CNONCE; \\\\\\n p++; \\\\\\n\\t\\t\\tgoto end; \\\\\\n\\t\\t} \\\\\\n\\t} \\\\\\n goto other;\",\n \"\\n#define opaq_CASE \\\\\",\n \" p += 4; NEED(2); \\\\\",\n \" if (LOWER_BYTE(*p) == 'u') { \\\\\\n\\t\\tp++; \\\\\\n\\t\\tif (LOWER_BYTE(*p) == 'e') { \\\\\\n\\t\\t\\t*_type = PAR_OPAQUE; \\\\\\n p++; \\\\\\n\\t\\t\\tgoto end; \\\\\\n\\t\\t} \\\\\\n\\t} \\\\\\n goto other;\",\n \"\\n#define rith_CASE \\\\\\n switch(LOWER_DWORD(val)) { \\\\\\n\\tcase _rith_: \\\\\\n\\t\\tp += 4; \\\\\\n\\t\\tif (LOWER_BYTE(*p) == 'm') { \\\\\\n\\t\\t\\t*_type = PAR_ALGORITHM; \\\\\\n p++; \\\\\\n\\t\\t\\tgoto end; \\\\\\n\\t\\t} \\\\\\n\\t\\tgoto other; \\\\\\n\\t}\",\n \"\\n#define algo_CASE \\\\\",\n \" p += 4; NEED(5); \\\\\",\n \" val = READ(p); \\\\\\n rith_CASE; \\\\\\n goto other\",\n \"\\n#define FIRST_QUATERNIONS \\\\\\n case _user_: user_CASE; \\\\\\n case _real_: real_CASE; \\\\\\n case _nonc_: nonc_CASE; \\\\\\n case _resp_: resp_CASE; \\\\\\n case _cnon_: cnon_CASE; \\\\\\n case _opaq_: opaq_CASE; \\\\\\n case _algo_: algo_CASE;\",\n \"\",\n \"\\nint parse_param_name(str* _s, dig_par_t* _type)\\n{\\n register char* p;\\n register int val;\\n\\tchar* end;\",\n \"\\tend = _s->s + _s->len;\",\n \"\\tp = _s->s;\\n\\tval = READ(p);\",\n \"\\tif (_s->len < 4) {\\n\\t\\tgoto other;\\n\\t}\",\n \" switch(LOWER_DWORD(val)) {\\n\\tFIRST_QUATERNIONS;\\n\\tdefault:\\n\\t\\tPARSE_SHORT;\\n\\t\\tgoto other;\\n }\",\n \" end:\\n\\t_s->len -= p - _s->s;\\n\\t_s->s = p;\",\n \"\\ttrim_leading(_s);\\n\\tif (_s->s[0] == '=') {\\n\\t\\treturn 0;\\n\\t}\",\n \" other:\\n\\tp = q_memchr(p, '=', end - p);\\n\\tif (!p) {\\n\\t\\treturn -1; /* Parse error */\\n\\t} else {\\n\\t\\t*_type = PAR_OTHER;\\n\\t\\t_s->len -= p - _s->s;\\n\\t\\t_s->s = p;\\n\\t\\treturn 0;\\n\\t}\\n}\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [167], \"buggy_code_start_loc\": [74], \"filenames\": [\"parser/digest/param_parser.c\"], \"fixing_code_end_loc\": [170], \"fixing_code_start_loc\": [75], \"message\": \"OpenSIPS is a Session Initiation Protocol (SIP) server implementation. Prior to versions 3.1.7 and 3.2.4, a specially crafted Authorization header causes OpenSIPS to crash or behave in an unexpected way due to a bug in the function `parse_param_name()` . This issue was discovered while performing coverage guided fuzzing of the function parse_msg. The AddressSanitizer identified that the issue occurred in the function `q_memchr()` which is being called by the function `parse_param_name()`. This issue may cause erratic program behaviour or a server crash. It affects configurations containing functions that make use of the affected code, such as the function `www_authorize()` . Versions 3.1.7 and 3.2.4 contain a fix.\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:opensips:opensips:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"8EF642AA-D786-40DF-801D-515888AF89BE\", \"versionEndExcluding\": \"3.1.7\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:opensips:opensips:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"34713A76-CAED-43CF-A77C-73F1C36208AA\", \"versionEndExcluding\": \"3.2.4\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": \"3.2.0\", \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"OpenSIPS is a Session Initiation Protocol (SIP) server implementation. Prior to versions 3.1.7 and 3.2.4, a specially crafted Authorization header causes OpenSIPS to crash or behave in an unexpected way due to a bug in the function `parse_param_name()` . This issue was discovered while performing coverage guided fuzzing of the function parse_msg. The AddressSanitizer identified that the issue occurred in the function `q_memchr()` which is being called by the function `parse_param_name()`. This issue may cause erratic program behaviour or a server crash. It affects configurations containing functions that make use of the affected code, such as the function `www_authorize()` . Versions 3.1.7 and 3.2.4 contain a fix.\"}], \"evaluatorComment\": null, \"id\": \"CVE-2023-28098\", \"lastModified\": \"2023-03-21T22:39:28.990\", \"metrics\": {\"cvssMetricV2\": null, \"cvssMetricV30\": null, \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"NETWORK\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 7.5, \"baseSeverity\": \"HIGH\", \"confidentialityImpact\": \"NONE\", \"integrityImpact\": \"NONE\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 3.9, \"impactScore\": 3.6, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}, {\"cvssData\": {\"attackComplexity\": \"HIGH\", \"attackVector\": \"NETWORK\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 5.9, \"baseSeverity\": \"MEDIUM\", \"confidentialityImpact\": \"NONE\", \"integrityImpact\": \"NONE\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:N/AC:H/PR:N/UI:N/S:U/C:N/I:N/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 2.2, \"impactScore\": 3.6, \"source\": \"security-advisories@github.com\", \"type\": \"Secondary\"}]}, \"published\": \"2023-03-15T23:15:09.717\", \"references\": [{\"source\": \"security-advisories@github.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/OpenSIPS/opensips/commit/dd9141b6f67d7df4072f3430f628d4b73df5e102\"}, {\"source\": \"security-advisories@github.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://github.com/OpenSIPS/opensips/security/advisories/GHSA-jrqg-vppj-hr2h\"}, {\"source\": \"security-advisories@github.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://opensips.org/pub/audit-2022/opensips-audit-technical-report-full.pdf\"}], \"sourceIdentifier\": \"security-advisories@github.com\", \"vendorComments\": null, \"vulnStatus\": \"Analyzed\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"NVD-CWE-noinfo\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-20\"}], \"source\": \"security-advisories@github.com\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/OpenSIPS/opensips/commit/dd9141b6f67d7df4072f3430f628d4b73df5e102\"}, \"type\": \"NVD-CWE-noinfo\"}"},"index":{"kind":"number","value":465,"string":"465"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":28,"numItemsPerPage":100,"numTotalItems":39158,"offset":2800,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTAzMjI3Mywic3ViIjoiL2RhdGFzZXRzL3ZpdmkteXUvdnVsX2NvZGVfcHJlY2lzZSIsImV4cCI6MTc3OTAzNTg3MywiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.Ddn4aCAP_PAk211JlL6h0SJVzcR8ZXSF7V_ef-I5PwLFmIbPdiYLbrFjCABD-3jbUl9XEy2xRzu8oNNlQtGYDw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":39158,"numBytesParquet":815091704},{"config":"default","split":"val","numRows":4895,"numBytesParquet":90417334},{"config":"default","split":"test","numRows":4895,"numBytesParquet":58600329}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
prompt stringclasses 1
value | completions listlengths 1 63.8k | labels listlengths 1 63.8k | source stringclasses 1
value | other_info stringlengths 2.06k 101k | index int64 0 6.83k |
|---|---|---|---|---|---|
Determine whether the {function_name} code is vulnerable or not. | [
"",
"import { sendToLagoonLogs } from '@lagoon/commons/dist/logs';",
"import { deleteProject } from '@lagoon/commons/dist/api';",
"\nimport { WebhookRequestData } from '../types';",
"export async function gitlabProjectDelete(webhook: WebhookRequestData) {\n const {\n webhooktype,\n event,\n uuid,\... | [
0,
1,
0,
1,
1,
0,
1,
1,
0,
1,
0,
1,
0,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [1460, 19, 49, 29, 21], "buggy_code_start_loc": [654, 19, 4, 0, 0], "filenames": ["node-packages/commons/src/api.ts", "node-packages/commons/src/gitlabApi.ts", "services/webhook-handler/src/extractWebhookData.ts", "services/webhooks2tasks/src/handlers/gitlabProjectDelete.ts", "services/webhooks2t... | 455 |
Determine whether the {function_name} code is vulnerable or not. | [
"import R from 'ramda';",
"import { sendToLagoonLogs } from '@lagoon/commons/dist/logs';",
"import { allProjectsInGroup, deleteProject, sanitizeGroupName } from '@lagoon/commons/dist/api';",
"\nimport { WebhookRequestData } from '../types';",
"export async function gitlabProjectDelete(webhook: WebhookReques... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [1460, 19, 49, 29, 21], "buggy_code_start_loc": [654, 19, 4, 0, 0], "filenames": ["node-packages/commons/src/api.ts", "node-packages/commons/src/gitlabApi.ts", "services/webhook-handler/src/extractWebhookData.ts", "services/webhooks2tasks/src/handlers/gitlabProjectDelete.ts", "services/webhooks2t... | 455 |
Determine whether the {function_name} code is vulnerable or not. | [
"",
"import { ChannelWrapper } from 'amqp-connection-manager';\nimport { ConsumeMessage } from 'amqplib';",
"",
"import { processProjects } from './webhooks/projects';\nimport { processDataSync } from './webhooks/dataSync';\nimport { processBackup } from './webhooks/backup';\nimport { processProblems } from '... | [
0,
1,
0,
1,
1,
1,
0,
1,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [1460, 19, 49, 29, 21], "buggy_code_start_loc": [654, 19, 4, 0, 0], "filenames": ["node-packages/commons/src/api.ts", "node-packages/commons/src/gitlabApi.ts", "services/webhook-handler/src/extractWebhookData.ts", "services/webhooks2tasks/src/handlers/gitlabProjectDelete.ts", "services/webhooks2t... | 455 |
Determine whether the {function_name} code is vulnerable or not. | [
"import R from 'ramda';",
"import { ChannelWrapper } from 'amqp-connection-manager';\nimport { ConsumeMessage } from 'amqplib';",
"import { secureGitlabSystemHooks } from '@lagoon/commons/dist/gitlabApi';",
"import { processProjects } from './webhooks/projects';\nimport { processDataSync } from './webhooks/da... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [1460, 19, 49, 29, 21], "buggy_code_start_loc": [654, 19, 4, 0, 0], "filenames": ["node-packages/commons/src/api.ts", "node-packages/commons/src/gitlabApi.ts", "services/webhook-handler/src/extractWebhookData.ts", "services/webhooks2tasks/src/handlers/gitlabProjectDelete.ts", "services/webhooks2t... | 455 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.",
"Licensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at",
" http://www.apache.org/licenses/LICENSE-2.0",
"Unless required b... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [70], "buggy_code_start_loc": [70], "filenames": ["tensorflow/lite/kernels/one_hot.cc"], "fixing_code_end_loc": [76], "fixing_code_start_loc": [71], "message": "TensorFlow is an end-to-end open source platform for machine learning. The implementation of the `OneHot` TFLite operator is vulnerable ... | 456 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.",
"Licensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at",
" http://www.apache.org/licenses/LICENSE-2.0",
"Unless required b... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [70], "buggy_code_start_loc": [70], "filenames": ["tensorflow/lite/kernels/one_hot.cc"], "fixing_code_end_loc": [76], "fixing_code_start_loc": [71], "message": "TensorFlow is an end-to-end open source platform for machine learning. The implementation of the `OneHot` TFLite operator is vulnerable ... | 456 |
Determine whether the {function_name} code is vulnerable or not. | [
"// https://github.com/Ethan-Arrowood/undici-fetch",
"'use strict'",
"const { kHeadersList } = require('../core/symbols')\nconst { kGuard, kHeadersCaseInsensitive } = require('./symbols')\nconst { kEnumerableProperty } = require('../core/util')\nconst {\n makeIterator,\n isValidHeaderName,\n isValidHeaderVal... | [
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [31, 686], "buggy_code_start_loc": [27, 668], "filenames": ["lib/fetch/headers.js", "test/fetch/headers.js"], "fixing_code_end_loc": [33, 698], "fixing_code_start_loc": [27, 669], "message": "Undici is an HTTP/1.1 client for Node.js. Prior to version 5.19.1, the `Headers.set()` and `Headers.appen... | 457 |
Determine whether the {function_name} code is vulnerable or not. | [
"// https://github.com/Ethan-Arrowood/undici-fetch",
"'use strict'",
"const { kHeadersList } = require('../core/symbols')\nconst { kGuard, kHeadersCaseInsensitive } = require('./symbols')\nconst { kEnumerableProperty } = require('../core/util')\nconst {\n makeIterator,\n isValidHeaderName,\n isValidHeaderVal... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [31, 686], "buggy_code_start_loc": [27, 668], "filenames": ["lib/fetch/headers.js", "test/fetch/headers.js"], "fixing_code_end_loc": [33, 698], "fixing_code_start_loc": [27, 669], "message": "Undici is an HTTP/1.1 client for Node.js. Prior to version 5.19.1, the `Headers.set()` and `Headers.appen... | 457 |
Determine whether the {function_name} code is vulnerable or not. | [
"'use strict'",
"const tap = require('tap')\nconst { Headers, fill } = require('../../lib/fetch/headers')\nconst { kGuard } = require('../../lib/fetch/symbols')",
"tap.test('Headers initialization', t => {\n t.plan(8)",
" t.test('allows undefined', t => {\n t.plan(1)",
" t.doesNotThrow(() => new Hea... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [31, 686], "buggy_code_start_loc": [27, 668], "filenames": ["lib/fetch/headers.js", "test/fetch/headers.js"], "fixing_code_end_loc": [33, 698], "fixing_code_start_loc": [27, 669], "message": "Undici is an HTTP/1.1 client for Node.js. Prior to version 5.19.1, the `Headers.set()` and `Headers.appen... | 457 |
Determine whether the {function_name} code is vulnerable or not. | [
"'use strict'",
"const tap = require('tap')\nconst { Headers, fill } = require('../../lib/fetch/headers')\nconst { kGuard } = require('../../lib/fetch/symbols')",
"tap.test('Headers initialization', t => {\n t.plan(8)",
" t.test('allows undefined', t => {\n t.plan(1)",
" t.doesNotThrow(() => new Hea... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [31, 686], "buggy_code_start_loc": [27, 668], "filenames": ["lib/fetch/headers.js", "test/fetch/headers.js"], "fixing_code_end_loc": [33, 698], "fixing_code_start_loc": [27, 669], "message": "Undici is an HTTP/1.1 client for Node.js. Prior to version 5.19.1, the `Headers.set()` and `Headers.appen... | 457 |
Determine whether the {function_name} code is vulnerable or not. | [
"# ~~ Generated by projen. To modify, edit .projenrc.js and run \"npx projen\".",
"name: rebuild-bot\non:",
" issue_comment:\n types:\n - created",
" workflow_dispatch: {}\njobs:\n build:\n runs-on: ubuntu-latest\n env:\n CI: \"true\"\n if: ${{ github.event.issue.pull_request && conta... | [
1,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [8, 4212, 1111], "buggy_code_start_loc": [5, 320, 884], "filenames": [".github/workflows/rebuild-bot.yml", "src/__tests__/__snapshots__/integ.test.ts.snap", "src/node-project.ts"], "fixing_code_end_loc": [4, 4205, 1122], "fixing_code_start_loc": [4, 319, 884], "message": "`projen` is a project ge... | 458 |
Determine whether the {function_name} code is vulnerable or not. | [
"# ~~ Generated by projen. To modify, edit .projenrc.js and run \"npx projen\".",
"name: rebuild-bot\non:",
"",
" workflow_dispatch: {}\njobs:\n build:\n runs-on: ubuntu-latest\n env:\n CI: \"true\"\n if: ${{ github.event.issue.pull_request && contains(github.event.comment.body,\n '@proje... | [
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [8, 4212, 1111], "buggy_code_start_loc": [5, 320, 884], "filenames": [".github/workflows/rebuild-bot.yml", "src/__tests__/__snapshots__/integ.test.ts.snap", "src/node-project.ts"], "fixing_code_end_loc": [4, 4205, 1122], "fixing_code_start_loc": [4, 319, 884], "message": "`projen` is a project ge... | 458 |
Determine whether the {function_name} code is vulnerable or not. | [
"// Jest Snapshot v1, https://goo.gl/fbAQLP",
"exports[`cdk-watchful 1`] = `\nObject {\n \".eslintrc.json\": Object {\n \"env\": Object {\n \"jest\": true,\n \"node\": true,\n },\n \"extends\": Array [\n \"plugin:import/typescript\",\n ],\n \"ignorePatterns\": Array [\n \"*.js\... | [
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [8, 4212, 1111], "buggy_code_start_loc": [5, 320, 884], "filenames": [".github/workflows/rebuild-bot.yml", "src/__tests__/__snapshots__/integ.test.ts.snap", "src/node-project.ts"], "fixing_code_end_loc": [4, 4205, 1122], "fixing_code_start_loc": [4, 319, 884], "message": "`projen` is a project ge... | 458 |
Determine whether the {function_name} code is vulnerable or not. | [
"// Jest Snapshot v1, https://goo.gl/fbAQLP",
"exports[`cdk-watchful 1`] = `\nObject {\n \".eslintrc.json\": Object {\n \"env\": Object {\n \"jest\": true,\n \"node\": true,\n },\n \"extends\": Array [\n \"plugin:import/typescript\",\n ],\n \"ignorePatterns\": Array [\n \"*.js\... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [8, 4212, 1111], "buggy_code_start_loc": [5, 320, 884], "filenames": [".github/workflows/rebuild-bot.yml", "src/__tests__/__snapshots__/integ.test.ts.snap", "src/node-project.ts"], "fixing_code_end_loc": [4, 4205, 1122], "fixing_code_start_loc": [4, 319, 884], "message": "`projen` is a project ge... | 458 |
Determine whether the {function_name} code is vulnerable or not. | [
"import { PROJEN_DIR, PROJEN_RC, PROJEN_VERSION } from './common';\nimport { GithubWorkflow } from './github';\nimport { AutoMerge } from './github/auto-merge';\nimport { DependabotOptions } from './github/dependabot';\nimport { MergifyOptions } from './github/mergify';\nimport { IgnoreFile } from './ignore-file';\... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [8, 4212, 1111], "buggy_code_start_loc": [5, 320, 884], "filenames": [".github/workflows/rebuild-bot.yml", "src/__tests__/__snapshots__/integ.test.ts.snap", "src/node-project.ts"], "fixing_code_end_loc": [4, 4205, 1122], "fixing_code_start_loc": [4, 319, 884], "message": "`projen` is a project ge... | 458 |
Determine whether the {function_name} code is vulnerable or not. | [
"import { PROJEN_DIR, PROJEN_RC, PROJEN_VERSION } from './common';\nimport { GithubWorkflow } from './github';\nimport { AutoMerge } from './github/auto-merge';\nimport { DependabotOptions } from './github/dependabot';\nimport { MergifyOptions } from './github/mergify';\nimport { IgnoreFile } from './ignore-file';\... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [8, 4212, 1111], "buggy_code_start_loc": [5, 320, 884], "filenames": [".github/workflows/rebuild-bot.yml", "src/__tests__/__snapshots__/integ.test.ts.snap", "src/node-project.ts"], "fixing_code_end_loc": [4, 4205, 1122], "fixing_code_start_loc": [4, 319, 884], "message": "`projen` is a project ge... | 458 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/*\n * Copyright (c) 2020, Tribal Limited\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * no... | [
1,
1,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/*\n * Copyright (c) 2020, Tribal Limited\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * no... | [
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/*\n * Copyright (c) 2020, Tribal Limited\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * no... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/*\n * Copyright (c) 2020, Tribal Limited\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * no... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2020, Tribal Limited\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, t... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2020, Tribal Limited\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, t... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"zenario.lib(function(k,M,V,l,z,E,w,q,u,Q,aa,a,T,r,v,m,t,W,y,ba,ca,p){a.getItemLinkTimeoutTime=7E3;a.yourWorkInProgressLastUpdateFrequency=6E4;a.yourWorkInProgressItemCount=10;a.itemDoubleClickTime=500;a.searchDelayTime=700;a.firstLoaded=!1;a.defaultPageSize=50;a.defaultColumnWidth=150;a.columnsExtraSpacing=1;a.col... | [
1,
0,
1,
0,
1,
0,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"zenario.lib(function(k,M,V,l,z,E,w,q,u,Q,aa,a,T,r,v,m,t,W,y,ba,ca,p){a.getItemLinkTimeoutTime=7E3;a.yourWorkInProgressLastUpdateFrequency=6E4;a.yourWorkInProgressItemCount=10;a.itemDoubleClickTime=500;a.searchDelayTime=700;a.firstLoaded=!1;a.defaultPageSize=50;a.defaultColumnWidth=150;a.columnsExtraSpacing=1;a.col... | [
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/*\n * Copyright (c) 2020, Tribal Limited\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * no... | [
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/*\n * Copyright (c) 2020, Tribal Limited\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * no... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\tAttempt to set the initial height of Organizer Quick to 95% */\n#zenario_fbog.zenario_organizer_quick {\n\theight: 97%;\n}",
"",
"body.webkit input {\n\tline-height: inherit !important;\n}",
".zenario_og,\n.zenario_og textarea {\n\tfont-family:Verdana, Arial, Helvetica, sans-serif;\n\tfont-size:9pt;\n\t... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\tAttempt to set the initial height of Organizer Quick to 95% */\n#zenario_fbog.zenario_organizer_quick {\n\theight: 97%;\n}",
"",
"body.webkit input {\n\tline-height: inherit !important;\n}",
".zenario_og,\n.zenario_og textarea {\n\tfont-family:Verdana, Arial, Helvetica, sans-serif;\n\tfont-size:9pt;\n\t... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"#zenario_fbog.zenario_organizer_quick{height:97%}body.webkit input{line-height:inherit !important}.zenario_og,.zenario_og textarea{font-family:Verdana,Arial,Helvetica,sans-serif;font-size:9pt;color:#616161}\n.zenario_organizer_quick__overlay{opacity:.4}.organizer_wrapInner,.organizer_wrapOuter,.organizer_wrapOuter... | [
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"#zenario_fbog.zenario_organizer_quick{height:97%}body.webkit input{line-height:inherit !important}.zenario_og,.zenario_og textarea{font-family:Verdana,Arial,Helvetica,sans-serif;font-size:9pt;color:#616161}\n.zenario_organizer_quick__overlay{opacity:.4}.organizer_wrapInner,.organizer_wrapOuter,.organizer_wrapOuter... | [
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 2624, 4793, 97, 470, 2360, 204], "buggy_code_start_loc": [40, 2623, 4726, 23, 469, 2360, 201], "filenames": ["zenario/admin/db_updates/latest_revision_no.inc.php", "zenario/autoload/welcome.php", "zenario/js/admin_organizer.js", "zenario/js/admin_organizer.min.js", "zenario/modules/zenario_f... | 459 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Apache 2.0 - Copyright 2007-2022 - pancake and dso\n class.c rewrite: Adam Pridgen <dso@rice.edu || adam.pridgen@thecoverofnight.com>\n */\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <stdarg.h>\n#include <r_types.h>\n#include <r_util.h>\n#include <r_bin.h>\n#include <math.h>\n#incl... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [6935], "buggy_code_start_loc": [6935], "filenames": ["shlr/java/class.c"], "fixing_code_end_loc": [6940], "fixing_code_start_loc": [6936], "message": "Out-of-bounds Read in r_bin_java_bootstrap_methods_attr_new function in GitHub repository radareorg/radare2 prior to 5.7.0. The bug causes the pr... | 460 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Apache 2.0 - Copyright 2007-2022 - pancake and dso\n class.c rewrite: Adam Pridgen <dso@rice.edu || adam.pridgen@thecoverofnight.com>\n */\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <stdarg.h>\n#include <r_types.h>\n#include <r_util.h>\n#include <r_bin.h>\n#include <math.h>\n#incl... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [6935], "buggy_code_start_loc": [6935], "filenames": ["shlr/java/class.c"], "fixing_code_end_loc": [6940], "fixing_code_start_loc": [6936], "message": "Out-of-bounds Read in r_bin_java_bootstrap_methods_attr_new function in GitHub repository radareorg/radare2 prior to 5.7.0. The bug causes the pr... | 460 |
Determine whether the {function_name} code is vulnerable or not. | [
"// This file is part of Deark.\n// Copyright (C) 2016 Jason Summers\n// See the file COPYING for terms of use.",
"// This file is for format-specific functions that are used by multiple modules.",
"#define DE_NOT_IN_MODULE\n#include \"deark-config.h\"\n#include \"deark-private.h\"\n#include \"deark-fmtutil.h\"... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [1622], "buggy_code_start_loc": [1621], "filenames": ["src/fmtutil.c"], "fixing_code_end_loc": [1624], "fixing_code_start_loc": [1621], "message": "In Deark before v1.5.8, a specially crafted input file can cause a division by zero in (src/fmtutil.c) because of the value of pixelsize.", "other": ... | 461 |
Determine whether the {function_name} code is vulnerable or not. | [
"// This file is part of Deark.\n// Copyright (C) 2016 Jason Summers\n// See the file COPYING for terms of use.",
"// This file is for format-specific functions that are used by multiple modules.",
"#define DE_NOT_IN_MODULE\n#include \"deark-config.h\"\n#include \"deark-private.h\"\n#include \"deark-fmtutil.h\"... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [1622], "buggy_code_start_loc": [1621], "filenames": ["src/fmtutil.c"], "fixing_code_end_loc": [1624], "fixing_code_start_loc": [1621], "message": "In Deark before v1.5.8, a specially crafted input file can cause a division by zero in (src/fmtutil.c) because of the value of pixelsize.", "other": ... | 461 |
Determine whether the {function_name} code is vulnerable or not. | [
"# Copyright (C) Dominik Picheta. All rights reserved.\n# BSD License. Look at license.txt for more info.",
"import parseutils, os, osproc, strutils, tables, pegs, uri\nimport packageinfo, packageparser, version, tools, common, options, cli\nfrom algorithm import SortOrder, sorted\nfrom sequtils import toSeq, fil... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [142], "buggy_code_start_loc": [91], "filenames": ["src/nimblepkg/download.nim"], "fixing_code_end_loc": [142], "fixing_code_start_loc": [91], "message": "Nimble is a package manager for the Nim programming language. In Nim release version before versions 1.2.10 and 1.4.4, Nimble doCmd is used in... | 462 |
Determine whether the {function_name} code is vulnerable or not. | [
"# Copyright (C) Dominik Picheta. All rights reserved.\n# BSD License. Look at license.txt for more info.",
"import parseutils, os, osproc, strutils, tables, pegs, uri\nimport packageinfo, packageparser, version, tools, common, options, cli\nfrom algorithm import SortOrder, sorted\nfrom sequtils import toSeq, fil... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [142], "buggy_code_start_loc": [91], "filenames": ["src/nimblepkg/download.nim"], "fixing_code_end_loc": [142], "fixing_code_start_loc": [91], "message": "Nimble is a package manager for the Nim programming language. In Nim release version before versions 1.2.10 and 1.4.4, Nimble doCmd is used in... | 462 |
Determine whether the {function_name} code is vulnerable or not. | [
"Version 1.0.47 (unreleased)\n---------------------------",
"New features:",
"* Vietnamese translation",
"",
"\nVersion 1.0.46 (August 13, 2017)\n--------------------------------",
"Security Issues:",
"* Fix two privilege escalation issues: a standard user could reset the password \nof another user (inc... | [
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"Version 1.0.47 (unreleased)\n---------------------------",
"New features:",
"* Vietnamese translation",
"\nSecurity Issues:",
"* Avoid people to alter other project resources by changing form data",
"\nVersion 1.0.46 (August 13, 2017)\n--------------------------------",
"Security Issues:",
"* Fix two... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"/**\n * Automatic Actions Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ActionController extends BaseController\n{\n /**\n * List of automatic actions for a given project\n *\n * @access public\n */\n ... | [
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
0,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"/**\n * Automatic Actions Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ActionController extends BaseController\n{\n /**\n * List of automatic actions for a given project\n *\n * @access public\n */\n ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"/**\n * Action Creation Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ActionCreationController extends BaseController\n{\n /**\n * Show the form (step 1)\n *\n * @access public\n */\n public function ... | [
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"/**\n * Action Creation Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ActionCreationController extends BaseController\n{\n /**\n * Show the form (step 1)\n *\n * @access public\n */\n public function ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Base;\nuse Kanboard\\Core\\Controller\\AccessForbiddenException;\nuse Kanboard\\Core\\Controller\\PageNotFoundException;",
"/**\n * Base Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nabstract class BaseCo... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Base;\nuse Kanboard\\Core\\Controller\\AccessForbiddenException;\nuse Kanboard\\Core\\Controller\\PageNotFoundException;",
"/**\n * Base Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nabstract class BaseCo... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\PageNotFoundException;",
"/**\n * Category Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass CategoryController extends BaseController\n{",
" /**\n * Get the category (common method b... | [
1,
1,
1,
1,
0,
0,
0,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
0,
1,
1,
0,
1,
0,
1,
1,
1,
1,
0,
1,
1,
0,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\PageNotFoundException;",
"/**\n * Category Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass CategoryController extends BaseController\n{",
"",
" /**\n * List of categories for a gi... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\AccessForbiddenException;",
"/**\n * Column Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ColumnController extends BaseController\n{\n /**\n * Display columns list\n *\n *... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
0,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
0,
1,
0,
1,
0,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\AccessForbiddenException;",
"/**\n * Column Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ColumnController extends BaseController\n{\n /**\n * Display columns list\n *\n *... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\AccessForbiddenException;\nuse Kanboard\\Core\\Security\\Role;",
"/**\n * Custom Filter Controller\n *\n * @package Kanboard\\Controller\n * @author Timo Litzbarski\n * @author Frederic Guillot\n */\nclass CustomFilterController ex... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
0,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\AccessForbiddenException;\nuse Kanboard\\Core\\Security\\Role;",
"/**\n * Custom Filter Controller\n *\n * @package Kanboard\\Controller\n * @author Timo Litzbarski\n * @author Frederic Guillot\n */\nclass CustomFilterController ex... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"/**\n * Project Edit Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ProjectEditController extends BaseController\n{\n /**\n * Edit project\n *\n * @access public\n * @param array $values\n * @param ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"/**\n * Project Edit Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ProjectEditController extends BaseController\n{\n /**\n * Edit project\n *\n * @access public\n * @param array $values\n * @param ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"\nuse Kanboard\\Core\\Controller\\AccessForbiddenException;",
"\n/**\n * Class ProjectTagController\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ProjectTagController extends BaseController\n{\n public function index()\n {\n ... | [
1,
1,
0,
1,
1,
1,
0,
1,
1,
0,
1,
1,
1,
1,
0,
1,
1,
1,
0,
1,
0,
1,
0,
1,
1,
1,
0,
1,
1,
0,
1,
0,
0,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"",
"\n/**\n * Class ProjectTagController\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass ProjectTagController extends BaseController\n{\n public function index()\n {\n $project = $this->getProject();",
" $this->... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\AccessForbiddenException;",
"use Kanboard\\Core\\Controller\\PageNotFoundException;\nuse Kanboard\\Model\\SwimlaneModel;",
"\n/**\n * Swimlanes Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\ncl... | [
1,
1,
1,
0,
1,
0,
0,
0,
0,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
0,
1,
1,
0,
1,
0,
1,
1,
1,
1,
0,
1,
1,
0,
0,
1,
1,
1,
0,
0,
1,
1,
1,
0,
0,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\AccessForbiddenException;",
"",
"\n/**\n * Swimlanes Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass SwimlaneController extends BaseController\n{\n /**",
"",
" * List of swimlan... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\PageNotFoundException;",
"/**\n * Task Creation Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass TaskCreationController extends BaseController\n{\n /**\n * Display a form to create a... | [
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"namespace Kanboard\\Controller;",
"use Kanboard\\Core\\Controller\\PageNotFoundException;",
"/**\n * Task Creation Controller\n *\n * @package Kanboard\\Controller\n * @author Frederic Guillot\n */\nclass TaskCreationController extends BaseController\n{\n /**\n * Display a form to create a... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add an action') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('ActionCreationController', 'event', array('project_id' => $project['id'])) ?>\">\n <?= $this->form->csrf() ?>",
" <?= $this->form->hidden('project_id', $values) ?>",
"\n <?... | [
1,
0,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add an action') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('ActionCreationController', 'event', array('project_id' => $project['id'])) ?>\">\n <?= $this->form->csrf() ?>",
"",
"\n <?= $this->form->label(t('Action'), 'action_name') ?>\n... | [
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Choose an event') ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('ActionCreationController', 'params', array('project_id' => $project['id'])) ?>\">\n <?= $this->form->csrf() ?>\n",
" <?= $this->form->hidden('project_id', $values) ?>",
... | [
1,
1,
0,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Choose an event') ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('ActionCreationController', 'params', array('project_id' => $project['id'])) ?>\">\n <?= $this->form->csrf() ?>\n",
"",
" <?= $this->form->hidden('action_name', $values) ... | [
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Define action parameters') ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('ActionCreationController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>\n",
" <?= $this->form->hidden('p... | [
1,
1,
0,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Define action parameters') ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('ActionCreationController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>\n",
"",
" <?= $this->form->hid... | [
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add a new category') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('CategoryController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
" <?= $this->form->hidden('project_id', $value... | [
1,
0,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add a new category') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('CategoryController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
"",
"\n <?= $this->form->label(t('Category N... | [
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Category modification for the project \"%s\"', $project['name']) ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('CategoryController', 'update', array('project_id' => $project['id'], 'category_id' => $values['id'])) ?>\" autocomplete=\"off\">\n ... | [
1,
1,
0,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Category modification for the project \"%s\"', $project['name']) ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('CategoryController', 'update', array('project_id' => $project['id'], 'category_id' => $values['id'])) ?>\" autocomplete=\"off\">\n ... | [
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add a new column') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('ColumnController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
"\n <?= $this->form->hidden('project_id', $values)... | [
1,
0,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add a new column') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('ColumnController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
"",
"\n <?= $this->form->label(t('Title'), 'titl... | [
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Edit column \"%s\"', $column['title']) ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('ColumnController', 'update', array('project_id' => $project['id'], 'column_id' => $column['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",... | [
1,
1,
0,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Edit column \"%s\"', $column['title']) ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('ColumnController', 'update', array('project_id' => $project['id'], 'column_id' => $column['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",... | [
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add a new filter') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('CustomFilterController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
" <?= $this->form->hidden('project_id', $val... | [
1,
0,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add a new filter') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('CustomFilterController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
"",
"\n <?= $this->form->label(t('Name'), ... | [
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Edit custom filter') ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('CustomFilterController', 'update', array('project_id' => $filter['project_id'], 'filter_id' => $filter['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>\n",
... | [
1,
1,
0,
1,
0,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Edit custom filter') ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('CustomFilterController', 'update', array('project_id' => $filter['project_id'], 'filter_id' => $filter['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>\n",
... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php if ($this->app->isAjax()): ?>\n <div class=\"page-header\">\n <h2><?= $this->text->e($project['name']) ?> > <?= t('Edit project') ?></h2>\n </div>\n<?php else: ?>\n <div class=\"page-header\">\n <h2><?= t('Edit project') ?></h2>\n </div>\n<?php endif ?>\n<form method=\"post\" act... | [
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php if ($this->app->isAjax()): ?>\n <div class=\"page-header\">\n <h2><?= $this->text->e($project['name']) ?> > <?= t('Edit project') ?></h2>\n </div>\n<?php else: ?>\n <div class=\"page-header\">\n <h2><?= t('Edit project') ?></h2>\n </div>\n<?php endif ?>\n<form method=\"post\" act... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add new tag') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('ProjectTagController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
" <?= $this->form->hidden('project_id', $values) ?>... | [
1,
0,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add new tag') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('ProjectTagController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
"",
"\n <?= $this->form->label(t('Name'), 'name')... | [
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Edit a tag') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('ProjectTagController', 'update', array('tag_id' => $tag['id'], 'project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
" <?= $this->form->hidden(... | [
1,
0,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Edit a tag') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('ProjectTagController', 'update', array('tag_id' => $tag['id'], 'project_id' => $project['id'])) ?>\" autocomplete=\"off\">\n <?= $this->form->csrf() ?>",
"",
"\n <?= $this->form-... | [
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add a new swimlane') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('SwimlaneController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">",
"",
" <?= $this->form->csrf() ?>",
" <?= $this->form->hidden('project_i... | [
1,
0,
1,
0,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Add a new swimlane') ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('SwimlaneController', 'save', array('project_id' => $project['id'])) ?>\" autocomplete=\"off\">",
"",
" <?= $this->form->csrf() ?>",
"",
"\n <?= $this->form->label(t('... | [
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Swimlane modification for the project \"%s\"', $project['name']) ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('SwimlaneController', 'update', array('project_id' => $project['id'], 'swimlane_id' => $values['id'])) ?>\" autocomplete=\"off\">",
... | [
1,
1,
0,
1,
0,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= t('Swimlane modification for the project \"%s\"', $project['name']) ?></h2>\n</div>",
"<form method=\"post\" action=\"<?= $this->url->href('SwimlaneController', 'update', array('project_id' => $project['id'], 'swimlane_id' => $values['id'])) ?>\" autocomplete=\"off\">",
... | [
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= $this->text->e($project['name']) ?> > <?= t('New task') ?><?= $this->task->getNewTaskDropdown($project['id'], $values['swimlane_id'], $values['column_id']) ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('TaskCreationController', 'save', array('proje... | [
1,
0,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"<div class=\"page-header\">\n <h2><?= $this->text->e($project['name']) ?> > <?= t('New task') ?><?= $this->task->getNewTaskDropdown($project['id'], $values['swimlane_id'], $values['column_id']) ?></h2>\n</div>\n<form method=\"post\" action=\"<?= $this->url->href('TaskCreationController', 'save', array('proje... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6, 69, 111, 157, 162, 186, 155, 67, 127, 208, 51, 7, 9, 9, 7, 10, 8, 10, 7, 11, 13, 7, 8, 8, 11, 7], "buggy_code_start_loc": [6, 48, 37, 157, 15, 63, 61, 67, 4, 6, 51, 6, 8, 8, 6, 7, 6, 7, 6, 8, 12, 6, 6, 5, 6, 6], "filenames": ["ChangeLog", "app/Controller/ActionController.php", "app/Controller... | 463 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n */",
"/*\n * Definition of error messages, sorted on error number.\n */",
"EXTERN cha... | [
1,
1,
1,
1,
0
] | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n */",
"/*\n * Definition of error messages, sorted on error number.\n */",
"EXTERN cha... | [
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\tby Bram Moolenaar\n * Multibyte extensions partly by Sung-Hoon Baek\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\tby Bram Moolenaar\n * Multibyte extensions partly by Sung-Hoon Baek\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the Vim source code.\n */",
"/*\n * spellfile.c: co... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the Vim source code.\n */",
"/*\n * spellfile.c: co... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"\" Test for spell checking with 'encoding' set to utf-8",
"source check.vim\nCheckFeature spell",
"scriptencoding utf-8",
"func TearDown()\n set nospell\n call delete('Xtest.aff')\n call delete('Xtest.dic')\n call delete('Xtest.utf-8.add')\n call delete('Xtest.utf-8.add.spl')\n call delete('Xtest.utf-8... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"\" Test for spell checking with 'encoding' set to utf-8",
"source check.vim\nCheckFeature spell",
"scriptencoding utf-8",
"func TearDown()\n set nospell\n call delete('Xtest.aff')\n call delete('Xtest.dic')\n call delete('Xtest.utf-8.add')\n call delete('Xtest.utf-8.add.spl')\n call delete('Xtest.utf-8... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\t\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the Vim source code.\n */",
"#include \"vim.h\"",... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\t\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the Vim source code.\n */",
"#include \"vim.h\"",... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [3275, 4230, 6192, 782, 748], "buggy_code_start_loc": [3275, 4229, 4392, 782, 748], "filenames": ["src/errors.h", "src/mbyte.c", "src/spellfile.c", "src/testdir/test_spell_utf8.vim", "src/version.c"], "fixing_code_end_loc": [3280, 4230, 6203, 788, 751], "fixing_code_start_loc": [3276, 4229, 4393,... | 464 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * 32-bit Digest parameter name parser\n *\n * Copyright (C) 2001-2003 FhG Fokus\n *\n * This file is part of opensips, a free SIP server.\n *\n * opensips is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foun... | [
1,
1,
1,
1,
1,
0,
1,
1,
0,
1,
1,
0,
1,
0,
1,
1,
0,
1,
0,
1,
1,
1,
0,
1,
1,
0,
1,
1,
0,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [167], "buggy_code_start_loc": [74], "filenames": ["parser/digest/param_parser.c"], "fixing_code_end_loc": [170], "fixing_code_start_loc": [75], "message": "OpenSIPS is a Session Initiation Protocol (SIP) server implementation. Prior to versions 3.1.7 and 3.2.4, a specially crafted Authorization ... | 465 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * 32-bit Digest parameter name parser\n *\n * Copyright (C) 2001-2003 FhG Fokus\n *\n * This file is part of opensips, a free SIP server.\n *\n * opensips is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foun... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [167], "buggy_code_start_loc": [74], "filenames": ["parser/digest/param_parser.c"], "fixing_code_end_loc": [170], "fixing_code_start_loc": [75], "message": "OpenSIPS is a Session Initiation Protocol (SIP) server implementation. Prior to versions 3.1.7 and 3.2.4, a specially crafted Authorization ... | 465 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.