Search Options

Results per page
Sort
Preferred Languages
Advance

Results 311 - 320 of 345 for mounted (0.15 sec)

  1. android/guava/src/com/google/common/collect/Sets.java

       *
       * <p>Note that if any input set is empty, the Cartesian product will also be empty. If no sets at
       * all are provided (an empty list), the resulting Cartesian product has one element, an empty
       * list (counter-intuitive, but mathematically consistent).
       *
       * <p><i>Performance notes:</i> while the cartesian product of sets of size {@code m, n, p} is a
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 21 14:28:19 UTC 2024
    - 78.8K bytes
    - Viewed (0)
  2. docs/en/docs/release-notes.md

    * Start translations for Italian. PR [#1557](https://github.com/tiangolo/fastapi/pull/1557) by [@csr](https://github.com/csr).
    
    ## 0.56.0
    
    * Add support for ASGI `root_path`:
        * Use `root_path` internally for mounted applications, so that OpenAPI and the docs UI works automatically without extra configurations and parameters.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Fri Nov 01 11:25:57 UTC 2024
    - 460.3K bytes
    - Viewed (0)
  3. common-protos/k8s.io/api/apps/v1beta2/generated.proto

      // MaxUnavailableStatefulSet feature. The field applies to all pods in the range 0 to
      // Replicas-1. That means if there is any unavailable pod in the range 0 to Replicas-1, it
      // will be counted towards MaxUnavailable.
      // +optional
      optional k8s.io.apimachinery.pkg.util.intstr.IntOrString maxUnavailable = 2;
    }
    
    // Scale represents a scaling request for a resource.
    message Scale {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 36.4K bytes
    - Viewed (0)
  4. guava/src/com/google/common/io/ByteStreams.java

            // in.available() always returns 0 (the default).
            int skip = (int) min(remaining, BUFFER_SIZE);
            if (buf == null) {
              // Allocate a buffer bounded by the maximum size that can be requested, for
              // example an array of BUFFER_SIZE is unnecessary when the value of remaining
              // is smaller.
              buf = new byte[skip];
            }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 29.7K bytes
    - Viewed (0)
  5. cmd/sts-handlers.go

    	// because there will be a policy mapping stored on drives whose
    	// filename is this parentUser: therefore, it needs to have only valid
    	// filename characters and needs to have bounded length.
    	{
    		h := sha256.New()
    		h.Write([]byte("openid:" + subFromToken + ":" + issFromToken))
    		bs := h.Sum(nil)
    		cred.ParentUser = base64.RawURLEncoding.EncodeToString(bs)
    	}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 15 01:29:20 UTC 2024
    - 33.9K bytes
    - Viewed (0)
  6. tensorflow/c/eager/c_api.cc

    }
    
    // This function will block till the operation that produces `h` has
    // completed. This is only valid on local TFE_TensorHandles. Returns the size in
    // bytes of the memory pointed to by the device pointer returned above.
    size_t TFE_TensorHandleDeviceMemorySize(TFE_TensorHandle* h,
                                            TF_Status* status) {
      if (h == nullptr) {
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 43.9K bytes
    - Viewed (0)
  7. api/maven-api-core/src/main/java/org/apache/maven/api/Session.java

         */
        @Nonnull
        Instant getStartTime();
    
        /**
         * Gets the directory of the topmost project being built, usually the current directory or the
         * directory pointed at by the {@code -f/--file} command line argument.
         *
         * @return the directory of the topmost project, never {@code null}
         * @see Project#isTopProject()
         * @see #getRootDirectory()
         */
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 16:43:07 UTC 2024
    - 36.4K bytes
    - Viewed (0)
  8. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

     * the queue exceeds that value, the queue automatically removes its greatest element according to
     * its comparator (which might be the element that was just added). This is different from
     * conventional bounded queues, which either block or reject new elements when full.
     *
     * <p>This implementation is based on the <a
     * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
  9. guava/src/com/google/common/net/InetAddresses.java

       * Evaluates whether the argument is a 6to4 address.
       *
       * <p>6to4 addresses begin with the {@code "2002::/16"} prefix. The next 32 bits are the IPv4
       * address of the host to which IPv6-in-IPv4 tunneled packets should be routed.
       *
       * <p>For more on 6to4 addresses see section 2 of <a target="_parent"
       * href="http://tools.ietf.org/html/rfc3056#section-2">RFC 3056</a>.
       *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 47.1K bytes
    - Viewed (0)
  10. src/main/webapp/css/admin/adminlte.min.css

    a40!important}.border-white{border-color:#fff!important}.rounded-sm{border-radius:.2rem!important}.rounded{border-radius:.25rem!important}.rounded-top{border-top-left-radius:.25rem!important;border-top-right-radius:.25rem!important}.rounded-right{border-top-right-radius:.25rem!important;border-bottom-right-radius:.25rem!important}.rounded-bottom{border-bottom-right-radius:.25rem!important;border-bottom-left-radius:.25rem!important}.rounded-left{border-top-left-radius:.25rem!important;border-bott...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 1.3M bytes
    - Viewed (0)
Back to top