Search Options

Results per page
Sort
Preferred Languages
Advance

Results 551 - 560 of 969 for furent (0.23 sec)

  1. tests/test_router_events.py

        async def router_lifespan(
            app: FastAPI,
        ) -> AsyncGenerator[Dict[str, Union[str, bool]], None]:
            yield {
                "router_specific": True,
                "overridden": "router",  # should override parent
            }
    
        router = APIRouter(lifespan=router_lifespan)
        app = FastAPI(lifespan=lifespan)
        app.include_router(router)
    
        with TestClient(app) as client:
            assert client.app_state == {
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sat Aug 24 19:09:52 UTC 2024
    - 7.3K bytes
    - Viewed (0)
  2. src/test/java/org/codelibs/fess/crawler/transformer/FessXpathTransformerTest.java

                if (MemoryUtil.getUsedMemory() < current + margin) {
                    break;
                }
                System.gc();
                Thread.sleep(1000L);
            }
            final long usedMemory = MemoryUtil.getUsedMemory();
            assertTrue(usedMemory + " < " + current + " + " + margin + ", " + MemoryUtil.getMemoryUsageLog(), usedMemory < current + margin);
        }
    
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Oct 24 13:01:38 UTC 2024
    - 41.3K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/math/Quantiles.java

    import com.google.common.primitives.Doubles;
    import com.google.common.primitives.Ints;
    import java.math.RoundingMode;
    import java.util.Collection;
    import java.util.LinkedHashMap;
    import java.util.Map;
    
    /**
     * Provides a fluent API for calculating <a
     * href="http://en.wikipedia.org/wiki/Quantile">quantiles</a>.
     *
     * <h3>Examples</h3>
     *
     * <p>To compute the median:
     *
     * <pre>{@code
     * double myMedian = median().compute(myDataset);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri May 12 17:02:53 UTC 2023
    - 29.9K bytes
    - Viewed (0)
  4. docs/en/docs/advanced/behind-a-proxy.md

    /// note | "Technical Details"
    
    The ASGI specification defines a `root_path` for this use case.
    
    And the `--root-path` command line option provides that `root_path`.
    
    ///
    
    ### Checking the current `root_path`
    
    You can get the current `root_path` used by your application for each request, it is part of the `scope` dictionary (that's part of the ASGI spec).
    
    Here we are including it in the message just for demonstration purposes.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 27 16:49:49 UTC 2024
    - 11.6K bytes
    - Viewed (0)
  5. cmd/encryption-v1.go

    // a io.Reader compatible interface.
    type DecryptBlocksReader struct {
    	// Source of the encrypted content that will be decrypted
    	reader io.Reader
    	// Current decrypter for the current encrypted data block
    	decrypter io.Reader
    	// Start sequence number
    	startSeqNum uint32
    	// Current part index
    	partIndex int
    	// Parts information
    	parts []ObjectPartInfo
    
    	objectEncryptionKey                []byte
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sun Oct 13 13:06:08 UTC 2024
    - 37.2K bytes
    - Viewed (0)
  6. common-protos/k8s.io/api/authorization/v1/generated.proto

      // +optional
      repeated string resourceNames = 4;
    }
    
    // SelfSubjectAccessReview checks whether or the current user can perform an action.  Not filling in a
    // spec.namespace means "in all namespaces".  Self is a special case, because users should always be able
    // to check whether they can perform an action
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 11.9K bytes
    - Viewed (0)
  7. okhttp/src/main/kotlin/okhttp3/Authenticator.kt

     *
     * If your authentication may be flaky and requires retries you should apply some policy
     * to limit the retries by the class of errors and number of attempts.  To get the number of
     * attempts to the current point use this function.
     *
     * ```java
     * private int responseCount(Response response) {
     *   int result = 1;
     *   while ((response = response.priorResponse()) != null) {
     *     result++;
     *   }
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 5.5K bytes
    - Viewed (0)
  8. cmd/lock-rest-server.go

    	"github.com/minio/minio/internal/grid"
    	"github.com/minio/minio/internal/logger"
    )
    
    // To abstract a node over network.
    type lockRESTServer struct {
    	ll *localLocker
    }
    
    // RefreshHandler - refresh the current lock
    func (l *lockRESTServer) RefreshHandler(args *dsync.LockArgs) (*dsync.LockResp, *grid.RemoteErr) {
    	resp := lockRPCRefresh.NewResponse()
    	refreshed, err := l.ll.Refresh(context.Background(), *args)
    	if err != nil {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Jul 29 18:10:04 UTC 2024
    - 5.8K bytes
    - Viewed (0)
  9. docs/batch-jobs/README.md

      mc batch - manage batch jobs
    
    USAGE:
      mc batch COMMAND [COMMAND FLAGS | -h] [ARGUMENTS...]
    
    COMMANDS:
      generate  generate a new batch job definition
      start     start a new batch job
      list, ls  list all current batch jobs
      status    summarize job events on MinIO server in real-time
      describe  describe job definition for a job
    ```
    
    ### Generate a job yaml
    ```
    mc batch generate alias/ replicate
    ```
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Oct 06 06:00:43 UTC 2022
    - 4.8K bytes
    - Viewed (0)
  10. cmd/encryption-v1_test.go

    		toRead := readLen
    		readStart := false
    		for i, v := range s {
    			partOffset := int64(0)
    			partDarePkgOffset := int64(0)
    			if !readStart && cumulativeSum+v > skipLen {
    				// Read starts at the current part
    				readStart = true
    
    				partOffset = skipLen - cumulativeSum
    
    				// All return values except `l` are
    				// calculated here.
    				sn = uint32(partOffset / pkgSz)
    				skip = partOffset % pkgSz
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sat Sep 24 04:17:08 UTC 2022
    - 19.9K bytes
    - Viewed (0)
Back to top