| /external/jacoco/org.jacoco.core.test.validation.java5/src/org/jacoco/core/test/validation/java5/ |
| 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 …]
|
| /external/google-benchmark/src/ |
| D | complexity.cc | 18 #include "complexity.h"
29 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
31 switch (complexity) { in FittingCurve()
55 // Function to return an string for the calculated complexity
56 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
57 switch (complexity) { in GetBigOString()
101 result.complexity = oLambda; in MinimalLeastSq()
103 // Calculate complexity. in MinimalLeastSq()
124 // - complexity : If different than oAuto, the fitting curve will stick to
128 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
[all …]
|
| /external/libcxx/utils/google-benchmark/src/ |
| 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 …]
|
| /external/cronet/third_party/google_benchmark/src/src/ |
| 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 …]
|
| /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 …]
|
| /external/sdv/vsomeip/third_party/boost/icl/doc/ |
| D | implementation.qbk | 20 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
77 [section Complexity]
79 [h4 Complexity of element containers]
82 stl::set and stl::map, their complexity characteristics are
86 [h4 Complexity of interval containers]
96 As an example, time complexity of __biLAddition__ on
99 More information on ['*complexity characteristics*]
[all …]
|
| /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 | 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 | 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 | 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 | 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 …]
|
| /external/bc/manuals/ |
| D | algorithms.md | 50 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 …]
|
| /external/icu/icu4j/main/core/src/main/java/com/ibm/icu/impl/units/ |
| 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 …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/units/ |
| 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 …]
|
| /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 …]
|
| D | directive.qbk | 99 [heading Complexity]
101 [:The complexity is defined by the complexity of the subject parser, `a`]
172 [heading Complexity]
174 [:The complexity is defined by the complexity of the subject parser, `a`]
248 [heading Complexity]
250 [:The complexity is defined by the complexity of the subject parser, `a`]
319 [heading Complexity]
321 [:The complexity is defined by the complexity of the subject parser, `a`]
395 [heading Complexity]
397 [:The complexity is defined by the complexity of the subject parser, `a`]
[all …]
|
| /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 …]
|
| /external/sdv/vsomeip/third_party/boost/intrusive/include/boost/intrusive/ |
| 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 | 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 …]
|
| /external/sdv/vsomeip/third_party/boost/spirit/doc/karma/ |
| D | operator.qbk | 111 [heading Complexity]
113 [: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),
202 [heading Complexity]
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
318 [heading Complexity]
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
[all …]
|
| /external/webrtc/test/pc/e2e/analyzer/video/ |
| D | multi_reader_queue.h | 47 // Complexity O(MultiReaderQueue::size(reader_to_copy)).
62 // Complexity O(MultiReaderQueue::size()).
74 // Complexity O(MultiReaderQueue::size(reader)).
86 // Add value to the end of the queue. Complexity O(1).
92 // Extract element from specified head. Complexity O(1).
111 // Returns element at specified head. Complexity O(1).
121 // or false otherwise. Complexity O(1).
128 // Complexity O(1).
131 // Returns size of the specified queue. Complexity O(1).
137 // Complexity O(1).
|
| /external/jacoco/org.jacoco.doc/docroot/doc/ |
| D | counters.html | 69 <h2>Cyclomatic Complexity</h2>
72 JaCoCo also calculates cyclomatic complexity for each non-abstract method and
73 summarizes complexity for classes, packages and groups. According to its
76 cyclomatic complexity is the minimum number of paths that can, in (linear)
78 complexity value can serve as an indication for the number of unit test cases
79 to fully cover a certain piece of software. Complexity figures can always be
84 The formal definition of the cyclomatic complexity v(G) is based on the
96 cyclomatic complexity of a method with the following equivalent equation based
108 missed complexity for each method. Missed complexity again is an indication
111 also not increase complexity.
|
| /external/webrtc/modules/audio_coding/codecs/opus/ |
| D | opus_complexity_unittest.cc | 59 // as the regular complexity, and the expectation is that the resulting ratio
61 // given a fixed complexity setting). On the other hand, when running on
62 // mobiles, the regular complexity is 5, and we expect the resulting ratio to
63 // be higher, since we have explicitly asked for a higher complexity setting at
68 // The limit -- including the hysteresis window -- at which the complexity in TEST()
83 // This test is identical to the one above, but without the complexity
89 // The limit -- including the hysteresis window -- at which the complexity in TEST()
90 // shuold be increased (but not in this test since complexity adaptation is in TEST()
|