Search Options

Results per page
Sort
Preferred Languages
Advance

Results 111 - 120 of 124 for Repeat (0.07 sec)

  1. ci/official/utilities/code_check_full.bats

        cat <<EOF
    Please rename files so there are no repeats. For example, README.md and
    Readme.md would be the same file on Windows. In this test, you would get a
    warning for "readme.md" because it makes everything lowercase. There are
    repeats of these filename(s) with different casing:
    EOF
        find . | tr '[A-Z]' '[a-z]' | sort | uniq -d | tee $BATS_FILE_TMPDIR/repeats
        [[ ! -s $BATS_FILE_TMPDIR/repeats ]]
    }
    
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Fri Dec 19 18:47:57 UTC 2025
    - 13.5K bytes
    - Viewed (0)
  2. CHANGELOG/CHANGELOG-1.18.md

     - Fixed a 1.18 regression in wait.Forever that skips the backoff period on the first repeat ([#90476](https://github.com/kubernetes/kubernetes/pull/90476), [@zhan849](https://github.com/zhan849)) [SIG API Machinery]
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Wed Jun 16 17:18:28 UTC 2021
    - 373.2K bytes
    - Viewed (0)
  3. CHANGELOG/CHANGELOG-1.19.md

    - Fixed a 1.18 regression in wait.Forever that skips the backoff period on the first repeat ([#90476](https://github.com/kubernetes/kubernetes/pull/90476), [@zhan849](https://github.com/zhan849)) [SIG API Machinery]
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Wed Jan 05 05:42:32 UTC 2022
    - 489.7K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/hash/BloomFilterTest.java

            assertThat(BloomFilter.optimalNumOfBits(n, fpp)).isAtLeast(0);
          }
        }
    
        // some random values
        Random random = new Random(0);
        for (int repeats = 0; repeats < 10000; repeats++) {
          assertThat(BloomFilter.optimalNumOfBits(random.nextInt(1 << 16), random.nextDouble()))
              .isAtLeast(0);
        }
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 22.1K bytes
    - Viewed (0)
  5. android/guava-tests/benchmark/com/google/common/hash/HashStringBenchmark.java

              // sequences - "Western European" text
              return 0x90;
            } else if (userFriendly.matches("(?i)(?:Branch.*Prediction.*Hostile)")) {
              // Defeat branch predictor for: c < 0x80 ; branch taken 50% of the time.
              return 0x100;
            } else if (userFriendly.matches("(?i)(?:Greek|Cyrillic|European|ISO.?8859)")) {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 5.3K bytes
    - Viewed (0)
  6. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    2E5E..2E7F    ; disallowed                             # NA   <reserved-2E5E>..<reserved-2E7F>
    2E80..2E99    ; valid                  ;      ; NV8    # 3.0  CJK RADICAL REPEAT..CJK RADICAL RAP
    2E9A          ; disallowed                             # NA   <reserved-2E9A>
    2E9B..2E9E    ; valid                  ;      ; NV8    # 3.0  CJK RADICAL CHOKE..CJK RADICAL DEATH
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Sat Feb 10 11:25:47 UTC 2024
    - 854.1K bytes
    - Viewed (0)
  7. samples/crawler/src/main/java/okhttp3/sample/Crawler.java

    import okhttp3.Request;
    import okhttp3.Response;
    import org.jsoup.Jsoup;
    import org.jsoup.nodes.Document;
    import org.jsoup.nodes.Element;
    
    /**
     * Fetches HTML from a requested URL, follows the links, and repeats.
     */
    public final class Crawler {
      private final OkHttpClient client;
      private final Set<HttpUrl> fetchedUrls = Collections.synchronizedSet(new LinkedHashSet<>());
      private final BlockingQueue<HttpUrl> queue;
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Wed Jul 23 00:58:06 UTC 2025
    - 5K bytes
    - Viewed (0)
  8. CONTRIBUTING.md

    -   If all looks good, the reviewer will approve the PR.
    -   If a change is needed, the contributor is requested to make the suggested
        change.
    -   You make the change and submit it for the review again.
    -   This cycle repeats itself until the PR gets approved.
    -   Note: As a friendly reminder, we may reach out to you if the PR is awaiting
        your response for more than 2 weeks.
    
    **4. Approved**
    
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Sat Jan 11 04:47:59 UTC 2025
    - 15.9K bytes
    - Viewed (0)
  9. lib/fips140/v1.0.0-c2097c7c.zip

    testingOnlyRejection = nil }) var loopCount int testingOnlyRejection = func() { loopCount++ } // A sequence of all ones will generate 2^N-1, which should be rejected. // (Unless, for example, we are masking too many bits.) r := io.MultiReader(bytes.NewReader(bytes.Repeat([]byte{0xff}, 100)), rand.Reader) if k, p, err := randomPoint(c, func(b []byte) error { _, err := r.Read(b) return err }); err != nil { t.Fatal(err) } else if k.IsZero() == 1 { t.Error("k is zero") } else if p.Bytes()[0] != 4 { t.Error("p is infinity")...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  10. lib/fips140/v1.1.0-rc1.zip

    testingOnlyRejection = nil }) var loopCount int testingOnlyRejection = func() { loopCount++ } // A sequence of all ones will generate 2^N-1, which should be rejected. // (Unless, for example, we are masking too many bits.) r := io.MultiReader(bytes.NewReader(bytes.Repeat([]byte{0xff}, 100)), rand.Reader) if k, p, err := randomPoint(c, func(b []byte) error { _, err := r.Read(b) return err }); err != nil { t.Fatal(err) } else if k.IsZero() == 1 { t.Error("k is zero") } else if p.Bytes()[0] != 4 { t.Error("p is infinity")...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
Back to top