| /external/libtextclassifier/lang_id/features/ |
| char-ngram-feature.cc | 55 counts_.assign(ngram_id_dimension_, 0);
66 SAFTM_CHECK_EQ(counts_.size(), ngram_id_dimension_);
102 int &ref_to_count_for_ngram = counts_[ngram_id];
140 const float weight = counts_[ngram_id] / norm;
144 // Clear up counts_, for the next invocation of Evaluate().
145 counts_[ngram_id] = 0;
|
| char-ngram-feature.h | 69 // Auxiliary for Evaluate(). Fills counts_ and non_zero_count_indices_ (see
73 // Guards counts_ and non_zero_count_indices_. NOTE: we use std::* constructs
78 // counts_[i] is the count of all ngrams with id i. Work data for Evaluate().
81 mutable std::vector<int> counts_; member in class:libtextclassifier3::mobile::lang_id::ContinuousBagOfNgramsFunction
83 // Indices of non-zero elements of counts_. See comments for counts_.
|
| /external/libchrome/base/metrics/ |
| sample_vector.h | 76 subtle::Acquire_Load(&counts_));
81 subtle::Acquire_Load(&counts_));
85 subtle::Release_Store(&counts_, reinterpret_cast<uintptr_t>(counts));
95 // |counts_| is actually a pointer to a HistogramBase::AtomicCount array but
98 // 1) single_sample == zero, counts_ == null
99 // 2) single_sample != zero, counts_ == null
100 // 3) single_sample != zero, counts_ != null BUT IS EMPTY
101 // 4) single_sample == zero, counts_ != null and may have data
102 // Once |counts_| is set, it can never revert and any existing single-sample
106 mutable subtle::AtomicWord counts_ = 0 member in class:base::SampleVectorBase
176 const HistogramBase::AtomicCount* counts_; member in class:base::SampleVectorIterator
[all...] |
| sample_vector.cc | 262 // concurrent entry into the code below; access and updates to |counts_|
265 if (subtle::NoBarrier_Load(&counts_) == 0) {
267 if (subtle::NoBarrier_Load(&counts_) == 0) {
272 // Point |counts_| to the newly created storage. This is done while
336 // because of a race condition) because at worst the |counts_| value would
367 : counts_(&(*counts)[0]),
379 : counts_(counts),
408 *count = subtle::NoBarrier_Load(&counts_[index_]);
423 if (subtle::NoBarrier_Load(&counts_[index_]) != 0)
|
| /external/v8/src/ |
| basic-block-profiler.cc | 28 counts_(n_blocks_, 0) {}
61 return reinterpret_cast<intptr_t>(&(counts_[offset]));
67 counts_[i] = 0;
109 int block_count_sum = std::accumulate(d.counts_.begin(), d.counts_.end(), 0);
116 os << "schedule for " << name << " (B0 entered " << d.counts_[0]
124 pairs.push_back(std::make_pair(d.block_rpo_numbers_[i], d.counts_[i]));
|
| basic-block-profiler.h | 25 const uint32_t* counts() const { return &counts_[0]; }
45 std::vector<uint32_t> counts_; member in class:v8::internal::BasicBlockProfiler::Data
|
| /external/tensorflow/tensorflow/contrib/distributions/python/ops/ |
| test_util.py | 97 [counts_, probs_] = sess_run_fn([counts, probs])
98 valid = counts_ > num_threshold
100 counts_ = counts_[valid]
101 self.assertAllClose(probs_, counts_ / num_samples,
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| executor.cc | 1000 PendingCounts counts_; member in struct:tensorflow::__anon44831::ExecutorState::IterationState
[all...] |
| /external/perfetto/src/trace_processor/ |
| trace_storage.h | 708 counts_.emplace_back(row.count);
715 const std::deque<int64_t>& counts() const { return counts_; }
722 std::deque<int64_t> counts_; member in class:perfetto::trace_processor::TraceStorage::HeapProfileAllocations
[all...] |
