- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 29 for midpoint (0.21 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) -
android/guava/src/com/google/common/collect/Range.java
return create(Cut.<C>belowAll(), Cut.aboveValue(endpoint)); } /** * Returns a range with no lower bound up to the given endpoint, which may be either inclusive * (closed) or exclusive (open). * * @since 14.0 */ public static <C extends Comparable<?>> Range<C> upTo(C endpoint, BoundType boundType) { switch (boundType) { case OPEN: return lessThan(endpoint);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 27.8K bytes - Viewed (0) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableNetwork.java
* {@link #addNode(Object) add} each missing endpoint to the graph. * * <p>If {@code edge} already connects an endpoint pair equal to {@code endpoints}, then this * method will have no effect. * * @return {@code true} if the network was modified as a result of this call * @throws IllegalArgumentException if {@code edge} already exists in the graph 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: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
} private static <N, V> Map<EndpointPair<N>, V> edgeValueMap(final ValueGraph<N, V> graph) { return Maps.asMap( graph.edges(), edge -> // requireNonNull is safe because the endpoint pair comes from the graph. requireNonNull(graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null))); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
* <p>This class maintains a map of nodes to {@link NetworkConnections}. This class also maintains a * map of edges to reference nodes. The reference node is defined to be the edge's source node on * directed graphs, and an arbitrary endpoint of the edge on undirected graphs. * * <p>Collection-returning accessors return unmodifiable views: the view returned will reflect * changes to the graph (if the graph is mutable) but may not be modified by the user. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
} for (N node : subgraph.nodes()) { for (N successorNode : graph.successors(node)) { if (subgraph.nodes().contains(successorNode)) { // requireNonNull is safe because the endpoint pair comes from the graph. subgraph.putEdgeValue( node, successorNode, requireNonNull(graph.edgeValueOrDefault(node, successorNode, null))); } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K 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)