| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/container/include/boost/container/ |
| D | map.hpp | 144 //! <b>Complexity</b>: Constant.
154 //! <b>Complexity</b>: Constant.
161 //! <b>Complexity</b>: Constant.
168 //! <b>Complexity</b>: Constant.
176 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
186 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
196 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
206 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
220 //! <b>Complexity</b>: Linear in N.
235 //! <b>Complexity</b>: Linear in N.
[all …]
|
| D | flat_map.hpp | 208 //! <b>Complexity</b>: Constant.
216 //! <b>Complexity</b>: Constant.
224 //! <b>Complexity</b>: Constant.
232 //! <b>Complexity</b>: Constant.
240 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
250 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
260 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
270 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
283 //! <b>Complexity</b>: Linear in N.
298 //! <b>Complexity</b>: Linear in N.
[all …]
|
| D | flat_set.hpp | 135 //! <b>Complexity</b>: Constant.
145 //! <b>Complexity</b>: Constant.
153 //! <b>Complexity</b>: Constant.
162 //! <b>Complexity</b>: Constant.
171 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
182 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
193 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
204 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
219 //! <b>Complexity</b>: Linear in N.
235 //! <b>Complexity</b>: Linear in N.
[all …]
|
| D | static_vector.hpp | 198 //! @par Complexity
213 //! @par Complexity
228 //! @par Complexity
247 //! @par Complexity
265 //! @par Complexity
283 //! @par Complexity
297 //! @par Complexity
325 //! @par Complexity
340 //! @par Complexity
357 //! @par Complexity
[all …]
|
| D | set.hpp | 114 //! <b>Complexity</b>: Constant.
124 //! <b>Complexity</b>: Constant.
131 //! <b>Complexity</b>: Constant.
139 //! <b>Complexity</b>: Constant.
147 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
157 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
167 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
177 //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
191 //! <b>Complexity</b>: Linear in N.
206 //! <b>Complexity</b>: Linear in N.
[all …]
|
| D | slist.hpp | 259 //! <b>Complexity</b>: Constant.
268 //! <b>Complexity</b>: Constant.
279 //! <b>Complexity</b>: Linear to n.
290 //! <b>Complexity</b>: Linear to n.
301 //! <b>Complexity</b>: Linear to n.
312 //! <b>Complexity</b>: Linear to the range [first, last).
325 //! <b>Complexity</b>: Linear to the range [il.begin(), il.end()).
337 //! <b>Complexity</b>: Linear to the elements x contains.
346 //! <b>Complexity</b>: Constant.
357 //! <b>Complexity</b>: Linear to the elements x contains.
[all …]
|
| D | list.hpp | 229 //! <b>Complexity</b>: Constant.
238 //! <b>Complexity</b>: Constant.
249 //! <b>Complexity</b>: Linear to n.
260 //! <b>Complexity</b>: Linear to n.
271 //! <b>Complexity</b>: Linear to n.
282 //! <b>Complexity</b>: Linear to the elements x contains.
291 //! <b>Complexity</b>: Constant.
302 //! <b>Complexity</b>: Linear to the elements x contains.
312 //! <b>Complexity</b>: Constant if a == x.get_allocator(), linear otherwise.
330 //! <b>Complexity</b>: Linear to the range [first, last).
[all …]
|
| D | deque.hpp | 588 //! <b>Complexity</b>: Constant.
598 //! <b>Complexity</b>: Constant.
609 //! <b>Complexity</b>: Linear to n.
624 //! <b>Complexity</b>: Linear to n.
641 //! <b>Complexity</b>: Linear to n.
656 //! <b>Complexity</b>: Linear to n.
673 //! <b>Complexity</b>: Linear to n.
684 //! <b>Complexity</b>: Linear to n.
695 //! <b>Complexity</b>: Linear to the range [first, last).
714 //! <b>Complexity</b>: Linear to the range [first, last).
[all …]
|
| /aosp_15_r20/external/jacoco/org.jacoco.core.test.validation.java5/src/org/jacoco/core/test/validation/java5/ |
| H A D | CyclomaticComplexityTest.java | 39 * Various tests for cyclomatic complexity of methods.
75 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
[all …]
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/container/bench/ |
| D | varray.hpp | 92 //! @par Complexity
107 //! @par Complexity
123 //! @par Complexity
141 //! @par Complexity
155 //! @par Complexity
170 //! @par Complexity
182 //! @par Complexity
199 //! @par Complexity
221 //! @par Complexity
237 //! @par Complexity
[all …]
|
| /aosp_15_r20/out/soong/.intermediates/external/llvm/lib/Target/AArch64/llvm-gen-aarch64/gen/ |
| D | AArch64GenDAGISel.inc | 43 …Predicate_unindexedstore>><<P:Predicate_truncstore>><<P:Predicate_truncstorei16>> - Complexity = 46
53 …Predicate_unindexedstore>><<P:Predicate_truncstore>><<P:Predicate_truncstorei16>> - Complexity = 46
69 …Rm, ro_Wextend16:i32:$extend))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 46
79 …Rm, ro_Xextend16:i32:$extend))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 46
101 …Predicate_unindexedstore>><<P:Predicate_truncstore>><<P:Predicate_truncstorei16>> - Complexity = 30
123 …Predicate_unindexedstore>><<P:Predicate_truncstore>><<P:Predicate_truncstorei32>> - Complexity = 46
133 …Predicate_unindexedstore>><<P:Predicate_truncstore>><<P:Predicate_truncstorei32>> - Complexity = 46
146 …Rm, ro_Wextend32:i32:$extend))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 46
156 …Rm, ro_Xextend32:i32:$extend))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 46
177 …dexS>>:$idx), GPR64sp:i64:$Rn)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 30
[all …]
|
| /aosp_15_r20/external/google-benchmark/src/ |
| H A D | complexity.cc | 18 #include "complexity.h"
29 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
51 // Function to return an string for the calculated complexity
52 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
53 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
99 // Calculate complexity. in MinimalLeastSq()
120 // - complexity : If different than oAuto, the fitting curve will stick to
124 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
[all …]
|
| /aosp_15_r20/external/cronet/third_party/google_benchmark/src/src/ |
| H A D | complexity.cc | 18 #include "complexity.h"
29 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
31 switch (complexity) { in FittingCurve()
53 // Function to return an string for the calculated complexity
54 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
55 switch (complexity) { in GetBigOString()
99 result.complexity = oLambda; in MinimalLeastSq()
101 // Calculate complexity. in MinimalLeastSq()
122 // - complexity : If different than oAuto, the fitting curve will stick to
126 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
[all …]
|
| /aosp_15_r20/external/libcxx/utils/google-benchmark/src/ |
| H A D | complexity.cc | 23 #include "complexity.h"
28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
49 // Function to return an string for the calculated complexity
50 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
99 // Calculate complexity. in MinimalLeastSq()
120 // - complexity : If different than oAuto, the fitting curve will stick to
124 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/RISCV/ |
| H A D | RISCVGenDAGISel.inc | 79 …*:[i32] } GPR:{ *:[i32] }:$rs2, 4294967295:{ *:[i32] })), 4294967295:{ *:[i32] }) - Complexity = 27
85 …*:[i32] } GPR:{ *:[i32] }:$rs2, 4294967295:{ *:[i32] })), 4294967295:{ *:[i32] }) - Complexity = 27
92 …*:[i64] } GPR:{ *:[i64] }:$rs2, 4294967295:{ *:[i64] })), 4294967295:{ *:[i64] }) - Complexity = 27
106 …2] } GPR:{ *:[i32] }:$rs2)<<P:Predicate_assertzexti32>>), 4294967295:{ *:[i32] }) - Complexity = 23
112 …2] } GPR:{ *:[i32] }:$rs2)<<P:Predicate_assertzexti32>>), 4294967295:{ *:[i32] }) - Complexity = 23
119 …4] } GPR:{ *:[i64] }:$rs2)<<P:Predicate_assertzexti32>>), 4294967295:{ *:[i64] }) - Complexity = 23
139 …*:[i32] } GPR:{ *:[i32] }:$rs2, 4294967295:{ *:[i32] })), 4294967295:{ *:[i32] }) - Complexity = 23
145 …*:[i32] } GPR:{ *:[i32] }:$rs2, 4294967295:{ *:[i32] })), 4294967295:{ *:[i32] }) - Complexity = 23
152 …*:[i64] } GPR:{ *:[i64] }:$rs2, 4294967295:{ *:[i64] })), 4294967295:{ *:[i64] }) - Complexity = 23
166 …2] } GPR:{ *:[i32] }:$rs2)<<P:Predicate_assertzexti32>>), 4294967295:{ *:[i32] }) - Complexity = 19
[all …]
|
| /aosp_15_r20/out/soong/.intermediates/external/llvm/lib/Target/ARM/llvm-gen-arm/gen/ |
| D | ARMGenDAGISel.inc | 52 …32 GPR:i32:$a, 16:i32), 16:i32), (sra:i32 (shl:i32 GPR:i32:$b, 16:i32), 16:i32))) - Complexity = 38
87 … 16:i32), 16:i32), (sra:i32 (shl:i32 GPR:i32:$b, 16:i32), 16:i32)), GPR:i32:$acc) - Complexity = 38
113 …opc:i32:$Rm, (imm:i32)<<P:Predicate_rot_imm>><<X:rot_imm_XFORM>>:$rot), 255:i32)) - Complexity = 34
136 …c:i32:$Rm, (imm:i32)<<P:Predicate_rot_imm>><<X:rot_imm_XFORM>>:$rot), 65535:i32)) - Complexity = 34
159 …GPR:i32:$Rm, (imm:i32)<<P:Predicate_rot_imm>><<X:rot_imm_XFORM>>:$rot), 255:i32)) - Complexity = 34
182 …R:i32:$Rm, (imm:i32)<<P:Predicate_rot_imm>><<X:rot_imm_XFORM>>:$rot), 65535:i32)) - Complexity = 34
205 …GPR:i32:$Rm, (imm:i32)<<P:Predicate_rot_imm>><<X:rot_imm_XFORM>>:$rot), 255:i32)) - Complexity = 34
228 …i32 (srl:i32 rGPR:i32:$Rm, (imm:i32)<<P:Predicate_imm8_or_16>>:$rot), 65535:i32)) - Complexity = 34
255 …(imm:i32)<<P:Predicate_rot_imm>><<X:rot_imm_XFORM>>:$rot), 255:i32), GPR:i32:$Rn) - Complexity = 34
279 …mm:i32)<<P:Predicate_rot_imm>><<X:rot_imm_XFORM>>:$rot), 65535:i32), GPR:i32:$Rn) - Complexity = 34
[all …]
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/intrusive/include/boost/intrusive/ |
| D | bstree.hpp | 607 //! The complexity guarantees only hold if the tree is balanced, logarithmic
608 //! complexity would increase to linear if the tree is totally unbalanced.
683 //! <b>Complexity</b>: Constant.
694 //! <b>Complexity</b>: Constant.
709 //! <b>Complexity</b>: Linear in N if [b, e) is already sorted using
732 //! <b>Complexity</b>: Constant.
753 //! <b>Complexity</b>: Linear to elements contained in *this.
761 //! <b>Complexity</b>: Constant.
768 //! <b>Complexity</b>: Constant.
775 //! <b>Complexity</b>: Constant.
[all …]
|
| D | list.hpp | 175 //! <b>Complexity</b>: Constant
188 //! <b>Complexity</b>: Constant
203 //! <b>Complexity</b>: Linear in distance(b, e). No copy constructors are called.
222 //! <b>Complexity</b>: Constant.
248 //! <b>Complexity</b>: Linear to the number of elements in the list, if
265 //! <b>Complexity</b>: Constant.
283 //! <b>Complexity</b>: Constant.
299 //! <b>Complexity</b>: Constant.
313 //! <b>Complexity</b>: Constant.
332 //! <b>Complexity</b>: Constant.
[all …]
|
| D | slist.hpp | 115 //! This function has linear complexity. To improve the usability esp. with
277 //! <b>Complexity</b>: Linear to the number of elements transferred
305 //! <b>Complexity</b>: Constant
315 //! <b>Complexity</b>: Constant
327 //! <b>Complexity</b>: Linear in distance(b, e). No copy constructors are called.
344 //! <b>Complexity</b>: Constant.
369 //! <b>Complexity</b>: Linear to the number of elements in the list, if
383 //! <b>Complexity</b>: Linear to the number of elements of the list.
404 //! <b>Complexity</b>: Linear to the number of elements of the list.
428 //! <b>Complexity</b>: Constant.
[all …]
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/container/bench/detail/ |
| D | varray.hpp | 282 //! @par Complexity
300 //! @par Complexity
321 //! @par Complexity
344 //! @par Complexity
360 //! @par Complexity
381 //! @par Complexity
400 //! @par Complexity
421 //! @par Complexity
447 //! @par Complexity
473 //! @par Complexity
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/Mips/ |
| H A D | MipsGenDAGISel.inc | 74 …v, addrRegImm:{ *:[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 54
82 …v, addrRegImm:{ *:[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53
90 …v, addrRegImm:{ *:[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53
98 …v, addrRegImm:{ *:[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53
114 …se, iPTR:{ *:[iPTR] }:$index))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 27
121 …se, iPTR:{ *:[iPTR] }:$index))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 27
137 …v, addrRegImm:{ *:[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53
145 …v, addrRegImm:{ *:[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53
161 …se, iPTR:{ *:[iPTR] }:$index))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 27
168 …se, iPTR:{ *:[iPTR] }:$index))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 27
[all …]
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/spirit/doc/qi/ |
| D | operator.qbk | 104 [heading Complexity]
106 [:The overall complexity of the alternative parser is defined by the sum
107 of the complexities of its elements. The complexity of the alternative
169 [heading Complexity]
171 [:The complexity is defined by the complexity of the predicate, `a`]
232 [heading Complexity]
234 [:The complexity of the difference parser is defined by the sum of the
337 [heading Complexity]
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
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/ARM/ |
| H A D | ARMGenDAGISel.inc | 87 …*:[i32] } (srl:{ *:[i32] } GPR:{ *:[i32] }:$Rm, 8:{ *:[i32] }), 255:{ *:[i32] })) - Complexity = 35
95 …:[i32] } (srl:{ *:[i32] } rGPR:{ *:[i32] }:$Rm, 8:{ *:[i32] }), 255:{ *:[i32] })) - Complexity = 35
125 …*:[i32] } (shl:{ *:[i32] } GPR:{ *:[i32] }:$Rm, 24:{ *:[i32] }), 16:{ *:[i32] })) - Complexity = 35
133 …:[i32] } (shl:{ *:[i32] } rGPR:{ *:[i32] }:$Rm, 24:{ *:[i32] }), 16:{ *:[i32] })) - Complexity = 35
160 …:$Rm, (imm:{ *:[i32] })<<P:Predicate_pkh_lsl_amt>>:$sh), 4294901760:{ *:[i32] })) - Complexity = 26
186 …32] }:$Rm, (imm:{ *:[i32] })<<P:Predicate_pkh_asr_amt>>:$sh), 65535:{ *:[i32] })) - Complexity = 26
205 …[i32] }:$src2, (imm:{ *:[i32] })<<P:Predicate_imm1_15>>:$sh), 65535:{ *:[i32] })) - Complexity = 26
232 …:$Rm, (imm:{ *:[i32] })<<P:Predicate_pkh_lsl_amt>>:$sh), 4294901760:{ *:[i32] })) - Complexity = 26
259 …32] }:$Rm, (imm:{ *:[i32] })<<P:Predicate_pkh_asr_amt>>:$sh), 65535:{ *:[i32] })) - Complexity = 26
278 …[i32] }:$src2, (imm:{ *:[i32] })<<P:Predicate_imm1_15>>:$sh), 65535:{ *:[i32] })) - Complexity = 26
[all …]
|
| /aosp_15_r20/external/icu/icu4j/main/core/src/main/java/com/ibm/icu/impl/units/ |
| H A D | MeasureUnitImpl.java | 24 * The complexity, either SINGLE, COMPOUND, or MIXED.
26 private MeasureUnit.Complexity complexity = MeasureUnit.Complexity.SINGLE; field in MeasureUnitImpl
29 * value of the complexity field.
68 result.complexity = this.complexity; in copy()
87 // This `for` loop will cause time complexity to be O(n^2). in copyAndSimplify()
129 if (this.getComplexity() == MeasureUnit.Complexity.MIXED) { in extractIndividualUnitsWithIndices()
190 // more than one. thus means the complexity should be `UMEASURE_UNIT_COMPOUND` in appendSingleUnit()
191 if (this.singleUnits.size() > 1 && this.complexity == MeasureUnit.Complexity.SINGLE) { in appendSingleUnit()
192 this.setComplexity(MeasureUnit.Complexity.COMPOUND); in appendSingleUnit()
229 public MeasureUnit.Complexity getComplexity() { in getComplexity()
[all …]
|
| /aosp_15_r20/external/icu/android_icu4j/src/main/java/android/icu/impl/units/ |
| H A D | MeasureUnitImpl.java | 28 * The complexity, either SINGLE, COMPOUND, or MIXED.
30 private MeasureUnit.Complexity complexity = MeasureUnit.Complexity.SINGLE; field in MeasureUnitImpl
33 * value of the complexity field.
72 result.complexity = this.complexity; in copy()
91 // This `for` loop will cause time complexity to be O(n^2). in copyAndSimplify()
133 if (this.getComplexity() == MeasureUnit.Complexity.MIXED) { in extractIndividualUnitsWithIndices()
194 // more than one. thus means the complexity should be `UMEASURE_UNIT_COMPOUND` in appendSingleUnit()
195 if (this.singleUnits.size() > 1 && this.complexity == MeasureUnit.Complexity.SINGLE) { in appendSingleUnit()
196 this.setComplexity(MeasureUnit.Complexity.COMPOUND); in appendSingleUnit()
233 public MeasureUnit.Complexity getComplexity() { in getComplexity()
[all …]
|