public void recordRdmaSend(int bytes, long durationNanos) {
        rdmaSends.incrementAndGet();
        bytesTransferred.addAndGet(bytes);
        totalSendTime.addAndGet(durationNanos);
    }

    /**
     * Record an RDMA receive operation
     *
     * @param bytes number of bytes received
     * @param durationNanos operation duration in nanoseconds
     */
    public void recordRdmaReceive(int bytes, long durationNanos) {

public final class MapMaker {
  private int initialCapacity = 16;

  public MapMaker() {}

  @CanIgnoreReturnValue
  public MapMaker initialCapacity(int initialCapacity) {
    if (initialCapacity < 0) {
      throw new IllegalArgumentException();
    }
    this.initialCapacity = initialCapacity;
    return this;
  }

  @CanIgnoreReturnValue
  public MapMaker concurrencyLevel(int concurrencyLevel) {
    checkArgument(

        parameterizedClassDescs = new ParameterizedClassDesc[parameterTypes.length];
        final Map<TypeVariable<?>, Type> typeVariables = beanDesc.getTypeVariables();
        for (int i = 0; i < parameterTypes.length; ++i) {
            parameterizedClassDescs[i] = ParameterizedClassDescFactory.createParameterizedClassDesc(constructor, i, typeVariables);
        }
    }

    @Override

    ImmutableSortedSet<Integer> asSet = RANGE_SET_ONE.asSet(DiscreteDomain.integers());

    for (int i = 0; i <= 20; i++) {
      for (int j = i + 1; j <= 20; j++) {
        assertEquals(expectedSet.subSet(i, false, j, false), asSet.subSet(i, false, j, false));
        assertEquals(expectedSet.subSet(i, true, j, false), asSet.subSet(i, true, j, false));

  private GraphConstants() {}

  static final int EXPECTED_DEGREE = 2;

  static final int DEFAULT_NODE_COUNT = 10;
  static final int DEFAULT_EDGE_COUNT = DEFAULT_NODE_COUNT * EXPECTED_DEGREE;

  // Load factor and capacity for "inner" (i.e. per node/edge element) hash sets or maps
  static final float INNER_LOAD_FACTOR = 1.0f;
  static final int INNER_CAPACITY = 2; // ceiling(EXPECTED_DEGREE / INNER_LOAD_FACTOR)

  }

  @CollectionFeature.Require(SUPPORTS_ADD)
  public void testAddMeansAddOne() {
    int originalCount = getMultiset().count(e0());
    assertTrue(getMultiset().add(e0()));
    assertEquals(originalCount + 1, getMultiset().count(e0()));
  }

  @CollectionFeature.Require(SUPPORTS_ADD)
  public void testAddOccurrencesZero() {
    int originalCount = getMultiset().count(e0());

     */
    Class<?> getElementClassOfCollection(int index);

    /**
     * Returns the key type if the parameter type of the method is a parameterized {@link Map}.
     *
     * @param index
     *            The index of the parameter
     * @return The key type if the parameter type is a parameterized {@link Map}, otherwise {@literal null}
     */
    Class<?> getKeyClassOfMap(int index);

    /**

  public void testToImmutableSortedSet_duplicates() {
    class TypeWithDuplicates implements Comparable<TypeWithDuplicates> {
      final int a;
      final int b;

      TypeWithDuplicates(int a, int b) {
        this.a = a;
        this.b = b;
      }

      @Override
      public int compareTo(TypeWithDuplicates o) {
        return Integer.compare(a, o.a);
      }

        sidArray.sids[0].sid.sub_authority = new int[] { 500 };

        sidArray.sids[1] = new lsarpc.LsarSidPtr();
        sidArray.sids[1].sid = new rpc.sid_t();
        sidArray.sids[1].sid.revision = 1;
        sidArray.sids[1].sid.identifier_authority = new byte[] { 0, 0, 0, 0, 0, 5 };
        sidArray.sids[1].sid.sub_authority_count = 1;
        sidArray.sids[1].sid.sub_authority = new int[] { 501 };

        // Encode to buffer

					}
				}
			}

			for initialized || rows.Next() {
			BEGIN:
				initialized = false

				if update {
					if int(db.RowsAffected) >= reflectValue.Len() {
						return
					}
					elem = reflectValue.Index(int(db.RowsAffected))
					if onConflictDonothing {
						for _, field := range fields {
							if _, ok := field.ValueOf(db.Statement.Context, elem); !ok {