- Sort Score
- Result 10 results
- Languages All
Results 581 - 590 of 1,378 for while (0.02 sec)
-
docs/en/docs/advanced/async-tests.md
Let's look at how we can make that work. ## pytest.mark.anyio
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 27 15:43:29 UTC 2024 - 3.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/IntervalControlHelper.java
protected volatile boolean crawlerRunning = true; protected long crawlerWaitMillis = 10000; protected List<IntervalRule> ruleList = new ArrayList<>(); public void checkCrawlerStatus() { while (!crawlerRunning) { ThreadUtil.sleepQuietly(crawlerWaitMillis); } } public void delayByRules() { final long delay = getDelay(); if (delay > 0) {
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Fri Oct 11 21:11:58 UTC 2024 - 5.8K bytes - Viewed (0) -
android/guava/src/com/google/common/io/CharSequenceReader.java
* mutation, which is not an actual risk because we use `synchronized`. * - Make `remaining` require a non-null `seq` argument. But this is a bit weird because the * method, while it would avoid the instance field `seq` would still access the instance field * `pos`. */ @Override public synchronized int read(CharBuffer target) throws IOException { checkNotNull(target);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 4.5K bytes - Viewed (0) -
guava/src/com/google/common/io/CharSequenceReader.java
* mutation, which is not an actual risk because we use `synchronized`. * - Make `remaining` require a non-null `seq` argument. But this is a bit weird because the * method, while it would avoid the instance field `seq` would still access the instance field * `pos`. */ @Override public synchronized int read(CharBuffer target) throws IOException { checkNotNull(target);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 4.5K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/indexer/IndexUpdater.java
long updateTime = systemHelper.getCurrentTimeAsLong(); int errorCount = 0; int emptyListCount = 0; long cleanupTime = -1; while (!finishCrawling || !accessResultList.isEmpty()) { try { final int sessionIdListSize = finishedSessionIdList.size(); intervalControlHelper.setCrawlerRunning(true);
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Fri Oct 11 21:20:39 UTC 2024 - 24.2K bytes - Viewed (0) -
cmd/metacache-manager.go
debug.PrintStack() } return b } m.mu.RUnlock() m.mu.Lock() defer m.mu.Unlock() // See if someone else fetched it while we waited for the lock. b, ok = m.buckets[bucket] if ok { if b.bucket != bucket { logger.Info("getBucket: newly cached bucket %s does not match this bucket %s", b.bucket, bucket) debug.PrintStack() }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 25 00:44:15 UTC 2022 - 5.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
} } /** * An {@code Entry} implementation that attempts to follow its key around the map -- that is, if * the key is moved, deleted, or reinserted, it will account for that -- while not doing any extra * work if the key has not moved. One quirk: The {@link #getValue()} method can return {@code * null} even for a map which supposedly does not contain null elements, if the key is not present
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Mar 06 16:06:58 UTC 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* Bubbles a value from {@code index} up the levels of this heap, and returns the index the * element ended up at. */ @CanIgnoreReturnValue int bubbleUpAlternatingLevels(int index, E x) { while (index > 2) { int grandParentIndex = getGrandparentIndex(index); E e = elementData(grandParentIndex); if (ordering.compare(e, x) <= 0) { break; } queue[index] = e;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 34.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
// -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3; while (left < right) { int pivotIndex = (left + right + 1) >>> 1; int pivotNewIndex = partition(left, right, pivotIndex); if (pivotNewIndex > k) { right = pivotNewIndex - 1;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 11.1K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/CacheStats.java
* are incremented, and the total loading time, in nanoseconds, is added to {@code * totalLoadTime}. * <li>When an exception is thrown while loading an entry, {@code missCount} and {@code * loadExceptionCount} are incremented, and the total loading time, in nanoseconds, is * added to {@code totalLoadTime}.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 19:07:49 UTC 2024 - 12.6K bytes - Viewed (0)