}

    /**
     * Creates and returns a new instance of {@link ArrayDeque}.
     *
     * @param <E> the element type of {@link ArrayDeque}
     * @return a new instance of {@link ArrayDeque}
     * @see ArrayDeque#ArrayDeque()
     */
    public static <E> ArrayDeque<E> newArrayDeque() {
        return new ArrayDeque<>();
    }

    /**
     * Creates and returns a new instance of {@link ArrayDeque}.

    protected DictionaryManager dictionaryManager;

    /**
     * Creates a new DictionaryCreator with the specified pattern.
     *
     * @param pattern the regular expression pattern to match file paths
     */
    protected DictionaryCreator(final String pattern) {
        this.pattern = Pattern.compile(pattern);
    }

    /**
     * Creates a dictionary file for the given path and timestamp if it matches this creator's pattern.

    private static final long serialVersionUID = -2154525994315946504L;

    /**
     * Creates a {@link ClIllegalStateException}.
     */
    public ClIllegalStateException() {
        super();
    }

    /**
     * Creates a {@link ClIllegalStateException}.
     *
     * @param message
     *            Message
     */

  // ArrayBlockingQueue

  /**
   * Creates an empty {@code ArrayBlockingQueue} with the given (fixed) capacity and nonfair access
   * policy.
   */
  @J2ktIncompatible
  @GwtIncompatible // ArrayBlockingQueue
  public static <E> ArrayBlockingQueue<E> newArrayBlockingQueue(int capacity) {
    return new ArrayBlockingQueue<>(capacity);
  }

  // ArrayDeque

  /**
   * Creates an empty {@code ArrayDeque}.
   *

    }

    /**
     * Creates and returns an initial context.
     *
     * @return the initial context
     */
    public static InitialContext create() {
        try {
            return new InitialContext();
        } catch (final NamingException ex) {
            throw new NamingRuntimeException(ex);
        }
    }

    /**

      L existing = locks.get(index);
      if (existing != null) {
        return existing;
      }
      L created = supplier.get();
      existing = locks.putIfAbsent(index, created);
      return MoreObjects.firstNonNull(existing, created);
    }

    @Override
    public int size() {
      return size;
    }
  }

  /** A bit mask were all bits are set. */

     */
    protected SchemaFactoryUtil() {
    }

    /**
     * Creates a {@link SchemaFactory} for W3C XML Schema.
     *
     * @return a {@link SchemaFactory} for W3C XML Schema
     */
    public static SchemaFactory newW3cXmlSchemaFactory() {
        return newW3cXmlSchemaFactory(false);
    }

    /**
     * Creates a {@link SchemaFactory} for W3C XML Schema.
     *
     * @param external

  Optional<Integer> expectedNodeCount = Optional.absent();

  /**
   * Creates a new instance with the specified edge directionality.
   *
   * @param directed if true, creates an instance for graphs whose edges are each directed; if
   *     false, creates an instance for graphs whose edges are each undirected.
   */
  AbstractGraphBuilder(boolean directed) {
    this.directed = directed;

@GwtCompatible
public final class HashMultiset<E extends @Nullable Object> extends AbstractMapBasedMultiset<E> {

  /** Creates a new, empty {@code HashMultiset} using the default initial capacity. */
  public static <E extends @Nullable Object> HashMultiset<E> create() {
    return new HashMultiset<>();
  }

  /**
   * Creates a new, empty {@code HashMultiset} with the specified expected number of distinct
   * elements.
   *

    }

    @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
  }

  /** Creates an empty {@code HashBasedTable}. */
  public static <R, C, V> HashBasedTable<R, C, V> create() {
    return new HashBasedTable<>(new LinkedHashMap<R, Map<C, V>>(), new Factory<C, V>(0));
  }

  /**
   * Creates an empty {@code HashBasedTable} with the specified map sizes.
   *