transient @Nullable V[] values;

  transient int size;
  transient int modCount;

  /** Maps a bucket to the "entry" of its first element. */
  private transient int[] hashTableKToV;

  /** Maps a bucket to the "entry" of its first element. */
  private transient int[] hashTableVToK;

  /** Maps an "entry" to the "entry" that follows it in its bucket. */
  private transient int[] nextInBucketKToV;

        assertSame(fe1, it.next(), "First element must match first page");
        assertTrue(it.hasNext(), "Iterator should have second element");
        assertSame(fe2, it.next(), "Second element must match first page");

        // Next page fetched via fetchMore()
        assertTrue(it.hasNext(), "Iterator should have third element after fetchMore");

    movePivotToStartOfSlice(array, from, to);
    double pivot = array[from];

    // Move all elements with indexes in (from, to] which are greater than the pivot to the end of
    // the array. Keep track of where those elements begin.
    int partitionPoint = to;
    for (int i = to; i > from; i--) {
      if (array[i] > pivot) {
        swap(array, partitionPoint, i);

                new TestStringSetGenerator() {
                  @Override
                  protected Set<String> create(String[] elements) {
                    return ImmutableMultiset.copyOf(elements).elementSet();
                  }
                })
            .named("ImmutableMultiset, element set")
            .withFeatures(
                CollectionSize.ANY,
                CollectionFeature.SERIALIZABLE,

                assertFalse(iterator1.hasNext(), "First instance should have no elements");
                assertFalse(iterator2.hasNext(), "Second instance should have no elements");
                assertFalse(iterator3.hasNext(), "Third instance should have no elements");

                assertNull(iterator1.next(), "First instance next() should return null");

          <name>licenses</name>
          <version>3.0.0+</version>
          <description>
            <![CDATA[
            This element describes all the licenses for this project.
            Each license is described by a {@code license} element, which
            is then described by additional elements.
            Projects should only list the license(s) that applies to the project
            and not the licenses that apply to dependencies.

        return elements;
    }

    /**
     * Returns an array of {@literal byte}.
     *
     * @param elements the elements of the array
     * @return the array
     */
    public static byte[] asByteArray(final byte... elements) {
        return elements;
    }

    /**
     * Returns an array of {@literal short}.
     *
     * @param elements the elements of the array
     * @return the array

   * objects per entry.  Instead we use an open-addressed hash table.  This design is basically
   * equivalent to RegularImmutableSet, save that instead of having a hash table containing the
   * elements directly and null for empty positions, we store indices of the keys in the hash table,
   * and ABSENT for empty positions.  We then look up the keys in alternatingKeysAndValues.
   *

        assertNotNull(authorizations, "The authorizations list should not be null.");
        assertEquals(1, authorizations.size(), "The authorizations list should contain one element.");
        assertEquals(mockAuthData, authorizations.get(0), "The authorization element should be the mocked object.");
    }

    /**
     * Test constructor with a malformed ASN.1 token.
     */
    @Test
    void testConstructor_MalformedToken() {

   * safely be included in an XML document as element content. See section <a
   * href="http://www.w3.org/TR/2008/REC-xml-20081126/#syntax">2.4</a> of the XML specification.
   *
   * <p><b>Note:</b> Double and single quotes are not escaped, so it is <b>not safe</b> to use this
   * escaper to escape attribute values. Use {@link #xmlContentEscaper} if the output can appear in
   * element content or {@link #xmlAttributeEscaper} in attribute values.