// Note: The current implementation does not validate the outer APPLICATION tag number
        // This test documents the actual behavior - any tag number is accepted
        byte[] token =
                buildInitToken(new ASN1ObjectIdentifier[] { OID_KRB }, NegTokenInit.INTEGRITY, new byte[] { 0x42 }, null, false, null, 1, // Non-zero tag number is currently accepted
                        null);

        /**
         * Default constructor for DfsEnumArray1
         */
        public DfsEnumArray1() {
            // Default constructor
        }

        /**
         * Number of DFS entries in the array
         */
        public int count;
        /**
         * Array of DFS information level 1 structures
         */
        public DfsInfo1[] s;

        @Override

    private int tflags;
    private Referral[] referrals;

    /**
     * Get the number of characters consumed from the path
     *
     * @return the pathConsumed
     */
    public final int getPathConsumed() {
        return this.pathConsumed;
    }

    /**
     * Get the number of referrals in the response
     *
     * @return the numReferrals
     */

                            },
                            "price": {
                                "anyOf": [{"type": "number"}, {"type": "null"}],
                                "title": "Price",
                            },
                            "tax": {"title": "Tax", "type": "number", "default": 10.5},
                            "tags": {
                                "title": "Tags",

	// Total size for objects that have been replicated to destination
	ReplicatedSizeV1 uint64 `json:"objectsReplicatedTotalSize"`
	// Total number of objects pending replication
	ReplicationPendingCountV1 uint64 `json:"objectsPendingReplicationCount"`
	// Total number of objects that failed replication
	ReplicationFailedCountV1 uint64 `json:"objectsFailedReplicationCount"`

MinIO divides the drives you provide into erasure-coding sets of *2 to 16* drives.  Therefore, the number of drives you present must be a multiple of one of these numbers.  Each object is written to a single erasure-coding set.

    Map<String, Integer> map = new HashMap<>();
    map.put("One", 1);
    map.put("Three", 3);
    Number number = Double.valueOf(42);
    Function<String, Number> function = Functions.forMap(map, number);

    assertEquals(1, function.apply("One").intValue());
    assertEquals(number, function.apply("Two"));
    assertEquals(3L, function.apply("Three").longValue());
  }

  public void testComposition() {

     */
    public static Integer toInteger(final Object o, final String pattern) {
        return switch (o) {
        case null -> null;
        case Integer i -> i;
        case Number n -> n.intValue();
        case String s -> toInteger(s);
        case java.util.Date d -> pattern != null ? Integer.valueOf(new SimpleDateFormat(pattern).format(d)) : (int) d.getTime();
        case Boolean b -> b ? 1 : 0;

     */
    int read() throws SmbException;

    /**
     * Read into buffer from current position
     *
     * @param b
     *            buffer
     * @return number of bytes read
     * @throws SmbException if an I/O error occurs during read
     */
    int read(byte[] b) throws SmbException;

    /**
     * Read into buffer from current position
     *
     * @param b

            } catch (Exception e) {
                log.warn("Failed to clear KeyStore entries: {}", e.getMessage());
            }
        }
    }

    /**
     * Get the number of stored keys
     *
     * @return number of keys in memory
     */
    public int getKeyCount() {
        return sessionKeys.size();
    }

    /**
     * Check if a session key exists
     *