Home
last modified time | relevance | path

Searched refs:counts_ (Results 1 – 7 of 7) sorted by relevance

/external/libchrome/base/metrics/
Dsample_vector.cc21 counts_(&local_counts_[0]), in SampleVector()
33 counts_(counts), in SampleVector()
44 subtle::NoBarrier_AtomicIncrement(&counts_[bucket_index], count); in Accumulate()
51 return subtle::NoBarrier_Load(&counts_[bucket_index]); in GetCount()
57 count += subtle::NoBarrier_Load(&counts_[i]); in TotalCount()
64 return subtle::NoBarrier_Load(&counts_[bucket_index]); in GetCountAtIndex()
69 new SampleVectorIterator(counts_, counts_size_, bucket_ranges_)); in Iterator()
86 &counts_[index], op == HistogramSamples::ADD ? count : -count); in AddSubtractImpl()
131 : counts_(&(*counts)[0]), in SampleVectorIterator()
143 : counts_(counts), in SampleVectorIterator()
[all …]
Dsample_vector.h65 HistogramBase::AtomicCount* counts_; variable
96 const HistogramBase::AtomicCount* counts_; variable
Dhistogram_unittest.cc492 snapshot->counts_[3] += 100; // Sample count won't match redundant count. in TEST_P()
495 snapshot->counts_[2] -= 200; in TEST_P()
500 snapshot->counts_[1] += 100; in TEST_P()
/external/libtextclassifier/lang_id/
Dlanguage-identifier-features.cc37 counts_.assign(ngram_id_dimension_, 0); in Setup()
50 TC_DCHECK_EQ(counts_.size(), ngram_id_dimension_); in ComputeNgramCounts()
96 int &ref_to_count_for_ngram = counts_[ngram_id]; in ComputeNgramCounts()
127 const float weight = counts_[ngram_id] / norm; in Evaluate()
132 counts_[ngram_id] = 0; in Evaluate()
Dlanguage-identifier-features.h62 mutable std::vector<int> counts_; variable
/external/v8/src/
Dbasic-block-profiler.cc13 : n_blocks_(n_blocks), block_ids_(n_blocks_), counts_(n_blocks_, 0) {} in Data()
47 return &counts_[offset]; in GetCounterAddress()
53 counts_[i] = 0; in ResetCounts()
104 os << "block " << d.block_ids_[i] << " : " << d.counts_[i] << std::endl; in operator <<()
Dbasic-block-profiler.h24 const uint32_t* counts() const { return &counts_[0]; } in counts()
44 std::vector<uint32_t> counts_; variable