Lines Matching refs:len
611 static uint4 simplehash( const char *p, int len )
617 -/* checks if n-gram lex is a prefix of key and of length len */
618 -inline int issame( char *lex, char *key, int len )
621 - for (i=0; i<len; i++) {
633 /* increases frequency of ngram(p,len) */
634 -static inline int increasefreq( table_t *t, char *p, int len )
636 - uint4 hash = simplehash( p, len ) & TABLEMASK;
637 +static int increasefreq( table_t *t, char *p, int len )
639 + uint4 hash = simplehash( p, len ) & TABLEMASK;
645 if ( issame( entry->str, p, len ) ) {
660 /* looks up ngram(p,len) */
661 -static entry_t *findfreq( table_t *t, char *p, int len )
663 - uint4 hash = simplehash( p, len ) & TABLEMASK;
664 +static entry_t *findfreq( table_t *t, char *p, int len )
666 + uint4 hash = simplehash( p, len ) & TABLEMASK;
672 if ( issame( entry->str, p, len ) ) {
1351 +int issame( char *lex, char *key, int len )
1353 + /*printf("[%s] prefix of [%s] with length %i", lex, key, len);*/
1356 + while(char_counter < len) {
1372 + /*printf(" NO\n", lex, key, len);*/
1469 +/* checks if n-gram lex is a prefix of key and of length len
1470 +* if _UTF8_ is defined, it uses escap characters and len is not really the length of lex
1471 +* in this case, len is the number of utf-8 char strlen("€") == 3 but len == 1
1473 +int issame( char *lex, char *key, int len );