Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for trial (0.19 sec)

  1. android/guava-tests/test/com/google/common/base/Utf8Test.java

        utf8Lengths.put(MAX_CODE_POINT, 4);
    
        Integer[] codePoints = utf8Lengths.keySet().toArray(new Integer[] {});
        StringBuilder sb = new StringBuilder();
        Random rnd = new Random();
        for (int trial = 0; trial < 100; trial++) {
          sb.setLength(0);
          int utf8Length = 0;
          for (int i = 0; i < 6; i++) {
            Integer randomCodePoint = codePoints[rnd.nextInt(codePoints.length)];
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 12.8K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java

        Random random = new Random();
        int warmupPermits = 10;
        double[] coldFactorsToTest = {2.0, 3.0, 10.0};
        double[] qpsToTest = {4.0, 2.0, 1.0, 0.5, 0.1};
        for (int trial = 0; trial < 100; trial++) {
          for (double coldFactor : coldFactorsToTest) {
            for (double qps : qpsToTest) {
              // If warmupPermits = maxPermits - thresholdPermits then
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 21.9K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java

        Random random = new Random();
        int warmupPermits = 10;
        double[] coldFactorsToTest = {2.0, 3.0, 10.0};
        double[] qpsToTest = {4.0, 2.0, 1.0, 0.5, 0.1};
        for (int trial = 0; trial < 100; trial++) {
          for (double coldFactor : coldFactorsToTest) {
            for (double qps : qpsToTest) {
              // If warmupPermits = maxPermits - thresholdPermits then
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 21.9K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/hash/HashTestUtils.java

       */
      static void checkAvalanche(HashFunction function, int trials, double epsilon) {
        Random rand = new Random(0);
        int keyBits = 32;
        int hashBits = function.bits();
        for (int i = 0; i < keyBits; i++) {
          int[] same = new int[hashBits];
          int[] diff = new int[hashBits];
          // go through trials to compute probability
          for (int j = 0; j < trials; j++) {
            int key1 = rand.nextInt();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 25.6K bytes
    - Viewed (0)
Back to top