Home
last modified time | relevance | path

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

12

/freebsd-13.1/contrib/bc/manuals/
H A Dalgorithms.md50 2. It minimizes algorithmic complexity.
58 a complexity of `O((n*log(n))^log_2(3))` which is favorable to the
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)`.
203 It has a complexity of `O(n)` because of add.
211 It has a complexity of `O(n)` because of add.
293 It has a complexity of `O(n^4)` because of `gcd()`.
301 It has a complexity of `O(n^3)` because of arctangent.
[all …]
/freebsd-13.1/contrib/apr/docs/
H A Dincomplete_types59 This gets rid of some of the complexity, by moving it off to the side, but
74 which added a layer of complexity that turned out to be unnecessary. If
/freebsd-13.1/contrib/libcbor/doc/source/api/
H A Dtype_2.rst17 …en before they are fully generated, but on the other hand it adds more complexity to the client co…
/freebsd-13.1/crypto/openssl/ssl/statem/
H A DREADME24 - Control complexity: only the state machine can change state: keep all
/freebsd-13.1/share/examples/diskless/
H A DME48 softlink. The advantage is that for all the complexity of your /conf
H A DREADME.TEMPLATING168 added complexity actually makes it easier to manage multiple
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DVOPInstructions.td64 // Using complex patterns gives VOP3 patterns a very high complexity rating,
66 // priority lower. The goal is to use a high number to reduce complexity to
111 // Using complex patterns gives VOP3 patterns a very high complexity rating,
113 // priority lower. The goal is to use a high number to reduce complexity to
/freebsd-13.1/contrib/libcbor/doc/source/
H A Ddevelopment.rst32 there is no significant complexity reduction that can be achieved by slightly
/freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/
H A DFastISelEmitter.cpp589 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns() local
601 SimplePatterns[Operands][OpcodeName][VT][RetVT].emplace(complexity, in collectPatterns()
H A DCodeGenDAGPatterns.h1066 int complexity, unsigned uid, unsigned setmode = 0,
1070 HwModeFeatures(hwmodefeatures.str()), AddedComplexity(complexity), in SrcRecord()
/freebsd-13.1/crypto/openssl/doc/man3/
H A DSSL_set_bio.pod88 Because of this complexity, this function should be avoided;
H A DSSL_CTX_set_security_level.pod126 By setting an appropriate security level much of this complexity can be
/freebsd-13.1/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/
H A DAnalyzerOptions.def355 ANALYZER_OPTION(unsigned, MaxSymbolComplexity, "max-symbol-complexity",
356 "The maximum complexity of symbolic constraint.", 35)
/freebsd-13.1/contrib/bzip2/
H A DREADME123 ensure that this program works correctly. However, the complexity
/freebsd-13.1/contrib/ncurses/doc/
H A Dhackguide.doc268 environment, but nevertheless have only fairly low complexity. These
292 Most of the algorithmic complexity in the library lives in these
570 To hold down complexity, do make your code data-driven. Especially, if
/freebsd-13.1/contrib/tzdata/
H A Dleap-seconds.list128 # This complexity would not be needed for negative leap seconds (if they
/freebsd-13.1/usr.sbin/ntp/ntpd/
H A Dleap-seconds128 # This complexity would not be needed for negative leap seconds (if they
/freebsd-13.1/sys/dev/isp/
H A DHardware.txt277 E. The next level of complexity is a Switched Fabric. The following topology
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonIntrinsics.td89 // Make sure the patterns with zero immediate value has higher complexity
H A DHexagonPatterns.td1050 // The complexity of the combines involving immediates should be greater
1051 // than the complexity of the combine with two registers.
1059 // The complexity of the combine with two immediates should be greater than
1060 // the complexity of a combine involving a register.
1869 // Add extra complexity to prefer these instructions over bitsset/bitsclr.
1892 // Do not increase complexity of these patterns. In the DAG, "cmp i8" may be
1895 // complexity that would make them preferable, and if they were actually used
/freebsd-13.1/contrib/llvm-project/lld/docs/
H A DNewLLD.rst39 to abstract the differences wouldn't be worth its complexity and run-time
/freebsd-13.1/contrib/atf/
H A DNEWS347 supporting use.fs adds a lot of unnecessary complexity. atf-run will
458 documents. They provided little value and introduced a lot of complexity
/freebsd-13.1/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Checkers/
H A DCheckers.td1573 "Ensures that every clone has at least the given complexity. "
1577 "the group in terms of complexity.",
/freebsd-13.1/contrib/mandoc/
H A DNEWS279 than to bother with the complexity of manpath(1).
964 and complexity.
1066 * Backed out -fno-ign-chars (pointless complexity).
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Target/
H A DTargetSelectionDAG.td1661 int complexity = -1> {
1667 int Complexity = complexity;

12