// Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
// for details. All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.

// @dart = 2.9

/// @assertion LinkedHashSet({bool equals(E e1, E e2), int hashCode(E e),
/// bool isValidKey(potentialKey)})
/// Create an insertion-ordered hash set using the provided [equals] and
/// [hashCode].
/// @description Checks that [LinkedHashSet] preserves insertion order.
/// @author msyabro

import "../../../Utils/expect.dart";
import "dart:collection";

checkOrder(Set set, List valuesOrder) {
  var idx = 0;
  for(var v in set) {
    Expect.equals(valuesOrder[idx++], v);
  }
}

main() {
  LinkedHashSet set = new LinkedHashSet();
  set.add(1);
  set.add(2);
  set.add(3);
  checkOrder(set, [1, 2, 3]);

  set.add(2);
  checkOrder(set, [1, 2, 3, 2]);

  set.remove(2);
  set.remove(5);
  set.add(10);
  checkOrder(set, [1, 3, 10]);

  set.remove(3);
  checkOrder(set, [1, 10]);

  set.add(4);
  checkOrder(set, [1, 10, 4]);
}