Home
last modified time | relevance | path

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

12345678910>>...34

/aosp_15_r20/external/jacoco/org.jacoco.core.test.validation.java5/src/org/jacoco/core/test/validation/java5/
H A DCyclomaticComplexityTest.java75 final ICounter complexity = analyze(); in testSimple1() local
76 assertEquals(CounterImpl.getInstance(1, 0), complexity); in testSimple1()
83 final ICounter complexity = analyze(); in testSimple2() local
84 assertEquals(CounterImpl.getInstance(0, 1), complexity); in testSimple2()
98 final ICounter complexity = analyze(); in testIf1() local
99 assertEquals(CounterImpl.getInstance(2, 0), complexity); in testIf1()
106 final ICounter complexity = analyze(); in testIf2() local
107 assertEquals(CounterImpl.getInstance(1, 1), complexity); in testIf2()
115 final ICounter complexity = analyze(); in testIf3() local
116 assertEquals(CounterImpl.getInstance(0, 2), complexity); in testIf3()
[all …]
/aosp_15_r20/external/libcxx/utils/google-benchmark/src/
H A 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 …]
/aosp_15_r20/external/google-benchmark/src/
H A Dcomplexity.cc29 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
52 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
53 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
124 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
128 BM_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 …]
/aosp_15_r20/external/cronet/third_party/google_benchmark/src/src/
H A Dcomplexity.cc29 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
31 switch (complexity) { in FittingCurve()
54 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
55 switch (complexity) { in GetBigOString()
99 result.complexity = oLambda; in MinimalLeastSq()
126 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
130 BM_CHECK_NE(complexity, oNone); in MinimalLeastSq()
134 if (complexity == oAuto) { in MinimalLeastSq()
139 best_fit.complexity = o1; in MinimalLeastSq()
146 best_fit.complexity = fit; in MinimalLeastSq()
[all …]
/aosp_15_r20/external/libopus/silk/float/
H A 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 …]
/aosp_15_r20/frameworks/av/media/libmedia/
H A DEncoderCapabilities.cpp119 std::optional<int> complexity, std::optional<int> quality, std::optional<int> profile) { in supports() argument
121 if (complexity) { in supports()
122 ok &= mComplexityRange.contains(complexity.value()); in supports()
160 std::optional<int> complexity = std::nullopt; in supportsFormat() local
162 complexity = tmp; in supportsFormat()
168 if (!complexity) { in supportsFormat()
169 complexity = flacComplexity; in supportsFormat()
170 } else if (flacComplexity != complexity.value()) { in supportsFormat()
172 " which are %d and %d", complexity.value(), flacComplexity); in supportsFormat()
202 return supports(complexity, quality, profile); in supportsFormat()
/aosp_15_r20/external/libopus/silk/fixed/
H A 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 …]
/aosp_15_r20/packages/apps/Settings/tests/robotests/testutils/com/android/settings/testutils/shadow/
DShadowLockPatternUtils.java138 int complexity = sUserToComplexityMap.getOrDefault(userId, in getRequestedPasswordComplexity() local
141 complexity = Math.max(complexity, sUserToProfileComplexityMap.getOrDefault(userId, in getRequestedPasswordComplexity()
144 return complexity; in getRequestedPasswordComplexity()
199 public static void setRequiredPasswordComplexity(int userHandle, int complexity) { in setRequiredPasswordComplexity() argument
200 sUserToComplexityMap.put(userHandle, complexity); in setRequiredPasswordComplexity()
203 public static void setRequiredPasswordComplexity(int complexity) { in setRequiredPasswordComplexity() argument
204 sUserToComplexityMap.put(UserHandle.myUserId(), complexity); in setRequiredPasswordComplexity() local
207 public static void setRequiredProfilePasswordComplexity(int complexity) { in setRequiredProfilePasswordComplexity() argument
208 sUserToProfileComplexityMap.put(UserHandle.myUserId(), complexity); in setRequiredProfilePasswordComplexity() local
/aosp_15_r20/external/libxaac/encoder/drc_src/
H A Dimpd_drc_uni_drc_filter_bank.c33 pstr_drc_filter_bank->complexity = 0; in impd_drc_filter_bank_complexity()
39 pstr_drc_filter_bank->complexity = 8; in impd_drc_filter_bank_complexity()
42 pstr_drc_filter_bank->complexity = 18; in impd_drc_filter_bank_complexity()
45 pstr_drc_filter_bank->complexity = 28; in impd_drc_filter_bank_complexity()
171 pstr_filter_banks->str_drc_filter_bank[group_idx].complexity += in impd_drc_init_all_filter_banks()
175 pstr_filter_banks->complexity = 0; in impd_drc_init_all_filter_banks()
178 pstr_filter_banks->complexity += in impd_drc_init_all_filter_banks()
180 pstr_filter_banks->str_drc_filter_bank[group_idx].complexity; in impd_drc_init_all_filter_banks()
/aosp_15_r20/external/bc/manuals/
H A 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
67 Its complexity is `O(log(n)*n^2)` as it requires one division per iteration, and
84 to calculate `cos(x)`. It has a complexity of `O(n^3)`.
110 It has a complexity of `O(n^3)`.
133 It has a complexity of `O(n^3)`.
153 to reduce `x` to small enough. It has a complexity of `O(n^3)`.
175 to calculate the bessel when `x < 0`, It has a complexity of `O(n^3)`.
184 exponentiation. The complexity is `O(e*n^2)`, which may initially seem
[all …]
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/icl/doc/
Dimplementation.qbk20 more detail together with ['*complexity characteristics*],
35 So all the ['*complexity characteristics*] of icl containers
42 Throughout the documentation on complexity,
61 complexity statements throughout the icl's documentation
82 stl::set and stl::map, their complexity characteristics are
96 As an example, time complexity of __biLAddition__ on
99 More information on ['*complexity characteristics*]
112 The third column contains the specific kind of complexity statement.
113 If column three is empty ['*worst case*] complexity is given
143 This results in ['*linear worst case time*] complexity for
[all …]
/aosp_15_r20/external/icu/android_icu4j/src/main/java/android/icu/impl/units/
H A DMeasureUnitImpl.java30 private MeasureUnit.Complexity complexity = MeasureUnit.Complexity.SINGLE; field in MeasureUnitImpl
72 result.complexity = this.complexity; in copy()
195 if (this.singleUnits.size() > 1 && this.complexity == MeasureUnit.Complexity.SINGLE) { in appendSingleUnit()
234 return complexity; in getComplexity()
237 public void setComplexity(MeasureUnit.Complexity complexity) { in setComplexity() argument
238 this.complexity = complexity; in setComplexity()
252 if (this.complexity == MeasureUnit.Complexity.COMPOUND) { in serialize()
548 MeasureUnit.Complexity complexity = in parse() local
553 result.setComplexity(complexity); in parse()
554 } else if (result.getComplexity() != complexity) { in parse()
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/spirit/doc/qi/
Doperator.qbk106 [:The overall complexity of the alternative parser is defined by the sum
107 of the complexities of its elements. The complexity of the alternative
171 [:The complexity is defined by the complexity of the predicate, `a`]
234 [:The complexity of the difference parser is defined by the sum of the
339 [:The overall complexity of the expectation parser is defined by the sum
340 of the complexities of its elements. The complexity of the expectation
403 [:The overall complexity of the Kleene star is defined by the complexity
405 complexity of the Kleene star itself is O(N), where N is the number
471 [:The overall complexity of the List is defined by the complexity of its
472 subject, `a`, multiplied by the number of repetitions. The complexity of
[all …]
Ddirective.qbk101 [:The complexity is defined by the complexity of the subject parser, `a`]
174 [:The complexity is defined by the complexity of the subject parser, `a`]
250 [:The complexity is defined by the complexity of the subject parser, `a`]
321 [:The complexity is defined by the complexity of the subject parser, `a`]
397 [:The complexity is defined by the complexity of the subject parser, `a`]
488 [:The overall complexity is defined by the complexity of its subject
489 parser. The complexity of `repeat` itself is O(N), where N is the number
566 [:The complexity is defined by the complexity of the subject parser, `a`]
653 [:The complexity is defined by the complexity of the subject parser, `a`]
737 [:The complexity is defined by the complexity of the subject parser, `a`]
[all …]
/aosp_15_r20/external/icu/icu4j/main/core/src/main/java/com/ibm/icu/impl/units/
H A DMeasureUnitImpl.java26 private MeasureUnit.Complexity complexity = MeasureUnit.Complexity.SINGLE; field in MeasureUnitImpl
68 result.complexity = this.complexity; in copy()
191 if (this.singleUnits.size() > 1 && this.complexity == MeasureUnit.Complexity.SINGLE) { in appendSingleUnit()
230 return complexity; in getComplexity()
233 public void setComplexity(MeasureUnit.Complexity complexity) { in setComplexity() argument
234 this.complexity = complexity; in setComplexity()
248 if (this.complexity == MeasureUnit.Complexity.COMPOUND) { in serialize()
529 MeasureUnit.Complexity complexity = in parse() local
534 result.setComplexity(complexity); in parse()
535 } else if (result.getComplexity() != complexity) { in parse()
/aosp_15_r20/frameworks/opt/car/setupwizard/library/utils/src/com/android/car/setupwizardlib/
DInitialLockSetupClient.java386 int complexity; in doInBackground() local
389 complexity = PasswordComplexity.PASSWORD_COMPLEXITY_MEDIUM; in doInBackground()
392 complexity = PasswordComplexity.PASSWORD_COMPLEXITY_LOW; in doInBackground()
395 complexity = PasswordComplexity.PASSWORD_COMPLEXITY_LOW; in doInBackground()
403 return km.isValidLockPasswordComplexity(mLockType, passwords[0], complexity) in doInBackground()
464 int complexity; in doInBackground() local
467 complexity = PasswordComplexity.PASSWORD_COMPLEXITY_MEDIUM; in doInBackground()
470 complexity = PasswordComplexity.PASSWORD_COMPLEXITY_LOW; in doInBackground()
473 complexity = PasswordComplexity.PASSWORD_COMPLEXITY_LOW; in doInBackground()
481 return km.setLock(mLockType, passwords[0], complexity) in doInBackground()
/aosp_15_r20/frameworks/av/media/module/codecs/m4v_h263/dec/src/
H A Dvop.cpp604 currVol->complexity.text_1 = BitstreamReadBits16(stream, 4); in DecodeVOLHeader()
612 currVol->complexity.text_2 = BitstreamReadBits16(stream, 4); in DecodeVOLHeader()
618 currVol->complexity.mc = BitstreamReadBits16(stream, 6); in DecodeVOLHeader()
957 if ((currVol->complexity.text_1 >> 3) & 0x1) /* intra */ in DecodeVOPHeader()
959 if (currVol->complexity.text_1 & 0x1) /* not_coded */ in DecodeVOPHeader()
961 if ((currVol->complexity.text_2 >> 3) & 0x1) /* dct_coefs */ in DecodeVOPHeader()
963 if ((currVol->complexity.text_2 >> 2) & 0x1) /* dct_lines */ in DecodeVOPHeader()
965 if ((currVol->complexity.text_2 >> 1) & 0x1) /* vlc_symbols */ in DecodeVOPHeader()
967 if (currVol->complexity.text_2 & 0x1) /* vlc_bits */ in DecodeVOPHeader()
972 if ((currVol->complexity.text_1 >> 2) & 0x1) /* inter */ in DecodeVOPHeader()
[all …]
/aosp_15_r20/frameworks/proto_logging/stats/enums/devicepolicy/
H A Denums.proto37 // The required password complexity.
39 COMPLEXITY_UNSPECIFIED = 0; // If password complexity is none of the below
40 COMPLEXITY_NONE = 1; // If password complexity is PASSWORD_COMPLEXITY_NONE
42 COMPLEXITY_LOW = 3; // If password complexity is PASSWORD_COMPLEXITY_LOW
43 COMPLEXITY_MEDIUM = 4; // If password complexity is PASSWORD_COMPLEXITY_MEDIUM
44 COMPLEXITY_HIGH = 5; // If password complexity is PASSWORD_COMPLEXITY_HIGH
/aosp_15_r20/external/lzma/CPP/7zip/Archive/Zip/
H A DZipUpdate.cpp437 UInt64 &complexity)
479 complexity += rangeSize;
743 UInt64 complexity = 0;
746 … RINOK(UpdateItemOldData(archive, inArchive, itemEx, ui, item, progress, opCallback, complexity))
749 lps->ProgressOffset += complexity;
919 UInt64 complexity = 0;
935 complexity += ui.Size;
950 complexity += inputItem.GetLocalFullSize();
953 complexity += kLocalHeaderSize;
954 complexity += kCentralHeaderSize;
[all …]
/aosp_15_r20/external/cronet/third_party/icu/source/i18n/
H A Dmeasunit_extra.cpp589 UMeasureUnitComplexity complexity = in parse() local
593 U_ASSERT(result.complexity == UMEASURE_UNIT_COMPOUND); in parse()
594 result.complexity = complexity; in parse()
595 } else if (result.complexity != complexity) { in parse()
1093 this->complexity == UMeasureUnitComplexity::UMEASURE_UNIT_SINGLE) { in appendSingleUnit()
1094 this->complexity = UMeasureUnitComplexity::UMEASURE_UNIT_COMPOUND; in appendSingleUnit()
1104 if (this->complexity != UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) { in extractIndividualUnitsWithIndices()
1132 if (this->complexity == UMEASURE_UNIT_COMPOUND) { in serialize()
1156 if (this->complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) { in serialize()
1191 return MeasureUnitImpl::forMeasureUnit(*this, temp, status).complexity; in getComplexity()
[all …]
/aosp_15_r20/external/icu/icu4c/source/i18n/
H A Dmeasunit_extra.cpp593 UMeasureUnitComplexity complexity = in parse() local
597 U_ASSERT(result.complexity == UMEASURE_UNIT_COMPOUND); in parse()
598 result.complexity = complexity; in parse()
599 } else if (result.complexity != complexity) { in parse()
1097 this->complexity == UMeasureUnitComplexity::UMEASURE_UNIT_SINGLE) { in appendSingleUnit()
1098 this->complexity = UMeasureUnitComplexity::UMEASURE_UNIT_COMPOUND; in appendSingleUnit()
1108 if (this->complexity != UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) { in extractIndividualUnitsWithIndices()
1136 if (this->complexity == UMEASURE_UNIT_COMPOUND) { in serialize()
1160 if (this->complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) { in serialize()
1195 return MeasureUnitImpl::forMeasureUnit(*this, temp, status).complexity; in getComplexity()
[all …]
/aosp_15_r20/packages/apps/Settings/src/com/android/settings/password/
DChooseLockGenericController.java117 public Builder setAppRequestedMinComplexity(int complexity) { in setAppRequestedMinComplexity() argument
118 mAppRequestedMinComplexity = complexity; in setAppRequestedMinComplexity()
274 int complexity = Math.max(mAppRequestedMinComplexity, in getAggregatedPasswordComplexity() local
278 complexity = Math.max(complexity, in getAggregatedPasswordComplexity()
281 return complexity; in getAggregatedPasswordComplexity()
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/spirit/doc/karma/
Doperator.qbk113 [:The overall complexity of the sequence generator is defined by the sum of the
114 complexities of its elements. The complexity of the sequence itself is O(N),
204 [:The overall complexity of the alternative generator is defined by the sum of
205 the complexities of its elements. The complexity of the alternative itself is
320 [:The overall complexity of the Kleene star generator is defined by the
321 complexity of its embedded generator multiplied by the number of executed
322 iterations. The complexity of the Kleene star itself is O(N), where N is the
431 [:The overall complexity of the plus generator is defined by the
432 complexity of its embedded generator multiplied by the number of executed
433 iterations. The complexity of the plus generator itself is O(N), where N is
[all …]
Ddirective.qbk238 [:The overall complexity of an alignment generator directive is defined by
239 the complexity of its embedded and padding generator. The complexity of the
240 left alignment directive generator itself is O(1). The complexity of the
403 [:The overall complexity of the repetition generator is defined by the
404 complexity of its embedded generator. The complexity of the repeat itself is
533 [:The overall complexity of the generator directives `delimit[]`, `verbatim[]`,
534 and `no_delimit[]` is defined by the complexity of its embedded generators.
535 The complexity of the directives themselves is O(1).]
660 [:The overall complexity of the generator directives `ns::lower[]` and `ns::upper[]`
661 is defined by the complexity of its embedded generators. The directives
[all …]
/aosp_15_r20/external/lzma/CPP/7zip/Archive/Tar/
H A DTarUpdate.cpp180 UInt64 complexity = 0; in UpdateArchive()
190 complexity += ui.Size; in UpdateArchive()
193 complexity += inputItems[(unsigned)ui.IndexInArc].Get_FullSize_Aligned(); in UpdateArchive()
197 RINOK(updateCallback->SetTotal(complexity)) in UpdateArchive()
205 complexity = 0; in UpdateArchive()
211 lps->InSize = lps->OutSize = complexity; in UpdateArchive()
491 complexity += item.PackSize; in UpdateArchive()
557 complexity += size; in UpdateArchive()

12345678910>>...34