Search Options

Results per page
Sort
Preferred Languages
Advance

Results 131 - 140 of 3,054 for have (0.47 sec)

  1. android/guava/src/com/google/common/graph/PredecessorsFunction.java

     * with any other implementation of this interface.
     *
     * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
     * which has a method {@code getParents()} that retrieves its predecessors in a graph:
     *
     * {@snippet :
     * someGraphAlgorithm(startNode, MyNode::getParents);
     * }
     *
     * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/graph/SuccessorsFunction.java

     * any other implementation of this interface.
     *
     * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
     * which has a method {@code getChildren()} that retrieves its successors in a graph:
     *
     * {@snippet :
     * someGraphAlgorithm(startNode, MyNode::getChildren);
     * }
     *
     * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  3. cmd/erasure-metadata-utils_test.go

    		ignoredErrs []error
    		err         error
    	}{
    		// Validate if have reduced properly.
    		{[]error{
    			errDiskNotFound,
    			errDiskNotFound,
    			errDiskFull,
    		}, []error{}, errErasureReadQuorum},
    		// Validate if have no consensus.
    		{[]error{
    			errDiskFull,
    			errDiskNotFound,
    			nil, nil,
    		}, []error{}, errErasureReadQuorum},
    		// Validate if have consensus and errors ignored.
    		{[]error{
    			errVolumeNotFound,
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  4. guava/src/com/google/common/base/FinalizableReferenceQueue.java

     *
     * <p>Keep a strong reference to this object until all of the associated referents have been
     * finalized. If this object is garbage collected earlier, the backing thread will not invoke {@code
     * finalizeReferent()} on the remaining references.
     *
     * <p>As an example of how this is used, imagine you have a class {@code MyServer} that creates a
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 14.7K bytes
    - Viewed (0)
  5. impl/maven-cli/src/test/java/org/apache/maven/cling/invoker/mvnup/goals/StrategyOrchestratorTest.java

                assertEquals(0, result.processedPoms().size(), "Should have no processed POMs");
                assertEquals(0, result.modifiedPoms().size(), "Should have no modified POMs");
                assertEquals(0, result.errorPoms().size(), "Should have no error POMs");
            }
    
            @Test
            @DisplayName("should handle overlapping POM modifications")
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Tue Nov 18 18:03:26 UTC 2025
    - 12.3K bytes
    - Viewed (0)
  6. impl/maven-core/src/test/java/org/apache/maven/internal/transformation/impl/ConsumerPomArtifactTransformerTest.java

            DeployRequest request = createDeployRequestWithConsumerPom();
    
            DeployRequest result = transformer.remapDeployArtifacts(session, request);
    
            // Should have both consumer POM (no classifier) and build POM (with "build" classifier)
            Collection<Artifact> artifacts = result.getArtifacts();
            assertEquals(3, artifacts.size()); // original jar + consumer pom + build pom
    
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Thu Nov 06 18:32:25 UTC 2025
    - 13.3K bytes
    - Viewed (0)
  7. docs/en/docs/tutorial/query-params.md

    * Data validation
    * Automatic documentation
    
    ## Defaults { #defaults }
    
    As query parameters are not a fixed part of a path, they can be optional and can have default values.
    
    In the example above they have default values of `skip=0` and `limit=10`.
    
    So, going to the URL:
    
    ```
    http://127.0.0.1:8000/items/
    ```
    
    would be the same as going to:
    
    ```
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 4.5K bytes
    - Viewed (0)
  8. cmd/data-usage-utils.go

    	// Total Size for objects that have not yet been replicated
    	ReplicationPendingSizeV1 uint64 `json:"objectsPendingReplicationTotalSize"`
    	// Total size for objects that have witness one or more failures and will be retried
    	ReplicationFailedSizeV1 uint64 `json:"objectsFailedReplicationTotalSize"`
    	// Total size for objects that have been replicated to destination
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Mar 10 09:15:15 UTC 2024
    - 6.4K bytes
    - Viewed (0)
  9. docs/en/docs/advanced/sub-applications.md

    # Sub Applications - Mounts { #sub-applications-mounts }
    
    If you need to have two independent FastAPI applications, with their own independent OpenAPI and their own docs UIs, you can have a main app and "mount" one (or more) sub-application(s).
    
    ## Mounting a **FastAPI** application { #mounting-a-fastapi-application }
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 3K bytes
    - Viewed (0)
  10. internal/bpool/bpool_test.go

    	bp.Put(make([]byte, width))           // wrong capacity is rejected (very less)
    	if len(bp.c) > 0 {
    		t.Fatal("bytepool should have rejected invalid packets")
    	}
    
    	// Try putting a short slice into pool
    	bp.Put(make([]byte, bp.w, bp.wcap)[:2])
    	if len(bp.c) != 1 {
    		t.Fatal("bytepool should have accepted short slice with sufficient capacity")
    	}
    
    	b = bp.Get()
    	if len(b) != width {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 2.7K bytes
    - Viewed (0)
Back to top