*/
    public PrunedTag(final String tag) {
        this.tag = tag;
    }

    /**
     * Checks if this pruned tag configuration matches the given DOM node.
     * The matching is based on tag name, and optionally ID, CSS class, or custom attributes.
     *
     * @param node the DOM node to check against this pruned tag configuration

        assertEquals(0, result);
    }

    @Test
    void testReadDataWireFormatAtBufferBoundary() throws SMBProtocolDecodingException {
        // Test with data exactly matching output buffer size
        byte[] smallOutputBuffer = new byte[5];
        TransCallNamedPipeResponse smallResponse = new TransCallNamedPipeResponse(mockConfig, smallOutputBuffer);

	app := cli.NewApp()
	app.Name = name
	app.Author = "MinIO, Inc."
	app.Version = ReleaseTag
	app.Usage = "High Performance Object Storage"
	app.Description = `Build high performance data infrastructure for machine learning, analytics and application data workloads with MinIO`
	app.Flags = GlobalFlags
	app.HideHelpCommand = true // Hide `help, h` command, we already have `minio --help`.
	app.Commands = commands

   * @param h hash code
   */
  static int rehash(int h) {
    // Spread bits to regularize both segment and index locations,
    // using variant of single-word Wang/Jenkins hash.
    // TODO(kevinb): use Hashing/move this to Hashing?
    h += (h << 15) ^ 0xffffcd7d;
    h ^= h >>> 10;
    h += h << 3;
    h ^= h >>> 6;
    h += (h << 2) + (h << 14);
    return h ^ (h >>> 16);
  }

  /**

    /**
     * Map of pending requests to their corresponding responses.
     */
    protected HashMap response_map = new HashMap(4);

    /**
     * Creates a key for the specified request for response matching.
     *
     * @param request the request to create a key for
     * @throws IOException if an I/O error occurs
     */
    protected abstract void makeKey(Request request) throws IOException;

    /**

   * updates are made to the base field.  Upon first contention (a
   * failed CAS on base update), the table is initialized to size 2.
   * The table size is doubled upon further contention until
   * reaching the nearest power of two greater than or equal to the
   * number of CPUS. Table slots remain empty (null) until they are
   * needed.
   *
   * A single spinlock ("busy") is used for initializing and

//
// 2. __offline__            - err == errDiskNotFound
//
// 3. __availableWithParts__ - has the latest copy of xl.meta and has all
//                             parts with checksums matching; returned by disksWithAllParts
//
// 4. __outdated__           - returned by outDatedDisk, provided []StorageAPI
//                             returned by diskWithAllParts is passed for latestDisks.

            <li>{@code exists(path)}: Checks if a file matching the given glob pattern exists.</li>
            <li>{@code missing(path)}: Checks if a file matching the given glob pattern does not exist.</li>
            <li>{@code inrange(version, range)}: Checks if the given version is within the specified version range.</li>

			if endpoint.IsLocal {
				gridLocal = u
			}

			gridHosts = append(gridHosts, u)
		}
	}

	return gridHosts, gridLocal
}

// FindGridHostsFromPeerPool will return a matching peerPool from provided peer (as string)
func (l EndpointServerPools) FindGridHostsFromPeerPool(peer string) []int {
	if peer == "" {
		return nil
	}

	var pools []int
	for _, ep := range l {

> **NOTE:** **Each pool you add must have the same erasure coding parity configuration as the original pool, so the same data redundancy SLA is maintained.**

## 3. Test your setup