| /external/chromium_org/third_party/skia/src/animator/ |
| SkHitTest.cpp | 16 SK_MEMBER_ARRAY(hits, Int),
29 hits.setCount(bullets.count());
37 hits[bIndex] = -1;
45 hits[bIndex] = tIndex;
|
| SkHitTest.h | 25 SkTDIntArray hits; member in class:SkHitTest
|
| /external/chromium_org/tools/telemetry/third_party/pyserial/serial/tools/ |
| list_ports.py | 78 hits = 0
93 hits += 1
95 if hits:
96 print("%d ports found" % (hits,))
|
| /external/skia/src/animator/ |
| SkHitTest.cpp | 16 SK_MEMBER_ARRAY(hits, Int),
29 hits.setCount(bullets.count());
37 hits[bIndex] = -1;
45 hits[bIndex] = tIndex;
|
| SkHitTest.h | 25 SkTDIntArray hits; member in class:SkHitTest
|
| /external/chromium_org/ui/app_list/search/ |
| tokenized_string_match.cc | 81 const TokenizedStringMatch::Hits& hits() const { return current_hits_; } function in class:app_list::__anon248::PrefixMatcher
89 const TokenizedStringMatch::Hits& hits,
94 hits(hits.begin(), hits.end()),
105 TokenizedStringMatch::Hits hits; member in struct:app_list::__anon248::PrefixMatcher::State
170 current_hits_.swap(last_match.hits);
[all...] |
| tokenized_string_match.h | 27 typedef std::vector<gfx::Range> Hits;
32 // Calculates the relevance and hits. Returns true if the two strings are
40 const Hits& hits() const { return hits_; } function in class:app_list::TokenizedStringMatch
47 Hits hits_;
|
| tokenized_string_match_unittest.cc | 16 // Returns a string of |text| marked the hits in |match| using block bracket.
17 // e.g. text= "Text", hits = [{0,1}], returns "[T]ext".
22 const TokenizedStringMatch::Hits& hits = match.hits(); local
23 for (TokenizedStringMatch::Hits::const_reverse_iterator it = hits.rbegin();
24 it != hits.rend(); ++it) {
|
| /external/qemu-pc-bios/bochs/bios/ |
| biossums.c | 96 int arg = 1, hits, pad = 0; local
121 hits = 0;
130 hits++;
132 if( hits == 1 && cur_val != new_val ) {
136 if( hits >= 2 ) {
139 if( hits ) {
144 hits = 0;
153 hits++;
155 if( hits == 1 && cur_val != new_val ) {
159 if( hits >= 2 )
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| csr2022.cpp | 37 int32_t hits = 0; local
60 hits += 1;
80 if (hits == 0) {
90 quality = (100*hits - 100*misses) / (hits + misses);
95 if (hits+shifts < 5) {
96 quality -= (5-(hits+shifts))*10;
|
| /external/icu/icu4c/source/i18n/ |
| csr2022.cpp | 37 int32_t hits = 0; local
60 hits += 1;
80 if (hits == 0) {
90 quality = (100*hits - 100*misses) / (hits + misses);
95 if (hits+shifts < 5) {
96 quality -= (5-(hits+shifts))*10;
|
| /external/fio/t/ |
| genzipf.c | 31 unsigned long hits; member in struct:node
76 n->hits = 1;
168 return n2->hits - n1->hits;
218 n->hits++;
234 printf("%lu, %lu\n", k, nodes[k].hits);
255 cur_vals = node->hits;
260 cur_vals += node->hits;
261 os->nranges += node->hits;
265 total_vals += node->hits;
[all...] |
| /external/chromium_org/v8/test/mjsunit/harmony/ |
| array-of.js | 51 var hits = 0; variable
53 hits++;
57 hits = 0;
59 assertEquals(hits, 1);
61 hits = 0;
68 hits = 0;
70 assertEquals(hits, 1);
97 var hits = 0; variable
102 hits++;
107 assertEquals(hits, 1)
112 var hits = 0; variable
[all...] |
| /external/libvorbis/vq/ |
| latticetune.c | 43 long *hits; local
84 hits=_ogg_malloc(entries*sizeof(long));
86 for(j=0;j<entries;j++)hits[j]=guard;
103 hits[code]++;
115 /* code:hits\n */
123 hits[code]+=val;
133 build_tree_from_lengths0(entries,hits,lengths);
|
| latticebuild.c | 26 description into a static codebook. It used to count hits for a
60 long *hits; local
113 hits=_ogg_malloc(c.entries*sizeof(long));
114 for(j=0;j<entries;j++)hits[j]=1;
169 for(i=0;i<entries;i++)hits[i]=1;
170 build_tree_from_lengths(entries,hits,c.lengthlist);
|
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-node-cache.cc | 64 int hits = 0; local
70 hits++;
73 CHECK_LT(4, hits);
105 int hits = 0; local
111 hits++;
114 CHECK_LT(4, hits);
150 int hits = 0; local
156 hits++;
159 CHECK_LT(4, hits);
|
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteDebug.java | 133 /** statement cache stats: hits/misses/cachesize */
137 int hits, int misses, int cachesize) {
142 this.cache = hits + "/" + misses + "/" + cachesize;
|
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
| LruBitmapPool.java | 17 private int hits; field in class:LruBitmapPool
79 hits++;
119 Log.v(TAG, "Hits=" + hits + " misses=" + misses + " puts=" + puts + " evictions=" + evictions + " currentSize="
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ |
| perf-archive.sh | 24 perf buildid-list -i $PERF_DATA --with-hits | grep -v "^$NOBUILDID " > $BUILDIDS
|
| /external/chromium_org/chrome/browser/ui/app_list/search/ |
| app_result.cc | 68 const TokenizedStringMatch::Hits& hits = match.hits(); local
71 tags.reserve(hits.size());
72 for (size_t i = 0; i < hits.size(); ++i)
73 tags.push_back(Tag(Tag::MATCH, hits[i].start(), hits[i].end()));
|
| /external/qemu-pc-bios/vgabios/ |
| biossums.c | 55 int hits, modified; local
91 hits = 0;
100 hits++;
102 if ((hits == 1) && (cur_val != new_val)) {
111 if (hits >= 2) {
114 if (hits) {
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| GrepDialog.py | 81 hits = 0
99 hits = hits + 1
100 if hits:
101 if hits == 1:
105 print "Found", hits, "hit%s." % s
108 print "No hits."
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| GrepDialog.py | 81 hits = 0
99 hits = hits + 1
100 if hits:
101 if hits == 1:
105 print "Found", hits, "hit%s." % s
108 print "No hits."
|
| /external/chromium_org/third_party/skia/tests/ |
| RTreeTest.cpp | 77 SkTDArray<void*> hits; local
79 tree.search(query, &hits);
80 REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
|
| /external/skia/tests/ |
| RTreeTest.cpp | 73 SkTDArray<void*> hits; local
75 tree.search(query, &hits);
76 REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
|
