- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 114 for Lower (0.2 sec)
-
android/guava/src/com/google/common/collect/ForwardingNavigableSet.java
@Override @CheckForNull public E lower(@ParametricNullness E e) { return delegate().lower(e); } /** * A sensible definition of {@link #lower} in terms of the {@code descendingIterator} method of * {@link #headSet(Object, boolean)}. If you override {@link #headSet(Object, boolean)}, you may * wish to override {@link #lower} to forward to this implementation. */ @CheckForNull
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri May 12 15:26:39 GMT 2023 - 9K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/AppendableWriterTest.java
StringBuilder builder = new StringBuilder(); Writer writer = new AppendableWriter(builder); writer.write("Hello".toCharArray()); writer.write(','); writer.write(0xBEEF0020); // only lower 16 bits are important writer.write("Wo"); writer.write("Whirled".toCharArray(), 3, 2); writer.write("Mad! Mad, I say", 2, 2); assertEquals("Hello, World!", builder.toString()); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeSet.java
* firstComplementRangeLowerBound is the first complement range lower bound inside * complementLowerBoundWindow. Complement range lower bounds are either positive range upper * bounds, or Cut.belowAll(). * * positiveItr starts at the first positive range with lower bound greater than * firstComplementRangeLowerBound. (Positive range lower bounds correspond to complement range * upper bounds.)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 32.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeSet.java
* of upper bound). */ Set<Range<C>> asRanges(); /** * Returns a descending view of the {@linkplain Range#isConnected disconnected} ranges that make * up this range set. The returned set may be empty. The iterators returned by its {@link * Iterable#iterator} method return the ranges in decreasing order of lower bound (equivalently, * of upper bound).
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 9.8K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/Types.java
WildcardType wildcard = (WildcardType) componentType; Type[] lowerBounds = wildcard.getLowerBounds(); checkArgument(lowerBounds.length <= 1, "Wildcard cannot have more than one lower bounds."); if (lowerBounds.length == 1) { return supertypeOf(newArrayType(lowerBounds[0])); } else { Type[] upperBounds = wildcard.getUpperBounds();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeMap.java
int index = SortedLists.binarySearch( ranges, Range::lowerBound, Cut.belowValue(key), KeyPresentBehavior.ANY_PRESENT, KeyAbsentBehavior.NEXT_LOWER); if (index == -1) { return null; } else { Range<K> range = ranges.get(index); return range.contains(key) ? values.get(index) : null; } } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 14.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSortedSet.java
} @Override public E last() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(size() - 1); } @Override @CheckForNull public E lower(E element) { int index = headIndex(element, false) - 1; return (index == -1) ? null : elements.get(index); } @Override @CheckForNull public E floor(E element) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SortedListsTest.java
// key is not present int nextHigherIndex = list.size(); for (int i = list.size() - 1; i >= 0 && list.get(i) > key; i--) { nextHigherIndex = i; } switch (absentBehavior) { case NEXT_LOWER: assertEquals(nextHigherIndex - 1, answer); return; case NEXT_HIGHER: assertEquals(nextHigherIndex, answer); return; case INVERTED_INSERTION_INDEX:
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 4.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/DescendingImmutableSortedSet.java
} @Override @GwtIncompatible("NavigableSet") ImmutableSortedSet<E> createDescendingSet() { throw new AssertionError("should never be called"); } @Override @CheckForNull public E lower(E element) { return forward.higher(element); } @Override @CheckForNull public E floor(E element) { return forward.ceiling(element); } @Override @CheckForNull
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 3.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/escape/UnicodeEscaperTest.java
// Pass } } } public void testFalsePositivesForNextEscapedIndex() { UnicodeEscaper e = new UnicodeEscaper() { // Canonical escaper method that only escapes lower case ASCII letters. @Override protected char @Nullable [] escape(int cp) { return ('a' <= cp && cp <= 'z') ? new char[] {Character.toUpperCase((char) cp)} : null; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 6.2K bytes - Viewed (0)