- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 435 for enough (0.09 sec)
-
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 @SuppressWarnings("ThreadPriorityCheck") // TODO: b/175898629 - Consider onSpinWait.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 02:42:09 UTC 2024 - 12.1K bytes - Viewed (0) -
guava/src/com/google/common/hash/BloomFilterStrategies.java
/** * Careful here: if threads are mutating the atomicLongArray while this method is executing, the * final long[] will be a "rolling snapshot" of the state of the bit array. This is usually good * enough, but should be kept in mind. */ public static long[] toPlainArray(AtomicLongArray atomicLongArray) { long[] array = new long[atomicLongArray.length()]; for (int i = 0; i < array.length; ++i) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 10.7K bytes - Viewed (0) -
internal/lock/lock_windows.go
// path limit imposed by Windows. If path is not easily converted to // the extended-length form (for example, if path is a relative path // or contains .. elements), or is short enough, fixLongPath returns // path unmodified. // // See https://msdn.microsoft.com/en-us/library/windows/desktop/aa365247(v=vs.85).aspx#maxpath func fixLongPath(path string) string {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Oct 18 18:08:15 UTC 2023 - 7.9K bytes - Viewed (0) -
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()) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 9.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/base/ThrowablesTest.java
Integer javaVersion = Ints.tryParse(JAVA_SPECIFICATION_VERSION.value()); if (javaVersion != null && javaVersion >= 9) { return; } // Obviously this isn't guaranteed in every environment, but it works well enough for now: assertTrue(lazyStackTraceIsLazy()); } @J2ktIncompatible @GwtIncompatible // lazyStackTrace(Throwable) public void testLazyStackTrace() { Exception e = new Exception();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Sep 17 18:14:12 UTC 2024 - 14.6K bytes - Viewed (0) -
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()) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 9.3K bytes - Viewed (0) -
cmd/global-heal.go
return nil } disks = disks[:len(disks)-healing] // healing drives are always at the end of the list if len(disks) < er.setDriveCount/2 { return fmt.Errorf("not enough drives (found=%d, healing=%d, total=%d) are available to heal `%s`", len(disks), healing, er.setDriveCount, tracker.disk.String()) } rand.Shuffle(len(disks), func(i, j int) { disks[i], disks[j] = disks[j], disks[i]
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Sat Oct 26 09:58:27 UTC 2024 - 16.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
checkNotNull(element); copyIfNecessary(); if (n == elements.length) { sortAndDedup(); /** * sortAndDedup may have made enough room for this element, but that's not necessarily good * enough. Consider, for example, the case where we have a buffer of size (n+1), add n * distinct elements, and add the last element over again many times over. We don't want a
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 39.1K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/DuplexTest.kt
Request.Builder() .url(server.url("/")) .post(AsyncRequestBody()) .build() val call = client.newCall(request) call.timeout() .timeout(500, TimeUnit.MILLISECONDS) // Long enough for the first TLS handshake. call.execute().use { response -> val requestBody = (call.request().body as AsyncRequestBody?)!!.takeSink() val responseBody = response.body.source()
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Sat Jan 20 10:30:28 UTC 2024 - 23.9K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/-HostnamesCommon.kt
// b: 10 // after: { 11, 11, 22, 22, 33, 33, 00, 00, 00, 00, 00, 00, 77, 77, 88, 88 } // if (b != address.size) { if (compress == -1) return null // Address didn't have compression or enough groups. address.copyInto(address, address.size - (b - compress), compress, b) address.fill(0.toByte(), compress, compress + (address.size - b)) } return address }
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 11.2K bytes - Viewed (0)