- Sort Score
- Num 10 results
- Language All
Results 341 - 350 of 391 for occupy (0.15 seconds)
-
android/guava/src/com/google/common/cache/LocalCache.java
* ordering information is updated. This is used to avoid lock contention by recording a memento * of reads and delaying a lock acquisition until the threshold is crossed or a mutation occurs. * * <p>This must be a (2^n)-1 as it is used as a mask. */ static final int DRAIN_THRESHOLD = 0x3F; /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 143.5K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/UninterruptiblesTest.java
} // Condition.await() tests /* * RE: the WaitNotInLoop warnings: * * Our tests for awaitUninterruptibly are written under the assumption that no spurious wakeups * occur except for those produced by awaitUninterruptibly itself in response to interrupts. * * This isn't guaranteed to work, so any further spurious wakeups would probably cause failures in
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 38.1K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/indexer/IndexUpdater.java
} } } /** * Retrieves the access result data from an OpenSearch access result. * Handles exceptions that may occur during data retrieval. * * @param accessResult the access result to extract data from * @return the access result data, or null if retrieval fails */Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Nov 28 16:29:12 GMT 2025 - 32.9K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* * <p><strong>Cycle Detection</strong> * * <p>Deadlocks can arise when locks are acquired in an order that forms a cycle. In a simple * example involving two locks and two threads, deadlock occurs when one thread acquires Lock A, and * then Lock B, while another thread acquires Lock B, and then Lock A: * * <pre> * Thread1: acquire(LockA) --X acquire(LockB) * Thread2: acquire(LockB) --X acquire(LockA) * </pre>
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 36K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.33.md
- Upgraded the `kubectl autoscale` subcommand to use `autoscaling/v2` rather than `autoscaling/v1` APIs. The command now attempts to use the `autoscaling/v2` API first. If the `autoscaling/v2` API is unavailable or an error occurs, it falls back to the `autoscaling/v1` API. ([#128950](https://github.com/kubernetes/kubernetes/pull/128950), [@googs1025](https://github.com/googs1025)) [SIG Autoscaling and CLI]
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu Mar 19 03:17:58 GMT 2026 - 369K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/ClosingFuture.java
* (Specifically, {@code directExecutor} functions should avoid heavyweight operations inside * {@code AsyncClosingFunction.apply}. Any heavyweight operations should occur in other threads * responsible for completing the returned {@code ClosingFuture}.) * * <p>After calling this method, you may not call {@link #finishToFuture()}, {@linkCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 101.7K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/Longs.java
*/ public static byte[] toByteArray(long value) { // Note that this code needs to stay compatible with GWT, which has known // bugs when narrowing byte casts of long values occur. byte[] result = new byte[8]; for (int i = 7; i >= 0; i--) { result[i] = (byte) (value & 0xffL); value >>= 8; } return result; } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Oct 22 18:14:49 GMT 2025 - 29K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
Multiset<Integer> elements = HashMultiset.create(); MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(); int range = 10_000; // range should be small enough that equal elements occur semi-frequently for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) { for (int i = 0; i < 100; i++) { Integer element = random.nextInt(range); elements.add(element);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 36.2K bytes - Click Count (0) -
cmd/metacache-set.go
internalLogIf(ctx, err) } if retries >= maxTries { return err } retries++ time.Sleep(retryDelay) } return nil }) // Blocks while consuming entries or an error occurs. err = bw.Close() if err != nil { mc.setErr(err.Error()) } metaMu.Lock() defer metaMu.Unlock() if mc.meta.error != "" { return err } // Save success
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 30.7K bytes - Click Count (0) -
cmd/xl-storage-format-v2.go
// only that it is unlikely. func (x xlMetaV2VersionHeader) InlineData() bool { return x.Flags&xlFlagInlineData != 0 } // signatureErr is a signature returned when an error occurs. var signatureErr = [4]byte{'e', 'r', 'r', 0} // getSignature will return a signature that is expected to be the same across all disks. func (j xlMetaV2Version) getSignature() [4]byte { switch j.Type {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 65.6K bytes - Click Count (1)