- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 39 for small (0.16 sec)
-
android/guava/src/com/google/common/primitives/Chars.java
* @return the same value cast to {@code char} if it is in the range of the {@code char} type, * {@link Character#MAX_VALUE} if it is too large, or {@link Character#MIN_VALUE} if it is too * small */ public static char saturatedCast(long value) { if (value > Character.MAX_VALUE) { return Character.MAX_VALUE; } if (value < Character.MIN_VALUE) { return Character.MIN_VALUE; }
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/primitives/UnsignedInts.java
* * <p>Users of these utilities must be <i>extremely careful</i> not to mix up signed and unsigned * {@code int} values. When possible, it is recommended that the {@link UnsignedInteger} wrapper * class be used, at a small efficiency penalty, to enforce the distinction in the type system. * * <p>See the Guava User Guide article on <a * href="https://github.com/google/guava/wiki/PrimitivesExplained#unsigned-support">unsigned
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 13.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
sort( insertionOrder, new Comparator<V>() { @Override public int compare(V left, V right) { // The indexes are small enough for the subtraction trick to be safe. return indexOfEntryWithValue(left) - indexOfEntryWithValue(right); } int indexOfEntryWithValue(V value) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
* @return the same value cast to {@code int} if it is in the range of the {@code int} type, * {@link Integer#MAX_VALUE} if it is too large, or {@link Integer#MIN_VALUE} if it is too * small */ public static int saturatedCast(long value) { if (value > Integer.MAX_VALUE) { return Integer.MAX_VALUE; } if (value < Integer.MIN_VALUE) { return Integer.MIN_VALUE; }
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) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// Timed Get // There are a few design constraints to consider // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I // have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the // timeout is small we shouldn't park(). This needs to be traded off with the cpu overhead of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
* .put(1, "one") * .put(2, "two") * .put(3, "three") * .buildOrThrow(); * }</pre> * * <p>For <i>small</i> immutable sorted maps, the {@code ImmutableSortedMap.of()} methods are even * more convenient. * * <p>Builder instances can be reused - it is safe to call {@link #buildOrThrow} multiple times to
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
Random random = new Random(0); Multiset<Integer> elements = HashMultiset.create(); MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(); int range = 10_000; // range should be small enough that equal elements occur semi-frequently for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) { for (int i = 0; i < 100; i++) { Integer element = random.nextInt(range);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableBiMap.java
* new ImmutableBiMap.Builder<String, Integer>() * .put("one", 1) * .put("two", 2) * .put("three", 3) * .buildOrThrow(); * }</pre> * * <p>For <i>small</i> immutable bimaps, the {@code ImmutableBiMap.of()} methods are even more * convenient. * * <p>By default, a {@code Builder} will generate bimaps that iterate over entries in the order
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* using a {@code LinkedHashSet} instead, at the cost of increased memory footprint, to get * deterministic iteration behavior. * * <p>This method is just a small convenience, either for {@code newHashSet(}{@link Arrays#asList * asList}{@code (...))}, or for creating an empty set then calling {@link Collections#addAll}.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableMapTest.java
.buildKeepingLast(); assertMapEquals(map, key1, 3, key2, 4); } // The java7 branch has different code depending on whether the entry indexes fit in a byte, // short, or int. The small table in testBuildKeepingLast_allowsOverwrite will test the byte // case. This method tests the short case. public void testBuildKeepingLast_shortTable() { Builder<Integer, String> builder = ImmutableMap.builder();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 27 13:27:08 GMT 2024 - 41.3K bytes - Viewed (0)