- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 144 for pola (0.02 sec)
-
guava-testlib/src/com/google/common/collect/testing/testers/QueuePollTester.java
public void testPoll_empty() { assertNull("emptyQueue.poll() should return null", getQueue().poll()); expectUnchanged(); } @CollectionFeature.Require(SUPPORTS_REMOVE) @CollectionSize.Require(ONE) public void testPoll_size1() { assertEquals("size1Queue.poll() should return first element", e0(), getQueue().poll()); expectMissing(e0()); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Nov 14 23:40:07 UTC 2024 - 2.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
} } } /** * Implementation of the InvertedMinMaxPriorityQueue which forwards all calls to a * MinMaxPriorityQueue, except poll, which is forwarded to pollMax. That way we can benchmark * pollMax using the same code that benchmarks poll. */ static final class InvertedMinMaxPriorityQueue<T> extends ForwardingQueue<T> { MinMaxPriorityQueue<T> mmHeap;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 4.4K bytes - Viewed (0) -
docs/pt/docs/advanced/templates.md
Você também pode usar `url_for()` dentro do template, ele recebe como argumentos os mesmos argumentos que seriam usados pela sua *path operation function*. Logo, a seção com: {% raw %} ```jinja <a href="{{ url_for('read_item', id=id) }}"> ``` {% endraw %} ...irá gerar um link para a mesma URL que será tratada pela *path operation function* `read_item(id=id)`. Por exemplo, com um ID de `42`, isso renderizará: ```html
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Nov 18 02:25:44 UTC 2024 - 3.3K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb2/rdma/RdmaBufferManager.java
// Clean up all pooled regions RdmaMemoryRegion region; while ((region = availableSendRegions.poll()) != null) { region.close(); totalReleased.incrementAndGet(); } while ((region = availableReceiveRegions.poll()) != null) { region.close(); totalReleased.incrementAndGet(); }
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 23 05:11:12 UTC 2025 - 8.7K bytes - Viewed (0) -
okhttp/src/jvmTest/kotlin/okhttp3/TestLogHandler.kt
afterEach(null) } } } fun takeAll(): List<String> { val list = mutableListOf<String>() logs.drainTo(list) return list } fun take(): String = logs.poll(10, TimeUnit.SECONDS) ?: throw AssertionError("Timed out waiting for log message.")
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 2.5K bytes - Viewed (0) -
docs/tr/docs/tutorial/static-files.md
# Statik Dosyalar `StaticFiles`'ı kullanarak statik dosyaları bir yol altında sunabilirsiniz. ## `StaticFiles` Kullanımı * `StaticFiles` sınıfını projenize dahil edin. * Bir `StaticFiles()` örneğini belirli bir yola bağlayın. {* ../../docs_src/static_files/tutorial001.py hl[2,6] *} /// note | Teknik Detaylar Projenize dahil etmek için `from starlette.staticfiles import StaticFiles` kullanabilirsiniz.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Nov 18 02:25:44 UTC 2024 - 1.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 18.9K bytes - Viewed (0) -
fess-crawler-opensearch/src/main/java/org/codelibs/fess/crawler/service/impl/OpenSearchUrlQueueService.java
*/ @Override public OpenSearchUrlQueue poll(final String sessionId) { final QueueHolder queueHolder = getQueueHolder(sessionId); final Queue<OpenSearchUrlQueue> waitingQueue = queueHolder.waitingQueue; final Queue<OpenSearchUrlQueue> crawlingQueue = queueHolder.crawlingQueue; OpenSearchUrlQueue urlQueue = waitingQueue.poll(); if (urlQueue != null) {
Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Thu Aug 07 02:55:08 UTC 2025 - 17K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Queues.java
while (added < numElements) { // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple // elements already available (e.g. LinkedBlockingQueue#drainTo locks only once) added += q.drainTo(buffer, numElements - added); if (added < numElements) { // not enough elements immediately available; will have to poll E e = q.poll(deadline - System.nanoTime(), NANOSECONDS); if (e == null) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 18.3K bytes - Viewed (0) -
src/main/java/org/codelibs/core/crypto/CachedCipher.java
* * @return an encryption cipher */ protected Cipher pollEncryptoCipher() { Cipher cipher = encryptoQueue.poll(); if (cipher == null) { final SecretKeySpec sksSpec = new SecretKeySpec(key.getBytes(), algorithm); try { cipher = Cipher.getInstance(algorithm);
Registered: Fri Sep 05 20:58:11 UTC 2025 - Last Modified: Sat Jul 05 00:11:05 UTC 2025 - 11.5K bytes - Viewed (0)