builder.edgeOrder.createMap(firstNonNull(builder.expectedEdgeCount, DEFAULT_EDGE_COUNT)));
  }

  /**
   * Constructs a graph with the properties specified in {@code builder}, initialized with the given
   * node and edge maps.
   */
  StandardNetwork(
      NetworkBuilder<? super N, ? super E> builder,
      Map<N, NetworkConnections<N, E>> nodeConnections,
      Map<E, N> edgeToReferenceNode) {

     *
     * @param strategy new strategy
     */
    public void setStrategy(LoadBalancingStrategy strategy) {
        this.strategy = strategy;
    }

    /**
     * Select a channel for the given message
     *
     * @param message SMB message to send
     * @return selected channel
     * @throws NoAvailableChannelException if no healthy channels available
     */

            return filtered;
        }

        // Distinct the projects to avoid duplicates.  Duplicates are possible in multi-module projects.
        //
        // Given a scenario where there is an aggregate POM with modules A, B, C, D, and E and project E depends on
        // A, B, C, and D. If the aggregate POM is being filtered for non-transitive and downstream dependencies where

./gradlew :server:test -Dtests.iters=N -Dtests.seed=DEAD:BEEF --tests org.elasticsearch.package.ClassName
------------------------------------------------------------------------

=== Repeats a given test N times

(note the filters - individual test repetitions are given suffixes,
ie: testFoo[0], testFoo[1], etc... so using testmethod or tests.method
ending in a glob is necessary to ensure iterations are run).

            cb.fetchFirst(fessConfig.getPageCrawlingInfoParamMaxFetchSizeAsInteger());
        });
    }

    /**
     * Retrieves the parameters from the most recent crawling session for a given session ID.
     * Returns an empty list if no crawling information is found for the session.
     *
     * @param sessionId the session identifier to find the latest crawling parameters for

  private Traverser(SuccessorsFunction<N> successorFunction) {
    this.successorFunction = checkNotNull(successorFunction);
  }

  /**
   * Creates a new traverser for the given general {@code graph}.
   *
   * <p>Traversers created using this method are guaranteed to visit each node reachable from the
   * start node(s) at most once.
   *

    Iterables.addAll(multiset, elements);
    return multiset;
  }

  /**
   * Returns a new {@code EnumMultiset} instance containing the given elements. Unlike {@link
   * EnumMultiset#create(Iterable)}, this method does not produce an exception on an empty iterable.
   *
   * @since 14.0
   */

    long a = (u ^ v) * mul;
    a ^= a >>> 47;
    long b = (v ^ a) * mul;
    b ^= b >>> 47;
    b *= mul;
    return b;
  }

  /**
   * Computes intermediate hash of 32 bytes of byte array from the given offset. Results are
   * returned in the output array because when we last measured, this was 12% faster than allocating
   * new arrays every time.
   */
  private static void weakHashLength32WithSeeds(

     * @param tag the HTML tag name to match (e.g., "div", "span", "p")
     */
    public PrunedTag(final String tag) {
        this.tag = tag;
    }

    /**
     * Checks if this pruned tag configuration matches the given DOM node.
     * The matching is based on tag name, and optionally ID, CSS class, or custom attributes.
     *
     * @param node the DOM node to check against this pruned tag configuration

        assertNotNull(conn);
        assertTrue(conn instanceof SmbFile, "Connection should be an instance of SmbFile");
        SmbFile file = (SmbFile) conn;
        assertEquals(url, file.getURL(), "Returned SmbFile should wrap the given URL");
        assertSame(mockCtx, file.getContext(), "SmbFile must use the provided CIFSContext");
        verify(mockCtx, atLeastOnce()).getConfig(); // interaction with dependency
    }

    @Test