/external/google-benchmark/src/ |
complexity.h | 44 // - complexity : Scalability form (e.g. oN, oNLogN). In case a scalability 50 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {} 54 BigO complexity; member in struct:benchmark::LeastSq 57 // Function to return an string for the calculated complexity 58 std::string GetBigOString(BigO complexity);
|
complexity.cc | 23 #include "complexity.h" 29 BigOFunc* FittingCurve(BigO complexity) { 30 switch (complexity) { 47 // Function to return an string for the calculated complexity 48 std::string GetBigOString(BigO complexity) { 49 switch (complexity) { 95 result.complexity = oLambda; 97 // Calculate complexity. 118 // - complexity : If different than oAuto, the fitting curve will stick to 122 const std::vector<double>& time, const BigO complexity) { [all...] |
benchmark_api_internal.h | 25 BigO complexity; member in struct:benchmark::internal::Benchmark::Instance
|
/external/libcxx/utils/google-benchmark/src/ |
complexity.h | 44 // - complexity : Scalability form (e.g. oN, oNLogN). In case a scalability 50 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {} 54 BigO complexity; member in struct:benchmark::LeastSq 57 // Function to return an string for the calculated complexity 58 std::string GetBigOString(BigO complexity);
|
complexity.cc | 23 #include "complexity.h" 29 BigOFunc* FittingCurve(BigO complexity) { 30 switch (complexity) { 47 // Function to return an string for the calculated complexity 48 std::string GetBigOString(BigO complexity) { 49 switch (complexity) { 95 result.complexity = oLambda; 97 // Calculate complexity. 118 // - complexity : If different than oAuto, the fitting curve will stick to 122 const std::vector<double>& time, const BigO complexity) { [all...] |
benchmark_api_internal.h | 25 BigO complexity; member in struct:benchmark::internal::Benchmark::Instance
|
csv_reporter.cc | 16 #include "complexity.h" 83 Out << GetBigOString(run.complexity);
|
/external/jacoco/org.jacoco.core.test/src/org/jacoco/core/test/validation/ |
CyclomaticComplexityTest.java | 38 * Various tests for cyclomatic complexity of methods. 74 final ICounter complexity = analyze(); local 75 assertEquals(CounterImpl.getInstance(1, 0), complexity); 82 final ICounter complexity = analyze(); local 83 assertEquals(CounterImpl.getInstance(0, 1), complexity); 97 final ICounter complexity = analyze(); local 98 assertEquals(CounterImpl.getInstance(2, 0), complexity); 105 final ICounter complexity = analyze(); local 106 assertEquals(CounterImpl.getInstance(1, 1), complexity); 114 final ICounter complexity = analyze() local 132 final ICounter complexity = analyze(); local 140 final ICounter complexity = analyze(); local 149 final ICounter complexity = analyze(); local 158 final ICounter complexity = analyze(); local 176 final ICounter complexity = analyze(); local 184 final ICounter complexity = analyze(); local 193 final ICounter complexity = analyze(); local 203 final ICounter complexity = analyze(); local 223 final ICounter complexity = analyze(); local 231 final ICounter complexity = analyze(); local 240 final ICounter complexity = analyze(); local 250 final ICounter complexity = analyze(); local [all...] |
/external/speex/libspeex/ |
cb_search.h | 63 int complexity, 89 int complexity,
|
ltp.h | 75 int complexity, 118 int complexity,
|
sb_celp.h | 92 int complexity; member in struct:SBEncState
|
/external/webrtc/webrtc/modules/audio_coding/codecs/opus/ |
opus_speed_test.cc | 84 #define ADD_TEST(complexity) \ 85 TEST_P(OpusSpeedTest, OpusSetComplexityTest##complexity) { \ 88 /* Set complexity. */ \ 89 printf("Setting complexity to %d ...\n", complexity); \ 90 EXPECT_EQ(0, WebRtcOpus_SetComplexity(opus_encoder_, complexity)); \
|
audio_encoder_opus.h | 40 int complexity = kDefaultComplexity; member in struct:webrtc::final::Config 45 // If we are on Android, iOS and/or ARM, use a lower complexity setting as 46 // default, to save encoder complexity.
|
opus_interface.h | 108 * complexity. This will affect the audio bandwidth in the coded audio. However, 186 * This function adjusts the computational complexity. The effect is the same as 187 * calling the complexity setting of Opus as an Opus encoder related CTL. 191 * - complexity : New target complexity (0-10, inclusive) 196 int16_t WebRtcOpus_SetComplexity(OpusEncInst* inst, int32_t complexity);
|
/external/libopus/silk/ |
check_control_input.c | 100 if( encControl->complexity < 0 || encControl->complexity > 10 ) {
|
control.h | 74 /* I: Complexity mode; 0 is lowest, 10 is highest complexity */ 75 opus_int complexity; member in struct:__anon24142
|
/external/libopus/silk/float/ |
pitch_analysis_core_FLP.c | 51 opus_int complexity, /* I Complexity setting */ 61 opus_int complexity /* I Complexity setting */ 77 const opus_int complexity, /* I Complexity setting, 0-2, where 2 is highest */ 114 /* Check for valid complexity setting */ 115 silk_assert( complexity >= SILK_PE_MIN_COMPLEX ); 116 silk_assert( complexity <= SILK_PE_MAX_COMPLEX ); 217 length_d_srch = 4 + 2 * complexity; [all...] |
/external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/ |
complexityMeasures.m | 35 % Compute each function's mean complexity 38 % Compute each function's maximum complexity in encoding 46 % Compute maximum complexity for a single frame (enc/dec separately and together)
|
/prebuilts/go/darwin-x86/src/container/heap/ |
heap.go | 39 // Its complexity is O(n) where n = h.Len(). 49 // Push pushes the element x onto the heap. The complexity is 58 // and returns it. The complexity is O(log(n)) where n = h.Len(). 69 // The complexity is O(log(n)) where n = h.Len(). 84 // The complexity is O(log(n)) where n = h.Len().
|
/prebuilts/go/linux-x86/src/container/heap/ |
heap.go | 39 // Its complexity is O(n) where n = h.Len(). 49 // Push pushes the element x onto the heap. The complexity is 58 // and returns it. The complexity is O(log(n)) where n = h.Len(). 69 // The complexity is O(log(n)) where n = h.Len(). 84 // The complexity is O(log(n)) where n = h.Len().
|
/external/libopus/silk/fixed/ |
pitch_analysis_core_FIX.c | 65 opus_int complexity, /* I Complexity setting */ 75 opus_int complexity, /* I Complexity setting */ 92 const opus_int complexity, /* I Complexity setting, 0-2, where 2 is highest */ 125 /* Check for valid complexity setting */ 126 silk_assert( complexity >= SILK_PE_MIN_COMPLEX ); 127 silk_assert( complexity <= SILK_PE_MAX_COMPLEX ); 246 length_d_srch = silk_ADD_LSHIFT32( 4, complexity, 1 ) [all...] |
/external/libopus/celt/ |
opus_custom_demo.c | 54 int complexity; local 65 " <bytes per packet> [<complexity> [packet loss rate]] " 124 complexity=atoi(argv[5]); 125 opus_custom_encoder_ctl(enc,OPUS_SET_COMPLEXITY(complexity));
|
/external/google-benchmark/include/benchmark/ |
reporter.h | 54 complexity(oNone), 90 // Keep track of arguments to compute asymptotic complexity 91 BigO complexity; member in struct:benchmark::BenchmarkReporter::Run 95 // Inform print function whether the current run is a complexity report 120 // complexity and RMS of that benchmark family.
|
/external/libcxx/utils/google-benchmark/include/benchmark/ |
reporter.h | 53 complexity(oNone), 88 // Keep track of arguments to compute asymptotic complexity 89 BigO complexity; member in struct:benchmark::BenchmarkReporter::Run 93 // Inform print function whether the current run is a complexity report 116 // complexity and RMS of that benchmark family.
|
/frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
vop.cpp | 554 mp4dec_log("DecodeVOLHeader(): Shape Complexity estimation is not supported.\n"); 561 currVol->complexity.text_1 = BitstreamReadBits16(stream, 4); 569 currVol->complexity.text_2 = BitstreamReadBits16(stream, 4); 575 currVol->complexity.mc = BitstreamReadBits16(stream, 6); 914 if ((currVol->complexity.text_1 >> 3) & 0x1) /* intra */ 916 if (currVol->complexity.text_1 & 0x1) /* not_coded */ 918 if ((currVol->complexity.text_2 >> 3) & 0x1) /* dct_coefs */ 920 if ((currVol->complexity.text_2 >> 2) & 0x1) /* dct_lines */ 922 if ((currVol->complexity.text_2 >> 1) & 0x1) /* vlc_symbols */ 924 if (currVol->complexity.text_2 & 0x1) /* vlc_bits * [all...] |