return name;
        }
      };
    }

    static final QueryOp<Map<Object, Object>> MAP_GET =
        QueryOp.create(
            "Map.get",
            (map, key) -> {
              Object unused = map.get(key);
            },
            Math::log);

    static final QueryOp<Set<Object>> SET_CONTAINS =
        QueryOp.create(
            "Set.contains",
            (set, key) -> {

            .collect(toImmutableList()),
        n -> n * log(n),
        ImmutableList.of(
            QueryOp.create(
                "BiMap.get",
                (biMap, key) -> {
                  Object unused = biMap.get(key);
                },
                Math::log),
            QueryOp.create(
                "BiMap.inverse.get",
                (biMap, o) -> {

  public CompactLinkedHashMapFloodingTest() {
    super(
        ImmutableList.of(Construction.mapFromKeys(CompactLinkedHashMap::create)),
        n -> n * log(n),
        ImmutableList.of(QueryOp.MAP_GET));
  }

  public CompactLinkedHashSetFloodingTest() {
    super(
        ImmutableList.of(Construction.setFromElements(CompactLinkedHashSet::create)),
        n -> n * log(n),
        ImmutableList.of(QueryOp.SET_CONTAINS));
  }

  public ImmutableMultisetFloodingTest() {
    super(
        asList(ConstructionPathway.values()),
        n -> n * log(n),
        ImmutableList.of(
            QueryOp.create(
                "count",
                (ms, o) -> {
                  int unused = ms.count(o);
                },
                Math::log)));
  }

  /** All the ways to create an ImmutableMultiset. */