* hexadecimal number in lower case.
   *
   * <p>Note that if the output is considered to be a single hexadecimal number, whether this string
   * is big-endian or little-endian depends on the byte order of {@link #asBytes}. This may be
   * surprising for implementations of {@code HashCode} that represent the number in big-endian

with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.

- *If total number of nodes are of odd number then GCD algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but this would lead to uneven distribution,...

  }

  public void testEmpty() {
    assertEquals(0, ImmutableTypeToInstanceMap.of().size());
  }

  public void testPrimitiveAndWrapper() {
    ImmutableTypeToInstanceMap<Number> map =
        ImmutableTypeToInstanceMap.<Number>builder()
            .put(Integer.class, 0)
            .put(int.class, 1)
            .build();
    assertEquals(2, map.size());

    assertEquals(0, (int) map.getInstance(Integer.class));

//
//	 e1 := MD5(part-1)
//	 e2 := MD5(part-2)
//	...
//	 eN := MD5(part-N)
//
// Then, the ETag of the object is computed as MD5 of all individual
// part checksums. S3 also encodes the number of parts into the ETag
// by appending a -<number-of-parts> at the end:
//
//	ETag := MD5(e1 || e2 || e3 ... || eN) || -N
//
//	For example: ceb8853ddc5086cc4ab9e149f8f09c88-5
//

     */
    public Smb2WriteResponse(final Configuration config) {
        super(config);
    }

    /**
     * Returns the number of bytes written.
     *
     * @return the count
     */
    public final int getCount() {
        return this.count;
    }

    /**
     * Returns the number of bytes remaining to be written.
     *
     * @return the remaining
     */
    public final int getRemaining() {

        src[srcIndex + 8] = 0x00;
        src[srcIndex + 9] = 0x00;
        // RData length
        src[srcIndex + 10] = 0x00;
        src[srcIndex + 11] = 0x1F; // 31 bytes: 1 + 18 + 6 + 6
        // Number of names (1)
        src[srcIndex + 12] = 0x01;
        // Name entry (18 bytes)
        String name = "TEST            ";
        System.arraycopy(name.getBytes("US-ASCII"), 0, src, srcIndex + 13, 16);

			if setSize%s == 0 {
				ss = append(ss, s)
			}
		}
		return ss
	}

	setCounts := possibleSetCounts(commonSize)
	if len(setCounts) == 0 {
		msg := fmt.Sprintf("Incorrect number of endpoints provided %s, number of drives %d is not divisible by any supported erasure set sizes %d", args, commonSize, setSizes)
		return nil, config.ErrInvalidNumberOfErasureEndpoints(nil).Msg(msg)
	}

	var setSize uint64

     *            The index of the {@link PropertyDesc}
     * @return {@link PropertyDesc}
     */
    PropertyDesc getPropertyDesc(int index);

    /**
     * Returns the number of {@link PropertyDesc}.
     *
     * @return The number of {@link PropertyDesc}
     */
    int getPropertyDescSize();

    /**
     * Returns an {@link Iterable} of {@link PropertyDesc}.
     *

   * skipped.
   *
   * @param streamId server-initiated stream ID: an even number.
   * @param source location of data corresponding with this stream ID.
   * @param byteCount number of bytes to read or skip from the source.
   * @param last when true, there are no data frames to follow.
   */
  @Throws(IOException::class)
  fun onData(
    streamId: Int,
    source: BufferedSource,

    }

    /**
     * Returns the number of POMs processed.
     */
    public int processedCount() {
        return processedPoms.size();
    }

    /**
     * Returns the number of POMs modified.
     */
    public int modifiedCount() {
        return modifiedPoms.size();
    }

    /**
     * Returns the number of POMs that had errors.
     */
    public int errorCount() {