- Sort Score
- Result 10 results
- Languages All
Results 11 - 15 of 15 for cinkeys (0.17 sec)
-
guava/src/com/google/common/collect/ImmutableMultimap.java
public ImmutableMultimap<K, V> build() { Collection<Map.Entry<K, Collection<V>>> mapEntries = builderMap.entrySet(); if (keyComparator != null) { mapEntries = Ordering.from(keyComparator).<K>onKeys().immutableSortedCopy(mapEntries); } return ImmutableListMultimap.fromMapEntries(mapEntries, valueComparator); } } /**
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 25.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
public <F extends @Nullable Object> Ordering<F> onResultOf(Function<F, ? extends T> function) { return new ByFunctionOrdering<>(function, this); } <T2 extends T> Ordering<Entry<T2, ?>> onKeys() { return onResultOf(Maps.<T2>keyFunction()); } /** * Returns an ordering which first uses the ordering {@code this}, but which in the event of a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TreeRangeMapTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 20:09:59 GMT 2024 - 33.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSet.java
return CollectCollectors.toImmutableSet(); } /** * Returns the empty immutable set. Preferred over {@link Collections#emptySet} for code * consistency, and because the return type conveys the immutability guarantee. * * <p><b>Performance note:</b> the instance returned is a singleton. */ @SuppressWarnings({"unchecked"}) // fully variant implementation (never actually produces any Es)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ConcurrentHashMultisetBasherTest.java
} @Override public int[] call() throws Exception { int iterations = 100000; int nKeys = keys.size(); int[] deltas = new int[nKeys]; Operation[] operations = Operation.values(); for (int i = 0; i < iterations; i++) { int keyIndex = random.nextInt(nKeys); String key = keys.get(keyIndex); Operation op = operations[random.nextInt(operations.length)];
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.8K bytes - Viewed (0)