-
-
Notifications
You must be signed in to change notification settings - Fork 155
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Benchmark for JUnitTestCaseSorter::uniqueByTestFile (#1177)
* Sample of JUnit test timing from a real project * Implement bucket sort Co-Authored-By: Théo FIDRY <theo.fidry@gmail.com>
- Loading branch information
Showing
8 changed files
with
5,329 additions
and
36 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
98 changes: 98 additions & 0 deletions
98
src/TestFramework/Coverage/JUnit/TestLocationBucketSorter.php
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,98 @@ | ||
<?php | ||
/** | ||
* This code is licensed under the BSD 3-Clause License. | ||
* | ||
* Copyright (c) 2017, Maks Rafalko | ||
* All rights reserved. | ||
* | ||
* Redistribution and use in source and binary forms, with or without | ||
* modification, are permitted provided that the following conditions are met: | ||
* | ||
* * Redistributions of source code must retain the above copyright notice, this | ||
* list of conditions and the following disclaimer. | ||
* | ||
* * Redistributions in binary form must reproduce the above copyright notice, | ||
* this list of conditions and the following disclaimer in the documentation | ||
* and/or other materials provided with the distribution. | ||
* | ||
* * Neither the name of the copyright holder nor the names of its | ||
* contributors may be used to endorse or promote products derived from | ||
* this software without specific prior written permission. | ||
* | ||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | ||
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | ||
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE | ||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | ||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR | ||
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER | ||
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, | ||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | ||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
*/ | ||
|
||
declare(strict_types=1); | ||
|
||
namespace Infection\TestFramework\Coverage\JUnit; | ||
|
||
use Infection\AbstractTestFramework\Coverage\TestLocation; | ||
use function Safe\ksort; | ||
|
||
/** | ||
* @internal | ||
*/ | ||
final class TestLocationBucketSorter | ||
{ | ||
/** | ||
* Pre-sort first buckets, optimistically assuming that most projects | ||
* won't have tests longer than a second. | ||
*/ | ||
private const INIT_BUCKETS = [ | ||
0 => [], | ||
1 => [], | ||
2 => [], | ||
3 => [], | ||
4 => [], | ||
5 => [], | ||
6 => [], | ||
7 => [], | ||
]; | ||
|
||
private function __construct() | ||
{ | ||
} | ||
|
||
/** | ||
* Sorts tests to run the fastest first. Exposed for benchmarking purposes. | ||
* | ||
* @param TestLocation[] $uniqueTestLocations | ||
* | ||
* @return iterable<TestLocation> | ||
*/ | ||
public static function bucketSort(array $uniqueTestLocations): iterable | ||
{ | ||
$buckets = self::INIT_BUCKETS; | ||
|
||
foreach ($uniqueTestLocations as $location) { | ||
// @codeCoverageIgnoreStart | ||
// This is a very hot path. Factoring here another method just to test this math may not be as good idea. | ||
|
||
// Quick drop off lower bits, reducing precision to 8th of a second | ||
$msTime = $location->getExecutionTime() * 1024 >> 7; // * 1024 / 128 | ||
|
||
// For anything above 4 seconds reduce precision to 4 seconds | ||
if ($msTime > 32) { | ||
$msTime = $msTime >> 5 << 5; // 7 + 5 = 12 bits | ||
} | ||
// @codeCoverageIgnoreEnd | ||
|
||
$buckets[$msTime][] = $location; | ||
} | ||
|
||
ksort($buckets); | ||
|
||
foreach ($buckets as $bucket) { | ||
yield from $bucket; | ||
} | ||
} | ||
} |
Oops, something went wrong.