- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 169 for caster (0.19 sec)
-
android/guava/src/com/google/common/collect/Multimaps.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 86.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
* very efficient. May be useful for calling code to fall back on an alternative implementation * that is slower than Unsafe.get/store but faster than the pure-Java mask-and-shift. */ static boolean usingUnsafe() { return (byteArray instanceof UnsafeByteArray); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLong.java
import java.math.BigInteger; import javax.annotation.CheckForNull; /** * A wrapper class for unsigned {@code long} values, supporting arithmetic operations. * * <p>In some cases, when speed is more important than code readability, it may be faster simply to * treat primitive {@code long} values as unsigned, using the methods from {@link UnsignedLongs}. * * <p>See the Guava User Guide article on <a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 22 13:09:25 GMT 2021 - 8.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Chars.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(char[] array, int distance) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/io/Files.java
* defined by the {@code java.io.tmpdir} system property), and returns its name. * * <p>The temporary directory is created with permissions restricted to the current user or, in * the case of Android, the current app. If that is not possible (as is the case under the very * old Android Ice Cream Sandwich release), then this method throws an exception instead of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 33.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeBasedTable.java
* iterators that don't support {@code remove()}. Otherwise, all optional operations are supported. * 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
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 11.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/util/concurrent/testing/TestingExecutors.java
* {@code schedule}, {@code scheduleAtFixedRate}, and {@code scheduleWithFixedDelay}. In the case * of tasks submitted by {@code invokeAll} or {@code invokeAny}, tasks will run serially on the * calling thread. Tasks are run to completion before a {@code Future} is returned to the caller * (unless the executor has been shutdown). * * <p>The returned executor is backed by the executor returned by {@link
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri May 26 22:04:00 GMT 2023 - 6.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashing.java
* then we should have {@code 0 ≤ entry ≤ 255}, and if {@code table} is a {@code short[]} then we * should have {@code 0 ≤ entry ≤ 65535}. It is the caller's responsibility to ensure this. */ static void tableSet(Object table, int index, int entry) { if (table instanceof byte[]) { ((byte[]) table)[index] = (byte) entry; // unsigned write
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashing.java
* then we should have {@code 0 ≤ entry ≤ 255}, and if {@code table} is a {@code short[]} then we * should have {@code 0 ≤ entry ≤ 65535}. It is the caller's responsibility to ensure this. */ static void tableSet(Object table, int index, int entry) { if (table instanceof byte[]) { ((byte[]) table)[index] = (byte) entry; // unsigned write
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Ints.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(int[] array, int distance) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0)