| /external/srec/srec/clib/ |
| specnorm.c | 42 /* Median calculations
78 spec->median = estimate_percentile(spec, spec->estimate_percentile);
97 /* Calculate the median
100 if (spec->count < MIN_COUNT) return(spec->median);
121 log_report("Median margin %d\n", accum / count);
131 /* Calculate the median
201 return (spec_val - spec->median + spec->offset);
239 spec->median = initial_median;
361 spec->median += shift;
|
| /frameworks/base/tools/preload/ |
| LoadedClass.java | 59 /** Median time to load this class. */
70 /** Median time to initialize this class. */
83 /** Calculates the median duration for a list of operations. */
|
| PrintCsv.java | 58 + ",Median Load Time (us)"
59 + ",Median Init Time (us)"
|
| Operation.java | 96 /** Gets the median time that this operation took across all processes. */
|
| /external/opencore/codecs_v2/audio/gsm_amr/amr_nb/common/include/ |
| gmed_n.h | 39 * Purpose : calculates N-point median.
69 Word16 gmed_n( /* o : index of the median value (0...N-1) */
|
| /frameworks/base/media/libstagefright/codecs/amrnb/common/include/ |
| gmed_n.h | 39 * Purpose : calculates N-point median.
69 Word16 gmed_n( /* o : index of the median value (0...N-1) */
|
| /external/opencore/codecs_v2/audio/gsm_amr/amr_nb/common/src/ |
| gmed_n.cpp | 68 #define NMAX 9 /* largest N used in median calculation */
90 n = number of inputs to find the median (Word16)
93 median value.
107 This function calculates N-point median of a data set. This routine is only
123 Word16 gmed_n ( // o : The median value (0...N-1)
183 Word16 gmed_n( /* o : the median value */
|
| /frameworks/base/media/libstagefright/codecs/amrnb/common/src/ |
| gmed_n.cpp | 68 #define NMAX 9 /* largest N used in median calculation */
90 n = number of inputs to find the median (Word16)
93 median value.
107 This function calculates N-point median of a data set. This routine is only
123 Word16 gmed_n ( // o : The median value (0...N-1)
183 Word16 gmed_n( /* o : the median value */
|
| /external/blktrace/btt/ |
| output.c | 323 long long nseeks, median; member in struct:o_seek_info
354 sip->median / sip->nseeks, new_list->mode, new_list->nseeks);
397 long long median; local
404 median = seeki_median(handle);
409 median, nmodes > 0 ? m.modes[0] : 0, m.most_seeks);
423 nseeks, mean, median,
432 seek_info.median += (nseeks * median);
454 "MEAN", "MEDIAN", "MODE");
460 "Overall", "NSEEKS", "MEAN", "MEDIAN", "MODE")
[all...] |
| /external/blktrace/btt/doc/ |
| sample-btt-output.tex | 43 DEV | NSEEKS MEAN MEDIAN | MODE
49 Overall | NSEEKS MEAN MEDIAN | MODE
54 DEV | NSEEKS MEAN MEDIAN | MODE
59 Overall | NSEEKS MEAN MEDIAN | MODE
|
| btt.tex | 240 IOs, the \emph{median} value for all seeks, and the \emph{mode} -
250 DEV | NSEEKS MEAN MEDIAN | MODE
255 We have almost exclusively seen median and mode values of 0, indicating
[all...] |
| /external/srec/srec/include/ |
| specnorm.h | 64 int median; member in struct:__anon5910
|
| /external/icu4c/common/ |
| triedict.h | 138 * @param median A UChar around which to balance the trie. Ideally, it should
139 * begin at least one word that is near the median of the set in the dictionary
142 MutableTrieDictionary( UChar median, UErrorCode &status );
|
| triedict.cpp | 80 MutableTrieDictionary::MutableTrieDictionary( UChar median, UErrorCode &status ) {
83 // Making it a median character cuts the worse case for searches from
86 fTrie = new TernaryNode(median);
[all...] |
| /external/bluetooth/glib/glib/ |
| gqsort.c | 90 2. Chose the pivot element using a median-of-three decision tree.
149 /* Select median value from among LO, MID, and HI. Rearrange
|
| /external/opencore/codecs_v2/audio/gsm_amr/amr_nb/dec/src/ |
| ec_gains.cpp | 275 // calculate median of last five gain values
278 // new gain = minimum(median, past_gain) * cdown[state]
333 /* calculate median of last five gain values */
336 /* new gain = minimum(median, past_gain) * cdown[state] */
544 // calculate median of last five gains
547 // new gain = minimum(median, past_gain) * pdown[state]
592 /* calculate median of last five gains */
595 /* new gain = minimum(median, past_gain) * pdown[state] */
|
| /external/opencore/codecs_v2/audio/gsm_amr/amr_wb/dec/src/ |
| median5.cpp | 51 The median of {X[-2], X[-1],..., X[2]}.
56 Returns the median of the set {X[-2], X[-1],..., X[2]},
|
| /frameworks/base/media/libstagefright/codecs/amrnb/dec/src/ |
| ec_gains.cpp | 275 // calculate median of last five gain values
278 // new gain = minimum(median, past_gain) * cdown[state]
333 /* calculate median of last five gain values */
336 /* new gain = minimum(median, past_gain) * cdown[state] */
544 // calculate median of last five gains
547 // new gain = minimum(median, past_gain) * pdown[state]
592 /* calculate median of last five gains */
595 /* new gain = minimum(median, past_gain) * pdown[state] */
|
| /frameworks/base/media/libstagefright/codecs/amrwb/src/ |
| median5.cpp | 51 The median of {X[-2], X[-1],..., X[2]}.
56 Returns the median of the set {X[-2], X[-1],..., X[2]},
|
| /external/bison/src/ |
| print_graph.c | 213 static_graph.crossing_weight = median;
|
| vcg.c | 332 case median: return "median";
|
| /external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
| SDL_qsort.c | 7 * - Median-of-three pivoting (and more)
125 * it's easy to construct datasets where median-of-3
129 * take the median of those.
|
| /external/webkit/WebKitTools/Scripts/webkitpy/layout_tests/ |
| run_chromium_webkit_tests.py | [all...] |
| /external/icu4c/tools/genctd/ |
| genctd.cpp | 280 // First, pick a median character.
|
| /sdk/ddms/libs/ddmuilib/src/com/android/ddmuilib/ |
| HeapPanel.java | 560 TableHelper.createTableColumn(tab, "Median", SWT.RIGHT,
814 int median = count / 2; local
815 HeapSegmentElement element = list.get(median);
[all...] |
