- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 137 for unordered (0.22 sec)
-
android/guava/src/com/google/common/collect/CollectCollectors.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:21:40 GMT 2024 - 17.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
} @Test public void edges_containsOrderMismatch() { addEdge(N1, N2, E12); EndpointPair<Integer> endpointsN1N2 = EndpointPair.unordered(N1, N2); EndpointPair<Integer> endpointsN2N1 = EndpointPair.unordered(N2, N1); assertThat(network.asGraph().edges()).doesNotContain(endpointsN1N2); assertThat(network.asGraph().edges()).doesNotContain(endpointsN2N1); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow parallel edges * <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * <li>graphs whose edges are unique objects * </ul> * * <h3>Building a {@code Network}</h3> * * <p>The implementation classes that {@code common.graph} provides are not public, by design. To
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* terms</a>): * * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * <li>graphs whose edges have associated values * </ul> * * <p>{@code ValueGraph}, as a subtype of {@code Graph}, explicitly does not support parallel edges,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* terms</a>): * * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * </ul> * * <p>{@code Graph} explicitly does not support parallel edges, and forbids implementations or * extensions with parallel edges. If you need parallel edges, use {@link Network}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
@Override public ElementOrder<N> incidentEdgeOrder() { // TODO(b/142723300): Return AbstractNetwork.this.incidentEdgeOrder() once Network has that // method. return ElementOrder.unordered(); } @Override public boolean isDirected() { return AbstractNetwork.this.isDirected(); } @Override public boolean allowsSelfLoops() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
api/go1.7.txt
pkg go/build, type Package struct, BinaryOnly bool pkg go/build, type Package struct, CgoFFLAGS []string pkg go/build, type Package struct, FFiles []string pkg go/doc, type Example struct, Unordered bool pkg io, const SeekCurrent = 1 pkg io, const SeekCurrent ideal-int pkg io, const SeekEnd = 2 pkg io, const SeekEnd ideal-int pkg io, const SeekStart = 0 pkg io, const SeekStart ideal-int
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Jun 28 15:08:11 GMT 2016 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
Iterators.transform( predecessors().iterator(), (N predecessor) -> EndpointPair.ordered(predecessor, thisNode)), Iterators.transform( successors().iterator(), (N successor) -> EndpointPair.ordered(thisNode, successor))); } else { resultWithDoubleSelfLoop = Iterators.transform(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
guava/src/com/google/common/collect/Comparators.java
return Collector.of( () -> TopKSelector.<T>least(k, comparator), TopKSelector::offer, TopKSelector::combine, TopKSelector::topK, Collector.Characteristics.UNORDERED); } /** * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified * {@code Comparator}) input elements, in descending order, as an unmodifiable {@code List}. Ties
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/Comparators.java
return Collector.of( () -> TopKSelector.<T>least(k, comparator), TopKSelector::offer, TopKSelector::combine, TopKSelector::topK, Collector.Characteristics.UNORDERED); } /** * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified * {@code Comparator}) input elements, in descending order, as an unmodifiable {@code List}. Ties
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0)