c878108cc8
All non-pubspec changes generated by `dart format pkg/compiler`. Change-Id: Iadaa70974816d96ccb47813fe72d5a2bb83d6bda Reviewed-on: https://dart-review.googlesource.com/c/sdk/+/400181 Reviewed-by: Nate Biggs <natebiggs@google.com> Commit-Queue: Mayank Patke <fishythefish@google.com>
165 lines
4.5 KiB
Dart
165 lines
4.5 KiB
Dart
// Copyright (c) 2016, 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.
|
|
|
|
library enumset.test;
|
|
|
|
import 'package:compiler/src/util/enumset.dart';
|
|
import 'package:expect/expect.dart';
|
|
|
|
enum Enum { A, B, C, D, E, F }
|
|
|
|
main() {
|
|
testAddRemoveContains();
|
|
testConstructorsIntersects();
|
|
}
|
|
|
|
void checkEnumSet(
|
|
EnumSet<Enum> enumSet,
|
|
int expectedValue,
|
|
List<Enum> expectedValues,
|
|
) {
|
|
Expect.equals(
|
|
expectedValue,
|
|
enumSet.mask,
|
|
"Unexpected EnumSet.value for ${enumSet.iterable(Enum.values)}",
|
|
);
|
|
Expect.listEquals(
|
|
expectedValues,
|
|
enumSet.iterable(Enum.values).toList(),
|
|
"Unexpected values: ${enumSet.iterable(Enum.values)}",
|
|
);
|
|
Expect.equals(
|
|
expectedValues.isEmpty,
|
|
enumSet.isEmpty,
|
|
"Unexpected EnumSet.isEmpty for ${enumSet.iterable(Enum.values)}",
|
|
);
|
|
for (Enum value in Enum.values) {
|
|
Expect.equals(
|
|
expectedValues.contains(value),
|
|
enumSet.contains(value),
|
|
"Unexpected EnumSet.contains for $value in "
|
|
"${enumSet.iterable(Enum.values)}",
|
|
);
|
|
}
|
|
}
|
|
|
|
void testAddRemoveContains() {
|
|
EnumSet<Enum> enumSet = EnumSet<Enum>.empty();
|
|
|
|
void check(int expectedValue, List<Enum> expectedValues) {
|
|
checkEnumSet(enumSet, expectedValue, expectedValues);
|
|
}
|
|
|
|
check(0, []);
|
|
|
|
enumSet = enumSet.add(Enum.B);
|
|
check(2, [Enum.B]);
|
|
|
|
enumSet = enumSet.add(Enum.F);
|
|
check(34, [Enum.F, Enum.B]);
|
|
|
|
enumSet = enumSet.add(Enum.A);
|
|
check(35, [Enum.F, Enum.B, Enum.A]);
|
|
|
|
enumSet = enumSet.add(Enum.A);
|
|
check(35, [Enum.F, Enum.B, Enum.A]);
|
|
|
|
enumSet = enumSet.remove(Enum.C);
|
|
check(35, [Enum.F, Enum.B, Enum.A]);
|
|
|
|
enumSet = enumSet.remove(Enum.B);
|
|
check(33, [Enum.F, Enum.A]);
|
|
|
|
enumSet = enumSet.remove(Enum.A);
|
|
check(32, [Enum.F]);
|
|
|
|
enumSet = EnumSet.empty();
|
|
check(0, []);
|
|
|
|
enumSet = enumSet.add(Enum.A);
|
|
enumSet = enumSet.add(Enum.B);
|
|
enumSet = enumSet.add(Enum.C);
|
|
enumSet = enumSet.add(Enum.D);
|
|
enumSet = enumSet.add(Enum.E);
|
|
enumSet = enumSet.add(Enum.F);
|
|
check(63, [Enum.F, Enum.E, Enum.D, Enum.C, Enum.B, Enum.A]);
|
|
}
|
|
|
|
void testConstructorsIntersects() {
|
|
EnumSet<Enum> emptyA = EnumSet<Enum>.empty();
|
|
EnumSet<Enum> emptyB = EnumSet<Enum>.fromRawBits(0);
|
|
EnumSet<Enum> emptyC = const EnumSet<Enum>.empty();
|
|
EnumSet<Enum> emptyD = const EnumSet<Enum>.fromRawBits(0);
|
|
EnumSet<Enum> emptyE = EnumSet<Enum>.fromValues(const []);
|
|
|
|
void checkIntersects(EnumSet<Enum> a, EnumSet<Enum> b, bool expectedValue) {
|
|
Expect.equals(
|
|
expectedValue,
|
|
a.intersects(b),
|
|
"Unexpected intersects of $a and $b",
|
|
);
|
|
Expect.equals(
|
|
a.intersects(b),
|
|
b.intersects(a),
|
|
"Unsymmetric intersects of $a and $b",
|
|
);
|
|
}
|
|
|
|
void check(EnumSet<Enum> a, EnumSet<Enum> b) {
|
|
Expect.equals(a.mask, b.mask, "Unexpected values of $a and $b");
|
|
Expect.equals(a.hashCode, b.hashCode, "Unexpected hash codes of $a and $b");
|
|
Expect.equals(a, b, "Unexpected equality of $a and $b");
|
|
checkIntersects(a, b, !a.isEmpty);
|
|
}
|
|
|
|
check(emptyA, emptyA);
|
|
check(emptyA, emptyB);
|
|
check(emptyA, emptyC);
|
|
check(emptyA, emptyD);
|
|
check(emptyA, emptyE);
|
|
|
|
EnumSet<Enum> singleA = const EnumSet<Enum>.empty().add(Enum.C);
|
|
EnumSet<Enum> singleB = EnumSet<Enum>.empty().add(Enum.C);
|
|
EnumSet<Enum> singleC = const EnumSet<Enum>.fromRawBits(4);
|
|
EnumSet<Enum> singleD = EnumSet<Enum>.fromRawBits(4);
|
|
EnumSet<Enum> singleE = EnumSet<Enum>.fromValues([Enum.C]);
|
|
EnumSet<Enum> singleF = EnumSet<Enum>.fromValue(Enum.C);
|
|
|
|
check(singleA, singleA);
|
|
check(singleA, singleB);
|
|
check(singleA, singleC);
|
|
check(singleA, singleD);
|
|
check(singleA, singleE);
|
|
check(singleA, singleF);
|
|
|
|
EnumSet<Enum> multiA = const EnumSet<Enum>.empty()
|
|
.add(Enum.A)
|
|
.add(Enum.D)
|
|
.add(Enum.F);
|
|
EnumSet<Enum> multiB = EnumSet<Enum>.empty()
|
|
.add(Enum.A)
|
|
.add(Enum.D)
|
|
.add(Enum.F);
|
|
EnumSet<Enum> multiC = const EnumSet<Enum>.fromRawBits(41);
|
|
EnumSet<Enum> multiD = EnumSet<Enum>.fromRawBits(41);
|
|
EnumSet<Enum> multiE = EnumSet<Enum>.fromValues([Enum.F, Enum.A, Enum.D]);
|
|
|
|
check(multiA, multiA);
|
|
check(multiA, multiB);
|
|
check(multiA, multiC);
|
|
check(multiA, multiD);
|
|
check(multiA, multiE);
|
|
|
|
EnumSet<Enum> multi2 = EnumSet<Enum>.fromValues([Enum.F, Enum.A, Enum.C]);
|
|
|
|
checkIntersects(emptyA, singleA, false);
|
|
checkIntersects(emptyA, multiA, false);
|
|
checkIntersects(emptyA, multi2, false);
|
|
|
|
checkIntersects(singleA, multiA, false);
|
|
checkIntersects(singleA, multi2, true);
|
|
|
|
checkIntersects(multiA, multi2, true);
|
|
}
|