.maximumSize(maxSize));
    long totalCapacity = 0;
    assertWithMessage("segments=%s, maxSize=%s", map.segments.length, maxSize)
        .that((long) map.segments.length)
        .isAtMost(max(1, maxSize / 10));
    for (int i = 0; i < map.segments.length; i++) {
      totalCapacity += map.segments[i].maxSegmentWeight;
    }
    assertWithMessage("totalCapacity=%s, maxSize=%s", totalCapacity, maxSize)

                .maximumSize(maxSize));
    long totalCapacity = 0;
    assertWithMessage("segments=%s, maxSize=%s", map.segments.length, maxSize)
        .that((long) map.segments.length)
        .isAtMost(max(1, maxSize / 10));
    for (int i = 0; i < map.segments.length; i++) {
      totalCapacity += map.segments[i].maxSegmentWeight;
    }
    assertWithMessage("totalCapacity=%s, maxSize=%s", totalCapacity, maxSize)

      // Since index and (dataset.length - 1) are non-negative ints, their product can be expressed
      // as a long, without risk of overflow:
      long numerator = (long) index * (dataset.length - 1);
      // Since scale is a positive int, index is in [0, scale], and (dataset.length - 1) is a
      // non-negative int, we can do long-arithmetic on index * (dataset.length - 1) / scale to get

    @Override
    public Class<?>[] createKeyArray(int length) {
      return new Class<?>[length];
    }

    @Override
    public Impl[] createValueArray(int length) {
      return new Impl[length];
    }

    @Override
    public SampleElements<Entry<Class, Impl>> samples() {
      return new SampleElements<>(

                req.setMaxOutputResponse(maxRecvSize);
                final Smb2IoctlResponse resp = th.send(req, RequestParam.NO_RETRY);
                return resp.getOutputLength();
            }
            if (this.transact) {
                final TransTransactNamedPipe req = new TransTransactNamedPipe(th.getConfig(), fh.getFid(), buf, off, length);

        try {
            // Time comparison between different length passwords
            long timeDiffLength = measureEqualsTime(auth1, auth2, TIMING_ITERATIONS);

            // Create same length passwords for comparison
            char[] password3 = "short".toCharArray();
            char[] password4 = "shore".toCharArray(); // Same length, different content

    @Override
    protected String doBuildColumnString(String dm) {
        StringBuilder sb = new StringBuilder();
        sb.append(dm).append(name);
        if (sb.length() > dm.length()) {
            sb.delete(0, dm.length());
        }
        sb.insert(0, "{").append("}");
        return sb.toString();
    }

    // ===================================================================================

    Integer[] array = new Integer[elements.length];
    int i = 0;
    for (Object e : elements) {
      array[i++] = (Integer) e;
    }
    return create(array);
  }

  protected abstract Set<Integer> create(Integer[] elements);

  @Override
  public Integer[] createArray(int length) {
    return new Integer[length];
  }

  /**
   * {@inheritDoc}
   *

    AnEnum[] array = new AnEnum[elements.length];
    int i = 0;
    for (Object e : elements) {
      array[i++] = (AnEnum) e;
    }
    return create(array);
  }

  protected abstract Multiset<AnEnum> create(AnEnum[] elements);

  @Override
  public AnEnum[] createArray(int length) {
    return new AnEnum[length];
  }

  /** Sorts the enums according to their natural ordering. */

        // SecurityBufferOffset (+4) and Length (+6)
        SMBUtil.writeInt2(secBufOffset, buf, bodyStart + 4);
        SMBUtil.writeInt2(blob != null ? blob.length : 0, buf, bodyStart + 6);
        if (blob != null && blob.length > 0) {
            int blobStart = headerStart + secBufOffset;
            System.arraycopy(blob, 0, buf, blobStart, blob.length);
        }
    }

    @Test