Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 17 for offer (0.83 sec)

  1. src/test/java/org/codelibs/fess/thumbnail/ThumbnailManagerTest.java

            Map<String, Object> docMap = new HashMap<>();
            docMap.put("_id", "docid1");
            docMap.put("url", "http://example.com");
    
            boolean result = thumbnailManager.offer(docMap);
            assertTrue(result);
        }
    
        // Test offer with no matching generator
        public void test_offer_noMatchingGenerator() {
            TestThumbnailGenerator generator = new TestThumbnailGenerator();
            generator.available = true;
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 18.7K bytes
    - Viewed (0)
  2. src/main/java/jcifs/internal/smb2/rdma/RdmaBufferManager.java

                    RdmaMemoryRegion region = provider.registerMemory(buffer, EnumSet.of(RdmaAccess.LOCAL_READ, RdmaAccess.REMOTE_READ));
                    availableSendRegions.offer(region);
                    totalAllocated.incrementAndGet();
                } catch (IOException e) {
                    log.warn("Failed to pre-allocate send buffer", e);
                }
            }
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 05:11:12 UTC 2025
    - 8.7K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/TopKSelector.java

     *
     * <p>This uses the same efficient implementation as {@link Ordering#leastOf(Iterable, int)},
     * offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link
     * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
     * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 31 13:15:26 UTC 2025
    - 11.4K bytes
    - Viewed (0)
  4. src/main/java/jcifs/audit/SecurityAuditLogger.java

                addMdcContext(entry.context);
    
                // Process asynchronously or synchronously based on configuration
                if (asyncLogging && !shutdown) {
                    if (!logQueue.offer(entry)) {
                        // Queue is full, log synchronously as fallback
                        processLogEntry(entry);
                        returnAuditEntry(entry);
                    }
                } else {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 26.6K bytes
    - Viewed (0)
  5. src/test/java/jcifs/smb/SmbTransportPoolImplTest.java

            // Replace with spies (remove and add back for concurrent queues)
            connections.remove(pooled);
            connections.offer(pooledSpy);
            nonPooledConnections.remove(nonPooled);
            nonPooledConnections.offer(nonPooledSpy);
    
            // Mock disconnect behavior
            when(pooledSpy.disconnect(false, false)).thenReturn(true); // In use
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 19.2K bytes
    - Viewed (0)
  6. src/test/java/jcifs/http/NtlmHttpFilterTest.java

            when(request.isSecure()).thenReturn(false);
            when(httpSession.getAttribute("NtlmHttpAuth")).thenReturn(null);
    
            filter.doFilter(request, response, filterChain);
    
            // Should only offer NTLM, not Basic auth
            verify(response).setHeader("WWW-Authenticate", "NTLM");
            verify(response, never()).addHeader(eq("WWW-Authenticate"), eq("Basic realm=\"TestRealm\""));
        }
    
        @Test
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 21 04:51:33 UTC 2025
    - 12.8K bytes
    - Viewed (0)
  7. src/main/java/jcifs/smb1/smb1/BufferCache.java

                return; // Silently ignore invalid buffers
            }
    
            // Only cache if we haven't reached the limit - O(1) check
            if (queueSize.get() < MAX_BUFFERS) {
                if (bufferQueue.offer(buf)) { // O(1) operation
                    queueSize.incrementAndGet();
                }
            }
            // If queue is full, let the buffer be garbage collected
        }
    
        /**
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  8. src/main/java/jcifs/smb/SmbTransportPoolImpl.java

            activeConnections.incrementAndGet();
    
            if (nonPooled) {
                this.nonPooledConnections.offer(conn);
            } else {
                this.connections.offer(conn);
            }
            return conn;
        }
    
        /**
         * @param tc
         * @param address
         * @param port
         * @param localAddr
         * @param localPort
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 33.4K bytes
    - Viewed (0)
  9. docs/en/docs/tutorial/body-nested-models.md

    ## Deeply nested models { #deeply-nested-models }
    
    You can define arbitrarily deeply nested models:
    
    {* ../../docs_src/body_nested_models/tutorial007_py310.py hl[7,12,18,21,25] *}
    
    /// info
    
    Notice how `Offer` has a list of `Item`s, which in turn have an optional list of `Image`s
    
    ///
    
    ## Bodies of pure lists { #bodies-of-pure-lists }
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  10. docs/en/docs/advanced/generate-clients.md

    * <a href="https://developers.liblab.com/tutorials/sdk-for-fastapi?utm_source=fastapi" class="external-link" target="_blank">liblab</a>
    
    Some of these solutions may also be open source or offer free tiers, so you can try them without a financial commitment. Other commercial SDK generators are available and can be found online. 🤓
    
    ## Create a TypeScript SDK { #create-a-typescript-sdk }
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 10.1K bytes
    - Viewed (1)
Back to top