- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 1,275 for valeurs (0.05 sec)
-
guava-tests/test/com/google/common/math/StatsTest.java
// For datasets of many double values created from an array, we test many combinations of finite // and non-finite values: for (ManyValues values : ALL_MANY_VALUES) { double mean = Stats.of(values.asArray()).mean(); if (values.hasAnyNaN()) { assertWithMessage("mean of " + values).that(mean).isNaN(); } else if (values.hasAnyPositiveInfinity() && values.hasAnyNegativeInfinity()) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 23 16:45:30 UTC 2024 - 33.3K bytes - Viewed (0) -
association.go
column, values := schema.ToQueryValues(rel.FieldSchema.Table, foreignKeys, pvs) if association.Unscope { association.Error = tx.Where(clause.IN{Column: column, Values: values}).Delete(modelValue).Error } else { association.Error = tx.Where(clause.IN{Column: column, Values: values}).UpdateColumns(updateMap).Error } } case schema.Many2Many:
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Wed Jun 12 10:49:45 UTC 2024 - 21.5K bytes - Viewed (0) -
logger/sql_test.go
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Thu Mar 21 08:00:02 UTC 2024 - 8.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/PairedStatsAccumulatorTest.java
.of(MANY_VALUES_SUM_OF_PRODUCTS_OF_DELTAS / MANY_VALUES_COUNT); // For datasets of many double values, we test many combinations of finite and non-finite // x-values: for (ManyValues values : ALL_MANY_VALUES) { PairedStatsAccumulator accumulator = createFilledPairedStatsAccumulator(values.asIterable(), OTHER_MANY_VALUES); PairedStatsAccumulator accumulatorByAddAllPartitionedPairedStats =
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Jul 03 21:17:33 UTC 2024 - 23.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedSetMultimap.java
/** * Stores a collection of values with the same key, replacing any existing values for that key. * * <p>Because a {@code SortedSetMultimap} has unique sorted values for a given key, this method * returns a {@link SortedSet}, instead of the {@link java.util.Collection} specified in the * {@link Multimap} interface. * * <p>Any duplicates in {@code values} will be stored in the multimap once. */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jan 24 17:47:51 UTC 2022 - 5.3K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* an application-specified ordering of lock acquisitions. The application defines the allowed * ordering with an {@code Enum} whose values each correspond to a lock type. The order in which * the values are declared dictates the allowed order of lock acquisition. In other words, locks * corresponding to smaller values of {@link Enum#ordinal()} should only be acquired before locks * with larger ordinals. Example: * * <pre>{@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
fastapi/dependencies/utils.py
call=call, stack=async_exit_stack, sub_values=solved_result.values ) elif is_coroutine_callable(call): solved = await call(**solved_result.values) else: solved = await run_in_threadpool(call, **solved_result.values) if sub_dependant.name is not None: values[sub_dependant.name] = solved if sub_dependant.cache_key not in dependency_cache:
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 27 21:46:26 UTC 2024 - 34.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathTesting.java
// Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31). intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE); // Add values up to 40. This covers cases like "square of a prime" and such. for (int i = 1; i <= 40; i++) { intValues.add(i); } // Now add values near 2^N for lots of values of N.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 11.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/MathTesting.java
// Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31). intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE); // Add values up to 40. This covers cases like "square of a prime" and such. for (int i = 1; i <= 40; i++) { intValues.add(i); } // Now add values near 2^N for lots of values of N.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 11.2K bytes - Viewed (0) -
helm/minio/templates/deployment.yaml
priorityClassName: "{{ .Values.priorityClassName }}" {{- end }} {{- if .Values.runtimeClassName }} runtimeClassName: "{{ .Values.runtimeClassName }}" {{- end }} {{- if and .Values.securityContext.enabled .Values.persistence.enabled }} securityContext: {{ omit .Values.securityContext "enabled" | toYaml | nindent 8 }} {{- end }}
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Oct 10 15:48:31 UTC 2024 - 8.6K bytes - Viewed (0)