}

  /** Confirm that get() returns a List implementing RandomAccess. */
  public void testGetRandomAccess() {
    Multimap<String, Integer> multimap = create();
    multimap.put("foo", 1);
    multimap.put("foo", 3);
    assertTrue(multimap.get("foo") instanceof RandomAccess);
    assertTrue(multimap.get("bar") instanceof RandomAccess);
  }

  /** Confirm that removeAll() returns a List implementing RandomAccess. */

    /*
     * It is a little awkward but prudent to pass the quering address
     * so that it may be included in the list of results. IOW we do
     * not want to create a new NbtAddress object for this particular
     * address from which the query is constructed, we want to populate
     * the data of the existing address that should be one of several
     * returned by the node status.
     */

    }

    /**
     * Setup exactly the same as the above test, except that the child project
     * now depends upon d, which has a transitive dependency on c.  Even though
     * we did list an exclusion on c, it was only from within the context of
     * project b.  We will pick up project c in this case because no
     * restrictions were placed on d.  This demonstrates that a, b, c, & d will
     * all be collected.
     *

// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

     *
     * @return {@literal true} if the field is parameterized
     */
    boolean isParameterized();

    /**
     * Returns the {@link ParameterizedClassDesc} that represents the type of the field.
     *
     * @return the {@link ParameterizedClassDesc} that represents the type of the field
     */
    ParameterizedClassDesc getParameterizedClassDesc();

    /**

		poolIDL, setIDL)
	erasureSetReadToleranceMD = NewGaugeMD(erasureSetReadTolerance,
		"No of drive failures that can be tolerated without disrupting read operations",
		poolIDL, setIDL)
	erasureSetWriteToleranceMD = NewGaugeMD(erasureSetWriteTolerance,
		"No of drive failures that can be tolerated without disrupting write operations",
		poolIDL, setIDL)
	erasureSetReadHealthMD = NewGaugeMD(erasureSetReadHealth,

			if err != nil {
				s.cancel(err)
				return err
			}
		}
	}
}

// Done will return a channel that will be closed when the stream is done.
// This mirrors context.Done().
func (s *Stream) Done() <-chan struct{} {
	return s.ctx.Done()
}

// Err will return the error that caused the stream to end.
// This mirrors context.Err().
func (s *Stream) Err() error {
	return s.ctx.Err()

	// Retrieves information about the amount of space that is available on a disk volume,
	// which is the total amount of space, the total amount of free space, and the total
	// amount of free space available to the user that is associated with the calling thread.
	GetDiskFreeSpaceEx = kernel32.NewProc("GetDiskFreeSpaceExW")

            public boolean equals(Object o) {
                return o instanceof DefaultVersionResolverRequest that
                        && Objects.equals(artifactCoordinates, that.artifactCoordinates)
                        && Objects.equals(repositories, that.repositories)
                        && nature == that.nature;
            }

            @Override
            public int hashCode() {

        // Check that password can be retrieved
        assertEquals(testPassword, auth.getPassword());

        // Check that char array method works
        char[] passwordArray = auth.getPasswordAsCharArray();
        assertNotNull(passwordArray);
        assertArrayEquals(testPassword.toCharArray(), passwordArray);

        // Verify that returned array is a copy
        Arrays.fill(passwordArray, 'X');