- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 122 for Cortez (0.18 sec)
-
guava/src/com/google/common/collect/ForwardingSortedMap.java
import java.util.SortedMap; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A sorted map which forwards all its method calls to another sorted map. Subclasses should * override one or more methods to modify the behavior of the backing sorted map as desired per the * <a href="http://en.wikipedia.org/wiki/Decorator_pattern">decorator pattern</a>. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 15:26:39 GMT 2023 - 5.6K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java
} } } private double[] dataset(int i) { // We must test on a fresh clone of the dataset each time. Doing sorts and quickselects on a // 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++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeBasedTable.java
* quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer, * since an iteration across all row keys occurs. * * <p>Because a {@code TreeBasedTable} has unique sorted values for a given row, both {@code * row(rowKey)} and {@code rowMap().get(rowKey)} are {@link SortedMap} instances, instead of the * {@link Map} specified in the {@link Table} interface. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 11.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/ForwardingSortedMultiset.java
import java.util.Iterator; import java.util.NavigableSet; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A sorted multiset which forwards all its method calls to another sorted multiset. Subclasses * should override one or more methods to modify the behavior of the backing multiset as desired per
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 15:26:39 GMT 2023 - 8.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/StandardMutableDirectedNetworkTest.java
@Parameters(name = "allowsSelfLoops={0}, allowsParallelEdges={1}, nodeOrder={2}, edgeOrder={3}") public static Collection<Object[]> parameters() { ElementOrder<?> naturalElementOrder = ElementOrder.sorted(Ordering.natural()); return Arrays.asList( new Object[][] { {false, false, ElementOrder.insertion(), ElementOrder.insertion()},
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 09 17:01:22 GMT 2020 - 2.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Comparators.java
* // returns {"foo", "quux"} * }</pre> * * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n * log n) time and O(n) space. * * @throws IllegalArgumentException if {@code k < 0} * @since 22.0 */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 10.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
checkNonnegative(k, "k"); if (k == 0 || !iterator.hasNext()) { return Collections.emptyList(); } else if (k >= Integer.MAX_VALUE / 2) { // k is really large; just do a straightforward sorted-copy-and-sublist ArrayList<E> list = Lists.newArrayList(iterator); Collections.sort(list, this); if (list.size() > k) { list.subList(k, list.size()).clear(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/SipHashFunctionTest.java
private static final HashFunction SIP_WITH_KEY = Hashing.sipHash24(K0, K1); private static final HashFunction SIP_WITHOUT_KEY = Hashing.sipHash24(); // These constants were originally ported from https://www.131002.net/siphash/siphash24.c. See: // https://github.com/nahi/siphash-java-inline/blob/master/src/test/java/org/jruby/util/SipHashInlineTest.java private static final long[] EXPECTED = new long[] {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Sun May 05 18:02:35 GMT 2019 - 6.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/GeneralRange.java
/** * A generalized interval on any ordering, for internal use. Supports {@code null}. Unlike {@link * Range}, this allows the use of an arbitrary comparator. This is designed for use in the * implementation of subcollections of sorted collection types. * * <p>Whenever possible, use {@code Range} instead, which is better supported. * * @author Louis Wasserman */ @GwtCompatible(serializable = true) @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMap.java
* Returns a newly-created immutable map. The iteration order of the returned map is the order * in which entries were inserted into the builder, unless {@link #orderEntriesByValue} was * called, in which case entries are sorted by value. * * <p>Prefer the equivalent method {@link #buildOrThrow()} to make it explicit that the method * will throw an exception if there are duplicate keys. The {@code build()} method will soon be
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 44.1K bytes - Viewed (0)