- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 228 for Upper (0.48 sec)
-
guava/src/com/google/common/collect/ContiguousSet.java
* (inclusive) to {@code upper} (inclusive). (These are the same values contained in {@code * Range.closed(lower, upper)}.) * * @throws IllegalArgumentException if {@code lower} is greater than {@code upper} * @since 23.0 */ public static ContiguousSet<Integer> closed(int lower, int upper) { return create(Range.closed(lower, upper), DiscreteDomain.integers()); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Nov 30 21:54:06 UTC 2023 - 9.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ContiguousSet.java
* (inclusive) to {@code upper} (inclusive). (These are the same values contained in {@code * Range.closed(lower, upper)}.) * * @throws IllegalArgumentException if {@code lower} is greater than {@code upper} * @since 23.0 */ public static ContiguousSet<Integer> closed(int lower, int upper) { return create(Range.closed(lower, upper), DiscreteDomain.integers()); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Nov 30 21:54:06 UTC 2023 - 9.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Range.java
* or equal to {@code upper}. * * @throws IllegalArgumentException if {@code lower} is greater than {@code upper} * @throws ClassCastException if {@code lower} and {@code upper} are not mutually comparable * @since 14.0 */ public static <C extends Comparable<?>> Range<C> closed(C lower, C upper) { return create(Cut.belowValue(lower), Cut.aboveValue(upper)); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
src/strconv/ftoa.go
// Walk along until d has distinguished itself from upper and lower. for ui := 0; ; ui++ { // lower, d, and upper may have the decimal points at different // places. In this case upper is the longest, so we iterate from // ui==0 and start li and mi at (possibly) -1. mi := ui - upper.dp + d.dp if mi >= d.nd { break } li := ui - upper.dp + lower.dp l := byte('0') // lower digit
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:28 UTC 2024 - 13.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedLists.java
// breakpoint... int lower = foundIndex; int upper = list.size() - 1; // Everything between lower and upper inclusive compares at >= 0. while (lower < upper) { int middle = (lower + upper + 1) >>> 1; int c = comparator.compare(list.get(middle), key); if (c > 0) { upper = middle - 1; } else { // c == 0 lower = middle; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/SortedLists.java
// breakpoint... int lower = foundIndex; int upper = list.size() - 1; // Everything between lower and upper inclusive compares at >= 0. while (lower < upper) { int middle = (lower + upper + 1) >>> 1; int c = comparator.compare(list.get(middle), key); if (c > 0) { upper = middle - 1; } else { // c == 0 lower = middle; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Range.java
* or equal to {@code upper}. * * @throws IllegalArgumentException if {@code lower} is greater than {@code upper} * @throws ClassCastException if {@code lower} and {@code upper} are not mutually comparable * @since 14.0 */ public static <C extends Comparable<?>> Range<C> closed(C lower, C upper) { return create(Cut.belowValue(lower), Cut.aboveValue(upper)); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
src/unicode/letter.go
delta := cr.Delta[_case] if delta > MaxRune { // In an Upper-Lower sequence, which always starts with // an UpperCase letter, the real deltas always look like: // {0, 1, 0} UpperCase (Lower is next) // {-1, 0, -1} LowerCase (Upper, Title are previous) // The characters at even offsets from the beginning of the // sequence are upper case; the ones at odd offsets are lower.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0) -
maven-artifact/src/main/java/org/apache/maven/artifact/versioning/VersionRange.java
upper = res2.getUpperBound(); upperInclusive = res2.isUpperBoundInclusive(); } } // don't add if they are equal and one is not inclusive if (lower == null || upper == null || lower.compareTo(upper) != 0) { restrictions.add(new Restriction(lower, lowerInclusive, upper, upperInclusive));
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Feb 28 07:40:37 UTC 2024 - 18.9K bytes - Viewed (0) -
src/math/big/ftoa.go
// 2) Compute lower bound by subtracting 1/2 ulp. var lower decimal var tmp nat lower.init(tmp.sub(mant, natOne), exp) // 3) Compute upper bound by adding 1/2 ulp. var upper decimal upper.init(tmp.add(mant, natOne), exp) // The upper and lower bounds are possible outputs only if // the original mantissa is even, so that ToNearestEven rounding // would round to the original mantissa and not the neighbors.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 13.5K bytes - Viewed (0)