- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for mediante (0.05 sec)
-
docs/es/docs/python-types.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 9.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesTest.java
public void testMedian_compute_doubleCollection() { assertThat(median().compute(SIXTEEN_SQUARES_DOUBLES)) .isWithin(ALLOWED_ERROR) .of(SIXTEEN_SQUARES_MEDIAN); } public void testMedian_computeInPlace() { double[] dataset = Doubles.toArray(SIXTEEN_SQUARES_DOUBLES); assertThat(median().computeInPlace(dataset)).isWithin(ALLOWED_ERROR).of(SIXTEEN_SQUARES_MEDIAN);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
/** * Provides a fluent API for calculating <a * href="http://en.wikipedia.org/wiki/Quantile">quantiles</a>. * * <h3>Examples</h3> * * <p>To compute the median: * * <pre>{@code * double myMedian = median().compute(myDataset); * }</pre> * * where {@link #median()} has been statically imported. * * <p>To compute the 99th percentile: * * <pre>{@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
// Exactly two elements left. swap(array, from, to); } return array[k]; } else { int midIndex = (from + to) >>> 1; // Choose the median of the elements at the from, to and mid indexes, // and rearrange so that array[from]<=array[from+1], and // array[to] => array[from + 1]. swap(array, midIndex, from + 1);
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
// dataset which is already sorted or partially sorted is cheating. return datasets[i & 0xFF].clone(); } @Benchmark double median(int reps) { double dummy = 0.0; for (int i = 0; i < reps; i++) { dummy += algorithm.singleQuantile(1, 2, dataset(i)); } return dummy; } @Benchmark double percentile90(int reps) {
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
// dataset which is already sorted or partially sorted is cheating. return datasets[i & 0xFF].clone(); } @Benchmark double median(int reps) { double dummy = 0.0; for (int i = 0; i < reps; i++) { dummy += algorithm.singleQuantile(1, 2, dataset(i)); } return dummy; } @Benchmark double percentile90(int reps) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 3.1K bytes - Viewed (0) -
docs/pt/docs/deployment/server-workers.md
Em particular, ao executar no **Kubernetes** você provavelmente **não** vai querer usar vários trabalhadores e, em vez disso, executar **um único processo Uvicorn por contêiner**, mas falarei sobre isso mais adiante neste capítulo. /// ## Vários trabalhadores Você pode iniciar vários trabalhadores com a opção de linha de comando `--workers`: //// tab | `fastapi` Se você usar o comando `fastapi`:
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Fri Sep 20 11:01:03 UTC 2024 - 9K bytes - Viewed (0) -
impl/maven-core/plugin-manager.txt
h3. Execution of the plugin
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 12.9K bytes - Viewed (0) -
docs/pt/docs/advanced/security/oauth2-scopes.md
O objeto `security_scopes` (da classe `SecurityScopes`) também oferece um atributo `scope_str` com uma única string, contendo os escopos separados por espaços (nós vamos utilizar isso).
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 21.7K bytes - Viewed (0) -
docs/fr/docs/async.md
/// --- Dans ce scénario de burgers parallèles, vous êtes un ordinateur / programme 🤖 avec deux processeurs (vous et votre crush 😍) attendant 🕙 à deux et dédiant votre attention 🕙 à "attendre devant le comptoir" pour une longue durée.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Tue Aug 06 04:48:30 UTC 2024 - 25.4K bytes - Viewed (0)