- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 26 for elementOrder (0.08 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/graph/ElementOrder.java
* </ul> * </ul> * * @since 29.0 */ public static <S> ElementOrder<S> stable() { return new ElementOrder<>(Type.STABLE, null); } /** Returns an instance which specifies that insertion ordering is guaranteed. */ public static <S> ElementOrder<S> insertion() { return new ElementOrder<>(Type.INSERTION, null); } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 6.5K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/GraphBuilder.java
checkArgument( incidentEdgeOrder.type() == ElementOrder.Type.UNORDERED || incidentEdgeOrder.type() == ElementOrder.Type.STABLE, "The given elementOrder (%s) is unsupported. incidentEdgeOrder() only supports" + " ElementOrder.unordered() and ElementOrder.stable().", incidentEdgeOrder); GraphBuilder<N1> newBuilder = cast();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Apr 02 14:49:41 GMT 2026 - 7.2K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/LexicographicalOrdering.java
@GwtCompatible final class LexicographicalOrdering<T extends @Nullable Object> extends Ordering<Iterable<T>> implements Serializable { final Comparator<? super T> elementOrder; LexicographicalOrdering(Comparator<? super T> elementOrder) { this.elementOrder = elementOrder; } @Override public int compare(Iterable<T> leftIterable, Iterable<T> rightIterable) { Iterator<T> left = leftIterable.iterator();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Jun 04 13:03:16 GMT 2025 - 2.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/LexicographicalOrdering.java
@GwtCompatible final class LexicographicalOrdering<T extends @Nullable Object> extends Ordering<Iterable<T>> implements Serializable { final Comparator<? super T> elementOrder; LexicographicalOrdering(Comparator<? super T> elementOrder) { this.elementOrder = elementOrder; } @Override public int compare(Iterable<T> leftIterable, Iterable<T> rightIterable) { Iterator<T> left = leftIterable.iterator();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Jun 04 13:03:16 GMT 2025 - 2.4K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/AbstractGraphBuilder.java
* * @author James Sexton */ abstract class AbstractGraphBuilder<N> { final boolean directed; boolean allowsSelfLoops = false; ElementOrder<N> nodeOrder = ElementOrder.insertion(); ElementOrder<N> incidentEdgeOrder = ElementOrder.unordered(); @Nullable Integer expectedNodeCount = null; /** * Creates a new instance with the specified edge directionality. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Apr 02 14:49:41 GMT 2026 - 1.4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java
NetworkBuilder.directed() .allowsSelfLoops(true) .nodeOrder(ElementOrder.<String>natural()) .<String, Integer>immutable() .build(); assertThat(emptyNetwork.isDirected()).isTrue(); assertThat(emptyNetwork.allowsSelfLoops()).isTrue(); assertThat(emptyNetwork.nodeOrder()).isEqualTo(ElementOrder.<String>natural()); } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 5.4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/ImmutableValueGraphTest.java
assertThat(immutableValueGraph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); } @Test public void incidentEdgeOrder_fromUnorderedGraph_stable() { ImmutableValueGraph<String, Integer> immutableValueGraph = ImmutableValueGraph.copyOf( ValueGraphBuilder.directed() .incidentEdgeOrder(ElementOrder.unordered()) .<String, Integer>build());Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 6.4K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java
NetworkBuilder.directed() .allowsSelfLoops(true) .nodeOrder(ElementOrder.<String>natural()) .<String, Integer>immutable() .build(); assertThat(emptyNetwork.isDirected()).isTrue(); assertThat(emptyNetwork.allowsSelfLoops()).isTrue(); assertThat(emptyNetwork.nodeOrder()).isEqualTo(ElementOrder.<String>natural()); } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 5.4K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
Set<EndpointPair<N>> edges(); /** * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link * #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ ElementOrder<N> incidentEdgeOrder(); /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Nov 11 17:11:16 GMT 2025 - 2.9K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
public boolean allowsSelfLoops() { return AbstractValueGraph.this.allowsSelfLoops(); } @Override public ElementOrder<N> nodeOrder() { return AbstractValueGraph.this.nodeOrder(); } @Override public ElementOrder<N> incidentEdgeOrder() { return AbstractValueGraph.this.incidentEdgeOrder(); } @Override
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 4K bytes - Click Count (0)