Home
last modified time | relevance | path

Searched refs:nhash (Results 76 – 100 of 751) sorted by relevance

12345678910>>...31

/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/deskutils/just/just-0.10.5/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/benchmarks/inferno/inferno-0.10.9/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/benchmarks/hyperfine/hyperfine-1.12.0/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/www/jwt-cli/jwt-cli-5.0.0/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/textproc/angle-grinder/angle-grinder-0.18.0/cargo-crates/memchr-2.4.0/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/textproc/bat/bat-0.18.3/cargo-crates/memchr-2.4.0/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/sysutils/fselect/fselect-0.7.7/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash,
59 if nhash.eq(hash) && is_prefix(haystack, needle) {
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]);
78 nhash: &NeedleHash,
88 if nhash.eq(hash) && is_suffix(haystack, needle) {
95 &nhash,
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) {
187 self.del(nhash, old);
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) {
199 let factor = nhash.hash_2pow;
/dports/sysutils/fd/fd-8.3.0/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/www/miniserve/miniserve-0.18.0/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/x11/wmfocus/wmfocus-1.2.0/cargo-crates/memchr-2.4.0/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/www/monolith/monolith-2.6.1/cargo-crates/memchr-2.4.0/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/devel/py-maturin/maturin-0.11.3/cargo-crates/memchr-2.4.1/src/memmem/
H A Drabinkarp.rs47 nhash: &NeedleHash, in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
78 nhash: &NeedleHash, in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
95 &nhash, in rfind_with()
186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll()
187 self.del(nhash, old); in roll()
198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del()
199 let factor = nhash.hash_2pow; in del()
/dports/textproc/heirloom-doctools/heirloom-doctools-160308/refer/
H A Dhunt1.c66 int falseflg, nhash, nitem, nfound = 0, frtbl, kk; in main() local
176 fread (&nhash, sizeof(nhash), 1, fa); in main()
180 hpt = calloc(nhash, sizeof(*hpt)); in main()
181 kk=fread( hpt, sizeof(*hpt), nhash, fa); in main()
183 fprintf(stderr,"read %d hashes, iflong %d, nhash %d\n", kk, iflong, nhash); in main()
185 assert (kk==nhash); in main()
186 hfreq = calloc(nhash, sizeof(*hfreq)); in main()
188 frtbl = fread(hfreq, sizeof(*hfreq), nhash, fa); in main()
189 hfrflg = (frtbl == nhash); in main()
204 nfound = doquery(hpt, nhash, fb, nitem, qitem, master); in main()
H A Dinv1.c54 int nhash = 256; in main() local
75 nhash = atoi (argv[1]+2); in main()
134 nhash = recopy(ftb, fb, fopen(nma, "r"), nhash); in main()
143 docs = newkeys(fta, stdin, fc, nhash, fd, &iflong); in main()
170 whash(fta, fa, fb, nhash, iflong, &keys, &hashes); in main()
/dports/devel/plan9port/plan9port-1f098efb7370a0b28306d10681e21883fb1c1507/src/libdiskfs/
H A Dcache.c21 int nhash; member
49 h = offset % d->nhash; in addtohash()
63 h = b->offset % d->nhash; in delfromhash()
132 h = offset % d->nhash; in findblock()
244 for(i=0; i<d->nhash; i++){ in diskcachesync()
283 int nhash, i; in diskcache() local
287 nhash = ncache; in diskcache()
288 while(nhash > 1 && !isprime(nhash)) in diskcache()
289 nhash--; in diskcache()
290 d = mallocz(sizeof(DiskCache)+ncache*sizeof(DiskCacheBlock)+nhash*sizeof(DiskCacheBlock*), 1); in diskcache()
[all …]
/dports/games/scummvm-tools/scummvm-tools-2.5.0/engines/grim/lua/
H A Dltable.h16 #define nhash(t) ((t)->nhash) macro
18 Hash *luaH_new (int32 nhash);
23 Node *hashnodecreate (int32 nhash);
/dports/math/saga/saga-8.1.3/saga-gis/src/tools/grid/grid_gridding/nn/
H A Dhash.c43 int nhash; /* number of used table elements */ member
79 table->nhash = 0; in ht_create()
146 table->nhash++; in ht_insert()
249 table->nhash--; in ht_delete()
467 return table->nhash; in ht_getnfilled()
633 printf(" %d entries, %d table elements, %d filled elements\n", ht->n, ht->size, ht->nhash); in main()
634 printf(" %f entries per hash value in use\n", (double) ht->n / ht->nhash); in main()
655 printf(" %d entries, %d table elements, %d filled elements\n", ht->n, ht->size, ht->nhash); in main()
656 printf(" %f entries per hash value in use\n", (double) ht->n / ht->nhash); in main()
701 printf(" %f entries per hash value in use\n", (double) ht->n / ht->nhash); in main()
[all …]
/dports/games/residualvm/residualvm-0.3.1/engines/grim/lua/
H A Dltable.h16 #define nhash(t) ((t)->nhash) macro
18 Hash *luaH_new(int32 nhash);
23 Node *hashnodecreate(int32 nhash);
/dports/games/scummvm/scummvm-2.5.1/engines/grim/lua/
H A Dltable.h16 #define nhash(t) ((t)->nhash) macro
18 Hash *luaH_new(int32 nhash);
23 Node *hashnodecreate(int32 nhash);
/dports/math/plplot-ada/plplot-5.15.0/lib/nn/
H A Dhash.c43 int nhash; // number of used table elements member
88 table->nhash = 0; in ht_create()
159 table->nhash++; in ht_insert()
267 table->nhash--; in ht_delete()
574 printf( " %d entries, %d table elements, %d filled elements\n", ht->n, ht->size, ht->nhash ); in main()
575 printf( " %f entries per hash value in use\n", (double) ht->n / ht->nhash ); in main()
598 printf( " %d entries, %d table elements, %d filled elements\n", ht->n, ht->size, ht->nhash ); in main()
599 printf( " %f entries per hash value in use\n", (double) ht->n / ht->nhash ); in main()
645 printf( " %d entries, %d table elements, %d filled elements\n", ht->n, ht->size, ht->nhash ); in main()
646 printf( " %f entries per hash value in use\n", (double) ht->n / ht->nhash ); in main()
[all …]
/dports/math/plplot/plplot-5.15.0/lib/nn/
H A Dhash.c43 int nhash; // number of used table elements member
88 table->nhash = 0; in ht_create()
159 table->nhash++; in ht_insert()
267 table->nhash--; in ht_delete()
574 printf( " %d entries, %d table elements, %d filled elements\n", ht->n, ht->size, ht->nhash ); in main()
575 printf( " %f entries per hash value in use\n", (double) ht->n / ht->nhash ); in main()
598 printf( " %d entries, %d table elements, %d filled elements\n", ht->n, ht->size, ht->nhash ); in main()
599 printf( " %f entries per hash value in use\n", (double) ht->n / ht->nhash ); in main()
645 printf( " %d entries, %d table elements, %d filled elements\n", ht->n, ht->size, ht->nhash ); in main()
646 printf( " %f entries per hash value in use\n", (double) ht->n / ht->nhash ); in main()
[all …]
/dports/emulators/qemu/qemu-6.2.0/crypto/
H A Divgen-essiv.c35 size_t nhash; in qcrypto_ivgen_essiv_init() local
42 nhash = qcrypto_hash_digest_len(ivgen->hash); in qcrypto_ivgen_essiv_init()
44 salt = g_new0(uint8_t, MAX(nhash, nsalt)); in qcrypto_ivgen_essiv_init()
47 &salt, &nhash, in qcrypto_ivgen_essiv_init()
57 salt, MIN(nhash, nsalt), in qcrypto_ivgen_essiv_init()
/dports/emulators/qemu42/qemu-4.2.1/crypto/
H A Divgen-essiv.c35 size_t nhash; in qcrypto_ivgen_essiv_init() local
42 nhash = qcrypto_hash_digest_len(ivgen->hash); in qcrypto_ivgen_essiv_init()
44 salt = g_new0(uint8_t, MAX(nhash, nsalt)); in qcrypto_ivgen_essiv_init()
47 &salt, &nhash, in qcrypto_ivgen_essiv_init()
57 salt, MIN(nhash, nsalt), in qcrypto_ivgen_essiv_init()

12345678910>>...31