- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 53 for hack (0.15 sec)
-
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
* @throws NullPointerException if any of {@code elements} is null */ public static <E> ImmutableSortedSet<E> copyOf(Iterable<? extends E> elements) { // Hack around E not being a subtype of Comparable. // Unsafe, see ImmutableSortedSetFauxverideShim. @SuppressWarnings("unchecked") Ordering<E> naturalOrder = (Ordering<E>) Ordering.<Comparable<?>>natural();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
* @throws NullPointerException if any of {@code elements} is null */ public static <E> ImmutableSortedSet<E> copyOf(Iterable<? extends E> elements) { // Hack around E not being a subtype of Comparable. // Unsafe, see ImmutableSortedSetFauxverideShim. @SuppressWarnings("unchecked") Ordering<E> naturalOrder = (Ordering<E>) Ordering.<Comparable<?>>natural();
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 38.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMultiset.java
* @throws NullPointerException if any of {@code elements} is null */ public static <E> ImmutableSortedMultiset<E> copyOf(Iterable<? extends E> elements) { // Hack around E not being a subtype of Comparable. // Unsafe, see ImmutableSortedMultisetFauxverideShim. @SuppressWarnings("unchecked") Ordering<E> naturalOrder = (Ordering<E>) Ordering.<Comparable<?>>natural();
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 29.6K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InetAddresses.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 44K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
alternatingKeysAndValues[previousKeyIndex ^ 1] = value; continue entries; } } if (outI < i) { // if outI == i don't bother writing the values back where they came from alternatingKeysAndValues[outKeyIndex] = key; alternatingKeysAndValues[outKeyIndex ^ 1] = value; } outI++; }
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/base/Throwables.java
* throwable.getStackTrace()}. Note, however, that this method's special implementation is not * available for all platforms and configurations. If that implementation is unavailable, this * method falls back to {@code getStackTrace}. Callers that require the special implementation can * check its availability with {@link #lazyStackTraceIsLazy()}. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/Types.java
static Class<?> getArrayClass(Class<?> componentType) { // TODO(user): This is not the most efficient way to handle generic // arrays, but is there another way to extract the array class in a // non-hacky way (i.e. using String value class names- "[L...")? return Array.newInstance(componentType, 0).getClass(); } // TODO(benyu): Once behavior is the same for all Java versions we support, delete this.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Throwables.java
* throwable.getStackTrace()}. Note, however, that this method's special implementation is not * available for all platforms and configurations. If that implementation is unavailable, this * method falls back to {@code getStackTrace}. Callers that require the special implementation can * check its availability with {@link #lazyStackTraceIsLazy()}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
* {@code asMap} has a few subtleties. As long as the set of keys remains unchanged, adding or * removing mappings does not affect the key iteration order. However, if you remove all values * associated with a key and then add the key back to the multimap, that key will come last in the * key iteration order. * * <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. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* up to give roundArbitrarily equal to 2^63, so the conversion back to long overflows and * roundArbitrarilyAsLong is Long.MAX_VALUE. (This is the only way this condition can occur as * otherwise the conversion back to long pads with zero bits.) In this case we know that * roundArbitrarily > x. (This is important when x == Long.MAX_VALUE ==
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)