/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkHitTest.h | 25 SkTDIntArray hits; member in class:SkHitTest
|
/external/skia/src/animator/ |
H A D | SkHitTest.h | 25 SkTDIntArray hits; member in class:SkHitTest
|
/external/chromium_org/chrome/browser/ui/app_list/search/ |
H A D | tokenized_string_match.h | 31 // Calculates the relevance and hits. Returns true if the two strings are 39 const Hits& hits() const { return hits_; } function in class:app_list::TokenizedStringMatch
|
H A D | tokenized_string_match_unittest.cc | 15 // Returns a string of |text| marked the hits in |match| using block bracket. 16 // e.g. text= "Text", hits = [{0,1}], returns "[T]ext". 21 const TokenizedStringMatch::Hits& hits = match.hits(); local 22 for (TokenizedStringMatch::Hits::const_reverse_iterator it = hits.rbegin(); 23 it != hits.rend(); ++it) {
|
H A D | app_result.cc | 64 const TokenizedStringMatch::Hits& hits = match.hits(); local 67 tags.reserve(hits.size()); 68 for (size_t i = 0; i < hits.size(); ++i) 69 tags.push_back(Tag(Tag::MATCH, hits[i].start(), hits[i].end()));
|
H A D | tokenized_string_match.cc | 81 const TokenizedStringMatch::Hits& hits() const { return current_hits_; } function in class:app_list::__anon4905::PrefixMatcher 89 const TokenizedStringMatch::Hits& hits, 94 hits(hits.begin(), hits.end()), 105 TokenizedStringMatch::Hits hits; member in struct:app_list::__anon4905::PrefixMatcher::State 170 current_hits_.swap(last_match.hits); 204 hits_.assign(matcher.hits().begin(), matcher.hits().end()); 87 State(double relevance, const gfx::Range& current_match, const TokenizedStringMatch::Hits& hits, const TokenizedStringCharIterator& query_iter, const TokenizedStringCharIterator& text_iter) argument
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Interval.java | 41 public static int hits = 0; field in class:Interval
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | csr2022.cpp | 36 int32_t hits = 0; local 59 hits += 1; 79 if (hits == 0) { 89 quality = (100*hits - 100*misses) / (hits + misses); 94 if (hits+shifts < 5) { 95 quality -= (5-(hits+shifts))*10;
|
/external/libvorbis/vq/ |
H A D | 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);
|
H A D | 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);
|
/external/chromium_org/third_party/skia/bench/ |
H A D | QuadTreeBench.cpp | 107 SkTDArray<void*> hits; variable 136 fTree->search(query, &hits);
|
H A D | RTreeBench.cpp | 117 SkTDArray<void*> hits; variable 146 fTree->search(query, &hits);
|
/external/chromium_org/third_party/skia/experimental/PdfViewer/ |
H A D | SkTracker.h | 129 // Starts a new rendering session - reset the number of hits. 135 int hits() { function in class:SkTracker
|
/external/chromium_org/third_party/skia/tests/ |
H A D | BBoxHierarchyTest.cpp | 78 SkTDArray<void*> hits; local 80 tree.search(query, &hits); 81 REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
|
H A D | RTreeTest.cpp | 73 SkTDArray<void*> hits; local 75 tree.search(query, &hits); 76 REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
|
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
H A D | 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/icu/icu4c/source/i18n/ |
H A D | 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/qemu-pc-bios/vgabios/ |
H A D | 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) {
|
/external/skia/bench/ |
H A D | QuadTreeBench.cpp | 107 SkTDArray<void*> hits; variable 136 fTree->search(query, &hits);
|
H A D | RTreeBench.cpp | 117 SkTDArray<void*> hits; variable 146 fTree->search(query, &hits);
|
/external/skia/experimental/PdfViewer/ |
H A D | SkTracker.h | 129 // Starts a new rendering session - reset the number of hits. 135 int hits() { function in class:SkTracker
|
/external/skia/tests/ |
H A D | BBoxHierarchyTest.cpp | 78 SkTDArray<void*> hits; local 80 tree.search(query, &hits); 81 REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
|
H A D | RTreeTest.cpp | 73 SkTDArray<void*> hits; local 75 tree.search(query, &hits); 76 REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
|
/external/chromium_org/third_party/mesa/src/src/glx/ |
H A D | glxhash.c | 118 unsigned long hits; /* At top of linked list */ member in struct:__glxHashTable 166 table->hits = 0; 220 ++table->hits; 362 table->hits, table->partials, table->misses);
|
/external/fio/t/ |
H A D | 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...] |