- Sort Score
- Result 10 results
- Languages All
Results 21 - 23 of 23 for BinarySearch (0.15 sec)
-
guava/src/com/google/common/base/CharMatcher.java
checkArgument(rangeEnds[i] < rangeStarts[i + 1]); } } } @Override public boolean matches(char c) { int index = Arrays.binarySearch(rangeStarts, c); if (index >= 0) { return true; } else { index = ~index - 1; return index >= 0 && c <= rangeEnds[index]; } } @Override
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.8K bytes - Viewed (0) -
api/go1.21.txt
pkg runtime, method (*Pinner) Pin(interface{}) #46787 pkg runtime, method (*Pinner) Unpin() #46787 pkg runtime, type PanicNilError struct #25448 pkg runtime, type Pinner struct #46787 pkg slices, func BinarySearch[$0 interface{ ~[]$1 }, $1 cmp.Ordered]($0, $1) (int, bool) #60091 pkg slices, func BinarySearchFunc[$0 interface{ ~[]$1 }, $1 interface{}, $2 interface{}]($0, $2, func($1, $2) int) (int, bool) #60091
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Mon Aug 07 09:39:17 GMT 2023 - 25.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
} // requireNonNull is safe because the first `size` elements have been filled in. // We're careful to put only K instances in. int index = Arrays.binarySearch((K[]) sortedKeys, (K) requireNonNull(keys[i]), comparator); sortedValues[index] = requireNonNull(values[i]); } return new ImmutableSortedMap<K, V>(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0)