vim-55/src/spell.c

18  * binary searching can be used and the NUL bytes are at the start.  The
517 /* First language that is loaded, start of the linked list of loaded
541 #define VIMSPELLMAGIC "VIMspell"  /* string at start of Vim spell file */
545 #define VIMSUGMAGIC "VIMsug"	/* string at start of Vim .sug file */
601     char_u	*su_badptr;	    /* start of bad word in line */
692     char_u	*mi_word;		/* start of word being checked */
715     int		mi_compoff;		/* start of following word offset */
763     STATE_START = 0,	/* At start of node check for NUL bytes (goodword
768     STATE_ENDNUL,	/* Past NUL bytes at start of the node. */
792     idx_T	ts_arridx;	/* index in tree array, start of node */
887 static int check_need_cap __ARGS((linenr_T lnum, colnr_T col));
998  * "ptr" points to a character that could be the start of a word.
1762 	    /* Second part matches at start of following compound word, now
1856  * Return TRUE if the compound flags in compflags[] match the start of any
2180     int		col;
2193      * Start looking for bad word at the start of the line, because we can't
2194      * start halfway a word, we don't know where it starts or ends.
2199      * We concatenate the start of the next line, so that wrapped words work
2230 	    col = (int)(skipwhite(line) - line);
2231 	    if (check_need_cap(lnum, col))
2232 		capcol = col;
2239 	/* Copy the line into "buf" and append the start of the next line if
2255 		    && (colnr_T)(p - buf) >= wp->w_cursor.col)
2258 	    /* start of word */
2275 						  > wp->w_cursor.col)))
2280 			    col = (int)(p - buf);
2281 			    (void)syn_get_id(wp, lnum, (colnr_T)col,
2294 			    found_pos.col = (int)(p - buf);
2310 				found_pos.col += len;
2366 		/* Wrap around to the start of the buffer.  May search the
2379 	    /* Skip the characters at the start of the next line that were
2402  * For spell checking: concatenate the start of the following line "line" into
2404  * Keep the blanks at the start of the next line, this is used in win_line()
3574     /* We also need a list of all flags that can appear at the start and one
3625 	    /* At start of item: copy flags to "sl_compstartflags".  For a
4596      * But a word with an upper char only at start is a ONECAP.
5733 			 * be empty or start with the same letter. */
6318  * each other.  We have almost 255 available, but start at 0-127 to avoid
6563     /* start with a message for the first line */
6855     char_u	*word;		/* basic word start */
6929 			    /* prefix: chop/add at the start of the word */
7646     long	start = 0;
7653     start = (getdigits(&p) * 10) / (SBLOCKSIZE / 102);
7669     if (start == 0 || incr == 0 || added == 0 || incr > start)
7672     compress_start = start;
7760      * start of the tree. */
8766  * Returns the wordnr at the start of the node.
9090     spin.si_newcompID = 127;	/* start compound ID at first maximum */
9424 		     * the start of the line.  Mixing reading and writing
9516 	 * is a path separator remember the start of the tail. */
9589     /* We include digits.  A word shouldn't start with a digit, but handling
10125 	badlen = (int)curwin->w_cursor.col - (int)VIsual.col;
10129 	    curwin->w_cursor.col = VIsual.col;
10135 	/* Find the start of the badly spelled word. */
10137 	    || curwin->w_cursor.col > prev_cursor.col)
10143 	p = line + curwin->w_cursor.col;
10144 	/* Backup to before start of word. */
10147 	/* Forward to start of word. */
10156 	curwin->w_cursor.col = (colnr_T)(p - line);
10162     need_cap = check_need_cap(curwin->w_cursor.lnum, curwin->w_cursor.col);
10175     spell_find_suggest(line + curwin->w_cursor.col, badlen, &sug, limit,
10314 	    curwin->w_cursor.col = c;
10336  * Check if the word at line "lnum" column "col" is required to start with a
10340 check_need_cap(lnum, col)
10342     colnr_T	col;
10356     if ((int)(skipwhite(line) - line) >= (int)col)
10358 	/* At start of line, check if previous line is empty or sentence
10377 	endcol = col;
10445 	if (addlen <= 0 || STRNCMP(line + curwin->w_cursor.col,
10451 	    mch_memmove(p, line, curwin->w_cursor.col);
10452 	    STRCPY(p + curwin->w_cursor.col, repl_to);
10453 	    STRCAT(p, line + curwin->w_cursor.col + STRLEN(repl_from));
10455 	    changed_bytes(curwin->w_cursor.lnum, curwin->w_cursor.col);
10464 	curwin->w_cursor.col += (colnr_T)STRLEN(repl_to);
10520  * Find spell suggestions for the word at the start of "badptr".
10533     int		need_cap;	/* word should start with capital */
11390 		/* At end of a prefix or at start of prefixtree: check for
11875 			 * may start compounding over again.  */
12113 		/* Deleting a vowel at the start of a word counts less, see
12209 		/* Inserting a vowel at the start of a word counts less,
12731     stack[depth + 1].ts_curi = 1;	/* start just after length byte */
14757     /* Adding/inserting "*" at the start (word starts with vowel) shouldn't be
15135      * The idea is to go from start to end over the words.  So long as
15324      * The idea is to go from start to end over the words.  So long as
15949  * Move "p" to the end of word "start".
15953 spell_to_word_end(start, win)
15954     char_u  *start;
15957     char_u  *p = start;
15967  * Find start of the word in front of column "startcol".
15978     int		col = 0;
15992     /* Go back to start of the word. */
15995 	col = (int)(p - line);
15999 	col = 0;
16002     return col;
16012 spell_expand_check_cap(col)
16013     colnr_T col;
16015     spell_expand_need_cap = check_need_cap(curwin->w_cursor.lnum, col);