Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 1,224 for numIter (0.06 sec)

  1. cmd/namespace-lock_test.go

    )
    
    // WARNING:
    //
    // Expected source line number is hard coded, 35, in the
    // following test. Adding new code before this test or changing its
    // position will cause the line number to change and the test to FAIL
    // Tests getSource().
    func TestGetSource(t *testing.T) {
    	currentSource := func() string { return getSource(2) }
    	gotSource := currentSource()
    	// Hard coded line number, 35, in the "expectedSource" value
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Apr 23 18:58:53 UTC 2021
    - 3.1K bytes
    - Viewed (0)
  2. guava/src/com/google/common/util/concurrent/RateLimiter.java

      }
    
      /**
       * Acquires the given number of permits from this {@code RateLimiter}, blocking until the request
       * can be granted. Tells the amount of time slept, if any.
       *
       * @param permits the number of permits to acquire
       * @return time spent sleeping to enforce rate, in seconds; 0.0 if not rate-limited
       * @throws IllegalArgumentException if the requested number of permits is negative or zero
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:51:36 UTC 2024
    - 21.6K bytes
    - Viewed (0)
  3. .github/workflows/create_issue.js

      @return {string} Returns the issue number and title
    */
    module.exports = async ({github, context}) => {
      const rollback_commit = context.payload.head_commit.id;
      const pr_match_groups = context.payload.head_commit.message.match(/\Rollback of PR #(\d+).*/) || [];
      if (pr_match_groups.length != 2) {
        console.log(`PR Number not found in ${context.payload.head_commit.message}`);
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Mon Oct 18 23:04:59 UTC 2021
    - 2.8K bytes
    - Viewed (0)
  4. docs/distributed/DESIGN.md

    with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.
    
    - *If total number of nodes are of odd number then GCD algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but this would lead to uneven distribution,...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 15 23:04:20 UTC 2023
    - 8K bytes
    - Viewed (0)
  5. manifests/charts/base/files/crd-all.gen.yaml

                              number:
                                maximum: 65535
                                minimum: 1
                                type: integer
                            required:
                            - number
                            type: object
                          type: array
                          x-kubernetes-list-map-keys:
                          - number
                          x-kubernetes-list-type: map
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Fri Nov 01 16:23:52 UTC 2024
    - 805K bytes
    - Viewed (0)
  6. tests/test_tutorial/test_body_fields/test_tutorial001_an_py310.py

                                "type": "number",
                                "description": "The price must be greater than zero",
                            },
                            "tax": IsDict(
                                {
                                    "title": "Tax",
                                    "anyOf": [{"type": "number"}, {"type": "null"}],
                                }
                            )
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Thu Apr 18 19:40:57 UTC 2024
    - 7.3K bytes
    - Viewed (0)
  7. docs/en/docs/js/termynal.js

         * @param {string} options.prefix - Prefix to use for data attributes.
         * @param {number} options.startDelay - Delay before animation, in ms.
         * @param {number} options.typeDelay - Delay between each typed character, in ms.
         * @param {number} options.lineDelay - Delay between each line, in ms.
         * @param {number} options.progressLength - Number of characters displayed as progress bar.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Thu May 12 00:06:16 UTC 2022
    - 9.3K bytes
    - Viewed (0)
  8. cmd/xl-storage-format_test.go

    	} else {
    		for i := 0; i < len(unMarshalXLMeta.Parts); i++ {
    			if unMarshalXLMeta.Parts[i].Number != jsoniterXLMeta.Parts[i].Number {
    				t.Errorf("Expected the number of part %d to be \"%d\", got \"%d\".", i+1, unMarshalXLMeta.Parts[i].Number, jsoniterXLMeta.Parts[i].Number)
    			}
    			if unMarshalXLMeta.Parts[i].Size != jsoniterXLMeta.Parts[i].Size {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Feb 22 06:26:06 UTC 2024
    - 17.6K bytes
    - Viewed (0)
  9. cmd/benchmark-utils_test.go

    	if err != nil {
    		b.Fatal(err)
    	}
    
    	// get text data generated for number of bytes equal to object size.
    	textData := generateBytesData(objSize)
    	// generate md5sum for the generated data.
    	// md5sum of the data to written is required as input for PutObject.
    
    	md5hex := getMD5Hash(textData)
    	sha256hex := ""
    
    	// benchmark utility which helps obtain number of allocations and bytes allocated per ops.
    	b.ReportAllocs()
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Dec 23 15:46:00 UTC 2022
    - 8.2K bytes
    - Viewed (0)
  10. guava/src/com/google/common/hash/BloomFilterStrategies.java

          }
          return array;
        }
    
        /** Number of bits */
        long bitSize() {
          return (long) data.length() * Long.SIZE;
        }
    
        /**
         * Number of set bits (1s).
         *
         * <p>Note that because of concurrent set calls and uses of atomics, this bitCount is a (very)
         * close *estimate* of the actual number of bits set. It's not possible to do better than an
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 10 19:45:10 UTC 2022
    - 10.7K bytes
    - Viewed (0)
Back to top