Search Options

Results per page
Sort
Preferred Languages
Advance

Results 271 - 280 of 345 for mounted (0.06 sec)

  1. helm/minio/README.md

    ```bash
    helm install --name my-release -f values.yaml minio/minio
    ```
    
    ### Persistence
    
    This chart provisions a PersistentVolumeClaim and mounts corresponding persistent volume to default location `/export`. You'll need physical storage available in the Kubernetes cluster for this to work. If you'd rather use `emptyDir`, disable PersistentVolumeClaim by:
    
    ```bash
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Jan 24 07:27:57 UTC 2024
    - 10.9K bytes
    - Viewed (0)
  2. tensorflow/c/c_api.h

    TF_CAPI_EXPORT extern TF_Library* TF_LoadLibrary(const char* library_filename,
                                                     TF_Status* status);
    
    // Get the OpList of OpDefs defined in the library pointed by lib_handle.
    //
    // Returns a TF_Buffer. The memory pointed to by the result is owned by
    // lib_handle. The data in the buffer will be the serialized OpList proto for
    // ops defined in the library.
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Thu Oct 26 21:08:15 UTC 2023
    - 82.3K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/math/Quantiles.java

          // Since scale is a positive int, index is in [0, scale], and (dataset.length - 1) is a
          // non-negative int, we can do long-arithmetic on index * (dataset.length - 1) / scale to get
          // a rounded ratio and a remainder which can be expressed as ints, without risk of overflow:
          int quotient = (int) LongMath.divide(numerator, scale, RoundingMode.DOWN);
          int remainder = (int) (numerator - (long) quotient * scale);
    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. cmd/endpoint.go

    			return nil, fmt.Errorf("duplicate endpoints found")
    		}
    		uniqueArgs.Add(arg)
    		endpoints = append(endpoints, endpoint)
    	}
    
    	return endpoints, nil
    }
    
    // Checks if there are any cross device mounts.
    func checkCrossDeviceMounts(endpoints Endpoints) (err error) {
    	var absPaths []string
    	for _, endpoint := range endpoints {
    		if endpoint.IsLocal {
    			var absPath string
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jun 21 22:22:24 UTC 2024
    - 34.2K bytes
    - Viewed (0)
  5. guava/src/com/google/common/collect/DiscreteDomain.java

     * {@link #previous} and {@link #distance}, according to their specifications. The methods {@link
     * #minValue} and {@link #maxValue} should also be overridden for bounded types.
     *
     * <p>A discrete domain always represents the <i>entire</i> set of values of its type; it cannot
     * represent partial domains such as "prime integers" or "strings of length 5."
     *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Feb 22 21:19:52 UTC 2024
    - 10.3K bytes
    - Viewed (0)
  6. guava/src/com/google/common/base/Stopwatch.java

        return isRunning ? ticker.read() - startTick + elapsedNanos : elapsedNanos;
      }
    
      /**
       * Returns the current elapsed time shown on this stopwatch, expressed in the desired time unit,
       * with any fraction rounded down.
       *
       * <p><b>Note:</b> the overhead of measurement can be more than a microsecond, so it is generally
       * not useful to specify {@link TimeUnit#NANOSECONDS} precision here.
       *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 31 14:20:11 UTC 2024
    - 9.3K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/hash/HashingTest.java

       * {@link #testSeededHashFunctionEquals} because the parameter to {@code goodFastHash} is a size,
       * not a seed, and because that size is rounded up. Thus, {@code goodFastHash} instances with
       * different parameters can be equal. That fact is a problem for {@code
       * testSeededHashFunctionEquals}.
       */
      public void testGoodFastHashEquals() throws Exception {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 09 17:40:09 UTC 2024
    - 26.3K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/util/concurrent/Futures.java

       * Future}.
       *
       * <p>Usage example:
       *
       * <pre>{@code
       * ListenableFuture<Integer> fetchCounterFuture = ...;
       *
       * // Falling back to a zero counter in case an exception happens when
       * // processing the RPC to fetch counters.
       * ListenableFuture<Integer> faultTolerantFuture = Futures.catching(
       *     fetchCounterFuture, FetchException.class, x -> 0, directExecutor());
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 13:13:32 UTC 2024
    - 64.7K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/collect/Ordering.java

      }
    
      @J2ktIncompatible // MapMaker
      @VisibleForTesting
      static class ArbitraryOrdering extends Ordering<@Nullable Object> {
    
        private final AtomicInteger counter = new AtomicInteger(0);
        private final ConcurrentMap<Object, Integer> uids =
            Platform.tryWeakKeys(new MapMaker()).makeMap();
    
        private Integer getUid(Object obj) {
          Integer uid = uids.get(obj);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 39.4K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/Lists.java

       *
       * <p>Note that if any input list is empty, the Cartesian product will also be empty. If no lists
       * 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 lists of size {@code m, n, p} is a
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 43.1K bytes
    - Viewed (0)
Back to top