| /src/usr.bin/locate/bigram/ |
| locate.bigram.c | 49 * bigram < text > bigrams
51 * List bigrams for 'updatedb' script.
71 struct bigram bigrams[256 * 256]; variable in typeref:struct:bigram[]
77 bigrams[(i1<<8)+i2].count++;
102 memset(bigrams, 0, sizeof(bigrams));
104 bigrams[i].b1 = i / 256;
105 bigrams[i].b2 = i % 256;
116 * output post-residue bigrams only
127 /* sort the bigrams by how many times it appeared and their value *
[all...] |
| locate.bigram.c | 49 * bigram < text > bigrams
51 * List bigrams for 'updatedb' script.
71 struct bigram bigrams[256 * 256]; variable in typeref:struct:bigram[]
77 bigrams[(i1<<8)+i2].count++;
102 memset(bigrams, 0, sizeof(bigrams));
104 bigrams[i].b1 = i / 256;
105 bigrams[i].b2 = i % 256;
116 * output post-residue bigrams only
127 /* sort the bigrams by how many times it appeared and their value *
[all...] |
| /src/usr.bin/locate/code/ |
| locate.code.c | 52 * USAGE: bigram < list > bigrams
53 * process bigrams (see updatedb) > common_bigrams
98 static char bigrams[BGBUFSIZE + 1] = { 0 }; variable in typeref:typename:char[]
122 strncpy(bigrams, argv[0], BGBUFSIZE);
123 bigrams[BGBUFSIZE] = '\0';
124 if (fwrite(bigrams, 1, BGBUFSIZE, stdout) != BGBUFSIZE)
190 bgindex(char *bg) /* Return location of bg in bigrams or -1. */
196 for (p = bigrams; *p != '\0'; p += 2)
199 return (*p == '\0' ? -1 : p - bigrams);
|
| locate.code.c | 52 * USAGE: bigram < list > bigrams
53 * process bigrams (see updatedb) > common_bigrams
98 static char bigrams[BGBUFSIZE + 1] = { 0 }; variable in typeref:typename:char[]
122 strncpy(bigrams, argv[0], BGBUFSIZE);
123 bigrams[BGBUFSIZE] = '\0';
124 if (fwrite(bigrams, 1, BGBUFSIZE, stdout) != BGBUFSIZE)
190 bgindex(char *bg) /* Return location of bg in bigrams or -1. */
196 for (p = bigrams; *p != '\0'; p += 2)
199 return (*p == '\0' ? -1 : p - bigrams);
|
