}

	// Decode and get the optional list id from the marker.
	o.parseMarker()
	if o.BaseDir == "" {
		o.BaseDir = baseDirFromPrefix(o.Prefix)
	}
	o.Transient = o.Transient || isReservedOrInvalidBucket(o.Bucket, false)
	o.SetFilter()
	if o.Transient {
		o.Create = false
	}

	// We have 2 cases:
	// 1) Cold listing, just list.
	// 2) Returning, but with no id. Start async listing.

    EnumMultiset<E> result = create(type);
    Iterables.addAll(result, elements);
    return result;
  }

  private transient Class<E> type;
  private transient E[] enumConstants;
  private transient int[] counts;
  private transient int distinctElements;
  private transient long size;

  /** Creates an empty {@code EnumMultiset}. */
  private EnumMultiset(Class<E> type) {
    this.type = type;

    /** 負荷係数 */
    protected transient int threshold;

    /** マップとしてのエントリ */
    protected transient Entry<K, V>[] mapTable;

    /** 配列としてのエントリ */
    protected transient Entry<K, V>[] listTable;

    /** 要素数 */
    protected transient int size = 0;

    /** {@link Set}としてのビュー */
    protected transient Set<? extends Map.Entry<K, V>> entrySet = null;

    /**

			z.IncludeDirectories, err = dc.ReadBool()
			if err != nil {
				err = msgp.WrapError(err, "IncludeDirectories")
				return
			}
		case "Transient":
			z.Transient, err = dc.ReadBool()
			if err != nil {
				err = msgp.WrapError(err, "Transient")
				return
			}
		case "Versioned":
			z.Versioned, err = dc.ReadBool()
			if err != nil {
				err = msgp.WrapError(err, "Versioned")
				return

   */
  @CheckForNull private transient int[] predecessor;

  /**
   * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last
   * node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  @CheckForNull private transient int[] successor;

   * by init(), which the constructor calls.
   */

  /** The keys of the entries in the map. */
  transient @Nullable Object[] keys;

  /** The values of the entries in the map. */
  transient int[] values;

  transient int size;

  transient int modCount;

  /**
   * The hashtable. Its values are indexes to the keys, values, and entries arrays.
   *

  // The first `size` elements are non-null.
  @VisibleForTesting final transient @Nullable Object[] elements;
  private final transient int hashCode;
  // the same values as `elements` in hashed positions (plus nulls)
  @VisibleForTesting final transient @Nullable Object[] table;
  // 'and' with an int to get a valid table index.
  private final transient int mask;
  private final transient int size;

  RegularImmutableSet(

  @CheckForNull private final transient Object keyHashTable;
  @VisibleForTesting final transient @Nullable Object[] alternatingKeysAndValues;
  private final transient int keyOffset; // 0 for K-to-V, 1 for V-to-K
  private final transient int size;
  private final transient RegularImmutableBiMap<V, K> inverse;

  /** Constructor for empty bimap. */

  // TODO: b/287198172 - Consider eagerly initializing these (but think about serialization).
  @LazyInit @CheckForNull private transient Ordering<@Nullable Comparable<?>> nullsFirst;
  @LazyInit @CheckForNull private transient Ordering<@Nullable Comparable<?>> nullsLast;

  @Override
  public int compare(Comparable<?> left, Comparable<?> right) {
    checkNotNull(left); // for GWT

implements java.util.Map, Cloneable, java.io.Serializable { private transient FastMap$EntryImpl[] _entries; private transient int _capacity; private transient int _mask; private transient FastMap$EntryImpl _poolFirst; private transient FastMap$EntryImpl _mapFirst; private transient FastMap$EntryImpl _mapLast; private transient int _size; private transient FastMap$Values _values; private transient FastMap$EntrySet _entrySet; private transient FastMap$KeySet _keySet; public void FastMap(); public void Fa...