}
}

func loadProcIOMetrics(ctx context.Context, io procfs.ProcIO, m MetricValues) {
	if io.RChar > 0 {
		m.Set(processIORCharBytes, float64(io.RChar))
	}

	if io.ReadBytes > 0 {
		m.Set(processIOReadBytes, float64(io.ReadBytes))
	}

	if io.WChar > 0 {
		m.Set(processIOWCharBytes, float64(io.WChar))
	}

	if io.WriteBytes > 0 {
		m.Set(processIOWriteBytes, float64(io.WriteBytes))
	}

	} unicode_string;

	/* 
	 * typedef struct _SID_IDENTIFIER_AUTHORITY {
	 *     UCHAR Value[6];
	 * } SID_IDENTIFIER_AUTHORITY, *PSID_IDENTIFIER_AUTHORITY;
	 * 
	 * #define SECURITY_NT_AUTHORITY           {0,0,0,0,0,5}
	 * 
	 * typedef struct _SID {
	 *    UCHAR Revision;
	 *    UCHAR SubAuthorityCount;
	 *    SID_IDENTIFIER_AUTHORITY IdentifierAuthority;

	} unicode_string;

	/* 
	 * typedef struct _SID_IDENTIFIER_AUTHORITY {
	 *     UCHAR Value[6];
	 * } SID_IDENTIFIER_AUTHORITY, *PSID_IDENTIFIER_AUTHORITY;
	 * 
	 * #define SECURITY_NT_AUTHORITY           {0,0,0,0,0,5}
	 * 
	 * typedef struct _SID {
	 *    UCHAR Revision;
	 *    UCHAR SubAuthorityCount;
	 *    SID_IDENTIFIER_AUTHORITY IdentifierAuthority;

        Field passwordField = NtlmPasswordAuthenticator.class.getDeclaredField("password");
        passwordField.setAccessible(true);

        char[] originalPassword = (char[]) passwordField.get(authenticator);
        char[] clonedPassword = (char[]) passwordField.get(cloned);

        assertNotSame(originalPassword, clonedPassword, "Cloned password should be a different array instance");

            final char originalChar1 = sb.charAt(i);
            final char originalChar2 = sb.charAt(i + 1);
            final char margedChar = mergeChar(originalChar1, originalChar2);
            if (margedChar != originalChar1) {
                sb.setCharAt(i, margedChar);
                sb.deleteCharAt(i + 1);
            } else {

      }
    }
  }

  private static String mikeRepeat(String string, int count) {
    int len = string.length();
    char[] strCopy = new char[len * Integer.highestOneBit(count)];
    string.getChars(0, len, strCopy, 0);

    char[] array = new char[len * count];

    int strCopyLen = len;
    int pos = 0;
    while (count != 0) {
      if ((count & 1) != 0) {

    }
    return result;
  }

  private static String allMatchingChars(BitSet bitSet) {
    char[] result = new char[bitSet.cardinality()];
    for (int j = 0, c = bitSet.nextSetBit(0); j < result.length; ++j) {
      result[j] = (char) c;
      c = bitSet.nextSetBit(c + 1);
    }
    return new String(result);
  }

            return "";
        }
        final int mod = inData.length % 3;
        final int num = inData.length / 3;
        char[] outData = null;
        if (mod != 0) {
            outData = new char[(num + 1) * 4];
        } else {
            outData = new char[num * 4];
        }
        for (int i = 0; i < num; i++) {
            encode(inData, i * 3, outData, i * 4);
        }
        if (mod == 1) {

    // read char by char
    CharSequenceReader reader = new CharSequenceReader(charSequence);
    for (int i = 0; i < expected.length(); i++) {
      assertEquals(expected.charAt(i), reader.read());
    }
    assertFullyRead(reader);

    // read all to one array
    reader = new CharSequenceReader(charSequence);
    char[] buf = new char[expected.length()];

  private final char innerNodeCode;

  /** The character used for a leaf node in the trie encoding */
  private final char leafNodeCode;

  PublicSuffixType(char innerNodeCode, char leafNodeCode) {
    this.innerNodeCode = innerNodeCode;
    this.leafNodeCode = leafNodeCode;
  }

  char getLeafNodeCode() {
    return leafNodeCode;
  }

  char getInnerNodeCode() {
    return innerNodeCode;