anchor.diff:        final root = createRoot<String, String, num>();
         expect(root.hasKeyAndValue, isFalse);
         expect(root.hasChildren, isFalse);
  +      expect(root.parts, isEmpty);
         final types = trie.entries.map((each) => each.runtimeType).toSet();
         expect(types.single, root.runtimeType);
       });
  
positive.code:         'pushAll',
          () => allHeapTests(<T>(List<T> list, {Comparator<T>? comparator}) =>
              Heap<T>(comparator: comparator)..pushAll(list)));
  
      // const ordered = [1, 2, 3, 4, 5];
      // group('constructor', () {
      //   test('empty', () {
      //     final heap = Heap<int>();
      //     verifyHeapInvariants(heap, source: []);
      //   });
      //   for (var permutation in ordered.permutations()) {
      //     test('of(${permutation.join(', ')})', () {
      //       final heap = Heap<int>.of(permutation);
      //       verifyHeapInvariants(heap, source: permutation);
      //       for (var i = ordered.length - 1; i >= 0; i--) {
      //         expect(heap.peek, ordered[i]);
      //         expect(heap.pop(), ordered[i]);
      //       }
      //     });
      //   }
      // });
      // group('push/pop', () {
      //   for (var permutation in ordered.permutations()) {
      //     test(permutation.join(', '), () {
      //       final heap = Heap<int>();
      //       heap.pushAll(permutation);
      //       verifyHeapInvariants(heap, source: permutation);
      //       for (var i = ordered.length - 1; i >= 0; i--) {
      //         expect(heap.peek, ordered[i]);
      //         expect(heap.pop(), ordered[i]);
      //       }
      //     });
      //   }
      // });
      // group('stress', () {
      //
      //
      //
      //   final random = Random(314);
      //   final unique = <int>{};
      //   // Create 1000 unique numbers.
      //   while (unique.length < 1000) {
      //     unique.add(random.nextInt(0xffffff));
      //   }
      //   final list = unique.toList()..sort();
      //   final heap1 = Heap<int>.of(unique);
      //   final heap2 = Heap<int>()..pushAll(unique);
      //   // Remove the 500 largest numbers
      //   while (list.length > 500) {
      //     final max = list.removeLast();
      //     expect(heap1.length, list.length + 1);
      //     expect(heap1.peek, max);
      //     expect(heap1.pop(), max);
      //     expect(heap2.length, list.length + 1);
      //     expect(heap2.peek, max);
      //     expect(heap2.pop(), max);
      //   }
      //   // Push and pop
      //
      // });
    });
    group('multimap', () {
      group('list', () {
  
negative.code:           map.replaceAll('b', [3, 4, 5]);
            expect(map, hasLength(4));
            expect(collection, [3, 4, 5]);
          });
          test('clear', () {
            final map = ListMultimap.fromIterables(['a', 'b', 'b'], [1, 2, 3]);
  