- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 33 for Fortino (0.18 sec)
-
android/guava-tests/benchmark/com/google/common/collect/ComparatorDelegationOverheadBenchmark.java
import com.google.caliper.Benchmark; import com.google.caliper.Param; import java.util.Arrays; import java.util.Comparator; import java.util.Random; /** * A benchmark to determine the overhead of sorting with {@link Ordering#from(Comparator)}, or with * {@link Ordering#natural()}, as opposed to using the inlined {@link Arrays#sort(Object[])} * implementation, which uses {@link Comparable#compareTo} directly. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
} /** * An iterator that performs a lazy N-way merge, calculating the next value each time the iterator * is polled. This amortizes the sorting cost over the iteration and requires less memory than * sorting all elements at once. * * <p>Retrieving a single element takes approximately O(log(M)) time, where M is the number of
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 51.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
* @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 double singleQuantile(int index, int scale, double[] dataset) { Arrays.sort(dataset); return singleQuantileFromSorted(index, scale, dataset); } @Override
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
* @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 double singleQuantile(int index, int scale, double[] dataset) { Arrays.sort(dataset); return singleQuantileFromSorted(index, scale, dataset); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
default: return construct(elements.clone()); } } /** * Returns an immutable list containing the given elements, sorted according to their natural * order. The sorting algorithm used is stable, so elements that compare as equal will stay in the * order in which they appear in the input. * * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 30K bytes - Viewed (1) -
android/guava/src/com/google/common/base/Ascii.java
public static final byte CAN = 24; /** * End of Medium: A control character associated with the sent data which may be used to identify * the physical end of the medium, or the end of the used, or wanted, portion of information * recorded on a medium. (The position of this character does not necessarily correspond to the * physical end of the medium.) * * @since 8.0 */ public static final byte EM = 25;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* * <p>If any values in the input are {@link Double#NaN NaN} then all values returned are {@link * Double#NaN NaN}. (This is the one occasion when the behaviour is not the same as you'd get from * sorting with {@link java.util.Arrays#sort(double[]) Arrays.sort(double[])} or {@link * java.util.Collections#sort(java.util.List) Collections.sort(List<Double>)} and selecting
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithmTest.java
private static final int DATASET_SIZE = 1000; private static final double ALLOWED_ERROR = 1.0e-10; private static final QuantilesAlgorithm REFERENCE_ALGORITHM = QuantilesAlgorithm.SORTING; private static final Set<QuantilesAlgorithm> NON_REFERENCE_ALGORITHMS = Sets.difference( ImmutableSet.copyOf(QuantilesAlgorithm.values()), ImmutableSet.of(REFERENCE_ALGORITHM)); private double[] dataset;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.4K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InternetDomainName.java
* * @since 6.0 */ public boolean hasPublicSuffix() { return publicSuffixIndex() != NO_SUFFIX_FOUND; } /** * Returns the {@linkplain #isPublicSuffix() public suffix} portion of the domain name, or {@code * null} if no public suffix is present. * * @since 6.0 */ @CheckForNull public InternetDomainName publicSuffix() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 20:47:23 GMT 2024 - 28K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* from least to greatest. If there are fewer than {@code k} elements present, all will be * included. * * <p>The implementation does not necessarily use a <i>stable</i> sorting algorithm; when multiple * elements are equivalent, it is undefined which will come first. * * <p><b>Java 8+ users:</b> Use {@code Streams.stream(iterable).collect(Comparators.least(k, * thisComparator))} instead.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0)