return new SampleElements<>(
          Multisets.immutableEntry(samples.e0(), 3),
          Multisets.immutableEntry(samples.e1(), 4),
          Multisets.immutableEntry(samples.e2(), 1),
          Multisets.immutableEntry(samples.e3(), 5),
          Multisets.immutableEntry(samples.e4(), 2));
    }

    @Override
    public Set<Multiset.Entry<E>> create(Object... entries) {

    Comparator<? super E> comparator = emptyMultiset.comparator();
    SampleElements<E> samples = delegate.samples();
    List<E> samplesList =
        asList(samples.e0(), samples.e1(), samples.e2(), samples.e3(), samples.e4());

    sort(samplesList, comparator);
    E firstInclusive = samplesList.get(0);
    E lastInclusive = samplesList.get(samplesList.size() - 1);

        project.addArtifact(new Artifact("g0", "a0", "v0", "e0", "c0"));
        project.addArtifact(new Artifact("g1", "a1", "v1", "e1", "c1"));
        project.addArtifact(new Artifact("g2", "a2", "v2", "e2", "c2"));
    }

    /**
     * <p>testValueExtraction.</p>
     *
     * @throws Exception if any.
     */
    @Test
    void testValueExtraction() throws Exception {

          sort(
              entryArray,
              0,
              size,
              (e1, e2) -> {
                // requireNonNull is safe because the first `size` elements have been filled in.
                requireNonNull(e1);
                requireNonNull(e2);
                return comparator.compare(e1.getKey(), e2.getKey());
              });

                  protected Set<String> create(String[] elements) {
                    return intersection(
                        newHashSet(samples().e1(), samples().e3()),
                        newHashSet(samples().e2(), samples().e4()));
                  }
                })
            .named("set & disjoint")
            .withFeatures(CollectionSize.ZERO, CollectionFeature.ALLOWS_NULL_VALUES)
            .createTestSuite());

      @ParametricNullness E element, E... elements) {
    return from(Lists.asList(element, elements));
  }

  /**
   * Returns a string representation of this fluent iterable, with the format {@code [e1, e2, ...,
   * en]}.
   *
   * <p><b>{@code Stream} equivalent:</b> {@code stream.collect(Collectors.joining(", ", "[", "]"))}
   * or (less efficiently) {@code stream.collect(Collectors.toList()).toString()}.
   */

        return false;
      }
    }
    return Iterators.elementsEqual(iterable1.iterator(), iterable2.iterator());
  }

  /**
   * Returns a string representation of {@code iterable}, with the format {@code [e1, e2, ..., en]}
   * (that is, identical to {@link java.util.Arrays Arrays}{@code
   * .toString(Iterables.toArray(iterable))}). Note that for <i>most</i> implementations of {@link

        return false;
      }
    }
    return Iterators.elementsEqual(iterable1.iterator(), iterable2.iterator());
  }

  /**
   * Returns a string representation of {@code iterable}, with the format {@code [e1, e2, ..., en]}
   * (that is, identical to {@link java.util.Arrays Arrays}{@code
   * .toString(Iterables.toArray(iterable))}). Note that for <i>most</i> implementations of {@link

      if (!Objects.equals(o1, o2)) {
        return false;
      }
    }
    return !iterator2.hasNext();
  }

  /**
   * Returns a string representation of {@code iterator}, with the format {@code [e1, e2, ..., en]}.
   * The iterator will be left exhausted: its {@code hasNext()} method will return {@code false}.
   */
  public static String toString(Iterator<?> iterator) {
    StringBuilder sb = new StringBuilder().append('[');

; È+54 qÖVs@²P}nsU Aïy°ú̧¡½ª†Slãpkª cU@ôYsf^Ô }e„@zw zoR\m[axé¬{U÷_sxì„Vy²H{_Zèñ |ªã*(>6{l Q OvEZìsv]xï„=cx=‘¬KKÖR}rªwZ²kmå9 °¬:}VôK{ïˆpj1*}@E~xªÙ[B\ˆÜ^OªVqPj¦^i¸nä»t H_Úe sL€tqÎïcBmpY¨qV [ø!wdò ñWªy{lnº gZ› ªLc¼]ÜsÖO„rSnã²ÎöH@Fáæ@C{sN¾äVlRO®©»ðh¸_{ê2{a™}OpîñÈ·igTei»ÊufsqKó»\aLycx+ }Dš ŸeSbûUô}rQñ`¾™È¬i_\yUÖ ­yûZ_s¬Y}PÚqJ ‘rGtãjÒÀÀ~^>dg £ÉÒ»³ DqÐ.cW%1ò^¼]ÜKFVÕúMI),éærsL}G~Ü„\WQV¦MDCfw@Üe ô}°j÷inS{Gpucò’}S\eUuð÷ xH2 q# ò; 6Ä 3 Ä" %è> 2 5 *\ wKûryˆtXI ‰åt † ixÉkfs¦¾ÿx mmFwfðsfˆYïN©æiIIF„{æV oܤBH_...