Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 271 - 280 of 381 for recessive (0.09 seconds)

  1. fess-crawler/src/main/java/org/codelibs/fess/crawler/client/storage/StorageClient.java

                    final ListObjectsArgs args = ListObjectsArgs.builder()
                            .bucket(bucketName)
                            .prefix(path)
                            .recursive(false)
                            .includeUserMetadata(false)
                            .useApiVersion1(false)
                            .build();
                    for (final Result<Item> result : minioClient.listObjects(args)) {
    Created: Sat Dec 20 11:21:39 GMT 2025
    - Last Modified: Mon Nov 24 03:59:47 GMT 2025
    - 20K bytes
    - Click Count (2)
  2. cmd/batch-rotate.go

    //     kmskey: "key-id" # match objects with KMS key-id (applicable only for sse-kms)
    //   notify:
    //     endpoint: "https://notify.endpoint" # notification endpoint to receive job status events
    //     token: "Bearer xxxxx" # optional authentication token for the notification endpoint
    
    //   retry:
    //     attempts: 10 # number of retries for the job before giving up
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 14.7K bytes
    - Click Count (0)
  3. guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java

          }
        }
      }
    
      private void recurse(int level) {
        // We're going to reuse the stimuli array 3^steps times by overwriting it
        // in a recursive loop.  Sneaky.
        if (level == stimuli.length) {
          // We've filled the array.
          compareResultsForThisListOfStimuli();
        } else {
          // Keep recursing to fill the array.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed May 14 19:40:47 GMT 2025
    - 21.4K bytes
    - Click Count (0)
  4. guava/src/com/google/common/math/BigIntegerMath.java

       * if {@code n == 0}.
       *
       * <p><b>Warning:</b> the result takes <i>O(n log n)</i> space, so use cautiously.
       *
       * <p>This uses an efficient binary recursive algorithm to compute the factorial with balanced
       * multiplies. It also removes all the 2s from the intermediate products (shifting them back in at
       * the end).
       *
       * @throws IllegalArgumentException if {@code n < 0}
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 18.8K bytes
    - Click Count (0)
  5. android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java

          throw new RuntimeException(Arrays.toString(stimuli), e);
        }
      }
    
      private void recurse(int level) {
        // We're going to reuse the stimuli array 3^steps times by overwriting it
        // in a recursive loop.  Sneaky.
        if (level == stimuli.length) {
          // We've filled the array.
          compareResultsForThisListOfStimuli();
        } else {
          // Keep recursing to fill the array.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed May 14 19:40:47 GMT 2025
    - 20.8K bytes
    - Click Count (0)
  6. cmd/background-newdisks-heal-ops.go

    // delete the tracker on disk.
    func (h *healingTracker) delete(ctx context.Context) error {
    	return h.disk.Delete(ctx, minioMetaBucket,
    		pathJoin(bucketMetaPrefix, healingTrackerFilename),
    		DeleteOptions{
    			Recursive: false,
    			Immediate: false,
    		},
    	)
    }
    
    func (h *healingTracker) isHealed(bucket string) bool {
    	h.mu.RLock()
    	defer h.mu.RUnlock()
    	return slices.Contains(h.HealedBuckets, bucket)
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 16.5K bytes
    - Click Count (0)
  7. guava/src/com/google/common/base/Throwables.java

          e.initCause(throwable);
          throw e;
        }
      }
    
      /**
       * Returns a string containing the result of {@link Throwable#toString() toString()}, followed by
       * the full, recursive stack trace of {@code throwable}. Note that you probably should not be
       * parsing the resulting string; if you need programmatic access to the stack frames, you can call
       * {@link Throwable#getStackTrace()}.
       */
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 20.6K bytes
    - Click Count (0)
  8. docs/en/docs/advanced/security/oauth2-scopes.md

    In this example we are using the OAuth2 "password" flow.
    
    This is appropriate when we are logging in to our own application, probably with our own frontend.
    
    Because we can trust it to receive the `username` and `password`, as we control it.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 10:49:48 GMT 2025
    - 13.5K bytes
    - Click Count (0)
  9. cmd/metrics-resource.go

    	interval := fmt.Sprintf("%ds", int(resourceMetricsCollectionInterval.Seconds()))
    	resourceMetricsHelpMap = map[MetricName]string{
    		interfaceRxBytes:  "Bytes received on the interface in " + interval,
    		interfaceRxErrors: "Receive errors in " + interval,
    		interfaceTxBytes:  "Bytes transmitted in " + interval,
    		interfaceTxErrors: "Transmit errors in " + interval,
    		total:             "Total memory on the node",
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Oct 10 18:57:03 GMT 2025
    - 17.2K bytes
    - Click Count (0)
  10. cmd/erasure-object_test.go

    		files, _ := disk.ListDir(ctx, "", bucket, object, -1)
    		for _, file := range files {
    			if file != "xl.meta" {
    				disk.Delete(ctx, bucket, pathJoin(object, file), DeleteOptions{
    					Recursive: true,
    					Immediate: false,
    				})
    			}
    		}
    	}
    
    	gr, err := xl.GetObjectNInfo(ctx, bucket, object, nil, nil, opts)
    	if err != nil {
    		if err != toObjectErr(errErasureReadQuorum, bucket, object) {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 38.3K bytes
    - Click Count (0)
Back to Top