- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 1,970 for keys (0.17 sec)
-
android/guava/src/com/google/common/collect/MultimapBuilder.java
} /** * Uses a hash table to map keys to value collections. * * <p>The collections returned by {@link Multimap#keySet()}, {@link Multimap#keys()}, and {@link * Multimap#asMap()} will iterate through the keys in the order that they were first added to the * multimap, save that if all values associated with a key are removed and then the key is added * back into the multimap, that key will come last in the key iteration order. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 17.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultimap.java
* according to the value ordering. * * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an * existing key-value pair has no effect. * * <p>Null keys and values are permitted (provided, of course, that the respective comparators * support them). All optional multimap methods are supported, and all returned views are * modifiable. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Mar 09 00:21:17 GMT 2024 - 8.7K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/testers/MapReplaceAllTester.java
getMap() .replaceAll( (K k, V v) -> { int index = keys().asList().indexOf(k); return values().asList().get(index + 1); }); List<Entry<K, V>> orderedEntries = getOrderedElements(); int index = 0; for (K key : getMap().keySet()) { assertEquals(orderedEntries.get(index).getKey(), key); index++; } } @MapFeature.Require(absent = SUPPORTS_PUT)
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 4.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
int minIndex = 0; for (int i = 1; i < keys.size(); i++) { if (keys.get(i) < keys.get(minIndex)) { minIndex = i; } } Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex)); Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size())); return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild)); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Table.java
/** * A collection that associates an ordered pair of keys, called a row key and a column key, with a * single value. A table may be sparse, with only a small fraction of row key / column key pairs * possessing a corresponding value. * * <p>The mappings corresponding to a given row key may be viewed as a {@link Map} whose keys are * the columns. The reverse is also available, associating a column with a row key / value map. Note
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 10.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMaker.java
* interface. It does not permit null keys or values. * * <p><b>Note:</b> by default, the returned map uses equality comparisons (the {@link Object#equals * equals} method) to determine equality for keys or values. However, if {@link #weakKeys} was * specified, the map uses identity ({@code ==}) comparisons instead for keys. Likewise, if {@link
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 13 14:30:51 GMT 2023 - 12.8K bytes - Viewed (0) -
docs/security/README.md
- `DecryptKey`: Takes a key ID and an encrypted data key and returns the plain data key - the decryption of the encrypted data key using the master key referenced by the key ID - on success or an error otherwise.
Plain Text - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Sat Feb 12 00:51:25 GMT 2022 - 13.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBasedTable.java
* Null row keys, columns keys, and values are not supported. * * <p>Lookups by row key are often faster than lookups by column key, because the data is stored in * a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs * quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer,
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jan 24 17:47:51 GMT 2022 - 4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/PopulatedCachesTest.java
.addEqualityGroup(cache.asMap().keySet(), keys) .addEqualityGroup(ImmutableSet.of()) .testEquals(); assertEquals(WARMUP_SIZE, keys.size()); for (int i = WARMUP_MIN; i < WARMUP_MAX; i++) { Object key = warmed.get(i - WARMUP_MIN).getKey(); assertTrue(keys.contains(key)); assertTrue(keys.remove(key)); assertFalse(keys.remove(key)); assertFalse(keys.contains(key));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 15K bytes - Viewed (0) -
guava/src/com/google/common/collect/ArrayTable.java
* either key is null or isn't among the keys provided during construction, this method has no * effect. * * <p>This method is equivalent to {@code put(rowKey, columnKey, null)} when both provided keys * are valid. * * @param rowKey row key of mapping to be erased * @param columnKey column key of mapping to be erased
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 26.9K bytes - Viewed (0)