/** The maximum number of segments to allow; used to bound constructor arguments. */
  static final int MAX_SEGMENTS = 1 << 16; // slightly conservative

  /** Number of (unsynchronized) retries in the containsValue method. */
  static final int CONTAINS_VALUE_RETRIES = 3;

  /**
   * Number of cache access operations that can be buffered per segment before the cache's recency

   *
   * <p>After calling this method, you may not call {@link #finishToFuture()}, this method again, or
   * any other derivation method on the original {@code ClosingFuture} instance.
   *
   * @param consumer a callback whose method will be called (using {@code executor}) when this
   *     operation is done
   */

   * iterators that don't support {@code remove()}, but all other methods are supported by the bimap
   * and its views. When given a value that doesn't satisfy the predicate, the bimap's {@code
   * put()}, {@code forcePut()} and {@code putAll()} methods throw an {@link
   * IllegalArgumentException}. Similarly, the map's entries have a {@link Entry#setValue} method

  /** The maximum number of segments to allow; used to bound constructor arguments. */
  static final int MAX_SEGMENTS = 1 << 16; // slightly conservative

  /** Number of (unsynchronized) retries in the containsValue method. */
  static final int CONTAINS_VALUE_RETRIES = 3;

  /**
   * Number of cache access operations that can be buffered per segment before the cache's recency

   * then we call it in a separate thread (using pseudoTimedGet). The result is that we wait as long
   * as necessary when the method is expected to return (at the cost of hanging forever if there is
   * a bug in the class under test) but that we time out fairly promptly when the method is expected
   * to hang (possibly too quickly, but too-quick failures should be very unlikely, given that we

   * then we call it in a separate thread (using pseudoTimedGet). The result is that we wait as long
   * as necessary when the method is expected to return (at the cost of hanging forever if there is
   * a bug in the class under test) but that we time out fairly promptly when the method is expected
   * to hang (possibly too quickly, but too-quick failures should be very unlikely, given that we

            return cache.get(otherKey, loader); // loads another key, is ok
          }
        };
    testLoadThrows(key, cache, proxyLoader);
  }

  // utility methods

  private void testLoadThrows(
      String key, LocalCache<String, String> cache, CacheLoader<String, String> loader)
      throws InterruptedException {
    CountDownLatch doneSignal = new CountDownLatch(1);

            return cache.get(otherKey, loader); // loads another key, is ok
          }
        };
    testLoadThrows(key, cache, proxyLoader);
  }

  // utility methods

  private void testLoadThrows(
      String key, LocalCache<String, String> cache, CacheLoader<String, String> loader)
      throws InterruptedException {
    CountDownLatch doneSignal = new CountDownLatch(1);

      this.matcher = SmallCharMatcher.from(tmp, "");
    }
    this.string = checkString(length, percent, config.matchingChars, new Random(), forceSlow, web);
  }

  // Caliper recognizes int-parameter methods beginning with "time"

  @Benchmark
  int trimAndCollapseFromString(int reps) {
    int dummy = 0;
    for (int i = 0; i < reps; i++) {
      dummy += matcher.trimAndCollapseFrom(string, '!').length();
    }

      this.matcher = SmallCharMatcher.from(tmp, "");
    }
    this.string = checkString(length, percent, config.matchingChars, new Random(), forceSlow, web);
  }

  // Caliper recognizes int-parameter methods beginning with "time"

  @Benchmark
  int trimAndCollapseFromString(int reps) {
    int dummy = 0;
    for (int i = 0; i < reps; i++) {
      dummy += matcher.trimAndCollapseFrom(string, '!').length();
    }