- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 15 for Barros (0.17 sec)
-
guava/src/com/google/common/collect/ImmutableListMultimap.java
* href="ImmutableMultimap.html#iteration">grouped by key</a>. * * <p>Example: * * <pre>{@code * static final Multimap<Character, String> FIRST_LETTER_MULTIMAP = * Stream.of("banana", "apple", "carrot", "asparagus", "cherry") * .collect(toImmutableListMultimap(str -> str.charAt(0), str -> str.substring(1))); * * // is equivalent to * * static final Multimap<Character, String> FIRST_LETTER_MULTIMAP =
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Aug 24 01:40:03 GMT 2023 - 17.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSetMultimap.java
* href="ImmutableMultimap.html#iteration">grouped by key</a>. * * <p>Example: * * <pre>{@code * static final Multimap<Character, String> FIRST_LETTER_MULTIMAP = * Stream.of("banana", "apple", "carrot", "asparagus", "cherry") * .collect(toImmutableSetMultimap(str -> str.charAt(0), str -> str.substring(1))); * * // is equivalent to * * static final Multimap<Character, String> FIRST_LETTER_MULTIMAP =
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSetMultimap.java
* href="ImmutableMultimap.html#iteration">grouped by key</a>. * * <p>Example: * * <pre>{@code * static final Multimap<Character, String> FIRST_LETTER_MULTIMAP = * Stream.of("banana", "apple", "carrot", "asparagus", "cherry") * .collect(toImmutableSetMultimap(str -> str.charAt(0), str -> str.substring(1))); * * // is equivalent to * * static final Multimap<Character, String> FIRST_LETTER_MULTIMAP =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableListMultimap.java
* href="ImmutableMultimap.html#iteration">grouped by key</a>. * * <p>Example: * * <pre>{@code * static final Multimap<Character, String> FIRST_LETTER_MULTIMAP = * Stream.of("banana", "apple", "carrot", "asparagus", "cherry") * .collect(toImmutableListMultimap(str -> str.charAt(0), str -> str.substring(1))); * * // is equivalent to * * static final Multimap<Character, String> FIRST_LETTER_MULTIMAP =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 08 18:58:42 GMT 2023 - 17.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
/* * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation. * * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6, * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2. */ int y = maxLog10ForLeadingZeros[Integer.numberOfLeadingZeros(x)];
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimaps.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 86.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableListMultimapTest.java
.putAll('c', Arrays.asList('h', 'e', 'r', 'r', 'y')) .build(); CollectorTester.of(collector, equivalence) .expectCollects(empty) .expectCollects(filled, "banana", "apple", "carrot", "asparagus", "cherry"); } public void testEmptyMultimapReads() { Multimap<String, Integer> multimap = ImmutableListMultimap.of(); assertFalse(multimap.containsKey("foo"));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
* e ---- c ---- f * }</pre> */ private static final SuccessorsFunction<Character> JAVADOC_GRAPH = createUndirectedGraph("ba", "ad", "be", "ac", "ec", "cf"); /** * A diamond shaped directed graph (arrows going down): * * <pre>{@code * a * / \ * b c * \ / * d * }</pre> */ private static final SuccessorsFunction<Character> DIAMOND_GRAPH =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
* e ---- c ---- f * }</pre> */ private static final SuccessorsFunction<Character> JAVADOC_GRAPH = createUndirectedGraph("ba", "ad", "be", "ac", "ec", "cf"); /** * A diamond shaped directed graph (arrows going down): * * <pre>{@code * a * / \ * b c * \ / * d * }</pre> */ private static final SuccessorsFunction<Character> DIAMOND_GRAPH =
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
/* * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation. * * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6, * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2. */ int y = maxLog10ForLeadingZeros[Long.numberOfLeadingZeros(x)];
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0)