}

  /**
   * Creates a <i>mutable</i>, empty {@code HashMap} instance.
   *
   * <p><b>Note:</b> if mutability is not required, use {@link ImmutableMap#of()} instead.
   *
   * <p><b>Note:</b> if {@code K} is an {@code enum} type, use {@link #newEnumMap} instead.
   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated. Instead,

  // Queues

  /**
   * A custom queue for managing eviction order. Note that this is tightly integrated with {@code
   * ReferenceEntry}, upon which it relies to perform its linking.
   *
   * <p>Note that this entire implementation makes the assumption that all elements which are in the
   * map are also in this queue, and that all elements not in the queue are not in the map.
   *

  // Queues

  /**
   * A custom queue for managing eviction order. Note that this is tightly integrated with {@code
   * ReferenceEntry}, upon which it relies to perform its linking.
   *
   * <p>Note that this entire implementation makes the assumption that all elements which are in the
   * map are also in this queue, and that all elements not in the queue are not in the map.
   *

     * {@link CloseableList} may not be subsumed.
     */
    CLOSING,

    /** The {@link CloseableList} has been closed. It may not be further subsumed. */
    CLOSED,

    /**
     * {@link ClosingFuture#finishToValueAndCloser(ValueAndCloserConsumer, Executor)} has been

    /** The key of the message: Update */
    public static final String LABELS_crawl_button_update = "{labels.crawl_button_update}";

    /** The key of the message: None */
    public static final String LABELS_NONE = "{labels.none}";

    /** The key of the message: Simultaneous Crawler Config */
    public static final String LABELS_crawling_thread_count = "{labels.crawling_thread_count}";

 * need to be on the same host. This operation does not copy extended
 * file attibutes such as ACLs but it does copy regular attributes as
 * well as create and last write times. This method is almost twice as
 * efficient as manually copying as it employs an additional write
 * thread to read and write data concurrently.
 * <p/>