- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 82 for Friend (0.15 sec)
-
guava-tests/test/com/google/common/util/concurrent/SequentialExecutorTest.java
// SequentialExecutor by the time the barrier is satisfied barrier.await(1, TimeUnit.SECONDS); executor.execute(barrierTask); // timeout means the second task wasn't even tried barrier.await(1, TimeUnit.SECONDS); } finally { service.shutdown(); } } public void testRejectedExecutionThrownWithMultipleCalls() throws Exception {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ListenableFuture.java
* after executing them. * * @param listener the listener to run when the computation is complete * @param executor the executor to run the listener in * @throws RejectedExecutionException if we tried to execute the listener immediately but the * executor rejected it. */ void addListener(Runnable listener, Executor executor);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:13:41 GMT 2023 - 8K bytes - Viewed (0) -
src/bufio/bufio.go
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. for i := maxConsecutiveEmptyReads; i > 0; i-- { n, err := b.rd.Read(b.buf[b.w:]) if n < 0 { panic(errNegativeRead) }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Oct 12 14:39:08 GMT 2023 - 21.8K bytes - Viewed (0) -
cmd/erasure-decode.go
bitrotHeal := int32(0) // Atomic bool flag. missingPartsHeal := int32(0) // Atomic bool flag. readerIndex := 0 var wg sync.WaitGroup // if readTrigger is true, it implies next disk.ReadAt() should be tried // if readTrigger is false, it implies previous disk.ReadAt() was successful and there is no need // to try reading the next disk. for readTrigger := range readTriggerCh { newBufLK.RLock()
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 19 16:44:59 GMT 2024 - 9.4K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot * exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
* cause if this Future has failed. * * - And this future *has* failed: This method is called only from handleException (through * getOrInitSeenExceptions). handleException tried to call setException and failed, so * either this Future was cancelled (which we ruled out with the isCancelled check above), * or it had already failed. (It couldn't have completed *successfully* or even had
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot * exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
cmd/prepare-storage.go
) storageDisks, format, err := connectLoadInitFormats(verbose, firstDisk, endpoints, poolCount, setCount, setDriveCount, deploymentID) if err == nil { return storageDisks, format, nil } tries++ // tried already once // Wait on each try for an update. ticker := time.NewTicker(1 * time.Second) defer ticker.Stop() for { // Only log once every 10 iterations, then reset the tries count.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Apr 15 08:25:46 GMT 2024 - 11.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot * exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/AbstractPackageSanityTests.java
* <ul> * <li>The visible constructor or visible static factory method with the most parameters is used * to construct the sample instances. In case of tie, the candidate constructors or * factories are tried one after another until one can be used to construct sample * instances. * <li>For the constructor or static factory method used to construct instances, it's checked
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri May 12 19:22:18 GMT 2023 - 17.5K bytes - Viewed (0)