/third_party/skia/bench/ |
H A D | FontCacheBench.cpp | 85 int collisions = 0; in count_collisions() local 88 collisions += table[index]; in count_collisions() 91 return collisions; in count_collisions() 124 int collisions = 0; variable 129 collisions += count_collisions(array, count, gRec[i].fHasher, hashMask); 133 SkDebugf("hashBits [%d] limit [%d] collisions [%d / %d = %1.2g%%] using %s\n", hashBits, limit, collisions, glyphs, 134 collisions * 100.0 / glyphs, gRec[i].fName);
|
/third_party/python/Include/internal/ |
H A D | pycore_typeobject.h | 38 size_t collisions; member
|
/third_party/mesa3d/src/vulkan/util/ |
H A D | vk_dispatch_table_gen.py | 297 * collisions entries: 299 * ${i}${'+' if i == 9 else ' '} ${strmap.collisions[i]} 639 self.collisions = [0] * 10 646 self.collisions[min(level, 9)] += 1
|
/third_party/python/Lib/test/ |
H A D | test_tuple.py | 122 # Various tests for hashing of tuples to check that we get few collisions. 125 # Earlier versions of the tuple hash algorithm had massive collisions 145 collisions = nballs - len(c) 146 z = (collisions - mean) / sdev 149 got = (collisions, pileup) 160 msg += f"coll {collisions:,} z {z:+.1f}" 204 # there's nothing the tuple hash can do to avoid collisions 205 # inherited from collisions in the tuple components' hashes. 215 # collisions among the hashes of the integers in L alone. 221 # Used to suffer a massive number of collisions [all...] |
/third_party/ffmpeg/libavcodec/ |
H A D | ass_split.h | 30 char *collisions; /**< how subtitles are moved to prevent collisions */ member
|
H A D | ass_split.c | 62 {"Collisions", ASS_STR, offsetof(ASSScriptInfo, collisions) },
|
/third_party/libbpf/include/uapi/linux/ |
H A D | if_link.h | 19 __u32 collisions; member 95 * @collisions: Number of collisions during packet transmissions. 196 * to late collisions (for Ethernet - after the first 64B of transmission). 228 __u64 collisions; member
|
/third_party/mesa3d/src/panfrost/midgard/ |
H A D | midgard_ra.c | 259 bool collisions[] = { is_ldst, is_texr, is_texw && is_aluw, is_brar }; in mir_lower_special_reads() local 261 for (unsigned j = 0; j < ARRAY_SIZE(collisions); ++j) { in mir_lower_special_reads() 262 if (!collisions[j]) continue; in mir_lower_special_reads()
|
/third_party/python/Lib/test/support/ |
H A D | __init__.py | 1992 # Return mean and sdev of number of collisions when tossing nballs balls 1994 # collisions is the number of balls minus the number of occupied bins at 2001 # so collisions = k - (n - n*(1 - 1/n)**k) 2025 collisions = k - occupied 2027 return float(collisions), float(var.sqrt())
|
/third_party/python/Tools/unicode/ |
H A D | makeunicodedata.py | 729 # collisions on the current data set. if you like, change it 1231 print(n, "collisions") 1232 self.collisions = n
|
/third_party/python/Objects/ |
H A D | typeobject.c | 245 size_t total = cache->hits + cache->collisions + cache->misses; in _PyType_ClearCache() 250 fprintf(stderr, "-- Method cache collisions = %zd (%d%%)\n", in _PyType_ClearCache() 251 cache->collisions, (int) (100.0 * cache->collisions / total)); in _PyType_ClearCache() 3859 cache->collisions++; in _PyType_Lookup()
|
/third_party/gn/src/gn/ |
H A D | variables.cc | 1584 output in a subdirectory of root_out_dir can result in collisions between 1611 Sometimes you will want an alternate name to avoid collisions or if the
|
/third_party/toybox/toys/pending/ |
H A D | ip.c | 776 rtstat->tx_dropped, rtstat->tx_carrier_errors, rtstat->collisions); in print_stats()
|
/third_party/sqlite/src/ |
H A D | shell.c | 3811 ** this file to prevent name collisions with C-library functions of the 10347 int collisions = 0; in idxCreateFromCons() local 10366 collisions = 0; in idxCreateFromCons() 10369 ++collisions; in idxCreateFromCons() 10370 }while( collisions<50 && zName!=0 ); in idxCreateFromCons() 10371 if( collisions ){ in idxCreateFromCons()
|
/third_party/skia/third_party/externals/microhttpd/doc/ |
H A D | texinfo.tex | 5265 % outlines by their "section number". We avoid collisions with chapter 8134 % collisions). But if this is a float type, we have more work to do.
|