зеркало из https://github.com/mozilla/gecko-dev.git
adbe589f59
This implements a chunk_by_manifest algorithm. It is similar to chunk_by_slice in that it tries to make an even number of tests run in each chunk. However, unlike chunk_by_slice it will guarantee that tests in the same manifest will all run in the same chunk. This makes it suitable to use with run-by-manifest. This means the chunks won't be perfect (as manifests are differnet sizes). It is also prone to more randomization, similar to chunk-by-runtime. In fact, this algorithm is nearly identical to the chunk-by-runtime one, so it was refactored out to a base class. MozReview-Commit-ID: HI2ByxW0i8V --HG-- extra : rebase_source : e066c034b85222d26bafe6873a80366d5bd9df9e |
||
---|---|---|
.. | ||
manifestparser | ||
tests | ||
setup.py |