Home
last modified time | relevance | path

Searched +full:upper +full:- +full:bound +full:- +full:check (Results 1 – 25 of 1018) sorted by relevance

12345678910>>...41

/external/apache-commons-math/src/main/java/org/apache/commons/math3/geometry/euclidean/oned/
DInterval.java9 * http://www.apache.org/licenses/LICENSE-2.0
30 /** The lower bound of the interval. */
33 /** The upper bound of the interval. */
34 private final double upper; field in Interval
37 * @param lower lower bound of the interval
38 * @param upper upper bound of the interval
40 public Interval(final double lower, final double upper) { in Interval() argument
41 if (upper < lower) { in Interval()
43 upper, lower, true); in Interval()
46 this.upper = upper; in Interval()
[all …]
DIntervalsSet.java9 * http://www.apache.org/licenses/LICENSE-2.0
38 private static final double DEFAULT_TOLERANCE = 1.0e-10;
49 * @param lower lower bound of the interval, must be lesser or equal
50 * to {@code upper} (may be {@code Double.NEGATIVE_INFINITY})
51 * @param upper upper bound of the interval, must be greater or equal
56 public IntervalsSet(final double lower, final double upper, final double tolerance) { in IntervalsSet() argument
57 super(buildTree(lower, upper, tolerance), tolerance); in IntervalsSet()
75 /** Build an intervals set from a Boundary REPresentation (B-rep).
77 * SubHyperplane sub-hyperplanes}. Each sub-hyperplane has the
81 * several non-connected sets (like for example polygons with holes
[all …]
/external/sdk-platform-java/.github/workflows/
Dshared_dependencies.yaml4 - main
7 - 'gapic-generator-java-bom/**'
8 - 'gapic-generator-java-pom-parent/**'
9 - 'java-shared-dependencies/**'
10 name: shared-dependencies version check
12 upper-bound-check:
13 name: Shared Dependencies BOM upper-bound check
14 runs-on: ubuntu-latest
17 - uses: actions/checkout@v2
18 - uses: stCarolas/setup-maven@v4
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math3/geometry/spherical/oned/
DArc.java9 * http://www.apache.org/licenses/LICENSE-2.0
33 /** The lower angular bound of the arc. */
36 /** The upper angular bound of the arc. */
37 private final double upper; field in Arc
47 * If either {@code lower} is equals to {@code upper} or
51 * greater than {@code upper} (an exception is thrown in this case).
53 * upper shifted accordingly, so the {@link #getInf()} and {@link #getSup()}
56 * @param lower lower angular bound of the arc
57 * @param upper upper angular bound of the arc
59 * @exception NumberIsTooLargeException if lower is greater than upper
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math3/analysis/solvers/
DUnivariateSolverUtils.java9 * http://www.apache.org/licenses/LICENSE-2.0
42 * @param x0 Lower bound for the interval.
43 * @param x1 Upper bound for the interval.
64 * @param x0 Lower bound for the interval.
65 * @param x1 Upper bound for the interval.
85 * Force a root found by a non-bracketing solver to lie on a specified side,
93 * @param baseRoot original root found by a previous non-bracketing solver
94 * @param min minimal bound of the search interval
95 * @param max maximal bound of the search interval
96 * @param allowedSolution the kind of solutions that the root-finding algorithm may
[all …]
DBaseAbstractUnivariateSolver.java9 * http://www.apache.org/licenses/LICENSE-2.0
32 * The default values for relative and function tolerances are 1e-14
33 * and 1e-15, respectively. It is however highly recommended to not
44 private static final double DEFAULT_RELATIVE_ACCURACY = 1e-14;
46 private static final double DEFAULT_FUNCTION_VALUE_ACCURACY = 1e-15;
169 * @param min Lower bound for the interval.
170 * @param max Upper bound for the interval.
204 return solve(maxEval, f, min, max, min + 0.5 * (max - min)); in solve()
228 * Check whether the function takes opposite signs at the endpoints.
231 * @param upper Upper endpoint.
[all …]
/external/llvm/test/CodeGen/ARM/
Dsat-arith.ll1 ; RUN: llc -O1 -mtriple=armv6-none-none-eabi %s -o - | FileCheck %s -check-prefix=ARM -check-prefix…
2 ; RUN: llc -O1 -mtriple=thumbv7-none-none-eabi %s -o - | FileCheck %s -check-prefix=THUMB -check-pr…
4 ; CHECK-LABEL: qadd
6 ; CHECK-DAG: mov{{s?}} [[R0:.*]], #8
7 ; CHECK-DAG: mov{{s?}} [[R1:.*]], #128
8 ; CHECK-ARM: qadd [[R0]], [[R1]], [[R0]]
9 ; CHECK-THRUMB: qadd [[R0]], [[R0]], [[R1]]
14 ; CHECK-LABEL: qsub
16 ; CHECK-DAG: mov{{s?}} [[R0:.*]], #8
17 ; CHECK-DAG: mov{{s?}} [[R1:.*]], #128
[all …]
/external/angle/third_party/spirv-tools/src/test/fuzzers/
Drandom_generator.cpp7 // http://www.apache.org/licenses/LICENSE-2.0
26 /// @tparam I - integer type
27 /// @param engine - random number engine to use
28 /// @param lower - Lower bound of integer generated
29 /// @param upper - Upper bound of integer generated
30 /// @returns i, where lower <= i < upper
32 I RandomUInt(std::mt19937_64* engine, I lower, I upper) { in RandomUInt() argument
33 assert(lower < upper && "|lower| must be stictly less than |upper|"); in RandomUInt()
34 return std::uniform_int_distribution<I>(lower, upper - 1)(*engine); in RandomUInt()
37 /// Helper for obtaining a seed bias value for HashCombine with a bit-width
[all …]
/external/deqp-deps/SPIRV-Tools/test/fuzzers/
Drandom_generator.cpp7 // http://www.apache.org/licenses/LICENSE-2.0
26 /// @tparam I - integer type
27 /// @param engine - random number engine to use
28 /// @param lower - Lower bound of integer generated
29 /// @param upper - Upper bound of integer generated
30 /// @returns i, where lower <= i < upper
32 I RandomUInt(std::mt19937_64* engine, I lower, I upper) { in RandomUInt() argument
33 assert(lower < upper && "|lower| must be stictly less than |upper|"); in RandomUInt()
34 return std::uniform_int_distribution<I>(lower, upper - 1)(*engine); in RandomUInt()
37 /// Helper for obtaining a seed bias value for HashCombine with a bit-width
[all …]
/external/swiftshader/third_party/SPIRV-Tools/test/fuzzers/
Drandom_generator.cpp7 // http://www.apache.org/licenses/LICENSE-2.0
26 /// @tparam I - integer type
27 /// @param engine - random number engine to use
28 /// @param lower - Lower bound of integer generated
29 /// @param upper - Upper bound of integer generated
30 /// @returns i, where lower <= i < upper
32 I RandomUInt(std::mt19937_64* engine, I lower, I upper) { in RandomUInt() argument
33 assert(lower < upper && "|lower| must be stictly less than |upper|"); in RandomUInt()
34 return std::uniform_int_distribution<I>(lower, upper - 1)(*engine); in RandomUInt()
37 /// Helper for obtaining a seed bias value for HashCombine with a bit-width
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DUnicodeCharRanges.h1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
22 /// Represents a closed range of Unicode code points [Lower, Upper].
25 uint32_t Upper; member
32 return Range.Upper < Value;
36 /// to quickly check if a code point is contained in the set represented by this
70 /// [min, max], and if the ranges themselves are ordered and non-overlapping.
75 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
76 LLVM_DEBUG(dbgs() << "Upper bound 0x"); in rangesAreValid()
[all …]
/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/Support/
DUnicodeCharRanges.h1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
22 /// Represents a closed range of Unicode code points [Lower, Upper].
25 uint32_t Upper; member
32 return Range.Upper < Value;
36 /// to quickly check if a code point is contained in the set represented by this
70 /// [min, max], and if the ranges themselves are ordered and non-overlapping.
75 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
76 LLVM_DEBUG(dbgs() << "Upper bound 0x"); in rangesAreValid()
[all …]
/external/autotest/utils/frozen_chromite/third_party/infra_libs/ts_mon/common/
Ddistribution.py2 # Use of this source code is governed by a BSD-style license that can be
18 growth_factor: if non-zero, the size of each bucket increases by another
19 multiplicative factor of this factor (see lower bound formula below).
21 additional buckets - an underflow and an overflow bucket - that have
22 lower and upper bounds of Infinity.
26 Specify a width for fixed-size buckets or specify a growth_factor for bucket
29 For fixed-size buckets::
31 The i'th bucket covers the interval [(i-1) * width, i * width), where i
34 bucket number lower bound upper bound
35 i == 0 (underflow) -inf 0
[all …]
/external/llvm/include/llvm/Support/
DUnicodeCharRanges.h1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===//
8 //===----------------------------------------------------------------------===//
26 /// \brief Represents a closed range of Unicode code points [Lower, Upper].
29 uint32_t Upper; member
36 return Range.Upper < Value;
40 /// to quickly check if a code point is contained in the set represented by this
74 /// [min, max], and if the ranges themselves are ordered and non-overlapping.
79 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
80 DEBUG(dbgs() << "Upper bound 0x"); in rangesAreValid()
82 DEBUG(dbgs() << " should be less than succeeding lower bound 0x"); in rangesAreValid()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
DMullerSolver.java9 * http://www.apache.org/licenses/LICENSE-2.0
36 * @version $Revision: 1070725 $ $Date: 2011-02-15 02:31:12 +0100 (mar. 15 févr. 2011) $
52 super(f, 100, 1E-6); in MullerSolver()
61 super(100, 1E-6); in MullerSolver()
84 * @param min the lower bound for the interval
85 * @param max the upper bound for the interval
108 * @param min the lower bound for the interval
109 * @param max the upper bound for the interval
123 // check for zeros before verifying bracketing in solve()
147 * example, f(x) = exp(x) - 1, min = -50, max = 100. In such case we use
[all …]
DRiddersSolver.java9 * http://www.apache.org/licenses/LICENSE-2.0
31 * Systems, 26 (1979), 979 - 980.
35 * @version $Revision: 1070725 $ $Date: 2011-02-15 02:31:12 +0100 (mar. 15 févr. 2011) $
51 super(f, 100, 1E-6); in RiddersSolver()
60 super(100, 1E-6); in RiddersSolver()
83 * @param min the lower bound for the interval
84 * @param max the upper bound for the interval
106 * @param min the lower bound for the interval
107 * @param max the upper bound for the interval
120 // check for zeros before verifying bracketing in solve()
[all …]
DLaguerreSolver.java9 * http://www.apache.org/licenses/LICENSE-2.0
38 * @version $Revision: 1070725 $ $Date: 2011-02-15 02:31:12 +0100 (mar. 15 févr. 2011) $
61 super(f, 100, 1E-6); in LaguerreSolver()
75 super(100, 1E-6); in LaguerreSolver()
110 * @param min the lower bound for the interval
111 * @param max the upper bound for the interval
134 * @param min the lower bound for the interval
135 * @param max the upper bound for the interval
149 // check for zeros before verifying bracketing in solve()
175 * p(x) = x^3 + 1, min = -2, max = 2, initial = 0. We can either try
[all …]
DUnivariateRealSolverImpl.java9 * http://www.apache.org/licenses/LICENSE-2.0
32 * @version $Revision: 1070725 $ $Date: 2011-02-15 02:31:12 +0100 (mar. 15 févr. 2011) $
84 this.defaultFunctionValueAccuracy = 1.0e-15; in UnivariateRealSolverImpl()
99 this.defaultFunctionValueAccuracy = 1.0e-15; in UnivariateRealSolverImpl()
103 /** Check if a result has been computed.
146 * @param min the lower bound for the interval.
147 * @param max the upper bound for the interval.
169 * @param min the lower bound for the interval.
170 * @param max the upper bound for the interval.
225 * @param upper the upper endpoint
[all …]
/external/swiftshader/third_party/llvm-16.0/llvm/lib/Analysis/
DDependenceAnalysis.cpp1 //===-- DependenceAnalysis.cpp - DA Implementation --------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
19 // or a more-or-less detailed description of the dependence between them.
22 // coupled RDIV subscripts and lacks a multi-subscript MIV test.
27 // analysis is using SCEV->delinearize to recover the representation of multiple
29 // delinearization is controlled by the flag -da-delinearize.
35 // Some non-linear subscript pairs can be handled by the GCD test
46 //===----------------------------------------------------------------------===//
48 // In memory of Ken Kennedy, 1945 - 2007 //
[all …]
/external/rust/crates/regex-syntax/src/hir/
Dinterval.rs46 pub fn new<T: IntoIterator<Item = I>>(intervals: T) -> IntervalSet<I> { in new()
63 pub fn iter(&self) -> IntervalSetIter<'_, I> { in iter()
70 pub fn intervals(&self) -> &[I] { in intervals()
75 /// characters. For example, if this class consists of the range `a-z`,
77 /// ranges `a-z` and `A-Z`.
81 pub fn case_fold_simple(&mut self) -> Result<(), unicode::CaseFoldError> { in case_fold_simple()
111 // There should be a way to do this in-place with constant memory, in intersect()
126 if self.ranges[a].upper() < other.ranges[b].upper() { in intersect()
163 if other.ranges[b].upper() < self.ranges[a].lower() { in difference()
168 // `b` range, then we can add it as-is. in difference()
[all …]
/external/clang/lib/StaticAnalyzer/Checkers/
DArrayBoundCheckerV2.cpp1 //== ArrayBoundCheckerV2.cpp ------------------------------------*- C++ -*--==//
8 //===----------------------------------------------------------------------===//
10 // This file defines ArrayBoundCheckerV2, which is a path-sensitive check
11 // which looks for an out-of-bound array element access.
13 //===----------------------------------------------------------------------===//
30 public Checker<check::Location> {
71 switch (region->getKind()) { in computeExtentBegin()
79 region = cast<SubRegion>(region)->getSuperRegion(); in computeExtentBegin()
107 // CHECK LOWER BOUND: Is byteOffset < extent begin? in checkLocation()
124 state->assume(*lowerBoundToCheck); in checkLocation()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DDependenceAnalysis.cpp1 //===-- DependenceAnalysis.cpp - DA Implementation --------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
19 // or a more-or-less detailed description of the dependence between them.
22 // coupled RDIV subscripts and lacks a multi-subscript MIV test.
27 // analysis is using SCEV->delinearize to recover the representation of multiple
29 // delinearization is controlled by the flag -da-delinearize.
35 // Some non-linear subscript pairs can be handled by the GCD test
46 //===----------------------------------------------------------------------===//
48 // In memory of Ken Kennedy, 1945 - 2007 //
[all …]
/external/googleapis/google/cloud/discoveryengine/v1/
Dcommon.proto7 // http://www.apache.org/licenses/LICENSE-2.0
87 // pricing. To learn more, check the pricing documentation.
99 // Add-on that provides additional functionality for search.
104 // Large language model add-on.
110 // The lower bound of the interval. If neither of the min fields are
111 // set, then the lower bound is negative infinity.
116 // Inclusive lower bound.
119 // Exclusive lower bound.
123 // The upper bound of the interval. If neither of the max fields are
124 // set, then the upper bound is positive infinity.
[all …]
/external/googleapis/google/cloud/discoveryengine/v1beta/
Dcommon.proto7 // http://www.apache.org/licenses/LICENSE-2.0
98 // pricing. To learn more, check the pricing documentation.
110 // Add-on that provides additional functionality for search.
115 // Large language model add-on.
121 // The lower bound of the interval. If neither of the min fields are
122 // set, then the lower bound is negative infinity.
127 // Inclusive lower bound.
130 // Exclusive lower bound.
134 // The upper bound of the interval. If neither of the max fields are
135 // set, then the upper bound is positive infinity.
[all …]
/external/llvm/lib/Analysis/
DDependenceAnalysis.cpp1 //===-- DependenceAnalysis.cpp - DA Implementation --------------*- C++ -*-===//
8 //===----------------------------------------------------------------------===//
20 // or a more-or-less detailed description of the dependence between them.
23 // coupled RDIV subscripts and lacks a multi-subscript MIV test.
29 // analysis is using SCEV->delinearize to recover the representation of multiple
31 // delinearization is controlled by the flag -da-delinearize.
37 // Some non-linear subscript pairs can be handled by the GCD test
48 //===----------------------------------------------------------------------===//
50 // In memory of Ken Kennedy, 1945 - 2007 //
52 //===----------------------------------------------------------------------===//
[all …]

12345678910>>...41