* {@link EndpointPair} of an undirected edge is an unordered pair of nodes ({@link #nodeU()} and
 * {@link #nodeV()}).
 *
 * <p>The edge is a self-loop if, and only if, the two endpoints are equal.
 *
 * @author James Sexton
 * @since 20.0
 */
@Beta
@Immutable(containerOf = {"N"})
public abstract class EndpointPair<N> implements Iterable<N> {
  private final N nodeU;

        iterator.close();
        iterator.close(); // Second close should be safe

        // Then: Tree handle should be released only once
        verify(treeHandle, times(1)).release();
    }

    @Test
    @DisplayName("Iterator should handle filter that rejects all entries")
    void testIterator_FilterRejectsAll() throws Exception {

        return createPathMatcher(baseDirectory, null, excludes, useDefaultExcludes);
    }

    /**
     * Creates a path matcher that only includes files matching the include patterns.
     * <p>
     * This is equivalent to calling {@link #createPathMatcher(Path, Collection, Collection, boolean)}

            }
            return;
        }

        doCrawl(sessionId, configList);
    }

    /**
     * Initiates crawling for specific data configurations.
     * This method starts crawling only for the data configurations
     * specified in the configIdList parameter.
     *
     * @param sessionId unique identifier for this crawling session
     * @param configIdList list of data configuration IDs to crawl

    Node collectDependencies(@Nonnull Project project, @Nonnull PathScope scope);

    /**
     * Collects the transitive dependencies of some artifacts and builds a dependency graph. Note that this operation is
     * only concerned about determining the coordinates of the transitive dependencies and does not actually resolve the
     * artifact files.
     * <p>
     * Shortcut for {@code getService(DependencyResolver.class).resolve(...)}

    for (int i = 0; i < 8; i++) {
      limiter.acquire(); // // #1
    }
    stopwatch.sleepMillis(4500); // #2: back to cold state (warmup period + repay last acquire)
    for (int i = 0; i < 3; i++) { // only three steps, we're somewhere in the warmup period
      limiter.acquire(); // #3
    }

    limiter.setRate(4.0); // double the rate!

    for (int i = 0; i < 8; i++) {
      limiter.acquire(); // // #1
    }
    stopwatch.sleepMillis(4500); // #2: back to cold state (warmup period + repay last acquire)
    for (int i = 0; i < 3; i++) { // only three steps, we're somewhere in the warmup period
      limiter.acquire(); // #3
    }

    limiter.setRate(4.0); // double the rate!

    @CanIgnoreReturnValue
    public Builder<K, V> expectedValuesPerKey(int expectedValuesPerKey) {
      checkNonnegative(expectedValuesPerKey, "expectedValuesPerKey");

      // Always presize to at least 1, since we only bother creating a value collection if there's
      // at least one element.
      this.expectedValuesPerKey = max(expectedValuesPerKey, 1);

      return this;
    }

    /**

    #   o diffIgnoredKeyList: list of ignored keys for differences (NotRequired)
    #   o maskedKeyList: list of masked keys for security (NotRequired)
    #   o isEnvOnlyFloatLeft: is it environment only? (and show as float-left?) (NotRequired)
    #   o extendsPropRequest: other request name of exnteds-properties (NotRequired)
    #   o isCheckImplicitOverride: does it check implicit override? (NotRequired)
    #

            cb.query().setDuplicateHostName_Wildcard(wrapQuery(duplicateHostPager.duplicateHostName));
        }
        // TODO Long, Integer, String supported only.

        // setup condition
        cb.query().addOrderBy_SortOrder_Asc();
        cb.query().addOrderBy_CreatedTime_Asc();

        // search

    }