}
    }

    @Override
    int decodeTo(byte[] target, CharSequence chars) throws DecodingException {
      checkNotNull(target);
      if (chars.length() % 2 == 1) {
        throw new DecodingException("Invalid input length " + chars.length());
      }
      int bytesWritten = 0;
      for (int i = 0; i < chars.length(); i += 2) {
        int decoded = alphabet.decode(chars.charAt(i)) << 4 | alphabet.decode(chars.charAt(i + 1));

func (d *Decoder) Pos() int { return int(d.pos) }

// Err returns the most recent decoder error if any, or nil
func (d *Decoder) Err() error { return d.err }

// MaxDepth will set the maximum recursion depth.
// If the maximum depth is exceeded, ErrMaxDepth is returned.
// Less than or 0 means no limit (default).
func (d *Decoder) MaxDepth(n int) *Decoder {
	d.maxDepth = n
	return d
}

	}

	// If we cannot decode, just return read quorum error.
	return nil, fmt.Errorf("%w (offline-disks=%d/%d)", errErasureReadQuorum, disksNotFound, len(p.readers))
}

// Decode reads from readers, reconstructs data if needed and writes the data to the writer.
// A set of preferred drives can be supplied. In that case they will be used and the data reconstructed.

    }

    /**
     * Decodes data encoded in Base64.
     * <p>
     * This method uses {@link java.util.Base64.Decoder} for decoding.
     * </p>
     *
     * @param inData
     *            The data to decode
     * @return The decoded data, or null if the input is null or empty
     */
    public static byte[] decode(final String inData) {
        if (StringUtil.isEmpty(inData)) {

            int pos = -1;
            while ((pos = decoded.indexOf('%', pos + 1)) >= 0) {
                if (pos + 2 < decoded.length()) {
                    String hexStr = decoded.substring(pos + 1, pos + 3);
                    char ch = (char) Integer.parseInt(hexStr, 16);
                    decoded = decoded.substring(0, pos) + ch + decoded.substring(pos + 3);
                }
            }
        }

        dst[di] = (byte) (i >> 24 & 0xFF);
        return 4;
    }

    /*
     * Decode integers
     */

    /**
     * Decodes a 16-bit unsigned integer from big-endian byte order.
     *
     * @param src the source byte array
     * @param si the starting index in the source array
     * @return the decoded short value
     */
    public static short dec_uint16be(final byte[] src, final int si) {

     * Decodes a 32-bit unsigned integer from little-endian byte order.
     *
     * @param src the source byte array
     * @param si the starting index in the source array
     * @return the decoded integer value
     */
    public static int dec_uint32le(final byte[] src, final int si) {
        return src[si] & 0xFF | (src[si + 1] & 0xFF) << 8 | (src[si + 2] & 0xFF) << 16 | (src[si + 3] & 0xFF) << 24;
    }

     * @param len the length of data to decode
     * @throws IOException if an I/O error occurs during decoding
     */
    public SecurityDescriptor(final byte[] buffer, final int bufferIndex, final int len) throws IOException {
        this.decode(buffer, bufferIndex, len);
    }

    /**
     * Decodes a security descriptor from a byte buffer.
     *

         */
        protected Map<String, Long> valueCountMap = new LinkedHashMap<>();

        /**
         * The decoded name of the field.
         */
        protected String name;

        /**
         * Constructs a Field from OpenSearch Terms aggregation.
         * Decodes the field name and processes all term buckets to extract
         * field values and their document counts.
         *

        }
    }

    /**
     * Decodes a string from UTF-16LE (Unicode Little Endian) bytes.
     *
     * @param src the byte array containing the encoded string
     * @param srcIndex the starting offset in the byte array
     * @param len the number of bytes to decode
     * @return decoded string
     */