* an edge connecting node A to node B if this {@link Network} has an edge connecting A to B.
   *
   * <p>If this network {@link #allowsParallelEdges() allows parallel edges}, parallel edges will be
   * treated as if collapsed into a single edge. For example, the {@link #degree(Object)} of a node
   * in the {@link Graph} view may be less than the degree of the same node in this {@link Network}.
   */
  Graph<N> asGraph();

  //

   * @param isFinalPart Is this the final (rightmost) domain part?
   * @return Whether the part is valid
   */
  private static boolean validatePart(String part, boolean isFinalPart) {

    // These tests could be collapsed into one big boolean expression, but
    // they have been left as independent tests for clarity.

    if (part.length() < 1 || part.length() > MAX_DOMAIN_PART_LENGTH) {
      return false;
    }

    /*

    /** Property key for login requirement configuration. */
    public static final String LOGIN_REQUIRED_PROPERTY = "login.required";

    /** Property key for result collapse configuration. */
    public static final String RESULT_COLLAPSED_PROPERTY = "result.collapsed";

    /** Property key for login link enabled configuration. */
    public static final String LOGIN_LINK_ENALBED_PROPERTY = "login.link.enabled";

 * to implement the related methods as well. Finally, two collection views are provided: {@link
 * #elementSet} contains the distinct elements of the multiset "with duplicates collapsed", and
 * {@link #entrySet} is similar but contains {@link Entry Multiset.Entry} instances, each providing
 * both a distinct element and the count of that element.
 *

 * to implement the related methods as well. Finally, two collection views are provided: {@link
 * #elementSet} contains the distinct elements of the multiset "with duplicates collapsed", and
 * {@link #entrySet} is similar but contains {@link Entry Multiset.Entry} instances, each providing
 * both a distinct element and the count of that element.
 *

        // But since size() < pageSize, collapsing logic applies and allPageCount becomes currentPageNumber
        assertEquals(1, qrList.getAllPageCount()); // Collapsed to current page due to size() = 1 < pageSize = 10
        assertEquals(1, qrList.getCurrentPageNumber());
    }

    public void test_constructor_withZeroPageSize() {

        assertThrows(IllegalArgumentException.class, () -> builder.buildOrThrow());
    // We don't really care which values the exception message contains, but they should be
    // different from each other. If buildKeepingLast() collapsed duplicates, that might end up not
    // being true.
    Pattern pattern = Pattern.compile("Multiple entries with same key: four=(.*) and four=(.*)");
    assertThat(expected).hasMessageThat().matches(pattern);

query.gsa.index.field.content_type.=content_type
# Maximum concurrent group results for collapse queries.
query.collapse.max.concurrent.group.results=4
# Inner hits name for collapse queries.
query.collapse.inner.hits.name=similar_docs
# Inner hits size for collapse queries.
query.collapse.inner.hits.size=0
# Sorts for inner hits in collapse queries.
query.collapse.inner.hits.sorts=
# Default languages for queries.
query.default.languages=

				}
				// {"acl": "public-read" } is an alternate way to indicate - [ "eq", "$acl", "public-read" ]
				// In this case we will just collapse this into "eq" for all use cases.
				parsedPolicy.Conditions.Policies = append(parsedPolicy.Conditions.Policies, struct {
					Operator string
					Key      string
					Value    string
				}{

      extends TestUnhashableCollectionGenerator<Set<UnhashableObject>>
      implements TestSetGenerator<UnhashableObject> {}

  private static Ordering<String> createExplicitComparator(String[] elements) {
    // Collapse equal elements, which Ordering.explicit() doesn't support, while
    // maintaining the ordering by first occurrence.
    Set<String> elementsPlus = new LinkedHashSet<>();
    elementsPlus.add(BEFORE_FIRST);