| /external/jacoco/org.jacoco.doc/docroot/doc/ |
| D | counters.html | 1 <?xml version="1.0" encoding="UTF-8" ?>
2 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-st…
5 <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
6 <link rel="stylesheet" href="resources/doc.css" charset="UTF-8" type="text/css" />
8 <title>JaCoCo - Coverage Counter</title>
25 optionally embedded in class files. This approach allows efficient on-the-fly
51 branches in a method and determines the number of executed or missed branches.
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
[all …]
|
| /external/bc/manuals/ |
| D | algorithms.md | 42 chunking method, it only uses subtraction to find a quotient digit. It avoids
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
63 This `bc` implements the fast algorithm [Newton's Method][4] (also known as the
64 Newton-Raphson Method, or the [Babylonian Method][5]) to perform the square root
65 operation. Its complexity is `O(log(n)*n^2)` as it requires one division per
73 x - x^3/3! + x^5/5! - x^7/7! + ...
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)`.
[all …]
|
| /external/jacoco/org.jacoco.core/src/org/jacoco/core/analysis/ |
| D | ICoverageNode.java | 6 * http://www.eclipse.org/legal/epl-v10.html
9 * Marc R. Hoffmann - initial API and implementation
25 /** Method */
26 METHOD, enumConstant
59 /** Counter for cyclomatic complexity */
60 COMPLEXITY, enumConstant
63 METHOD, enumConstant
105 * Returns the counter for cyclomatic complexity.
107 * @return counter for complexity
144 * this method is reduced to the counters only. This helps to save memory
|
| /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/xml/ |
| D | XMLFormatterTest.java | 6 * http://www.eclipse.org/legal/epl-v10.html
9 * Marc R. Hoffmann - initial API and implementation
65 infos.add(new SessionInfo("session-1", 12345, 67890)); in testSessionInfo()
66 infos.add(new SessionInfo("session-2", 1, 2)); in testSessionInfo()
67 infos.add(new SessionInfo("session-3", 1, 2)); in testSessionInfo()
72 assertPathMatches("session-1", "/report/sessioninfo[1]/@id"); in testSessionInfo()
75 assertPathMatches("session-2", "/report/sessioninfo[2]/@id"); in testSessionInfo()
76 assertPathMatches("session-3", "/report/sessioninfo[3]/@id"); in testSessionInfo()
104 "/report/group/package/class/method/@name"); in testStructureWithGroup()
114 assertPathMatches("1", "count(/report/counter[@type='COMPLEXITY'])"); in testStructureWithGroup()
[all …]
|
| /external/llvm-project/llvm/utils/benchmark/include/benchmark/ |
| D | benchmark.h | 7 // http://www.apache.org/licenses/LICENSE-2.0
37 // via the --benchmarks command line flag. E.g.,
38 // my_unittest --benchmark_filter=all
39 // my_unittest --benchmark_filter=BM_StringCreation
40 // my_unittest --benchmark_filter=String
41 // my_unittest --benchmark_filter='Copy|Creation'
63 BENCHMARK(BM_memcpy)->Arg(8)->Arg(64)->Arg(512)->Arg(1<<10)->Arg(8<<10);
66 // following short-hand. The following invocation will pick a few
69 BENCHMARK(BM_memcpy)->Range(8, 8<<10);
85 ->Args({1<<10, 128})
[all …]
|
| /external/llvm-project/clang-tools-extra/docs/clang-tidy/checks/ |
| D | readability-function-cognitive-complexity.rst | 1 .. title:: clang-tidy - readability-function-cognitive-complexity
3 readability-function-cognitive-complexity
6 Checks function Cognitive Complexity metric.
8 The metric is implemented as per the `COGNITIVE COMPLEXITY by SonarSource
13 -------
17 Flag functions with Cognitive Complexity exceeding this number.
21 ---------------
23 There are three basic building blocks of a Cognitive Complexity metric:
28 The following structures increase the function's Cognitive Complexity metric
33 - ``if()``
[all …]
|
| /external/google-benchmark/include/benchmark/ |
| D | benchmark.h | 7 // http://www.apache.org/licenses/LICENSE-2.0
37 // via the --benchmarks command line flag. E.g.,
38 // my_unittest --benchmark_filter=all
39 // my_unittest --benchmark_filter=BM_StringCreation
40 // my_unittest --benchmark_filter=String
41 // my_unittest --benchmark_filter='Copy|Creation'
62 BENCHMARK(BM_memcpy)->Arg(8)->Arg(64)->Arg(512)->Arg(1<<10)->Arg(8<<10);
65 // following short-hand. The following invocation will pick a few
68 BENCHMARK(BM_memcpy)->Range(8, 8<<10);
84 ->Args({1<<10, 128})
[all …]
|
| /external/libcxx/utils/google-benchmark/include/benchmark/ |
| D | benchmark.h | 7 // http://www.apache.org/licenses/LICENSE-2.0
37 // via the --benchmarks command line flag. E.g.,
38 // my_unittest --benchmark_filter=all
39 // my_unittest --benchmark_filter=BM_StringCreation
40 // my_unittest --benchmark_filter=String
41 // my_unittest --benchmark_filter='Copy|Creation'
63 BENCHMARK(BM_memcpy)->Arg(8)->Arg(64)->Arg(512)->Arg(1<<10)->Arg(8<<10);
66 // following short-hand. The following invocation will pick a few
69 BENCHMARK(BM_memcpy)->Range(8, 8<<10);
85 ->Args({1<<10, 128})
[all …]
|
| /external/llvm-project/libcxx/utils/google-benchmark/include/benchmark/ |
| D | benchmark.h | 7 // http://www.apache.org/licenses/LICENSE-2.0
37 // via the --benchmarks command line flag. E.g.,
38 // my_unittest --benchmark_filter=all
39 // my_unittest --benchmark_filter=BM_StringCreation
40 // my_unittest --benchmark_filter=String
41 // my_unittest --benchmark_filter='Copy|Creation'
63 BENCHMARK(BM_memcpy)->Arg(8)->Arg(64)->Arg(512)->Arg(1<<10)->Arg(8<<10);
66 // following short-hand. The following invocation will pick a few
69 BENCHMARK(BM_memcpy)->Range(8, 8<<10);
85 ->Args({1<<10, 128})
[all …]
|
| /external/jacoco/org.jacoco.core.test.validation.java5/src/org/jacoco/core/test/validation/java5/ |
| D | CyclomaticComplexityTest.java | 6 * http://www.eclipse.org/legal/epl-v10.html
9 * Marc R. Hoffmann - initial API and implementation
38 * Various tests for cyclomatic complexity of methods.
74 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
[all …]
|
| /external/llvm-project/clang-tools-extra/clang-tidy/readability/ |
| D | FunctionCognitiveComplexityCheck.cpp | 1 //===--- FunctionCognitiveComplexityCheck.cpp - clang-tidy ------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
45 // or user-facing docs at
46 // http://clang.llvm.org/extra/clang-tidy/checks/readability-function-cognitive-complexity.html
51 // B1, increases cognitive complexity (by 1)
60 // * each method in a recursion cycle (not implemented)
75 // B3, increases cognitive complexity by the current nesting level
100 // information - what message to output, how much of an increment did this
130 // Based on the publicly-avaliable numbers for some big open-source projects
[all …]
|
| /external/llvm-project/clang/lib/Analysis/ |
| D | CloneDetection.cpp | 1 //===--- CloneDetection.cpp - Finds code clones in an AST -------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
28 assert(EndIndex <= Stmt->size() && "Given array too big for this Stmt"); in StmtSequence()
64 return CS->body_begin() + StartIndex; in begin()
72 return CS->body_begin() + EndIndex; in end()
77 return D->getASTContext(); in getASTContext()
81 return front()->getBeginLoc(); in getBeginLoc()
84 SourceLocation StmtSequence::getEndLoc() const { return back()->getEndLoc(); } in getEndLoc()
[all …]
|
| /external/mockito/src/main/java/org/mockito/stubbing/ |
| D | OngoingStubbing.java | 10 * Simply put: "<b>When</b> the x method is called <b>then</b> return y". E.g:
21 * //you can set different behavior for consecutive method calls.
37 * Sets a return value to be returned when the method is called. E.g:
51 * Sets consecutive return values to be returned when the method is called. E.g:
65 …// Additional method helps users of JDK7+ to hide heap pollution / unchecked generics array creati…
70 * Sets Throwable objects to be thrown when the method is called. E.g:
76 * match one of the checked exceptions of method signature.
85 * @param throwables to be thrown on method invocation
92 * Sets a Throwable type to be thrown when the method is called. E.g:
99 * match one of the checked exceptions of the stubbed method signature.
[all …]
|
| /external/mockito/src/main/java/org/mockito/internal/stubbing/answers/ |
| D | CallsRealMethods.java | 26 …* Object oriented programming is more less tackling complexity by dividing the complexity into sep…
28 …* Partial mock usually means that the complexity has been moved to a different method on the same …
33 * However, I wouldn't use partial mocks for new, test-driven & well-designed code.
|
| /external/llvm-project/clang/test/Analysis/copypaste/ |
| D | call.cpp | 1 …ng_analyze_cc1 -std=c++1z -analyzer-checker=alpha.clone.CloneChecker -analyzer-config alpha.clone.…
3 // expected-no-diagnostics
8 // Calls method a with some extra code to pass the minimum complexity
17 // Calls method b with some extra code to pass the minimum complexity
|
| /external/llvm-project/clang/include/clang/Analysis/ |
| D | CloneDetection.h | 1 //===--- CloneDetection.h - Finds code clones in an AST ---------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
42 /// If EndIndex is non-zero, then S is a CompoundStmt and this StmtSequence
54 /// that describe a non-empty sub-array in the body of the given CompoundStmt.
83 /// This method should only be called on a non-empty StmtSequence object.
91 /// This method should only be called on a non-empty StmtSequence object.
94 return begin()[size() - 1]; in back()
100 return EndIndex - StartIndex; in size()
[all …]
|
| /external/python/google-api-python-client/docs/dyn/ |
| D | poly_v1.assets.html | 8 font-weight: inherit;
9 font-style: inherit;
10 font-size: 100%;
11 font-family: inherit;
12 vertical-align: baseline;
16 font-size: 13px;
21 font-size: 26px;
22 margin-bottom: 1em;
26 font-size: 24px;
27 margin-bottom: 1em;
[all …]
|
| /external/mockito/src/main/java/org/mockito/ |
| D | MockSettings.java | 26 * If you cannot write a test in a simple way - refactor the code under test.
70 …* Specifies mock name. Naming mocks can be helpful for debugging - the name is used in all verific…
95 …bject oriented programming is more or less about tackling complexity by dividing the complexity in…
97 …* Partial mock usually means that the complexity has been moved to a different method on the same …
102 * However, I wouldn't use partial mocks for new, test-driven & well-designed code.
112 …* About stubbing for a partial mock, as it is a spy it will always call the real method, unless yo…
119 …* //Impossible: real method is called so spy.get(0) throws IndexOutOfBoundsException (the list i…
136 * It is the default answer so it will be used <b>only when you don't</b> stub the method call.
190 * Enables real-time logging of method invocations on this mock. Can be used
195 * Calling this method multiple times makes no difference.
[all …]
|
| /external/rust/crates/bstr/src/ |
| D | ext_slice.rs | 25 /// A short-hand constructor for building a `&[u8]`.
71 pub fn B<'a, B: ?Sized + AsRef<[u8]>>(bytes: &'a B) -> &'a [u8] { in B()
77 fn as_bytes(&self) -> &[u8] { in as_bytes()
82 fn as_bytes_mut(&mut self) -> &mut [u8] { in as_bytes_mut()
94 /// A method for accessing the raw bytes of this type. This is always a
95 /// no-op and callers shouldn't care about it. This only exists for making
98 fn as_bytes(&self) -> &[u8]; in as_bytes()
100 /// A method for accessing the raw bytes of this type, mutably. This is
101 /// always a no-op and callers shouldn't care about it. This only exists
104 fn as_bytes_mut(&mut self) -> &mut [u8]; in as_bytes_mut()
[all …]
|
| /external/google-benchmark/ |
| D | README.md | 3 …-and-test](https://github.com/google/benchmark/workflows/build-and-test/badge.svg)](https://github…
5 …st-bindings](https://github.com/google/benchmark/workflows/test-bindings/badge.svg)](https://githu…
7 [](https://travis-ci.org/g…
32 [User Guide](#user-guide) for a more comprehensive feature overview.
39 [Discussion group](https://groups.google.com/d/forum/benchmark-discuss)
59 See [Platform-Specific Build Instructions](#platform-specific-build-instructions).
63 This describes the installation process using cmake. As pre-requisites, you'll
77 $ cmake -E make_directory "build"
79 $ cmake -E chdir "build" cmake -DCMAKE_BUILD_TYPE=Release ../
81 # cmake -DCMAKE_BUILD_TYPE=Release -S . -B "build"
[all …]
|
| /external/llvm-project/mlir/docs/Rationale/ |
| D | UsageOfConst.md | 6 form a graph-based data structure, and the compiler analyses and passes
12 `const` entirely for the core IR types: you should never see a `const` method on
14 about this. That said, you *should* use `const` for non-IR types, like
29 > the optimization needs to get a non-`const` pointer. So all analyses either
33 > are all bad, probably so bad as to out-weigh the benefits of const.
37 This document argues this design is introducing significant sub-optimalities
39 a poor tradeoff, and proposes switching to a much simpler approach - eliminating
51 casting (of various sorts) to check for patterns, and use some high-abstraction
68 // A non-const instruction returns a non-const parent pointer.
75 The rationale for this design is that it would be const-incorrect to return a
[all …]
|
| /external/jacoco/org.jacoco.core.test/src/org/jacoco/core/analysis/ |
| D | CoverageNodeImplTest.java | 6 * http://www.eclipse.org/legal/epl-v10.html
9 * Marc R. Hoffmann - initial API and implementation
16 import static org.jacoco.core.analysis.ICoverageNode.CounterEntity.COMPLEXITY;
19 import static org.jacoco.core.analysis.ICoverageNode.CounterEntity.METHOD;
75 parent.getCounter(COMPLEXITY)); in testIncrement()
78 assertEquals(CounterImpl.getInstance(1, 21), parent.getCounter(METHOD)); in testIncrement()
|
| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_aq_complexity.c | 4 * Use of this source code is governed by a BSD-style license
36 { -4.0, -3.0, -2.0, 100.00, 100.0 },
37 { -3.5, -2.5, -1.5, 100.00, 100.0 },
38 { -3.0, -2.0, -1.0, 100.00, 100.0 }
48 VP9_COMMON *const cm = &cpi->common; in vp9_setup_in_frame_q_adj()
49 struct segmentation *const seg = &cm->seg; in vp9_setup_in_frame_q_adj()
54 if (frame_is_intra_only(cm) || cm->error_resilient_mode || in vp9_setup_in_frame_q_adj()
55 cpi->refresh_alt_ref_frame || cpi->force_update_segmentation || in vp9_setup_in_frame_q_adj()
56 (cpi->refresh_golden_frame && !cpi->rc.is_src_frame_alt_ref)) { in vp9_setup_in_frame_q_adj()
58 const int aq_strength = get_aq_c_strength(cm->base_qindex, cm->bit_depth); in vp9_setup_in_frame_q_adj()
[all …]
|
| /external/python/rsa/ |
| D | .codeclimate.yml | 6 - python
15 - "**.py"
17 - tests/**/*
19 argument-count:
22 file-lines:
25 method-complexity:
|
| /external/mesa3d/.gitlab-ci/ |
| D | traces-radeonsi.yml | 1 traces-db:
2 download-url: "https://minio-packet.freedesktop.org/mesa-tracie-public/"
5 - path: glmark2/desktop-blur-radius=5:effect=blur:passes=1:separable=true:windows=4.rdc
7 - device: gl-radeonsi-stoney
9 - path: glmark2/jellyfish.rdc
11 - device: gl-radeonsi-stoney
13 - path: glxgears/glxgears-2.trace
15 - device: gl-radeonsi-stoney
17 - path: 0ad/0ad.trace
19 - device: gl-radeonsi-stoney
[all …]
|