- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 61 for tale (0.13 sec)
-
guava-tests/test/com/google/common/collect/AbstractTableTest.java
assertEquals(2, table.size()); assertEquals((Character) 'a', table.get("foo", 1)); assertEquals((Character) 'b', table.get("bar", 1)); assertNull(table.get("foo", 3)); assertNull(table.remove(null, 1)); assertNull(table.remove("foo", null)); assertNull(table.remove(null, null)); assertSize(2); } else { try { table.remove("foo", 3);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 16:54:11 GMT 2024 - 6K bytes - Viewed (0) -
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-tests/test/com/google/common/collect/HashBasedTableTest.java
@Override protected Table<String, Integer, Character> create(@Nullable Object... data) { Table<String, Integer, Character> table = HashBasedTable.create(); table.put("foo", 4, 'a'); table.put("cat", 1, 'b'); table.clear(); populate(table, data); return table; } public void testIterationOrder() { Table<String, String, String> table = HashBasedTable.create();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 16:54:11 GMT 2024 - 3.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TablesTransformValuesTest.java
} }; @Override protected Table<String, Integer, Character> create(@Nullable Object... data) { Table<String, Integer, String> table = HashBasedTable.create(); checkArgument(data.length % 3 == 0); for (int i = 0; i < data.length; i += 3) { String value = (data[i + 2] == null) ? null : (data[i + 2] + "transformed"); table.put((String) data[i], (Integer) data[i + 1], value); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 16:54:11 GMT 2024 - 3.1K 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-tests/test/com/google/common/collect/EnumMultisetTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 16:35:21 GMT 2024 - 5.8K 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/hash/Hashing.java
* generated using this are byte-wise identical to those created using the C++ version, but note * that this uses unsigned integers (see {@link com.google.common.primitives.UnsignedInts}). * Comparisons between the two should take this into account. * * <p>Fingerprint2011() is a form of Murmur2 on strings up to 32 bytes and a form of CityHash for * longer strings. It could have been one or the other throughout. The main advantage of the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0)