@GwtIncompatible // SerializableTester
public class ReserializedSafeTreeMapMapInterfaceTest
    extends SortedMapInterfaceTest<String, Integer> {
  public ReserializedSafeTreeMapMapInterfaceTest() {
    super(false, true, true, true, true);
  }

  @Override
  protected SortedMap<String, Integer> makePopulatedMap() {
    NavigableMap<String, Integer> map = new SafeTreeMap<>();
    map.put("one", 1);
    map.put("two", 2);
    map.put("three", 3);

errors.failed_to_upgrade_from=Kan niet upgraden vanaf {0}.
errors.failed_to_reindex=Kan herindexering van {0} naar {1} niet starten.
errors.failed_to_rebuild_config_index=Kan configuratie-indexen niet opnieuw opbouwen.
errors.no_target_index_selected=Selecteer minimaal één doelindex om opnieuw op te bouwen.
errors.operation_already_running=De bewerking wordt al uitgevoerd op {0}.

    long r = 0;
    List<Facade<Integer>> list = new ArrayList<>(reps);
    for (int i = 0; i < reps; i++) {
      Facade<Integer> localFuture = impl.newFacade();
      list.add(localFuture);
      localFuture.setException(exception);
    }
    for (int i = 0; i < reps; i++) {
      Facade<Integer> facade = list.get(i);
      try {
        facade.get();
        r++;

    for (int i = 0; i < numInsertions * 2; i += 2) {
      bf.put(Integer.toString(i));
    }
    assertApproximateElementCountGuess(bf, numInsertions);

    // Assert that the BF "might" have all of the even numbers.
    for (int i = 0; i < numInsertions * 2; i += 2) {
      assertTrue(bf.mightContain(Integer.toString(i)));
    }

        return index;
    }

    /**
     * Sets the current index position in the buffer.
     *
     * @param index the new index position
     */
    public void setIndex(final int index) {
        this.index = index;
    }

    /**
     * Returns the capacity of the buffer.
     *
     * @return the buffer capacity
     */
    public int getCapacity() {
        return buf.length - start;

  }

  private final boolean allowsSelfLoops;
  private final ElementOrder<Integer> incidentEdgeOrder;

  public StandardMutableUndirectedGraphTest(
      boolean allowsSelfLoops, ElementOrder<Integer> incidentEdgeOrder) {
    this.allowsSelfLoops = allowsSelfLoops;
    this.incidentEdgeOrder = incidentEdgeOrder;
  }

  @Override
  public MutableGraph<Integer> createGraph() {
    return GraphBuilder.undirected()

  public SubMapMultimapAsMapImplementsMapTest() {
    super(true, true, true);
  }

  private TreeMultimap<String, Integer> createMultimap() {
    TreeMultimap<String, Integer> multimap =
        TreeMultimap.create(
            Ordering.<String>natural().nullsFirst(), Ordering.<Integer>natural().nullsFirst());
    multimap.put("a", -1);
    multimap.put("a", -3);
    multimap.put("z", -2);
    return multimap;
  }

            "type" : "keyword"
          },
          "intervalTime" : {
            "type" : "integer"
          },
          "maxAccessCount" : {
            "type" : "long"
          },
          "name" : {
            "type" : "keyword"
          },
          "numOfThread" : {
            "type" : "integer"
          },
          "permissions" : {
            "type" : "keyword"
          },

    return suite;
  }

  public void testInsertionOrder() {
    Map<Integer, String> map = CompactLinkedHashMap.create();
    map.put(1, "a");
    map.put(4, "b");
    map.put(3, "d");
    map.put(2, "c");
    testHasMapEntriesInOrder(map, 1, "a", 4, "b", 3, "d", 2, "c");
  }

  public void testInsertionOrderAfterPutKeyTwice() {
    Map<Integer, String> map = CompactLinkedHashMap.create();
    map.put(1, "a");

        }
      }
    }

    @Override
    public boolean matches(char c) {
      int index = Arrays.binarySearch(rangeStarts, c);
      if (index >= 0) {
        return true;
      } else {
        index = ~index - 1;
        return index >= 0 && c <= rangeEnds[index];
      }
    }

    @Override
    public String toString() {
      return description;
    }