- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 26 for midpoint (0.2 sec)
-
android/guava/src/com/google/common/math/Quantiles.java
} } } /** * Performs a partition operation on the slice of {@code array} with elements in the range [{@code * from}, {@code to}]. Uses the median of {@code from}, {@code to}, and the midpoint between them * as a pivot. Returns the index which the slice is partitioned around, i.e. if it returns {@code * ret} then we know that the values with indexes in [{@code from}, {@code ret}) are less than or
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) -
guava/src/com/google/common/collect/Cut.java
* No code ever sees this bogus value for `endpoint`: This class overrides both methods that * use the `endpoint` field, compareTo() and endpoint(). Additionally, the main implementation * of Cut.compareTo checks for belowAll before reading accessing `endpoint` on another Cut * instance. */ super(""); } @Override Comparable<?> endpoint() {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 12.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* all "null" (UNSET). * * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list, * and a node with "next" pointer equal to {@code ENDPOINT} is the last node. */ @CheckForNull @VisibleForTesting transient long[] links; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int firstEntry;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
/** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */ @CheckForNull private transient int[] predecessor; /** * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
nextInBucketKToV = createFilledWithAbsent(expectedSize); nextInBucketVToK = createFilledWithAbsent(expectedSize); firstInInsertionOrder = ENDPOINT; lastInInsertionOrder = ENDPOINT; prevInInsertionOrder = createFilledWithAbsent(expectedSize); nextInInsertionOrder = createFilledWithAbsent(expectedSize); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
// The cast is safe because of the hasLowerBound check. E endpoint = uncheckedCastNullableTToT(range.getLowerEndpoint()); node = root.ceiling(comparator(), endpoint); if (node == null) { return null; } if (range.getLowerBoundType() == BoundType.OPEN && comparator().compare(endpoint, node.getElement()) == 0) { node = node.succ(); } } else {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/BoundType.java
/** * Indicates whether an endpoint of some range is contained in the range itself ("closed") or not * ("open"). If a range is unbounded on a side, it is neither open nor closed on that side; the * bound simply does not exist. * * @since 10.0 */ @GwtCompatible @ElementTypesAreNonnullByDefault public enum BoundType { /** The endpoint value <i>is not</i> considered part of the set ("exclusive"). */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Sep 20 15:57:47 GMT 2021 - 1.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPair.java
*/ public abstract N target(); /** * If this {@link EndpointPair} {@link #isOrdered()} returns the {@link #source()}; otherwise, * returns an arbitrary (but consistent) endpoint of the origin edge. */ public final N nodeU() { return nodeU; } /** * Returns the node {@link #adjacentNode(Object) adjacent} to {@link #nodeU()} along the origin
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/BoundType.java
/** * Indicates whether an endpoint of some range is contained in the range itself ("closed") or not * ("open"). If a range is unbounded on a side, it is neither open nor closed on that side; the * bound simply does not exist. * * @since 10.0 */ @GwtCompatible @ElementTypesAreNonnullByDefault public enum BoundType { /** The endpoint value <i>is not</i> considered part of the set ("exclusive"). */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Sep 20 15:57:47 GMT 2021 - 1.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
* silently {@link #addNode(Object) add} each missing endpoint to the network. * * <p>If {@code edge} already connects an endpoint pair equal to {@code endpoints}, then this * method will have no effect. * * @return this {@code Builder} object * @throws IllegalArgumentException if {@code edge} already exists in the network and connects * some other endpoint pair that is not equal to {@code endpoints}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 9.6K bytes - Viewed (0)