- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for QuantilesAlgorithm (0.33 sec)
-
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
* quantiles. All algorithms modify the dataset they are given (the cost of a copy to avoid this * will be constant across algorithms). * * @author Pete Gillin * @since 20.0 */ enum QuantilesAlgorithm { /** * Sorts the dataset, and picks values from it. When computing multiple quantiles, we sort once * and pick multiple values. */ SORTING { @Override
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java
ContiguousSet.create(Range.closed(0, 10), DiscreteDomain.integers()); @Param({"10", "100", "1000", "10000", "100000"}) int datasetSize; @Param QuantilesAlgorithm algorithm; private double[][] datasets = new double[0x100][]; @BeforeExperiment void setUp() { Random rng = new Random(); for (int i = 0; i < 0x100; i++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 3.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java
ContiguousSet.create(Range.closed(0, 10), DiscreteDomain.integers()); @Param({"10", "100", "1000", "10000", "100000"}) int datasetSize; @Param QuantilesAlgorithm algorithm; private double[][] datasets = new double[0x100][]; @BeforeExperiment void setUp() { Random rng = new Random(); for (int i = 0; i < 0x100; i++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 3.1K bytes - Viewed (0)