- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 60 for Peal (0.13 sec)
-
android/guava-tests/test/com/google/common/primitives/BytesTest.java
assertThat(newArray).isEqualTo(new byte[] {(byte) 0, (byte) 1, (byte) 2}); newArray[1] = (byte) 5; assertThat((byte) list.get(1)).isEqualTo((byte) 1); } // This test stems from a real bug found by andrewk public void testAsList_subList_toArray_roundTrip() { byte[] array = {(byte) 0, (byte) 1, (byte) 2, (byte) 3}; List<Byte> list = Bytes.asList(array);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 16.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSet.java
* k <= i < n}. * * <p>After this method returns, {@code elements} will contain no duplicates, but {@code elements} * may be the real array backing the returned set, so do not modify it further. * * <p>{@code elements} may contain only values of type {@code E}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* </ul> * * @author James Sexton * @author Joshua O'Madadhain * @param <N> Node parameter type * @param <E> Edge parameter type * @since 20.0 */ @Beta @DoNotMock("Use NetworkBuilder to create a real instance") @ElementTypesAreNonnullByDefault public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFunction<N> { // // Network-level accessors //
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/IntsTest.java
list.set(0, (int) 4); assertThat(newArray).isEqualTo(new int[] {(int) 0, (int) 1, (int) 2}); newArray[1] = (int) 5; assertThat((int) list.get(1)).isEqualTo((int) 1); } // This test stems from a real bug found by andrewk public void testAsList_subList_toArray_roundTrip() { int[] array = {(int) 0, (int) 1, (int) 2, (int) 3}; List<Integer> list = Ints.asList(array);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 28.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableList.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/CharsTest.java
assertThat(newArray).isEqualTo(new char[] {(char) 0, (char) 1, (char) 2}); newArray[1] = (char) 5; assertThat((char) list.get(1)).isEqualTo((char) 1); } // This test stems from a real bug found by andrewk public void testAsList_subList_toArray_roundTrip() { char[] array = {(char) 0, (char) 1, (char) 2, (char) 3}; List<Character> list = Chars.asList(array);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 24.7K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/CacheBuilder.java
* return createExpensiveGraph(key); * } * }); * }</pre> * * <p>Or equivalently, * * <pre>{@code * // In real life this would come from a command-line flag or config file * String spec = "maximumSize=10000,expireAfterWrite=10m"; * * LoadingCache<Key, Graph> graphs = CacheBuilder.from(spec) * .removalListener(MY_LISTENER)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 44.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 17.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
* This avoids out-of-control memory consumption, and it keeps the cache from growing so * large that doing the lookup is noticeably slower than redoing the work would be. * * Ideally we'd have a real eviction policy, but until we see a problem in practice, I hope * that this will suffice. I have not even benchmarked with different size limits. */ if (validClasses.size() > 1000) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AtomicLongMap.java
* The problem with these is that remove(K, long) has to be done in two phases by definition --- * first decrementing to zero, and then removing. putIfAbsent or replace could observe the * intermediate zero-state. Ways we could deal with this are: * * - Don't define any of the ConcurrentMap operations. This is the current state of affairs. * * - Define putIfAbsent and replace as treating zero and absent identically (as currently
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.1K bytes - Viewed (0)