- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for mention (0.23 sec)
-
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* eliminate duplicate keys (for buildKeepingLast()) then we have to ensure that a later call to * buildOrThrow() will still throw as if the duplicates had not been eliminated. And the exception * message must mention two values that were associated with the duplicate key in two different * calls to Builder.put (though we don't really care *which* two values if there were more than
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) -
guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* * <p>If you are designing a new system that needs HMAC, prefer {@link #hmacSha256} or other * future-proof algorithms <a * href="https://datatracker.ietf.org/doc/html/rfc6151#section-2.3">over {@code hmacMd5}</a>. * * @param key the secret key * @throws IllegalArgumentException if the given key is inappropriate for initializing this MAC * @since 20.0 */
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) -
android/guava/src/com/google/common/collect/ImmutableSetMultimap.java
* whose keys and values are the result of applying the provided mapping functions to the input * elements. * * <p>For streams with defined encounter order (as defined in the Ordering section of the {@link * java.util.stream} Javadoc), that order is preserved, but entries are <a * href="ImmutableMultimap.html#iteration">grouped by key</a>. * * <p>Example: * * <pre>{@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/io/BaseEncoding.java
/** * The "base64" base encoding specified by <a * href="http://tools.ietf.org/html/rfc4648#section-4">RFC 4648 section 4</a>, Base 64 Encoding. * (This is the same as the base 64 encoding from <a * href="http://tools.ietf.org/html/rfc3548#section-3">RFC 3548</a>.) * * <p>The character {@code '='} is used for padding, but can be {@linkplain #omitPadding()
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Mar 15 16:33:32 GMT 2024 - 41.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
// places left to rotate. int m = -distance % length; m = (m < 0) ? m + length : m; // The current index of what will become the first element of the rotated section. int newFirstIndex = m + fromIndex; if (newFirstIndex == fromIndex) { return; } reverse(array, fromIndex, newFirstIndex); reverse(array, newFirstIndex, toIndex);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 25.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Doubles.java
// places left to rotate. int m = -distance % length; m = (m < 0) ? m + length : m; // The current index of what will become the first element of the rotated section. int newFirstIndex = m + fromIndex; if (newFirstIndex == fromIndex) { return; } reverse(array, fromIndex, newFirstIndex); reverse(array, newFirstIndex, toIndex);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 27.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableListMultimap.java
* whose keys and values are the result of applying the provided mapping functions to the input * elements. * * <p>For streams with defined encounter order (as defined in the Ordering section of the {@link * java.util.stream} Javadoc), that order is preserved, but entries are <a * href="ImmutableMultimap.html#iteration">grouped by key</a>. * * <p>Example: * * <pre>{@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 17.6K bytes - Viewed (0) -
android/guava/src/com/google/common/net/HttpHeaders.java
/** The HTTP {@code Host} header field name. */ public static final String HOST = "Host"; /** * The HTTP <a href="https://tools.ietf.org/html/rfc7540#section-3.2.1">{@code HTTP2-Settings} * </a> header field name. * * @since 24.0 */ public static final String HTTP2_SETTINGS = "HTTP2-Settings"; /** The HTTP {@code If-Match} header field name. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:08:08 GMT 2024 - 34.3K bytes - Viewed (0)