Searched defs:counts (Results 1 - 25 of 77) sorted by relevance

1234

/external/chromium_org/net/spdy/
H A Dspdy_priority_forest_test.cc216 int counts[8] = {0}; local
221 ++counts[node_id];
226 EXPECT_GE(counts[1], 800); EXPECT_LE(counts[1], 1200);
227 EXPECT_GE(counts[7], 1600); EXPECT_LE(counts[7], 2400);
228 EXPECT_GE(counts[5], 3200); EXPECT_LE(counts[5], 4800);
257 int counts[8] = {0}; local
262 ++counts[node_i
[all...]
/external/oprofile/libpp/
H A Dsymbol.cpp35 bool has_sample_counts(count_array_t const & counts, size_t lo, size_t hi) argument
38 if (counts[i] != 0)
H A Dsample_container.cpp25 count_array_t add_counts(count_array_t const & counts, argument
28 count_array_t temp(counts);
29 temp += s->counts;
73 it->second.counts += sample.counts;
H A Dsymbol.h29 /// for storing sample counts
57 count_array_t counts; member in struct:sample_entry
101 * the sample counts replaced with the relevant arc counts, whilst
142 bool has_sample_counts(count_array_t const & counts, size_t lo, size_t hi);
/external/chromium_org/chrome/common/extensions/docs/examples/apps/calculator/tests/
H A Dmanual.js22 var counts = {passed: 0, failed: 0};
31 counts.passed += run.tests[i].success ? 1 : 0;
32 counts.failed += run.tests[i].success ? 0 : 1;
49 passed.textContent = counts.passed;
50 passed.setAttribute('class', counts.passed ? 'passed' : 'passed none');
51 failed.textContent = counts.failed;
52 failed.setAttribute('class', counts.failed ? 'failed' : 'failed none');
/external/chromium_org/third_party/smhasher/src/
H A DAvalancheTest.cpp37 double maxBias ( std::vector<int> & counts, int reps ) argument
41 for(int i = 0; i < (int)counts.size(); i++)
43 double c = double(counts[i]) / double(reps);
H A DAvalancheTest.h23 double maxBias ( std::vector<int> & counts, int reps );
28 void calcBias ( pfHash hash, std::vector<int> & counts, int reps, Rand & r ) argument
47 int * cursor = &counts[0];
/external/stlport/test/eh/
H A Dtest_algo.cpp105 // Prepare an array of counts of the occurrence of each value in
107 unsigned counts[SortClass::kRange]; local
108 EH_STD::fill_n( counts, (int)SortClass::kRange, 0 );
110 counts[ q->value() ]++;
125 counts[ p->value() ]--;
130 EH_ASSERT( counts[j] == 0 );
151 // Prepare an array of counts of the occurrence of each value in
153 unsigned counts[SortClass::kRange]; local
154 EH_STD::fill_n( counts, (int)SortClass::kRange, 0 );
156 counts[
[all...]
/external/chromium_org/base/metrics/
H A Dsample_vector.cc62 // Go through the iterator and add the counts into correct bucket.
111 SampleVectorIterator::SampleVectorIterator(const vector<Count>* counts, argument
113 : counts_(counts),
/external/guava/guava-tests/test/com/google/common/util/concurrent/
H A DAtomicDoubleArrayTest.java289 volatile long counts; field in class:AtomicDoubleArrayTest.Counter
300 ++counts;
327 assertEquals(c1.counts + c2.counts, SIZE * COUNTDOWN);
/external/libvpx/libvpx/vp9/common/
H A Dvp9_treecoder.h46 /* Convert array of token occurrence counts into a table of probabilities
95 const unsigned int *counts,
101 ? counts[-l]
102 : tree_merge_probs_impl(l, tree, pre_probs, counts,
106 ? counts[-r]
107 : tree_merge_probs_impl(r, tree, pre_probs, counts,
117 const unsigned int *counts,
120 tree_merge_probs_impl(0, tree, pre_probs, counts,
92 tree_merge_probs_impl(unsigned int i, const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, unsigned int count_sat, unsigned int max_update_factor, vp9_prob *probs) argument
115 tree_merge_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, unsigned int count_sat, unsigned int max_update_factor, vp9_prob *probs) argument
H A Dvp9_entropymode.c357 const vp9_prob *pre_probs, const unsigned int *counts,
359 tree_merge_probs(tree, pre_probs, counts, COUNT_SAT, MAX_UPDATE_FACTOR,
367 const FRAME_COUNTS *counts = &cm->counts; local
371 counts->intra_inter[i]);
374 counts->comp_inter[i]);
377 counts->comp_ref[i]);
381 counts->single_ref[i][j]);
385 counts->inter_mode[i], fc->inter_mode_probs[i]);
389 counts
356 adapt_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, vp9_prob *probs) argument
[all...]
H A Dvp9_entropymv.c178 void vp9_inc_mv(const MV *mv, nmv_context_counts *counts) { argument
179 if (counts != NULL) {
181 ++counts->joints[j];
184 inc_mv_component(mv->row, &counts->comps[0], 1, 1);
188 inc_mv_component(mv->col, &counts->comps[1], 1, 1);
198 const unsigned int *counts, vp9_prob *probs) {
199 tree_merge_probs(tree, pre_probs, counts, MV_COUNT_SAT, MV_MAX_UPDATE_FACTOR,
208 const nmv_context_counts *counts = &cm->counts.mv; local
210 adapt_probs(vp9_mv_joint_tree, pre_fc->joints, counts
197 adapt_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, vp9_prob *probs) argument
[all...]
/external/linux-tools-perf/util/
H A Devsel.h62 struct perf_counts *counts; member in struct:perf_evsel
/external/smack/src/org/xbill/DNS/
H A DHeader.java19 private int [] counts; field in class:Header
28 counts = new int[4];
57 for (int i = 0; i < counts.length; i++)
58 counts[i] = in.readU16();
74 for (int i = 0; i < counts.length; i++)
75 out.writeU16(counts[i]);
212 counts[field] = value;
217 if (counts[field] == 0xFFFF)
220 counts[field]++;
225 if (counts[fiel
[all...]
/external/strace/
H A Dcount.c46 #define counts (countv[current_personality]) macro
56 if (!counts)
58 counts = calloc(nsyscalls, sizeof(*counts));
59 if (!counts)
62 "strace: out of memory for call counts\n");
67 counts[tcp->scno].calls++;
69 counts[tcp->scno].errors++;
102 tv_add(&counts[tcp->scno].time, &counts[tc
[all...]
/external/chromium/chrome/common/extensions/docs/examples/apps/hello-php/lib/lightopenid/
H A Dopenid.php338 $counts = array(); variable
345 if (empty($counts[$alias])) $counts[$alias] = 0;
346 $counts[$alias] += 1;
353 foreach ($counts as $alias => $count) {
/external/chromium_org/chrome/browser/profiles/
H A Dprofile_metrics.cc53 bool CountProfileInformation(ProfileManager* manager, ProfileCounts* counts) { argument
56 counts->total = number_of_profiles;
64 counts->managed++;
66 counts->signedin++;
106 ProfileCounts counts; local
107 if (CountProfileInformation(manager, &counts)) {
108 int limited_total = counts.total;
109 int limited_signedin = counts.signedin;
113 (int)((float)(counts.signedin * limited_total)
114 / counts
121 ProfileCounts counts; local
[all...]
/external/chromium_org/chrome/common/extensions/docs/examples/apps/hello-php/lib/lightopenid/
H A Dopenid.php338 $counts = array(); variable
345 if (empty($counts[$alias])) $counts[$alias] = 0;
346 $counts[$alias] += 1;
353 foreach ($counts as $alias => $count) {
/external/chromium_org/chrome/renderer/extensions/
H A Devent_bindings.cc56 // A map of extension IDs to listener counts for that extension.
67 // A map of extension IDs to filtered listener counts for that extension.
210 FilteredEventListenerCounts& counts = local
212 FilteredEventListenerCounts::iterator it = counts.find(event_name);
213 if (it == counts.end())
214 counts[event_name].reset(new ValueCounter);
216 int result = counts[event_name]->Add(*filter);
225 FilteredEventListenerCounts& counts = local
227 FilteredEventListenerCounts::iterator it = counts.find(event_name);
228 if (it == counts
[all...]
/external/chromium_org/media/base/
H A Ddemuxer_perftest.cc72 const std::vector<int>& counts() { return counts_; } function in class:media::StreamReader
/external/chromium_org/tools/gn/
H A Dcommand_gyp.cc389 std::pair<int, int> counts = local
405 base::IntToString(counts.first) + " targets to " +
406 base::IntToString(counts.second) + " GYP files read from " +
/external/guava/guava/src/com/google/common/collect/
H A DImmutableMultiset.java459 final int[] counts; field in class:ImmutableMultiset.SerializedForm
464 counts = new int[distinct];
468 counts[i] = entry.getCount();
477 multiset.add(elements[i], counts[i]);
H A DImmutableSortedMultiset.java576 int[] counts; field in class:ImmutableSortedMultiset.SerializedForm
582 counts = new int[n];
586 counts[i] = entry.getCount();
596 builder.addCopies(elements[i], counts[i]);
/external/jdiff/src/jdiff/
H A DDiffMyers.java523 @return the array of equivalence class counts.
562 @param counts The count of each equivalence number for the other file.
567 private byte[] discardable(final int[] counts) { argument
584 nmatch = counts[equivs[i]];

Completed in 770 milliseconds

1234