- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 48 for Towers (0.49 sec)
-
android/guava-testlib/src/com/google/common/collect/testing/SafeTreeSet.java
public Iterator<E> iterator() { return delegate.iterator(); } @Override public E last() { return delegate.last(); } @Override public @Nullable E lower(E e) { return delegate.lower(checkValid(e)); } @Override public @Nullable E pollFirst() { return delegate.pollFirst(); } @Override public @Nullable E pollLast() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 5.8K bytes - Viewed (0) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.7K 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/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) -
guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
assertSame(testEquivalence, map.keyEquivalence); assertSame(map.valueStrength().defaultEquivalence(), map.valueEquivalence()); } public void testSetConcurrencyLevel() { // round up to the nearest power of two checkConcurrencyLevel(1, 1); checkConcurrencyLevel(2, 2); checkConcurrencyLevel(3, 4); checkConcurrencyLevel(4, 4); checkConcurrencyLevel(5, 8); checkConcurrencyLevel(6, 8);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
assertSame(testEquivalence, map.keyEquivalence); assertSame(map.valueStrength().defaultEquivalence(), map.valueEquivalence()); } public void testSetConcurrencyLevel() { // round up to the nearest power of two checkConcurrencyLevel(1, 1); checkConcurrencyLevel(2, 2); checkConcurrencyLevel(3, 4); checkConcurrencyLevel(4, 4); checkConcurrencyLevel(5, 8); checkConcurrencyLevel(6, 8);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* save that if that location is already full, we try the next index, and the next, until we * find an empty table position. Since the table has a power-of-two size, we use * & (table.length - 1) instead of % table.length, though. */ @CheckForNull private final transient Object hashTable;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
static StringBuilder newStringBuilderForCollection(int size) { checkNonnegative(size, "size"); return new StringBuilder((int) Math.min(size * 8L, Ints.MAX_POWER_OF_TWO)); } /** * Returns a {@link Collection} of all the permutations of the specified {@link Iterable}. * * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeRangeMapTest.java
rangeMap.put(Range.closedOpen(18, 19), 3); rangeMap.putCoalescing(Range.closedOpen(-5, -4), 0); // disconnected rangeMap.putCoalescing(Range.closedOpen(-6, -5), 0); // lower than minimum rangeMap.putCoalescing(Range.closedOpen(2, 4), 1); // between rangeMap.putCoalescing(Range.closedOpen(9, 14), 0); // different value rangeMap.putCoalescing(Range.closedOpen(17, 20), 3); // enclosing
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 20:09:59 GMT 2024 - 28K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
ValueSet(@ParametricNullness K key, int expectedValues) { this.key = key; this.firstEntry = this; this.lastEntry = this; // Round expected values up to a power of 2 to get the table size. int tableSize = Hashing.closedTableSize(expectedValues, VALUE_SET_LOAD_FACTOR); @SuppressWarnings({"rawtypes", "unchecked"}) @Nullable
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0)