// per bouncycastle
        // <li>1: K(i) := PRF( KI, [i]_2 || Label || 0x00 || Context || [L]_2 ) with the counter at the very beginning
        // of the fixedInputData (The default implementation has this format)</li>
        // with the parameters
        // <li>1. KDFCounterParameters(ki, null, "Label || 0x00 || Context || [L]_2]", 8);

        // all fixed inputs go into the suffix:
        // + label

        SMBUtil.writeInt2(dstIndex - getHeaderStart(), dst, dataOffsetOffset);

        if (dstIndex + this.dataLength > dst.length) {
            throw new IllegalArgumentException(
                    String.format("Data exceeds buffer size ( remain buffer: %d data length: %d)", dst.length - dstIndex, this.dataLength));
        }

        System.arraycopy(this.data, this.dataOffset, dst, dstIndex, this.dataLength);

        assertTrue(infoString.contains("bytesPerSect=512"), "toString should contain bytesPerSect");
    }

    // Helper methods to write numbers to byte array in little-endian format.
    private void writeInt2(int val, byte[] dst, int dstIndex) {
        dst[dstIndex++] = (byte) val;
        dst[dstIndex++] = (byte) (val >> 8);
    }

 */

package jcifs.util;

/**
 * Utility class for hexadecimal dumping of binary data.
 * This class provides methods for converting binary data to readable hex format.
 */

public class Hexdump {

    /**
     * Default constructor.
     */
    public Hexdump() {
        // Utility class - no instance variables to initialize
    }

    /**

     */
    public static void replace(final List<AvPair> pairs, final AvPair rep) {
        remove(pairs, rep.getType());
        pairs.add(rep);
    }

    /**
     * Encodes a list of AV pairs into byte array format
     *
     * @param pairs the list of AV pairs to encode
     * @return encoded avpairs
     */
    public static byte[] encode(final List<AvPair> pairs) {
        int size = 0;

    expectContents(contents);
  }

  /**
   * Returns {@link Method} instances for the remove tests that assume multisets support duplicates
   * so that the test of {@code Multisets.forSet()} can suppress them.
   */
  @J2ktIncompatible
  @GwtIncompatible // reflection
  public static List<Method> getRemoveDuplicateInitializingMethods() {

    expectContents(contents);
  }

  /**
   * Returns {@link Method} instances for the remove tests that assume multisets support duplicates
   * so that the test of {@code Multisets.forSet()} can suppress them.
   */
  @J2ktIncompatible
  @GwtIncompatible // reflection
  public static List<Method> getRemoveDuplicateInitializingMethods() {

   * collection is empty, but we'd still like to test removeAll(null) when we
   * can. We split the test into empty and non-empty cases. This allows us to
   * suppress only the former.
   */

  @CollectionFeature.Require(SUPPORTS_REMOVE)
  @CollectionSize.Require(ZERO)
  public void testRemoveAll_nullCollectionReferenceEmptySubject() {
    try {
      collection.removeAll(null);

     *       {@code {"--patch-module", "foo.bar=dir/path1:dir/path2"}} on Unix or
     *       {@code {"--patch-module", "foo.bar=dir\path1;dir\path2"}} on Windows.</li>
     * </ul>
     *
     * @param paths the path to format as a string
     * @return the option associated to this path type followed by the given path elements,
     *         or an empty array if there is no path element.
     */
    @Nonnull

                + Arrays.toString(newInputs) + ", newOutput=" + newOutput + "]";
    }

    /**
     * Returns a compact string representation of this mapping item in the format "input1,input2=>output".
     * If the item has pending updates, the new values are used; otherwise, the current values are used.
     *
     * @return compact string representation of the mapping rule
     */