- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 254 for Slough (0.32 sec)
-
android/guava/src/com/google/common/io/ReaderInputStream.java
result = encoder.flush(byteBuffer); } else { result = encoder.encode(charBuffer, byteBuffer, endOfInput); } if (result.isOverflow()) { // Not enough room in output buffer--drain it, creating a bigger buffer if necessary. startDraining(true); continue DRAINING; } else if (result.isUnderflow()) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 28 20:13:02 GMT 2023 - 9.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
return set; } /** * Creates a {@code CompactHashSet} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without growth. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactHashSet} with enough capacity to hold {@code expectedSize} * elements without resizing
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* always have the same hash code. */ @Override int hashCode(); /** * {@inheritDoc} * * <p>It is recommended, though not mandatory, that this method return the result of invoking * {@link #toString} on the {@link #entrySet}, yielding a result such as {@code [a x 3, c, d x 2, * e]}. */ @Override String toString();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 19.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
} public void testGreatestOfIterable_simple() { /* * If greatestOf() promised to be implemented as reverse().leastOf(), this * test would be enough. It doesn't... but we'll cheat and act like it does * anyway. There's a comment there to remind us to fix this if we change it. */ List<Integer> list = Arrays.asList(3, 1, 3, 2, 4, 2, 4, 3);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
} public void testGreatestOfIterable_simple() { /* * If greatestOf() promised to be implemented as reverse().leastOf(), this * test would be enough. It doesn't... but we'll cheat and act like it does * anyway. There's a comment there to remind us to fix this if we change it. */ List<Integer> list = Arrays.asList(3, 1, 3, 2, 4, 2, 4, 3);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/QueuesTest.java
// if waiting works, this should get stuck Queues.drain(q, newArrayList(), 1, MAX_VALUE, NANOSECONDS); fail(); } catch (InterruptedException expected) { // we indeed waited; a slow thread had enough time to interrupt us } } // same as above; uninterruptible version private void assertUninterruptibleDrained(BlockingQueue<Object> q) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12K bytes - Viewed (0) -
android/guava/src/com/google/common/io/TempFileCreator.java
* I'm not sure that we could actually get here for *Android*: I would expect us to enter * the POSIX code path instead. And if we tried this code path, we'd have trouble unless we * were running under a new enough version of Android to support NIO. * * So this is probably just the "Windows Java 8" case. In that case, if we wanted *another* * layer of fallback before consulting the system property, we could try
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 06 17:11:11 GMT 2023 - 12.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
ReentrantLock lockD = otherFactory.newReentrantLock("LockD"); // lockA -> lockD lockA.lock(); lockD.lock(); lockA.unlock(); lockD.unlock(); // lockD -> lockA should fail even though lockD is from a different factory. lockD.lock(); PotentialDeadlockException expected = assertThrows(PotentialDeadlockException.class, () -> lockA.lock());
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 16.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
* LinkedHashMap because one target node may be mapped to both a predecessor and a successor. A * LinkedHashMap combines two such edges into a single node-value pair, even though the edges may * not have been inserted consecutively. */ @CheckForNull private final List<NodeConnection<N>> orderedNodeConnections; private int predecessorCount; private int successorCount;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InetAddresses.java
* @since 10.0 */ public static String toAddrString(InetAddress ip) { checkNotNull(ip); if (ip instanceof Inet4Address) { // For IPv4, Java's formatting is good enough. // requireNonNull accommodates Android's @RecentlyNullable annotation on getHostAddress return requireNonNull(ip.getHostAddress()); } checkArgument(ip instanceof Inet6Address);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 44K bytes - Viewed (1)