# shellcheck disable=SC2120
catch() {
	if [ $# -ne 0 ]; then
		echo "error on line $1"
		for site in sitea siteb; do
			echo "$site server logs ========="
			cat "/tmp/${site}_1.log"
			echo "==========================="
			cat "/tmp/${site}_2.log"
		done
	fi

	echo "Cleaning up instances of MinIO"
	pkill minio
	pkill -9 minio
	rm -rf /tmp/multisitea
	rm -rf /tmp/multisiteb
	if [ $# -ne 0 ]; then
		exit $#
	fi

 * or implied. See the License for the specific language governing permissions and limitations under
 * the License.
 */

package com.google.common.collect;

import static java.lang.Math.log;

import com.google.common.annotations.GwtIncompatible;
import java.util.Map;

@GwtIncompatible
public class CompactLinkedHashMapFloodingTest
    extends AbstractHashFloodingTest<Map<Object, Object>> {

      }
    }.test();
  }

  @GwtIncompatible // slow (~5s)
  public void testConcatNoIteratorsYieldsEmpty() {
    new EmptyIteratorTester() {
      @Override
      protected Iterator<Integer> newTargetIterator() {
        return Iterators.concat();
      }
    }.test();
  }

  @GwtIncompatible // slow (~5s)
  public void testConcatOneEmptyIteratorYieldsEmpty() {

      }
    }.test();
  }

  @GwtIncompatible // slow (~5s)
  public void testConcatNoIteratorsYieldsEmpty() {
    new EmptyIteratorTester() {
      @Override
      protected Iterator<Integer> newTargetIterator() {
        return Iterators.concat();
      }
    }.test();
  }

  @GwtIncompatible // slow (~5s)
  public void testConcatOneEmptyIteratorYieldsEmpty() {

    assertThrows(IllegalArgumentException.class, () -> LinkedHashMultimap.create(20, -15));
  }

  @GwtIncompatible // unreasonably slow
  public void testGetIteration() {
    new IteratorTester<Integer>(
        6,
        MODIFIABLE,
        newLinkedHashSet(asList(2, 3, 4, 7, 8)),
        IteratorTester.KnownOrder.KNOWN_ORDER) {

            .collect(toImmutableList()),
        n -> n * log(n),
        ImmutableList.of(
            QueryOp.create("BiMap.get", BiMap::get, Math::log),
            QueryOp.create("BiMap.inverse.get", (bm, o) -> bm.inverse().get(o), Math::log)));
  }

  /** All the ways to create an ImmutableBiMap. */
  enum ConstructionPathway {
    COPY_OF_MAP {
      @Override

  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. */

import static java.lang.Math.log;

import com.google.common.annotations.GwtIncompatible;
import java.util.Map;

@GwtIncompatible
public class CompactHashMapFloodingTest extends AbstractHashFloodingTest<Map<Object, Object>> {
  public CompactHashMapFloodingTest() {
    super(
        ImmutableList.of(Construction.mapFromKeys(CompactHashMap::create)),
        n -> n * log(n),
        ImmutableList.of(QueryOp.MAP_GET));

import static java.lang.Math.log;

import com.google.common.annotations.GwtIncompatible;
import java.util.Set;

@GwtIncompatible
public class CompactHashSetFloodingTest extends AbstractHashFloodingTest<Set<Object>> {
  public CompactHashSetFloodingTest() {
    super(
        ImmutableList.of(Construction.setFromElements(CompactHashSet::create)),
        n -> n * log(n),
        ImmutableList.of(QueryOp.SET_CONTAINS));

 * offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link
 * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
 * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log
 * k). In benchmarks, this implementation performs at least as well as either implementation, and