// access some of the elements
      Random random = new Random();
      List<ReferenceEntry<Object, Object>> reads = new ArrayList<>();
      Iterator<ReferenceEntry<Object, Object>> i = readOrder.iterator();
      while (i.hasNext()) {
        ReferenceEntry<Object, Object> entry = i.next();
        if (random.nextBoolean()) {
          map.get(entry.getKey(), loader);
          reads.add(entry);

      // access some of the elements
      Random random = new Random();
      List<ReferenceEntry<Object, Object>> reads = new ArrayList<>();
      Iterator<ReferenceEntry<Object, Object>> i = readOrder.iterator();
      while (i.hasNext()) {
        ReferenceEntry<Object, Object> entry = i.next();
        if (random.nextBoolean()) {
          map.get(entry.getKey(), loader);
          reads.add(entry);

    // entries. The special casing for size-based eviction is only necessary because that eviction
    // happens per segment instead of globally, so too many segments compared to the maximum size
    // will result in random eviction behavior.
    int segmentShift = 0;
    int segmentCount = 1;
    while (segmentCount < concurrencyLevel
        && (!evictsBySize() || segmentCount * 20L <= maxWeight)) {
      ++segmentShift;

      populateProb1();
      populateProb2();
      populateChars1();
      populateChars2();
    }

    private final Random random;

    public CharSamples(Random random) {
      this.random = random;
    }

    public int nextCodePoint() {
      int needle = random.nextInt(sum);
      int l = 0;
      int r = prob.length - 1;
      int c = prob.length / 2;
      int lv = prob[l];

      populateProb1();
      populateProb2();
      populateChars1();
      populateChars2();
    }

    private final Random random;

    public CharSamples(Random random) {
      this.random = random;
    }

    public int nextCodePoint() {
      int needle = random.nextInt(sum);
      int l = 0;
      int r = prob.length - 1;
      int c = prob.length / 2;
      int lv = prob[l];

    // entries. The special casing for size-based eviction is only necessary because that eviction
    // happens per segment instead of globally, so too many segments compared to the maximum size
    // will result in random eviction behavior.
    int segmentShift = 0;
    int segmentCount = 1;
    while (segmentCount < concurrencyLevel
        && (!evictsBySize() || segmentCount * 20L <= maxWeight)) {
      ++segmentShift;