Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 161 - 170 of 357 for poodlE (0.05 seconds)

  1. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http/ExchangeCodec.kt

      @Throws(IOException::class)
      fun peekTrailers(): Headers?
    
      /**
       * Cancel this stream. Resources held by this stream will be cleaned up, though not synchronously.
       * That may happen later by the connection pool thread.
       */
      fun cancel()
    
      /**
       * Carries an exchange. This is usually a connection, but it could also be a connect plan for
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jul 29 21:11:09 GMT 2025
    - 3.3K bytes
    - Click Count (0)
  2. cmd/os_unix.go

    const blockSize = 8 << 10 // 8192
    
    // By default at least 128 entries in single getdents call (1MiB buffer)
    var (
    	direntPool = bpool.Pool[*[]byte]{
    		New: func() *[]byte {
    			buf := make([]byte, blockSize*128)
    			return &buf
    		},
    	}
    
    	direntNamePool = bpool.Pool[*[]byte]{
    		New: func() *[]byte {
    			buf := make([]byte, blockSize)
    			return &buf
    		},
    	}
    )
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 9.3K bytes
    - Click Count (0)
  3. cmd/erasure-multipart.go

    	toEncode := io.Reader(data)
    	if data.Size() > bigFileThreshold {
    		// Add input readahead.
    		// We use 2 buffers, so we always have a full buffer of input.
    		pool := globalBytePoolCap.Load()
    		bufA := pool.Get()
    		bufB := pool.Get()
    		defer pool.Put(bufA)
    		defer pool.Put(bufB)
    		ra, err := readahead.NewReaderBuffer(data, [][]byte{bufA[:fi.Erasure.BlockSize], bufB[:fi.Erasure.BlockSize]})
    		if err == nil {
    			toEncode = ra
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Oct 24 04:05:31 GMT 2025
    - 47.1K bytes
    - Click Count (0)
  4. cmd/erasure-object.go

    	}
    
    	toEncode := io.Reader(data)
    	if data.Size() >= bigFileThreshold {
    		// We use 2 buffers, so we always have a full buffer of input.
    		pool := globalBytePoolCap.Load()
    		bufA := pool.Get()
    		bufB := pool.Get()
    		defer pool.Put(bufA)
    		defer pool.Put(bufB)
    		ra, err := readahead.NewReaderBuffer(data, [][]byte{bufA[:fi.Erasure.BlockSize], bufB[:fi.Erasure.BlockSize]})
    		if err == nil {
    			toEncode = ra
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Oct 24 04:05:31 GMT 2025
    - 80.4K bytes
    - Click Count (0)
  5. src/main/java/jcifs/smb1/smb1/BufferCache.java

     */
    
    package jcifs.smb1.smb1;
    
    import jcifs.smb1.Config;
    
    /**
     * Buffer cache implementation for SMB1 protocol operations.
     * Manages a pool of byte buffers to reduce garbage collection overhead.
     *
     * Performance optimizations:
     * - Uses ConcurrentLinkedQueue for O(1) operations
     * - Lock-free operations for better concurrency
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  6. docs/tr/docs/advanced/stream-data.md

    ///
    
    Event loop'u bloke etmemek için, *path operation function*'ı `async def` yerine normal `def` ile tanımlayabilirsiniz; böylece FastAPI ana döngüyü bloke etmemek için bunu bir thread pool worker (iş parçacığı havuzu çalışanı) üzerinde çalıştırır.
    
    {* ../../docs_src/stream_data/tutorial002_py310.py ln[30:34] hl[31] *}
    
    /// tip | İpucu
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:51:35 GMT 2026
    - 5.8K bytes
    - Click Count (0)
  7. src/main/java/org/codelibs/fess/ds/callback/FileListIndexUpdateCallbackImpl.java

        /**
         * Creates a new fixed thread pool executor with the specified number of threads.
         *
         * @param nThreads the number of threads in the pool
         * @return a new ThreadPoolExecutor configured for this callback
         */
        protected ExecutorService newFixedThreadPool(final int nThreads) {
            if (logger.isDebugEnabled()) {
                logger.debug("Initialized executor thread pool: size={}", nThreads);
            }
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 29.7K bytes
    - Click Count (3)
  8. scripts/docs.py

            if (lang.is_dir() and lang.name in SUPPORTED_LANGS)
        ]
        cpu_count = os.cpu_count() or 1
        process_pool_size = cpu_count * 4
        typer.echo(f"Using process pool size: {process_pool_size}")
        with Pool(process_pool_size) as p:
            p.map(build_lang, langs)
    
    
    @app.command()
    def update_languages() -> None:
        """
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 17:46:10 GMT 2026
    - 25.4K bytes
    - Click Count (0)
  9. docs/smb3-features/05-rdma-smb-direct-design.md

        private final ConcurrentLinkedQueue<RdmaMemoryRegion> availableReceiveRegions;
        private final AtomicLong totalAllocated;
        private final AtomicLong totalReleased;
        
        // Buffer pool configuration
        private final int initialSendBuffers = 32;
        private final int initialReceiveBuffers = 64;
        private final int sendBufferSize = 65536;      // 64KB
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 02:53:50 GMT 2025
    - 35.9K bytes
    - Click Count (0)
  10. src/main/java/org/codelibs/fess/helper/DataIndexHelper.java

     * of crawled documents into the search engine.
     *
     * <p>The DataIndexHelper supports:</p>
     * <ul>
     *   <li>Concurrent crawling of multiple data configurations</li>
     *   <li>Thread pool management for crawler execution</li>
     *   <li>Session-based crawling with cleanup operations</li>
     *   <li>Old document deletion after successful crawling</li>
     *   <li>Crawling execution monitoring and timing</li>
     * </ul>
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 19K bytes
    - Click Count (0)
Back to Top