Index: pkg/lookup_map/test/lookup_map_test.dart |
diff --git a/pkg/lookup_map/test/lookup_map_test.dart b/pkg/lookup_map/test/lookup_map_test.dart |
index 7695833c769b08455758cd9da59081bbd23d2291..d35e0beb98b028a91a0493d4bd1af76cc6ea3447 100644 |
--- a/pkg/lookup_map/test/lookup_map_test.dart |
+++ b/pkg/lookup_map/test/lookup_map_test.dart |
@@ -11,16 +11,22 @@ class Key { |
const Key(this.id); |
} |
-class A{} |
+class A {} |
+ |
const B = const Key(1); |
-class C{} |
+ |
+class C {} |
main() { |
test('entries constructor', () { |
var m = const LookupMap(const [ |
- A, "the-text-for-A", |
- B, "the-text-for-B", |
- 1.2, "the-text-for-1.2"]); |
+ A, |
+ "the-text-for-A", |
+ B, |
+ "the-text-for-B", |
+ 1.2, |
+ "the-text-for-1.2" |
+ ]); |
expect(m[A], 'the-text-for-A'); |
expect(m[B], 'the-text-for-B'); |
expect(m[1.2], 'the-text-for-1.2'); |
@@ -43,7 +49,8 @@ main() { |
test('entry shadows nested maps', () { |
var m = const LookupMap(const [ |
- A, "the-text-for-A2", |
+ A, |
+ "the-text-for-A2", |
], const [ |
const LookupMap.pair(A, "the-text-for-A1"), |
]); |
@@ -51,7 +58,7 @@ main() { |
}); |
test('nested maps shadow in order', () { |
- var m = const LookupMap(const [ ], const [ |
+ var m = const LookupMap(const [], const [ |
const LookupMap.pair(A, "the-text-for-A1"), |
const LookupMap.pair(B, "the-text-for-B2"), |
const LookupMap.pair(A, "the-text-for-A2"), |
@@ -65,9 +72,12 @@ main() { |
// sanity. |
test('reachable lookups are not tree-shaken', () { |
var m = const LookupMap(const [ |
- A, B, |
- B, C, |
- C, 3.4, |
+ A, |
+ B, |
+ B, |
+ C, |
+ C, |
+ 3.4, |
]); |
expect(m[m[m[A]]], 3.4); |
}); |