- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for midpoint (0.22 sec)
-
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) -
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) -
android/guava/src/com/google/common/graph/ImmutableGraph.java
* <p>If this graph is directed, {@code endpoints} must be ordered. * * <p>If either or both endpoints are not already present in this graph, this method will * silently {@link #addNode(Object) add} each missing endpoint to the graph. * * @return this {@code Builder} object * @throws IllegalArgumentException if the introduction of the edge would violate {@link * #allowsSelfLoops()}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
* visited twice if there is an edge connecting them. To avoid returning duplicate {@link * EndpointPair}s, we keep track of the nodes that we have visited. When processing endpoint * pairs, we skip if the "other node" is in the visited set, as shown below: * * <pre> * Nodes = {N1, N2, N3, N4} * N2 __ * / \ | | * N1----N3 N4__| *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountLinkedHashMap.java
firstEntry = ENDPOINT; lastEntry = ENDPOINT; links = new long[expectedSize]; Arrays.fill(links, UNSET); } @Override int firstIndex() { return (firstEntry == ENDPOINT) ? -1 : firstEntry; } @Override int nextIndex(int index) { int result = getSuccessor(index); return (result == ENDPOINT) ? -1 : result; } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 5.9K bytes - Viewed (0)