* NormalizerChain chain = new NormalizerChain();
 * chain.add(new SomeNormalizer());
 * chain.add(new AnotherNormalizer());
 * String normalizedText = chain.normalize("input text", "field", "en");
 * </pre>
 *
 * <p>Methods:</p>
 * <ul>
 *   <li>{@link #normalize(String, String, String...)} - Applies all added normalizers to the input text.</li>
 *   <li>{@link #add(Normalizer)} - Adds a new normalizer to the chain.</li>
 * </ul>
 *

    }

    /**
     * Adds a tag to filter by.
     * @param tag The tag.
     */
    public void addTag(final String tag) {
        tags.add(tag);
    }

    /**
     * Adds a role to filter by.
     * @param role The role.
     */
    public void addRole(final String role) {
        roles.add(role);
    }

    /**
     * Adds a field to filter by.

      // modify this builder, so we make a copy instead.
      this.mutableValueGraph =
          graphBuilder.copy().incidentEdgeOrder(ElementOrder.<N>stable()).build();
    }

    /**
     * Adds {@code node} if it is not already present.
     *
     * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null.
     *
     * @return this {@code Builder} object
     */

            urlQueueMap.put(sessionId, urlQueueList);
        }
        return urlQueueList;
    }

    /**
     * Adds the provided URL queue to the existing queue for the specified session.
     * @param sessionId the session ID
     * @param urlQueueList the URL queue to add
     */
    public synchronized void addUrlQueueList(final String sessionId, final Queue<UrlQueueImpl<Long>> urlQueueList) {

    }

    /**
     * Adds a boost function to modify document scoring during search.
     * This method adds a boost function that applies to all documents.
     *
     * @param scoreFunction the score function to add for boosting
     */
    public void addBoostFunction(final ScoreFunctionBuilder<?> scoreFunction) {
        boostFunctionList.add(new FilterFunctionBuilder(scoreFunction));
    }

   * @since 6.0 (source-compatible since 2.0)
   */
  public static <E> ImmutableMultiset<E> of(E e1, E e2, E e3, E e4, E e5, E e6, E... others) {
    return new Builder<E>().add(e1).add(e2).add(e3).add(e4).add(e5).add(e6).add(others).build();
  }

  /**
   * Returns an immutable multiset containing the given elements, in the "grouped iteration order"
   * described in the class documentation.
   *

    return delegate;
  }

  /**
   * Adds the given element to this queue. If the queue is currently full, the element at the head
   * of the queue is evicted to make room.
   *
   * @return {@code true} always
   */
  @Override
  @CanIgnoreReturnValue
  public boolean offer(E e) {
    return add(e);
  }

  /**

   * #add(Range) add} any range not {@linkplain Range#encloses(Range) enclosed} by {@code view}.
   */
  RangeSet<C> subRangeSet(Range<C> view);

  // Modification

  /**
   * Adds the specified range to this {@code RangeSet} (optional operation). That is, for equal
   * range sets a and b, the result of {@code a.add(range)} is that {@code a} will be the minimal

/**
 * A subinterface of {@link Graph} which adds mutation methods. When mutation is not required, users
 * should prefer the {@link Graph} interface.
 *
 * @author James Sexton
 * @author Joshua O'Madadhain
 * @param <N> Node parameter type
 * @since 20.0
 */
@Beta
public interface MutableGraph<N> extends Graph<N> {

  /**
   * Adds {@code node} if it is not already present.
   *

pkg net, method (*UnixConn) CloseRead() error
pkg net, method (*UnixConn) CloseWrite() error
pkg net, type Dialer struct
pkg net, type Dialer struct, Deadline time.Time
pkg net, type Dialer struct, LocalAddr Addr
pkg net, type Dialer struct, Timeout time.Duration
pkg net, type IPAddr struct, Zone string
pkg net, type NS struct
pkg net, type NS struct, Host string
pkg net, type TCPAddr struct, Zone string