Searched refs:buckets (Results 1 - 25 of 96) sorted by path

1234

/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h80 * if the number of buckets is small). We could implement dual hashing algorithms
109 /** Number of buckets available in this table
113 /** Points to the memory where the array of buckets
116 pANTLR3_HASH_BUCKET buckets; member in struct:ANTLR3_HASH_TABLE_struct
353 pANTLR3_TRIE_ENTRY buckets; /**< This is the data bucket(s) that the key indexes, which may be NULL */ member in struct:ANTLR3_INT_TRIE_NODE_struct
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c129 // and allocate memory for the requested number of buckets.
133 ANTLR3_UINT32 bucket; // Used to traverse the buckets
143 // Allocate memory for the buckets
145 table->buckets = (pANTLR3_HASH_BUCKET) ANTLR3_MALLOC((size_t) (sizeof(ANTLR3_HASH_BUCKET) * sizeHint));
147 if (table->buckets == NULL)
159 /* Initialize the buckets to empty
163 table->buckets[bucket].entries = NULL;
197 ANTLR3_UINT32 bucket; /* Used to traverse the buckets */
203 /* Free the table, all buckets and all entries, and all the
210 thisBucket = &(table->buckets[bucke
[all...]
/external/blktrace/btt/doc/
H A Dbtt.tex404 \item[Q2D Histogram] A display of histogram buckets for the Q to D times
406 device, and when it is dispatched. The buckets are arranged via the
555 outgoing IO sizes (in blocks). For simplicity, the histogram buckets
560 containing data for the first 1,023 buckets, and a separate set
/external/bsdiff/
H A Dbsdiff.c106 off_t buckets[256]; local
109 for(i=0;i<256;i++) buckets[i]=0;
110 for(i=0;i<oldsize;i++) buckets[old[i]]++;
111 for(i=1;i<256;i++) buckets[i]+=buckets[i-1];
112 for(i=255;i>0;i--) buckets[i]=buckets[i-1];
113 buckets[0]=0;
115 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
117 for(i=0;i<oldsize;i++) V[i]=buckets[ol
[all...]
/external/chromium_org/base/metrics/
H A Dhistogram.cc7 // vector of numbers corresponding to each of the aggregating buckets).
145 // consecutive buckets that is sooo small, that the integer bounds are the same
150 // that bucket onward we do use the exponential growth of buckets.
333 // buckets), so we need this to make it possible to see what is going on and
334 // not have 0-graphical-height buckets.
403 break; // All buckets are empty.
499 ListValue* buckets) const {
512 buckets->Set(index, bucket_value.release());
520 // buckets.
605 // Adjacent buckets wit
[all...]
H A Dhistogram.h7 // vector of numbers corresponding to each of the aggregating buckets).
34 // The buckets layout of class Histogram is exponential. For example, buckets
38 // for values between 1 and 64, with 8 buckets, such as:
45 // the smallest ratio that it can use to construct the number of buckets
46 // selected in the constructor. An another example, if you had 50 buckets,
49 // root of 10000. This approach provides very fine grain (narrow) buckets
51 // gigantic range with the addition of very few buckets.
166 // The first four macros use 50 buckets.
173 // of times you want plotted, and the number of buckets yo
[all...]
H A Dhistogram_base.cc103 scoped_ptr<ListValue> buckets(new ListValue());
104 GetCountAndBucketData(&count, &sum, buckets.get());
115 root.Set("buckets", buckets.release());
H A Dhistogram_base.h153 // Writes information about the current (non-empty) buckets and their sample
154 // counts to |buckets|, the total sample count to |count| and the total sum
158 ListValue* buckets) const = 0;
169 // Output is the count in the buckets, as well as the percentage.
H A Dsparse_histogram.cc110 ListValue* buckets) const {
H A Dsparse_histogram.h93 ListValue* buckets) const OVERRIDE;
/external/chromium_org/chrome/browser/autocomplete/
H A Dhistory_url_provider.cc135 for (size_t i = 0; i < score_buckets.buckets().size(); ++i) {
136 score_bucket = &score_buckets.buckets()[i];
H A Dhistory_url_provider_unittest.cc920 max_2000_no_time_decay.typed_count_buckets.buckets().push_back(
923 max_1250_no_time_decay.typed_count_buckets.buckets().push_back(
926 max_1000_no_time_decay.typed_count_buckets.buckets().push_back(
934 max_1100_with_time_decay_and_max_cap.typed_count_buckets.buckets().push_back(
936 max_1100_with_time_decay_and_max_cap.typed_count_buckets.buckets().push_back(
938 max_1100_with_time_decay_and_max_cap.typed_count_buckets.buckets().push_back(
943 max_1100_visit_typed_decays.typed_count_buckets.buckets().push_back(
945 max_1100_visit_typed_decays.typed_count_buckets.buckets().push_back(
948 max_1100_visit_typed_decays.visited_count_buckets.buckets().push_back(
950 max_1100_visit_typed_decays.visited_count_buckets.buckets()
[all...]
/external/chromium_org/chrome/browser/extensions/api/bookmarks/
H A Dbookmarks_api.cc833 BucketList* buckets) OVERRIDE {
862 buckets->push_back(GetBucket(base::SHA1HashString(bucket_id)));
874 BucketList* buckets) OVERRIDE {
894 buckets->push_back(GetBucket(base::SHA1HashString(bucket_id)));
910 BucketList* buckets) {
916 buckets->push_back(GetBucket(*it));
909 GetBucketsForArgs(const base::ListValue* args, BucketList* buckets) argument
/external/chromium_org/chrome/browser/extensions/api/metrics_private/
H A Dmetrics_apitest.cc35 size_t buckets; member in struct:__anon3697::RecordedHistogram
63 Bucket buckets[10]; member in struct:__anon3697::SparseHistogram
128 const Bucket& bucket = sparse_histogram.buckets[j];
160 histogram->HasConstructionArguments(r.min, r.max, r.buckets));
H A Dmetrics_private_api.cc38 // buckets; there is no real need for them
81 int min, int max, size_t buckets,
87 buckets = std::min(buckets, kMaxBuckets);
91 buckets = std::max(buckets, static_cast<size_t>(3));
92 // Trim buckets down to a maximum of the given range + over/underflow buckets
93 if (buckets > static_cast<size_t>(max - min + 2))
94 buckets
78 RecordValue( const std::string& name, base::HistogramType type, int min, int max, size_t buckets, int sample) argument
[all...]
H A Dmetrics_private_api.h69 int min, int max, size_t buckets,
/external/chromium_org/chrome/browser/metrics/
H A Dextensions_metrics_provider.cc28 // The number of hash buckets into which extension IDs are mapped. This sets
107 std::set<int> buckets; local
111 buckets.insert(HashExtension((*it)->id(), client_key));
114 for (std::set<int>::const_iterator it = buckets.begin(); it != buckets.end();
/external/chromium_org/chrome/browser/omnibox/
H A Domnibox_field_trial.cc127 score_buckets->buckets().push_back(bucket);
129 std::sort(score_buckets->buckets().begin(),
130 score_buckets->buckets().end(),
H A Domnibox_field_trial.h47 std::vector<CountMaxRelevance>& buckets() { return buckets_; } function in class:HUPScoringParams::ScoreBuckets
48 const std::vector<CountMaxRelevance>& buckets() const { return buckets_; } function in class:HUPScoringParams::ScoreBuckets
H A Domnibox_field_trial_unittest.cc368 ASSERT_EQ(3u, scoring_params.typed_count_buckets.buckets().size());
370 scoring_params.typed_count_buckets.buckets()[0]);
372 scoring_params.typed_count_buckets.buckets()[1]);
374 scoring_params.typed_count_buckets.buckets()[2]);
377 ASSERT_EQ(2u, scoring_params.visited_count_buckets.buckets().size());
379 scoring_params.visited_count_buckets.buckets()[0]);
381 scoring_params.visited_count_buckets.buckets()[1]);
385 HUPScoringParams::ScoreBuckets buckets; local
388 EXPECT_EQ(1.0, buckets.HalfLifeTimeDecay(base::TimeDelta::FromDays(7)));
390 buckets
[all...]
/external/chromium_org/chrome/browser/resources/google_now/
H A Dbackground.js270 buckets: GoogleNowEvent.EVENTS_TOTAL + 1
/external/chromium_org/chrome/installer/mac/third_party/bsdiff/
H A Dgoobsdiff.c121 off_t buckets[256]; local
124 for(i=0;i<256;i++) buckets[i]=0;
125 for(i=0;i<oldsize;i++) buckets[old[i]]++;
126 for(i=1;i<256;i++) buckets[i]+=buckets[i-1];
127 for(i=255;i>0;i--) buckets[i]=buckets[i-1];
128 buckets[0]=0;
130 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
132 for(i=0;i<oldsize;i++) V[i]=buckets[ol
[all...]
/external/chromium_org/content/browser/geolocation/
H A Dnetwork_location_request.cc64 const int buckets = 21; local
66 count, min, max, buckets);
/external/chromium_org/content/renderer/
H A Drender_thread_impl.cc234 const char *name, int min, int max, size_t buckets) {
246 histogram_name, min, max, buckets,
233 CreateHistogram( const char *name, int min, int max, size_t buckets) argument
/external/chromium_org/courgette/third_party/
H A Dbsdiff_create.cc117 int buckets[256]; local
120 for(i=0;i<256;i++) buckets[i]=0;
121 for(i=0;i<oldsize;i++) buckets[old[i]]++;
122 for(i=1;i<256;i++) buckets[i]+=buckets[i-1];
123 for(i=255;i>0;i--) buckets[i]=buckets[i-1];
124 buckets[0]=0;
126 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
128 for(i=0;i<oldsize;i++) V[i]=buckets[ol
[all...]

Completed in 875 milliseconds

1234