anchor.diff:                                       hasRuntimeErrors,
                                        multitestOutcome);
         cachedTests.add(info);
  -      if (configuration['shards'] == 1) {
  -        // If we are not sharding, we queue the tests as we find them.
  -        enqueueTestCaseFromTestInformation(info);
  -      }
  +      enqueueTestCaseFromTestInformation(info);
       };
     }
   
  
positive.code:              "numStaticTypeAnnotations": numStaticTypeAnnotations,
               "numCompileTimeAnnotations": numCompileTimeAnnotations};
    }
  
    /**
     * shardTests takes the list of tests, stored as the List<TestInformation>
     * cachedTests, and selects only the tests belonging to this shard.
     * The tests are sorted by filename, and if there are n shards and we are
     * shard number i, only the tests at indices equal to i-1 modulo n are kept.
     */
    List<TestInformation> shardTests() {
      cachedTests.sort((TestInformation a, TestInformation b) => a.filename.compareTo(b.filename));
      int n = configuration['shards'];
      int i = configuration['shard'];
      if (n >= 2) {
        int current = 0;
        // The test function given to cachedTests.filter uses the entry's index.
        cachedTests = cachedTests.filter((t) => ((++current % n) == i - 1));
      }
      return cachedTests;
    }  
  }
  
  
  
negative.code:         // this suite.
          if (!testCache.containsKey(suiteName)) {
            cachedTests = testCache[suiteName] = [];
            processDirectory();
          } else {
            // We rely on enqueueing completing asynchronously so use a
  