- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 96 for Lankes (0.14 sec)
-
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
return getSubMap(0, keySet.headIndex(checkNotNull(toKey), inclusive)); } /** * This method returns a {@code ImmutableSortedMap}, consisting of the entries whose keys ranges * from {@code fromKey}, inclusive, to {@code toKey}, exclusive. * * <p>The {@link SortedMap#subMap} documentation states that a submap of a submap throws an {@link
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) -
android/guava-tests/test/com/google/common/base/PredicatesTest.java
Predicates.or(Collections.<Predicate<@Nullable Integer>>emptyList()); Predicate<@Nullable Integer> troo = Predicates.or(Collections.singletonList(TRUE)); /* * newLinkedList() takes varargs. TRUE and FALSE are both instances of * Predicate<Integer>, so the call is safe. */ Predicate<@Nullable Integer> trueAndFalse = Predicates.or(Arrays.asList(TRUE, FALSE));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 32.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ShortsTest.java
} @GwtIncompatible // Shorts.fromByteArray, Shorts.toByteArray public void testByteArrayRoundTrips() { Random r = new Random(5); byte[] b = new byte[Shorts.BYTES]; // total overkill, but, it takes 0.1 sec so why not... for (int i = 0; i < 10000; i++) { short num = (short) r.nextInt(); assertThat(Shorts.fromByteArray(Shorts.toByteArray(num))).isEqualTo(num); r.nextBytes(b);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 26.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* Benchmarks (as of December 2011) show that: * * <ul> * <li>for an unnested {@code lock()} and {@code unlock()}, a cycle detecting lock takes 38ns as * opposed to the 24ns taken by a plain lock. * <li>for nested locking, the cost increases with the depth of the nesting: * <ul> * <li>2 levels: average of 64ns per lock()/unlock()
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
* elements are in the first {@code k} positions of {@code contents}, and {@code contents[i] == * null} for {@code k <= i < n}. * * <p>This method takes ownership of {@code contents}; do not modify {@code contents} after this * returns. * * @throws NullPointerException if any of the first {@code n} elements of {@code contents} is null */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableRangeSet.java
ImmutableRangeSet(ImmutableList<Range<C>> ranges) { this.ranges = ranges; } private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { this.ranges = ranges; this.complement = complement; } private final transient ImmutableList<Range<C>> ranges; @Override public boolean intersects(Range<C> otherRange) { int ceilingIndex = SortedLists.binarySearch(
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 26.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
ImmutableRangeSet(ImmutableList<Range<C>> ranges) { this.ranges = ranges; } private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { this.ranges = ranges; this.complement = complement; } private final transient ImmutableList<Range<C>> ranges; @Override public boolean intersects(Range<C> otherRange) { int ceilingIndex = SortedLists.binarySearch(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeSet.java
/** * A set comprising zero or more {@linkplain Range#isEmpty nonempty}, {@linkplain * Range#isConnected(Range) disconnected} ranges of type {@code C}. * * <p>Implementations that choose to support the {@link #add(Range)} operation are required to * ignore empty ranges and coalesce connected ranges. For example: * * <pre>{@code * RangeSet<Integer> rangeSet = TreeRangeSet.create(); * rangeSet.add(Range.closed(1, 10)); // {[1, 10]}
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/collect/ImmutableRangeMap.java
} else { Range<K> range = ranges.get(index); return range.contains(key) ? Maps.immutableEntry(range, values.get(index)) : null; } } @Override public Range<K> span() { if (ranges.isEmpty()) { throw new NoSuchElementException(); } Range<K> firstRange = ranges.get(0); Range<K> lastRange = ranges.get(ranges.size() - 1);
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-tests/test/com/google/common/collect/AbstractRangeSetTest.java
// test that connected ranges are coalesced for (int i = 0; i + 1 < asRanges.size(); i++) { Range<C> range1 = asRanges.get(i); Range<C> range2 = asRanges.get(i + 1); assertFalse(range1.isConnected(range2)); } // test that there are no empty ranges for (Range<C> range : asRanges) { assertFalse(range.isEmpty()); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 20:09:59 GMT 2024 - 2.6K bytes - Viewed (0)