Home
last modified time | relevance | path

Searched refs:complexity (Results 1 – 25 of 416) sorted by relevance

12345678910>>...17

/external/jacoco/org.jacoco.core.test.validation.java5/src/org/jacoco/core/test/validation/java5/
DCyclomaticComplexityTest.java74 final ICounter complexity = analyze(); in testSimple1() local
75 assertEquals(CounterImpl.getInstance(1, 0), complexity); in testSimple1()
82 final ICounter complexity = analyze(); in testSimple2() local
83 assertEquals(CounterImpl.getInstance(0, 1), complexity); in testSimple2()
97 final ICounter complexity = analyze(); in testIf1() local
98 assertEquals(CounterImpl.getInstance(2, 0), complexity); in testIf1()
105 final ICounter complexity = analyze(); in testIf2() local
106 assertEquals(CounterImpl.getInstance(1, 1), complexity); in testIf2()
114 final ICounter complexity = analyze(); in testIf3() local
115 assertEquals(CounterImpl.getInstance(0, 2), complexity); in testIf3()
[all …]
/external/llvm-project/libcxx/utils/google-benchmark/src/
Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
50 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
124 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
128 CHECK_NE(complexity, oNone); in MinimalLeastSq()
132 if (complexity == oAuto) { in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
[all …]
Dcomplexity.h43 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {} in LeastSq()
47 BigO complexity; member
51 std::string GetBigOString(BigO complexity);
/external/libcxx/utils/google-benchmark/src/
Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
50 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
124 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
128 CHECK_NE(complexity, oNone); in MinimalLeastSq()
132 if (complexity == oAuto) { in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
[all …]
Dcomplexity.h43 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {} in LeastSq()
47 BigO complexity; member
51 std::string GetBigOString(BigO complexity);
/external/llvm-project/llvm/utils/benchmark/src/
Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
47 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
121 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
[all …]
Dcomplexity.h43 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {} in LeastSq()
47 BigO complexity; member
51 std::string GetBigOString(BigO complexity);
/external/google-benchmark/src/
Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
53 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
54 switch (complexity) { in GetBigOString()
100 result.complexity = oLambda; in MinimalLeastSq()
127 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
131 CHECK_NE(complexity, oNone); in MinimalLeastSq()
135 if (complexity == oAuto) { in MinimalLeastSq()
140 best_fit.complexity = o1; in MinimalLeastSq()
147 best_fit.complexity = fit; in MinimalLeastSq()
[all …]
Dcomplexity.h43 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {} in LeastSq()
47 BigO complexity; member
51 std::string GetBigOString(BigO complexity);
/external/libopus/silk/float/
Dpitch_analysis_core_FLP.c51 …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 … in silk_pitch_analysis_core_FLP() argument
115 celt_assert( complexity >= SILK_PE_MIN_COMPLEX ); in silk_pitch_analysis_core_FLP()
116 celt_assert( complexity <= SILK_PE_MAX_COMPLEX ); in silk_pitch_analysis_core_FLP()
217 length_d_srch = 4 + 2 * complexity; in silk_pitch_analysis_core_FLP()
329 if( Fs_kHz == 8 && complexity > SILK_PE_MIN_COMPLEX ) { in silk_pitch_analysis_core_FLP()
414 …silk_P_Ana_calc_corr_st3( cross_corr_st3, frame, start_lag, sf_length, nb_subfr, complexity, arch … in silk_pitch_analysis_core_FLP()
415 … silk_P_Ana_calc_energy_st3( energies_st3, frame, start_lag, sf_length, nb_subfr, complexity ); in silk_pitch_analysis_core_FLP()
423 nb_cbk_search = (opus_int)silk_nb_cbk_searchs_stage3[ complexity ]; in silk_pitch_analysis_core_FLP()
[all …]
/external/libopus/silk/fixed/
Dpitch_analysis_core_FIX.c65 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 highes… in silk_pitch_analysis_core() argument
128 celt_assert( complexity >= SILK_PE_MIN_COMPLEX ); in silk_pitch_analysis_core()
129 celt_assert( complexity <= SILK_PE_MAX_COMPLEX ); in silk_pitch_analysis_core()
251 length_d_srch = silk_ADD_LSHIFT32( 4, complexity, 1 ); in silk_pitch_analysis_core()
379 if( Fs_kHz == 8 && complexity > SILK_PE_MIN_COMPLEX ) { in silk_pitch_analysis_core()
485 nb_cbk_search = (opus_int)silk_nb_cbk_searchs_stage3[ complexity ]; in silk_pitch_analysis_core()
497 …lk_P_Ana_calc_corr_st3( cross_corr_st3, frame, start_lag, sf_length, nb_subfr, complexity, arch ); in silk_pitch_analysis_core()
498 …silk_P_Ana_calc_energy_st3( energies_st3, frame, start_lag, sf_length, nb_subfr, complexity, arch … in silk_pitch_analysis_core()
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/impl/units/
DMeasureUnitImpl.java31 private MeasureUnit.Complexity complexity = MeasureUnit.Complexity.SINGLE; field in MeasureUnitImpl
75 result.complexity = this.complexity; in copy()
174 if (this.singleUnits.size() > 1 && this.complexity == MeasureUnit.Complexity.SINGLE) { in appendSingleUnit()
214 return complexity; in getComplexity()
217 public void setComplexity(MeasureUnit.Complexity complexity) { in setComplexity() argument
218 this.complexity = complexity; in setComplexity()
230 if (this.complexity == MeasureUnit.Complexity.COMPOUND) { in serialize()
511 MeasureUnit.Complexity complexity = in parse() local
516 result.setComplexity(complexity); in parse()
517 } else if (result.getComplexity() != complexity) { in parse()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/units/
DMeasureUnitImpl.java27 private MeasureUnit.Complexity complexity = MeasureUnit.Complexity.SINGLE; field in MeasureUnitImpl
71 result.complexity = this.complexity; in copy()
170 if (this.singleUnits.size() > 1 && this.complexity == MeasureUnit.Complexity.SINGLE) { in appendSingleUnit()
210 return complexity; in getComplexity()
213 public void setComplexity(MeasureUnit.Complexity complexity) { in setComplexity() argument
214 this.complexity = complexity; in setComplexity()
226 if (this.complexity == MeasureUnit.Complexity.COMPOUND) { in serialize()
495 MeasureUnit.Complexity complexity = in parse() local
500 result.setComplexity(complexity); in parse()
501 } else if (result.getComplexity() != complexity) { in parse()
/external/webrtc/api/audio_codecs/opus/
Daudio_encoder_opus_config.cc43 complexity(kDefaultComplexity), in AudioEncoderOpusConfig()
71 if (complexity < 0 || complexity > 10) in IsOk()
Daudio_encoder_multi_channel_opus_config.cc28 complexity(kDefaultComplexity), in AudioEncoderMultiChannelOpusConfig()
46 if (complexity < 0 || complexity > 10) in IsOk()
/external/webrtc/modules/audio_coding/codecs/opus/
Dopus_speed_test.cc91 #define ADD_TEST(complexity) \ argument
92 TEST_P(OpusSpeedTest, OpusSetComplexityTest##complexity) { \
94 printf("Setting complexity to %d ...\n", complexity); \
95 EXPECT_EQ(0, WebRtcOpus_SetComplexity(opus_encoder_, complexity)); \
/external/icu/icu4c/source/i18n/
Dmeasunit_extra.cpp598 UMeasureUnitComplexity complexity = in parseImpl() local
601 U_ASSERT(result.complexity == UMEASURE_UNIT_SINGLE); in parseImpl()
602 result.complexity = complexity; in parseImpl()
603 } else if (result.complexity != complexity) { in parseImpl()
692 if (impl.complexity == UMEASURE_UNIT_COMPOUND) { in serialize()
713 if (impl.complexity == UMEASURE_UNIT_MIXED) { in serialize()
837 if (this->complexity != UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) { in extractIndividualUnits()
860 return MeasureUnitImpl::forMeasureUnit(*this, temp, status).complexity; in getComplexity()
898 if (impl.complexity == UMEASURE_UNIT_MIXED || otherImpl.complexity == UMEASURE_UNIT_MIXED) { in product()
906 impl.complexity = UMEASURE_UNIT_COMPOUND; in product()
/external/bc/manuals/
Dalgorithms.md50 2. It minimizes algorithmic complexity.
53 complexity of `O(n^(2*log_2(3)))` (best case) and `O(n^3)` (worst case).
58 a complexity of `O((n*log(n))^log_2(3))` which is favorable to the
65 operation. Its complexity is `O(log(n)*n^2)` as it requires one division per
82 to calculate `cos(x)`. It has a complexity of `O(n^3)`.
106 to reduce `x`. It has a complexity of `O(n^3)`.
127 to sufficiently reduce `x`. It has a complexity of `O(n^3)`.
147 to reduce `x` to small enough. It has a complexity of `O(n^3)`.
169 to calculate the bessel when `x < 0`, It has a complexity of `O(n^3)`.
178 exponentiation. The complexity is `O(e*n^2)`, which may initially seem
/external/skqp/src/core/
DSkScan_AntiPath.cpp607 static void compute_complexity(const SkPath& path, SkScalar& avgLength, SkScalar& complexity) { in compute_complexity() argument
611 avgLength = complexity = -1; in compute_complexity()
633 complexity = sk_ieee_float_divide(intersections, path.getBounds().height()); in compute_complexity()
635 if (sk_float_isnan(complexity)) { // it may be possible to have 0.0 / 0.0; inf is fine for us. in compute_complexity()
636 complexity = -1; in compute_complexity()
640 static bool ShouldUseDAA(const SkPath& path, SkScalar avgLength, SkScalar complexity) { in ShouldUseDAA() argument
656 if (avgLength < 0 || complexity < 0 || path.getBounds().isEmpty() || path.isConvex()) { in ShouldUseDAA()
680 return complexity >= kComplexityThreshold; in ShouldUseDAA()
685 static bool ShouldUseAAA(const SkPath& path, SkScalar avgLength, SkScalar complexity) { in ShouldUseAAA() argument
716 return complexity < kComplexityThreshold; in ShouldUseAAA()
[all …]
/external/webrtc/api/video_codecs/
Dvideo_codec.cc33 return (complexity == other.complexity && in operator ==()
42 return (complexity == other.complexity && in operator ==()
/external/llvm-project/llvm/test/Transforms/InstCombine/
Dfadd.ll40 %z = frem double 42.0, %pz ; thwart complexity-based canonicalization
56 %z = frem <2 x double> <double 42.0, double 8.0>, %pz ; thwart complexity-based canonicalization
72 %z = frem double 42.0, %pz ; thwart complexity-based canonicalization
89 %y = frem double -42.0, %py ; thwart complexity-based canonicalization
90 %z = frem double 42.0, %pz ; thwart complexity-based canonicalization
106 %z = frem double 42.0, %pz ; thwart complexity-based canonicalization
122 %z = frem <2 x double> <double 42.0, double 8.0>, %pz ; thwart complexity-based canonicalization
138 %z = frem double 42.0, %pz ; thwart complexity-based canonicalization
155 %y = frem double 41.0, %py ; thwart complexity-based canonicalization
156 %z = frem double 42.0, %pz ; thwart complexity-based canonicalization
[all …]
Dsmin-icmp.ll44 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
59 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
100 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
115 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
156 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
171 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
212 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
227 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
264 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
277 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
[all …]
Dand-xor-or.ll14 %a = udiv i32 42, %pa ; thwart complexity-based canonicalization
15 %b = udiv i32 43, %pb ; thwart complexity-based canonicalization
31 %a = udiv i32 42, %pa ; thwart complexity-based canonicalization
32 %b = udiv i32 43, %pb ; thwart complexity-based canonicalization
48 %a = udiv i32 42, %pa ; thwart complexity-based canonicalization
49 %b = udiv i32 43, %pb ; thwart complexity-based canonicalization
65 %a = udiv <2 x i32> <i32 42, i32 43>, %pa ; thwart complexity-based canonicalization
66 %b = udiv <2 x i32> <i32 43, i32 42>, %pb ; thwart complexity-based canonicalization
170 %z = sdiv i8 42, %zarg ; thwart complexity-based canonicalization
187 %z = sdiv i8 42, %zarg ; thwart complexity-based canonicalization
[all …]
Dumax-icmp.ll45 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
60 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
101 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
116 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
157 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
172 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
213 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
228 %x = add i32 %a, 3 ; thwart complexity-based canonicalization
/external/skia/src/core/
DSkScan_AntiPath.cpp605 static void compute_complexity(const SkPath& path, SkScalar& avgLength, SkScalar& complexity) { in compute_complexity() argument
609 avgLength = complexity = -1; in compute_complexity()
631 complexity = sk_ieee_float_divide(intersections, path.getBounds().height()); in compute_complexity()
633 if (sk_float_isnan(complexity)) { // it may be possible to have 0.0 / 0.0; inf is fine for us. in compute_complexity()
634 complexity = -1; in compute_complexity()
638 static bool ShouldUseAAA(const SkPath& path, SkScalar avgLength, SkScalar complexity) { in ShouldUseAAA() argument
669 return complexity < kComplexityThreshold; in ShouldUseAAA()
785 SkScalar avgLength, complexity; in AntiFillPath() local
786 compute_complexity(path, avgLength, complexity); in AntiFillPath()
788 if (ShouldUseAAA(path, avgLength, complexity)) { in AntiFillPath()

12345678910>>...17