- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,006 for Gill (0.16 sec)
-
src/bufio/bufio.go
} var errNegativeRead = errors.New("bufio: reader returned negative count from Read") // fill reads a new chunk into the buffer. func (b *Reader) fill() { // Slide existing data to beginning. if b.r > 0 { copy(b.buf, b.buf[b.r:b.w]) b.w -= b.r b.r = 0 } if b.w >= len(b.buf) { panic("bufio: tried to fill full buffer") } // Read new data: try a limited number of times.
Go - Registered: Tue Apr 16 11:13:10 GMT 2024 - Last Modified: Thu Oct 12 14:39:08 GMT 2023 - 21.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Verify.java
* whenever there is a chance the check may fail "in real life". Example: * * <pre>{@code * Bill bill = remoteService.getLastUnpaidBill(); * * // In case bug 12345 happens again we'd rather just die * Verify.verify(bill.status() == Status.UNPAID, * "Unexpected bill status: %s", bill.status()); * }</pre> * * <h3>Comparison to alternatives</h3> *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon May 17 14:07:47 GMT 2021 - 18.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Verify.java
* whenever there is a chance the check may fail "in real life". Example: * * <pre>{@code * Bill bill = remoteService.getLastUnpaidBill(); * * // In case bug 12345 happens again we'd rather just die * Verify.verify(bill.status() == Status.UNPAID, * "Unexpected bill status: %s", bill.status()); * }</pre> * * <h3>Comparison to alternatives</h3> *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon May 17 14:07:47 GMT 2021 - 18.5K bytes - Viewed (0) -
tensorflow/c/eager/c_api.h
// you want the latter, use TFE_TensorHandleBackingDeviceName. This function // will block till the operation that produces `h` has completed. TF_CAPI_EXPORT extern const char* TFE_TensorHandleDeviceName( TFE_TensorHandle* h, TF_Status* status); // Returns the name of the device in whose memory `h` resides. // // This function will block till the operation that produces `h` has completed.
C - Registered: Tue Apr 16 12:39:09 GMT 2024 - Last Modified: Thu Apr 27 21:07:00 GMT 2023 - 22.8K bytes - Viewed (1) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* acquire(1000)} will result in exactly the same throttling, if any), but it affects the throttling * of the <i>next</i> request. I.e., if an expensive task arrives at an idle RateLimiter, it will be * granted immediately, but it is the <i>next</i> request that will experience extra throttling, * thus paying for the cost of the expensive task. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* values are null. This method may update {@code alternatingKeysAndValues} if there are duplicate * keys. If so, the return value will indicate how many entries are still valid, and will also * include a {@link Builder.DuplicateKey} in case duplicate keys are not allowed now or will not * be allowed on a later {@link Builder#buildOrThrow()} call. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java
* multiset itself). * * <p>Despite the method name, this method attempts to avoid actually copying the data when it is * safe to do so. The exact circumstances under which a copy will or will not be performed are * undocumented and subject to change. * * <p>This method is not type-safe, as it may be called on elements that are not mutually * comparable. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
@Override public void clear() { Arrays.fill(keys, 0, size, null); Arrays.fill(values, 0, size, null); Arrays.fill(hashTableKToV, ABSENT); Arrays.fill(hashTableVToK, ABSENT); Arrays.fill(nextInBucketKToV, 0, size, ABSENT); Arrays.fill(nextInBucketVToK, 0, size, ABSENT); Arrays.fill(prevInInsertionOrder, 0, size, ABSENT); Arrays.fill(nextInInsertionOrder, 0, size, ABSENT); size = 0;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. * * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one * permutation, instead of two. This is why the elements have to implement {@link Comparable}. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/http2/Http2Test.kt
} } @Test fun readPaddedDataFrame() { val dataLength = 1123 val expectedData = ByteArray(dataLength) Arrays.fill(expectedData, 2.toByte()) val paddingLength = 254 val padding = ByteArray(paddingLength) Arrays.fill(padding, 0.toByte()) writeMedium(frame, dataLength + paddingLength + 1) frame.writeByte(Http2.TYPE_DATA) frame.writeByte(FLAG_PADDED)
Plain Text - Registered: Fri Apr 19 11:42:09 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 28.1K bytes - Viewed (0)