/external/chromium_org/net/disk_cache/simple/ |
simple_histogram_macros.h | 8 #include "base/metrics/histogram.h"
|
/external/chromium_org/net/socket/ |
client_socket_pool.cc | 13 // TODO(ziadh): Change this timeout after getting histogram data on how long it
|
/external/chromium_org/third_party/skia/tools/lua/ |
glyph-usage.lua | 120 local histogram = {} 134 histogram[count] = (histogram[count] or 0) + 1 140 for k, v in next, histogram do
|
/external/chromium_org/third_party/webrtc/modules/audio_processing/ns/ |
ns_core.h | 18 //bin size of histogram 22 //range of histogram over which lrt threshold is computed 30 //limit on spacing of two highest peaks in histogram: spacing determined by bin size 45 //criteria of weight of histogram peak to accept/reject feature
|
/external/chromium_org/ui/file_manager/file_manager/foreground/js/image_editor/ |
filter.js | 84 * Return a color histogram for an image. 88 * histogram. 539 * @param {Object} options Histogram for autofix. 544 filter.autofix.stretchColors(options.histogram.r), 545 filter.autofix.stretchColors(options.histogram.g), 546 filter.autofix.stretchColors(options.histogram.b)); 552 * @param {Array.<number>} channelHistogram Histogram to calculate range. 566 * Return a range that encloses non-zero elements values in a histogram array. 567 * @param {Array.<number>} channelHistogram Histogram to analyze. 568 * @return {{first: number, last: number}} Channel range in histogram [all...] |
/external/chromium_org/ui/file_manager/gallery/js/image_editor/ |
filter.js | 84 * Return a color histogram for an image. 88 * histogram. 539 * @param {Object} options Histogram for autofix. 544 filter.autofix.stretchColors(options.histogram.r), 545 filter.autofix.stretchColors(options.histogram.g), 546 filter.autofix.stretchColors(options.histogram.b)); 552 * @param {Array.<number>} channelHistogram Histogram to calculate range. 566 * Return a range that encloses non-zero elements values in a histogram array. 567 * @param {Array.<number>} channelHistogram Histogram to analyze. 568 * @return {{first: number, last: number}} Channel range in histogram [all...] |
/external/libpng/ |
TODO | 18 Histogram creation.
|
/external/skia/tools/lua/ |
glyph-usage.lua | 120 local histogram = {} 134 histogram[count] = (histogram[count] or 0) + 1 140 for k, v in next, histogram do
|
/external/webrtc/src/modules/audio_processing/ns/ |
ns_core.h | 18 //bin size of histogram 22 //range of histogram over which lrt threshold is computed 30 //limit on spacing of two highest peaks in histogram: spacing determined by bin size 45 //criteria of weight of histogram peak to accept/reject feature
|
/frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/jni/ |
Android.mk | 35 histogram.cpp \
|
histogram.h | 17 // Native function to extract histogram from image (handed down as ByteBuffer).
|
/external/chromium_org/chrome/browser/captive_portal/ |
captive_portal_service.cc | 11 #include "base/metrics/histogram.h" 60 // Histogram macros can't be used with variable names, since they cache 61 // pointers, so have to use the histogram functions directly. 65 base::Histogram::FactoryGet( 70 base::Histogram::kUmaTargetedHistogramFlag); 78 base::Histogram::FactoryTimeGet( 83 base::Histogram::kUmaTargetedHistogramFlag);
|
/external/chromium_org/net/dns/ |
dns_session.cc | 10 #include "base/metrics/histogram.h" 30 // Number of buckets in the histogram of observed RTTs. 32 // Target percentile in the RTT histogram used for retransmission timeout. 41 // Seed histogram with 2 samples at |rtt_estimate| timeout. 58 // A histogram of observed RTT . 69 base::Histogram::InitializeBucketRanges(1, 5000, this); 184 // Histogram-based method.
|
/frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
ClusterManager.java | 239 // duration, histogram, etc. 259 HashMap<String, Long> histogram = new HashMap<String, Long>(); local 271 histogram.clear(); 275 histogram.put(featureValue, Long.valueOf(map.get(featureValue))); 278 cluster.setHistogram(histogram); 302 HashMap<String, Long> histogram = cluster.getHistogram(); local 303 for (Map.Entry<String, Long> entry : histogram.entrySet()) {
|
/packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/ |
ImageCurves.java | 368 private void drawHistogram(Canvas canvas, int[] histogram, int color, PorterDuff.Mode mode) { 370 for (int i = 0; i < histogram.length; i++) { 371 if (histogram[i] > max) { 372 max = histogram[i]; 378 float wl = w / histogram.length; 393 for (int i = 0; i < histogram.length; i++) { 395 float l = histogram[i] * wh;
|
/packages/inputmethods/LatinIME/tools/make-keyboard-text/src/com/android/inputmethod/keyboard/tools/ |
MoreKeysResources.java | 49 // Histogram of string resource names. This is used to sort {@link #mSortedResourceNames}. 51 // Sorted string resource names array; Descending order of histogram count. 68 // Initialize name histogram and names list. 72 nameHistogram.put(res.mName, 0); // Initialize histogram value. 75 // Make name histogram. 94 // Descending order of histogram count. 97 // TODO: Add further criteria to order the same histogram value names to be able to
|
/external/chromium_org/chrome/browser/chromeos/input_method/ |
input_method_engine_unittest.cc | 6 #include "base/metrics/histogram.h" 34 base::HistogramBase* histogram = local 36 EXPECT_NE(static_cast<base::HistogramBase*>(NULL), histogram); local 37 return histogram->SnapshotSamples().Pass(); 139 base::Histogram::FactoryGet(
|
/external/chromium_org/chrome/browser/prefs/ |
pref_metrics_service.cc | 9 #include "base/metrics/histogram.h" 190 base::HistogramBase* histogram = base::BooleanHistogram::FactoryGet( 192 histogram->Add(boolean_value); 201 base::HistogramBase* histogram = base::LinearHistogram::FactoryGet( 207 histogram->Add(integer_value);
|
/external/chromium_org/net/quic/ |
quic_connection_logger.cc | 12 #include "base/metrics/histogram.h" 30 // We have ranges-of-buckets in the cumulative histogram (covering 21 packet 256 // feature, so we can't report the results in the histogram. 690 // This histogram takes a binary encoding of the 6 consecutive packets 700 // This histogram contains, for each sequence of 21 packets, the results from 705 // of samples, all told, but the histogram is a tad easier to read this way. 723 base::HistogramBase* histogram, 737 histogram->Add(range_start + bits_so_far); 744 // Net.QuicSession.21CumulativePacketsReceived_* histogram to indicate packet 746 // histogram. (e.g., if we only got 5 packets, but lost 1, we'd otherwis 759 base::HistogramBase* histogram = base::Histogram::FactoryGet( local [all...] |
/prebuilts/gcc/darwin-x86/x86/x86_64-linux-android-4.9/lib/gcc/x86_64-linux-android/4.9/gcov-src/ |
libgcov-driver.c | 305 /* Insert counter VALUE into HISTOGRAM. */ 308 gcov_histogram_insert(gcov_bucket_type *histogram, gcov_type value) 313 histogram[i].num_counters++; 314 histogram[i].cum_value += value; 315 if (value < histogram[i].min_value) 316 histogram[i].min_value = value; 319 /* Computes a histogram of the arc counters to place in the summary SUM. */ 341 cs_ptr->histogram[h_ix].num_counters = 0; 342 cs_ptr->histogram[h_ix].min_value = cs_ptr->run_max; 343 cs_ptr->histogram[h_ix].cum_value = 0 [all...] |
/external/chromium_org/third_party/libwebp/utils/ |
huffman_encode.c | 165 static void GenerateOptimalTree(const uint32_t* const histogram, 175 if (histogram[i] != 0) { 194 // So, we try by faking histogram entries to be at least 'count_min'. 198 if (histogram[j] != 0) { 200 (histogram[j] < count_min) ? count_min : histogram[j]; 406 void VP8LCreateHuffmanTree(uint32_t* const histogram, int tree_depth_limit, 412 OptimizeHuffmanForRle(num_symbols, buf_rle, histogram); 413 GenerateOptimalTree(histogram, num_symbols, huff_tree, tree_depth_limit,
|
/external/chromium_org/third_party/webrtc/modules/audio_coding/neteq/ |
delay_manager.cc | 56 // Set the histogram vector to an exponentially decaying distribution 105 // (rounding down). This is the value used as index to the histogram 171 // |iat_packets| is slightly increased, while the sum of the histogram remains 173 // Due to inaccuracies in the fixed-point arithmetic, the histogram may no 179 // beginning. With each update of the histogram, the factor is increased towards 255 // Calculate target buffer level from inter-arrival time histogram. 259 // the histogram as the reverse cumulant PDF, i.e., the sum of elements from 263 // elements from the start of the histogram. 310 iat_factor_ = 0; // Adapt the histogram faster for the first few packets.
|
/external/webp/src/utils/ |
huffman_encode.c | 165 static void GenerateOptimalTree(const uint32_t* const histogram, 175 if (histogram[i] != 0) { 194 // So, we try by faking histogram entries to be at least 'count_min'. 198 if (histogram[j] != 0) { 200 (histogram[j] < count_min) ? count_min : histogram[j]; 406 void VP8LCreateHuffmanTree(uint32_t* const histogram, int tree_depth_limit, 412 OptimizeHuffmanForRle(num_symbols, buf_rle, histogram); 413 GenerateOptimalTree(histogram, num_symbols, huff_tree, tree_depth_limit,
|
/external/chromium_org/chrome/browser/net/ |
url_info.cc | 16 #include "base/metrics/histogram.h" 140 // Make a custom linear histogram for the region from 0 to boundary. 142 static base::HistogramBase* histogram(NULL); 143 if (!histogram) 144 histogram = base::LinearHistogram::FactoryTimeGet( 147 histogram->AddTime(queue_duration_);
|
/external/chromium_org/content/browser/ |
histogram_synchronizer.cc | 10 #include "base/metrics/histogram.h" 68 // Records that we are waiting for one less histogram data from a process for 124 UMA_HISTOGRAM_BOOLEAN("Histogram.ReceivedProcessGroupCount", 126 UMA_HISTOGRAM_COUNTS("Histogram.PendingProcessNotResponding", 243 // Get histogram data from renderer and browser child processes. 332 // decides to send some histogram data.
|