/external/v8/test/mjsunit/es6/ |
D | array-of.js | 49 var hits = 0; variable 51 hits++; 55 hits = 0; 57 assertEquals(hits, 1); 59 hits = 0; 66 hits = 0; 68 assertEquals(hits, 1); 95 var hits = 0; 100 hits++; 105 assertEquals(hits, 1); [all …]
|
D | typedarray-of.js | 57 var hits = 0; 63 hits++; 67 hits = 0; 69 assertEquals(1, hits); 74 hits = 0; 76 assertEquals(1, hits);
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
D | CharsetRecog_2022.java | 35 int hits = 0; in match() local 56 hits++; in match() 70 if (hits == 0) { in match() 80 quality = (100*hits - 100*misses) / (hits + misses); in match() 85 if (hits+shifts < 5) { in match() 86 quality -= (5-(hits+shifts))*10; in match()
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
D | CharsetRecog_2022.java | 36 int hits = 0; in match() local 57 hits++; in match() 71 if (hits == 0) { in match() 81 quality = (100*hits - 100*misses) / (hits + misses); in match() 86 if (hits+shifts < 5) { in match() 87 quality -= (5-(hits+shifts))*10; in match()
|
/external/icu/icu4c/source/i18n/ |
D | csr2022.cpp | 37 int32_t hits = 0; in match_2022() local 60 hits += 1; in match_2022() 80 if (hits == 0) { in match_2022() 90 quality = (100*hits - 100*misses) / (hits + misses); in match_2022() 95 if (hits+shifts < 5) { in match_2022() 96 quality -= (5-(hits+shifts))*10; in match_2022()
|
/external/selinux/libselinux/utils/ |
D | avcstat.c | 31 unsigned long long hits; member 186 &tmp.hits, in main() 195 tot.hits += tmp.hits; in main() 208 tot.lookups, tot.hits, tot.misses, in main() 212 rel.hits = tot.hits - last.hits; in main() 218 rel.lookups, rel.hits, rel.misses, in main()
|
/external/fio/t/ |
D | genzipf.c | 31 unsigned long hits; member 76 n->hits = 1; in hash_insert() 168 return n2->hits - n1->hits; in node_cmp() 218 n->hits++; in main() 234 printf("%lu, %lu\n", k, nodes[k].hits); in main() 255 cur_vals = node->hits; in main() 260 cur_vals += node->hits; in main() 261 os->nranges += node->hits; in main() 265 total_vals += node->hits; in main()
|
/external/libvorbis/vq/ |
D | latticetune.c | 43 long *hits; in main() local 84 hits=_ogg_malloc(entries*sizeof(long)); in main() 86 for(j=0;j<entries;j++)hits[j]=guard; in main() 103 hits[code]++; in main() 123 hits[code]+=val; in main() 133 build_tree_from_lengths0(entries,hits,lengths); in main()
|
D | latticebuild.c | 60 long *hits; in main() local 113 hits=_ogg_malloc(c.entries*sizeof(long)); in main() 114 for(j=0;j<entries;j++)hits[j]=1; in main() 169 for(i=0;i<entries;i++)hits[i]=1; in main() 170 build_tree_from_lengths(entries,hits,c.lengthlist); in main()
|
/external/chromium-trace/catapult/telemetry/third_party/pyserial/serial/tools/ |
D | list_ports.py | 78 hits = 0 93 hits += 1 95 if hits: 96 print("%d ports found" % (hits,))
|
/external/skia/src/animator/ |
D | SkHitTest.cpp | 16 SK_MEMBER_ARRAY(hits, Int), 29 hits.setCount(bullets.count()); in draw() 37 hits[bIndex] = -1; in draw() 45 hits[bIndex] = tIndex; in draw()
|
/external/v8/tools/release/ |
D | search_related_commits.py | 99 hits = ( 103 hits = _remove_duplicates(hits) 106 for current_hit in hits: 110 return hits 113 return hits
|
/external/v8/test/unittests/compiler/ |
D | node-cache-unittest.cc | 61 int hits = 0; in TEST_F() local 67 hits++; in TEST_F() 70 EXPECT_LT(4, hits); in TEST_F() 99 int hits = 0; in TEST_F() local 105 hits++; in TEST_F() 108 EXPECT_LT(4, hits); in TEST_F()
|
/external/autotest/scheduler/ |
D | rdb_cache_manager.py | 205 self.hits = 0 224 if not self.hits and not self.misses: 226 requests = float(self.hits + self.misses) 227 return (self.hits/requests) * 100 268 self.hits += 1
|
D | rdb_cache_unittests.py | 76 if not (self.cache.hits == 0 and self.cache.misses == 2): 135 if not (self.cache.hits == 2 and self.cache.misses ==1): 179 if not (self.cache.misses == 1 and self.cache.hits == 2): 228 assert(self.cache.misses == 2 and self.cache.hits == 1) 294 cache.hits = 0 296 cache.hits = 1 320 if not (self.cache.hits == 0 and self.cache.misses == 2):
|
/external/skia/tests/ |
D | RTreeTest.cpp | 49 SkTDArray<int> hits; in run_queries() local 51 tree.search(query, &hits); in run_queries() 52 REPORTER_ASSERT(reporter, verify_query(query, rects, hits)); in run_queries()
|
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/unit/cloudsearch2/ |
D | test_search.py | 22 hits = [ variable in CloudSearchSearchBaseTest 106 'hit': CloudSearchSearchBaseTest.hits 213 self.assertEqual(results.hits, 30) 244 hits = list(map(lambda x: x['id'], results.docs)) 248 hits, ["12341", "12342", "12343", "12344", 289 'hit': CloudSearchSearchBaseTest.hits
|
/external/autotest/site_utils/ |
D | collect_suite_time_stats.py | 128 for hit in results.hits: 163 for hit in results.hits: 236 for hit in results.hits: 288 for hit in results.hits: 382 for hit in results.hits:
|
D | host_history_utils.py | 77 for entry in lock_history.hits: 112 return result.hits[0] 170 if (len(lock_history_entries.hits) == 1 and t_lock_val and 302 return host_history_entries.hits 347 for hostname,intervals_for_host in groupby(results.hits,
|
/external/autotest/client/site_tests/network_ProxyResolver/ |
D | network_ProxyResolver.py | 67 def hits(self): member in ThreadedHitServer 100 def hits(self): member in ProxyListener 104 return self._server.hits() 323 if self._proxy_server.hits() > 0:
|
/external/deqp/doc/testspecs/GLES2/ |
D | performance.compiler.txt | 26 + Tests for impact of cache hits on compilation time (note: in release 2012.4) 49 Separate cases are made for testing compilation time when avoiding cache hits and 53 Cache hits are however only ever allowed between the iterations of a case and not 66 iteration. In cases that allow cache hits the average excludes the first
|
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/unit/cloudsearch/ |
D | test_search.py | 18 hits = [ variable in CloudSearchSearchBaseTest 80 'hit': CloudSearchSearchBaseTest.hits 298 hits = list(map(lambda x: x['id'], results.docs)) 302 hits, ["12341", "12342", "12343", "12344", 343 'hit': CloudSearchSearchBaseTest.hits
|
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
D | LruBitmapPool.java | 30 private int hits; field in LruBitmapPool 118 hits++; in getDirty() 164 … Log.v(TAG, "Hits=" + hits + " misses=" + misses + " puts=" + puts + " evictions=" + evictions in dump()
|
/external/skia/src/pathops/ |
D | SkPathOpsWinding.cpp | 103 void SkOpContour::rayCheck(const SkOpRayHit& base, SkOpRayDir dir, SkOpRayHit** hits, in rayCheck() argument 114 testSegment->rayCheck(base, dir, hits, allocator); in rayCheck() 118 void SkOpSegment::rayCheck(const SkOpRayHit& base, SkOpRayDir dir, SkOpRayHit** hits, in rayCheck() argument 178 newHit->fNext = *hits; in rayCheck() 184 *hits = newHit; in rayCheck()
|
/external/mesa3d/src/glx/ |
D | glxhash.c | 118 unsigned long hits; /* At top of linked list */ member 166 table->hits = 0; in __glxHashCreate() 220 ++table->hits; in HashFind() 362 table->hits, table->partials, table->misses); in compute_dist()
|