- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 36 for Cable (0.13 sec)
-
android/guava-tests/test/com/google/common/collect/TreeBasedTableTest.java
table.put("cat", 1, 'b'); table.clear(); populate(table, data); return table; } public void testCreateExplicitComparators() { table = TreeBasedTable.create(Collections.reverseOrder(), Ordering.usingToString()); table.put("foo", 3, 'a'); table.put("foo", 12, 'b'); table.put("bar", 5, 'c'); table.put("cat", 8, 'd');
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TableCollectors.java
final Table<R, C, MutableCell<R, C, V>> table = HashBasedTable.create(); void put(R row, C column, V value, BinaryOperator<V> merger) { MutableCell<R, C, V> oldCell = table.get(row, column); if (oldCell == null) { MutableCell<R, C, V> cell = new MutableCell<>(row, column, value); insertionOrder.add(cell); table.put(row, column, cell); } else {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Mar 09 00:21:17 GMT 2024 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length], * 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) -
android/guava-testlib/src/com/google/common/testing/FreshValueGenerator.java
} @Generates static <R, C, V> Table<R, C, V> generateTable(R row, C column, V value) { return generateHashBasedTable(row, column, value); } @Generates static <R, C, V> HashBasedTable<R, C, V> generateHashBasedTable(R row, C column, V value) { HashBasedTable<R, C, V> table = HashBasedTable.create(); table.put(row, column, value); return table; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 28K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* function doing a good job of distributing the elements to the buckets to a distribution not far * from uniform), and amortized since some operations can trigger a hash table resize. * * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/Types.java
* UnsupportedOperationException}; this should only apply to {@code getAnnotatedBounds()}. This * does mean that users on Java 8 who obtain an instance of {@code TypeVariable} from {@link * TypeResolver#resolveType} will not be able to call {@code getAnnotatedBounds()} on it, but that * should hopefully be rare. * * <p>TODO(b/147144588): We are currently also missing the methods inherited from {@link
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) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* MultiExceptionListIterator. Because we're inside an * AbstractIteratorTester<E>, that's implicitly a cast to * AbstractIteratorTester<E>.MultiExceptionListIterator. The runtime * won't be able to verify the AbstractIteratorTester<E> part, so it's * an unchecked cast. We know, however, that the only possible value for * the type parameter is <E>, since otherwise the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
* doesn't need this suppression, but we keep it to minimize diffs.) Generally be more clear * about when we have an Object[] vs. a Comparable[] or other array type in internalArray? If we * used Object[], we might be able to optimize toArray() to use clone() sometimes. (See * cl/592273615 and cl/592273683.) */ @SuppressWarnings("unchecked") public Builder(Comparator<? super E> comparator) {
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) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
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) -
guava-tests/test/com/google/common/collect/TreeBasedTableTest.java
table.put("cat", 1, 'b'); table.clear(); populate(table, data); return table; } public void testCreateExplicitComparators() { table = TreeBasedTable.create(Collections.reverseOrder(), Ordering.usingToString()); table.put("foo", 3, 'a'); table.put("foo", 12, 'b'); table.put("bar", 5, 'c'); table.put("cat", 8, 'd');
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 15K bytes - Viewed (0)