HomeSort by relevance Sort by last modified time
    Searched full:complexity (Results 1 - 25 of 831) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/mockito/src/org/mockito/internal/stubbing/answers/
CallsRealMethods.java 22 * Object oriented programming is more less tackling complexity by dividing the complexity into separate, specific, SRPy objects.
24 * Partial mock usually means that the complexity has been moved to a different method on the same object.
  /external/chromium_org/third_party/opus/src/silk/fixed/
pitch_analysis_core_FIX.c 65 opus_int complexity /* I Complexity setting */
74 opus_int complexity /* I Complexity setting */
90 const opus_int complexity, /* I Complexity setting, 0-2, where 2 is highest */
122 /* Check for valid complexity setting */
123 silk_assert( complexity >= SILK_PE_MIN_COMPLEX );
124 silk_assert( complexity <= SILK_PE_MAX_COMPLEX );
243 length_d_srch = silk_ADD_LSHIFT32( 4, complexity, 1 )
    [all...]
  /external/chromium_org/third_party/opus/src/silk/float/
pitch_analysis_core_FLP.c 51 opus_int complexity /* I Complexity setting */
60 opus_int complexity /* I Complexity setting */
76 const opus_int complexity, /* I Complexity setting, 0-2, where 2 is highest */
112 /* Check for valid complexity setting */
113 silk_assert( complexity >= SILK_PE_MIN_COMPLEX );
114 silk_assert( complexity <= SILK_PE_MAX_COMPLEX );
215 length_d_srch = 4 + 2 * complexity;
    [all...]
  /external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
fft.c 92 /* Complexity is: 10 cycles */
164 /* Complexity is: 51+48 = 99 cycles for 16x16 muls, but 51+120 = 171 cycles for 16x32 muls*/
197 /* Complexity : (31+6)*20 = 740 cycles for 16x16 muls, but (31+18)*20 = 980 cycles for 16x32 muls*/
202 /* Complexity : 4*(740+3) = 2972 cycles for 16x16 muls, but 4*(980+3) = 3932 cycles for 16x32 muls*/
234 // Complexity: 2*(13+5+4*13+2) = 144 for 16x16 muls, but 2*(13+5+4*33+2) = 304 cycles for 16x32 muls
237 // Complexity: 19*144 = 2736 for 16x16 muls, but 19*304 = 5776 cycles for 16x32 muls
299 // Complexity: 12*(64+40+10) = 1368 for 16x16 muls, but 12*(112+88+10) = 2520 cycles for 16x32 muls
302 // Complexity: 4*1368 = 5472 for 16x16 muls, but 4*2520 = 10080 cycles for 16x32 muls
335 // Complexity: 12*(12+12) = 288 for 16x16 muls, but 12*(12+32) = 528 cycles for 16x32 muls
338 // Complexity: 4*288+6 for 16x16 muls, but 4*528+6 cycles for 16x32 mul
    [all...]
  /frameworks/av/media/libstagefright/codecs/aacenc/basic_op/
basicop2.c 91 | Complexity weight : 1 |
138 | Complexity weight : 1 |
182 | Complexity weight : 1 |
236 | Complexity weight : 1 |
303 | Complexity weight : 1 |
373 | Complexity weight : 1 |
426 | Complexity weight : 1 |
480 | Complexity weight : 1 |
517 | Complexity weight : 1 |
555 | Complexity weight : 1
    [all...]
  /external/chromium_org/third_party/opus/src/silk/
control_codec.c 55 opus_int Complexity /* I */
116 /* Set encoding complexity */
118 ret += silk_setup_complexity( &psEnc->sCmn, encControl->complexity );
315 opus_int Complexity /* I */
320 /* Set encoding complexity */
321 silk_assert( Complexity >= 0 && Complexity <= 10 );
322 if( Complexity < 2 ) {
333 } else if( Complexity < 4 ) {
344 } else if( Complexity < 6 )
    [all...]
control.h 74 /* I: Complexity mode; 0 is lowest, 10 is highest complexity */
75 opus_int complexity; member in struct:__anon13790
check_control_input.c 100 if( encControl->complexity < 0 || encControl->complexity > 10 ) {
quant_LTP_gains.c 40 opus_int lowComplexity, /* I Flag for low complexity */
94 /* Break early in low-complexity mode if rate distortion is below threshold */
  /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/
mp4lib_int.h 27 #define FAST_IDCT /* , for fast Variable complexity IDCT */
47 /* complexity estimation parameters */
92 int complexity_estDisable; /* VOL disable complexity estimation */
93 int complexity_estMethod; /* VOL complexity estimation method */
94 Complexity_Est complexity; /* complexity estimation flags */ member in struct:tagVol
  /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/
basic_op.h 103 | Complexity weight : 1 |
145 | Complexity weight : 1 |
189 | Complexity weight : 1 |
249 | Complexity weight : 1 |
314 | Complexity weight : 1 |
361 | Complexity weight : 1 |
411 | Complexity weight : 1 |
450 | Complexity weight : 1 |
496 | Complexity weight : 1 |
542 | Complexity weight : 2
    [all...]
  /external/chromium_org/third_party/opus/src/
README.draft 47 -complexity <comp> : complexity, 0 (lowest) ... 10 (highest); default: 10
  /external/speex/libspeex/
cb_search.h 63 int complexity,
89 int complexity,
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
invert.h 44 // Complexity:
55 // Complexity:
difference.h 40 // Complexity: same as ComposeFst.
124 // Complexity: same as Compose.
intersect.h 37 // Complexity: same as ComposeFst.
114 // Complexity: same as Compose.
project.h 58 // Complexity:
72 // Complexity:
rmfinalepsilon.h 44 // non-coaccessible future. Complexity O(S)
63 // Move the final weight. Complexity O(E)
  /bionic/libc/tzcode/
difftime.c 51 ** Stay calm...decent optimizers will eliminate the complexity below.
  /external/chromium_org/chrome/browser/invalidation/
invalidation_service_factory.h 30 // different platforms; this class should help to hide this complexity. It also
  /external/chromium_org/third_party/opus/src/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/llvm/include/llvm/CodeGen/
MachineBranchProbabilityInfo.h 66 // NB: This routine's complexity is linear on the number of successors.
72 // NB: This routine's complexity is linear on the number of successors of
  /external/openfst/src/include/fst/
invert.h 51 // Complexity:
70 // Complexity:
project.h 72 // Complexity:
90 // Complexity:
rmfinalepsilon.h 50 // non-coaccessible future. Complexity O(S)
69 // Move the final weight. Complexity O(E)

Completed in 1051 milliseconds

1 2 3 4 5 6 7 8 91011>>