Search Options

Results per page
Sort
Preferred Languages
Advance

Results 2341 - 2350 of 2,375 for requis (0.04 sec)

  1. cmd/erasure-server-pool-decom.go

    	z.poolMetaMutex.Lock()
    	var dctx context.Context
    	dctx, z.decommissionCancelers[idx] = context.WithCancel(GlobalContext)
    	z.poolMetaMutex.Unlock()
    
    	// Generate an empty request info so it can be directly modified later by audit
    	dctx = logger.SetReqInfo(dctx, &logger.ReqInfo{})
    
    	if err := z.decommissionInBackground(dctx, idx); err != nil {
    		decomLogIf(GlobalContext, err)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 42.1K bytes
    - Viewed (1)
  2. doc/go_spec.html

    0X_1FFFP-16  // == 0.1249847412109375
    0x15e-2      // == 0x15e - 2 (integer subtraction)
    
    0x.p1        // invalid: mantissa has no digits
    1p-2         // invalid: p exponent requires hexadecimal mantissa
    0x1.5e-2     // invalid: hexadecimal mantissa requires p exponent
    1_.5         // invalid: _ must separate successive digits
    1._5         // invalid: _ must separate successive digits
    1.5_e1       // invalid: _ must separate successive digits
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue May 06 19:12:15 UTC 2025
    - 286.2K bytes
    - Viewed (0)
  3. cmd/notification.go

    	}
    	return ng.Wait()
    }
    
    var errPeerNotReachable = errors.New("peer is not reachable")
    
    // GetLocks - makes GetLocks RPC call on all peers.
    func (sys *NotificationSys) GetLocks(ctx context.Context, r *http.Request) []*PeerLocks {
    	locksResp := make([]*PeerLocks, len(sys.peerClients))
    	g := errgroup.WithNErrs(len(sys.peerClients))
    	for index, client := range sys.peerClients {
    		client := client
    		g.Go(func() error {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 45.9K bytes
    - Viewed (0)
  4. src/main/webapp/js/admin/popper.min.js.map

    /** @prop {String|HTMLElement} element='[x-arrow]' - Selector or node used as arrow */\n    element: '[x-arrow]',\n  },\n\n  /**\n   * Modifier used to flip the popper's placement when it starts to overlap its\n   * reference element.\n   *\n   * Requires the `preventOverflow` modifier before it in order to work.\n   *\n   * **NOTE:** this modifier will interrupt the current update cycle and will\n   * restart it if it detects the need to flip the placement.\n   * @memberof modifiers\n   * @inner\n...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 120.9K bytes
    - Viewed (0)
  5. docs/ja/docs/deployment/docker.md

    * <a href="https://hub.docker.com/_/mongo" class="external-link" target="_blank">MongoDB</a>
    * <a href="https://hub.docker.com/_/redis" class="external-link" target="_blank">Redis</a>, etc.
    
    予め作成されたコンテナ・イメージを使用することで、異なるツールを**組み合わせて**使用することが非常に簡単になります。例えば、新しいデータベースを試す場合に特に便利です。ほとんどの場合、**公式イメージ**を使い、環境変数で設定するだけで良いです。
    
    そうすれば多くの場合、コンテナとDockerについて学び、その知識をさまざまなツールやコンポーネントによって再利用することができます。
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Aug 12 21:47:53 UTC 2024
    - 44.3K bytes
    - Viewed (0)
  6. guava/src/com/google/common/util/concurrent/Monitor.java

       * - Favor responding to interrupts over timeouts.
       * - System.nanoTime() is expensive enough that we want to call it the minimum required number of
       *   times, typically once before invoking a blocking method. This often requires keeping track of
       *   the first time in a method that nanoTime() has been invoked, for which the special value 0L
       *   is reserved to mean "uninitialized". If timeout is non-positive, then nanoTime need never be
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 42.8K bytes
    - Viewed (0)
  7. docs/metrics/prometheus/grafana/bucket/minio-bucket.json

              "interval": "1m",
              "intervalFactor": 2,
              "legendFormat": "{{bucket,api}}",
              "refId": "A"
            }
          ],
          "title": "S3 API Request 4xx Error Rate",
          "type": "timeseries"
        },
        {
          "datasource": {
            "type": "prometheus",
            "uid": "${DS_PROMETHEUS}"
          },
          "fieldConfig": {
            "defaults": {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon Aug 04 01:46:49 UTC 2025
    - 101.9K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/base/Preconditions.java

       * nullness checker can already "prove" are non-null. That means that the first parameter to
       * checkNotNull *should* be annotated to require it to be non-null.
       *
       * However, for a variety of reasons, Google developers have written a ton of code over the past
       * decade that assumes that they can use checkNotNull for non-precondition checks. I had hoped to
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 10 22:11:00 UTC 2025
    - 53K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/base/CharMatcher.java

      }
    
      /**
       * Returns a {@code char} matcher functionally equivalent to this one, but which may be faster to
       * query than the original; your mileage may vary. Precomputation takes time and requires more
       * memory, so it is only likely to be worthwhile if the precomputed matcher is queried very often.
       *
       * <p>This method has no effect (returns {@code this}) when called in GWT: it's unclear whether a
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 53.9K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/Iterators.java

      }
    
      /**
       * An iterator that performs a lazy N-way merge, calculating the next value each time the iterator
       * is polled. This amortizes the sorting cost over the iteration and requires less memory than
       * sorting all elements at once.
       *
       * <p>Retrieving a single element takes approximately O(log(M)) time, where M is the number of
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 50.5K bytes
    - Viewed (0)
Back to top