Search Options

Results per page
Sort
Preferred Languages
Advance

Results 531 - 540 of 1,487 for makes (1.38 sec)

  1. internal/s3select/message.go

    	writer := &messageWriter{
    		writer:          w,
    		getProgressFunc: getProgressFunc,
    
    		payloadBuffer: make([]byte, bufLength),
    		payloadCh:     make(chan *bytes.Buffer, 1),
    
    		errCh:  make(chan []byte),
    		doneCh: make(chan struct{}),
    	}
    	go writer.start()
    	return writer
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Feb 18 16:25:55 UTC 2025
    - 15.3K bytes
    - Viewed (0)
  2. src/main/java/jcifs/NameServiceClient.java

         */
        NetbiosName getUnknownName();
    
        /**
         * Retrieve all addresses of a host by it's address. NetBIOS hosts can
         * have many names for a given IP address. The name and IP address make the
         * NetBIOS address. This provides a way to retrieve the other names for a
         * host with the same IP address.
         *
         * @param addr
         *            the address to query
         * @return resolved addresses
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 8.4K bytes
    - Viewed (0)
  3. callbacks/update.go

    				}
    			}
    		}
    	}
    
    	switch value := updatingValue.Interface().(type) {
    	case map[string]interface{}:
    		set = make([]clause.Assignment, 0, len(value))
    
    		keys := make([]string, 0, len(value))
    		for k := range value {
    			keys = append(keys, k)
    		}
    		sort.Strings(keys)
    
    		for _, k := range keys {
    			kv := value[k]
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 9.6K bytes
    - Viewed (0)
  4. internal/bucket/replication/replication.go

    	}
    	// replication config should have at least one rule
    	if len(c.Rules) == 0 {
    		return errReplicationNoRule
    	}
    
    	// Validate all the rules in the replication config
    	targetMap := make(map[string]struct{})
    	priorityMap := make(map[string]struct{})
    	var legacyArn bool
    	for _, r := range c.Rules {
    		if _, ok := targetMap[r.Destination.Bucket]; !ok {
    			targetMap[r.Destination.Bucket] = struct{}{}
    		}
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Mar 30 00:56:02 UTC 2025
    - 8.9K bytes
    - Viewed (0)
  5. docs/en/docs/tutorial/static-files.md

    ///
    
    ### What is "Mounting" { #what-is-mounting }
    
    "Mounting" means adding a complete "independent" application in a specific path, that then takes care of handling all the sub-paths.
    
    This is different from using an `APIRouter` as a mounted application is completely independent. The OpenAPI and docs from your main application won't include anything from the mounted application, etc.
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 1.7K bytes
    - Viewed (0)
  6. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RoutePlanner.kt

     *     the same connection for an initial exchange and its follow-ups may improve locality.
     *
     *  2. If there is a connection in the pool that can satisfy the request it is used. Note that it is
     *     possible for shared exchanges to make requests to different host names! See
     *     [RealConnection.isEligible] for details.
     *
     *  3. Attempt plans from prior connect attempts for this call. These occur as either follow-ups to
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Tue May 27 14:58:02 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  7. guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java

          int j = i & ARRAY_MASK;
          tmp += UnsignedLongs.remainder(longs[j], divisors[j]);
        }
        return tmp;
      }
    
      @Benchmark
      long parseUnsignedLong(int reps) {
        long tmp = 0;
        // Given that we make three calls per pass, we scale reps down in order
        // to do a comparable amount of work to other measurements.
        int scaledReps = reps / 3 + 1;
        for (int i = 0; i < scaledReps; i++) {
          int j = i & ARRAY_MASK;
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Dec 28 01:26:26 UTC 2024
    - 4.4K bytes
    - Viewed (0)
  8. docs/en/docs/tutorial/path-operation-configuration.md

    ### Tags with Enums { #tags-with-enums }
    
    If you have a big application, you might end up accumulating **several tags**, and you would want to make sure you always use the **same tag** for related *path operations*.
    
    In these cases, it could make sense to store the tags in an `Enum`.
    
    **FastAPI** supports that the same way as with plain strings:
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 4.1K bytes
    - Viewed (0)
  9. compat/maven-compat/src/main/java/org/apache/maven/artifact/resolver/ArtifactCollector.java

    import org.apache.maven.artifact.metadata.ArtifactMetadataSource;
    import org.apache.maven.artifact.repository.ArtifactRepository;
    import org.apache.maven.artifact.resolver.filter.ArtifactFilter;
    
    /**
     * Artifact collector - takes a set of original artifacts and resolves the best versions to use
     * along with their metadata. No artifacts are downloaded.
     */
    @Deprecated
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Sat Apr 05 11:52:05 UTC 2025
    - 1.8K bytes
    - Viewed (0)
  10. tests/test_depends_hashable.py

    # This is more or less a workaround to make Depends and Security hashable
    # as other tools that use them depend on that
    # Ref: https://github.com/fastapi/fastapi/pull/14320
    
    from fastapi import Depends, Security
    
    
    def dep():
        pass
    
    
    def test_depends_hashable():
        dep()  # just for coverage
        d1 = Depends(dep)
        d2 = Depends(dep)
        d3 = Depends(dep, scope="function")
        d4 = Depends(dep, scope="function")
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Nov 19 16:50:18 UTC 2025
    - 596 bytes
    - Viewed (0)
Back to top