Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for simultaneously (0.05 sec)

  1. android/guava/src/com/google/common/eventbus/AllowConcurrentEvents.java

    import java.lang.annotation.RetentionPolicy;
    import java.lang.annotation.Target;
    
    /**
     * Marks an event subscriber method as being thread-safe. This annotation indicates that EventBus
     * may invoke the event subscriber simultaneously from multiple threads.
     *
     * <p>This does not mark the method, and so should be used in combination with {@link Subscribe}.
     *
     * @author Cliff Biffle
     * @since 10.0
     */
    @Retention(RetentionPolicy.RUNTIME)
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 1.2K bytes
    - Viewed (0)
  2. src/archive/zip/register.go

    )
    
    // A Compressor returns a new compressing writer, writing to w.
    // The WriteCloser's Close method must be used to flush pending data to w.
    // The Compressor itself must be safe to invoke from multiple goroutines
    // simultaneously, but each returned writer will be used only by
    // one goroutine at a time.
    type Compressor func(w io.Writer) (io.WriteCloser, error)
    
    // A Decompressor returns a new decompressing reader, reading from r.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Oct 13 18:36:46 UTC 2023
    - 3.7K bytes
    - Viewed (0)
  3. cmd/veeam-sos-api.go

    //     methods like Instant Restore, File Level Recovery, and Database/Application restores. Veeam recommends that vendors
    //     optimize the storage system for the default value of 1MB minus compression object sizes. The setting simultaneously
    //     affects read from source, block, file, dedup, and object storage backup targets for a specific Veeam Job. When customers
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Thu Aug 15 00:34:56 UTC 2024
    - 8.8K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/base/Utf8.java

            }
          } while ((byte1 = bytes[index++]) >= 0);
    
          if (byte1 < (byte) 0xE0) {
            // Two-byte form.
            if (index == end) {
              return false;
            }
            // Simultaneously check for illegal trailing-byte in leading position
            // and overlong 2-byte form.
            if (byte1 < (byte) 0xC2 || bytes[index++] > (byte) 0xBF) {
              return false;
            }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 7K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/cache/LocalCacheMapComputeTest.java

        cache.put(key, "1");
        // simultaneous update for same key, some null, some non-null
        doParallelCacheOp(
            count,
            n -> {
              cache.asMap().compute(key, (k, v) -> n % 2 == 0 ? v + delimiter + n : null);
            });
        assertThat(cache.size()).isAtMost(1);
      }
    
      public void testCompute() {
        cache.put(key, "1");
        // simultaneous deletion
        doParallelCacheOp(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Feb 12 03:49:18 UTC 2025
    - 6.4K bytes
    - Viewed (0)
  6. docs/features/calls.md

    ## Dispatch
    
    For synchronous calls, you bring your own thread and are responsible for managing how many simultaneous requests you make. Too many simultaneous connections wastes resources; too few harms latency.
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sun Feb 06 02:19:09 UTC 2022
    - 3.9K bytes
    - Viewed (0)
  7. docs/throttle/README.md

    Example: Limit a MinIO cluster to accept at max 1600 simultaneous S3 API requests across all nodes of the cluster.
    
    ```sh
    export MINIO_API_REQUESTS_MAX=1600
    export MINIO_ROOT_USER=your-access-key
    export MINIO_ROOT_PASSWORD=your-secret-key
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 16 08:43:49 UTC 2024
    - 1.5K bytes
    - Viewed (1)
Back to top