- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 99 for insertion (0.18 sec)
-
android/guava-tests/test/com/google/common/graph/ElementOrderTest.java
} @Test public void nodeOrder_insertion() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(insertion()).build(); addNodes(graph); assertThat(graph.nodeOrder()).isEqualTo(insertion()); assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); } // The default ordering is INSERTION unless otherwise specified. @Test public void nodeOrder_default() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkBuilder.java
return this; } /** * Specifies the order of iteration for the elements of {@link Network#nodes()}. * * <p>The default value is {@link ElementOrder#insertion() insertion order}. */ public <N1 extends N> NetworkBuilder<N1, E> nodeOrder(ElementOrder<N1> nodeOrder) { NetworkBuilder<N1, E> newBuilder = cast(); newBuilder.nodeOrder = checkNotNull(nodeOrder);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.4K 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 * node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */
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-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableCollection.java
} } /** If this collection is backed by an array of its elements in insertion order, returns it. */ Object @Nullable [] internalArray() { return null; } /** * If this collection is backed by an array of its elements in insertion order, returns the offset * where this collection's elements start. */ int internalArrayStart() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jan 23 18:43:40 GMT 2024 - 5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
} @Test public void nodeOrder_insertion() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(insertion()).build(); addNodes(graph); assertThat(graph.nodeOrder()).isEqualTo(insertion()); assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); } // The default ordering is INSERTION unless otherwise specified. @Test public void nodeOrder_default() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code edges()}: Stable order * <li>{@code adjacentNodes(node)}: Connecting edge insertion order * <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Edge insertion order * </ul> * <li>For {@link Network}: * <ul>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 6.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
/** The "entry" of the first element in insertion order. */ private transient int firstInInsertionOrder; /** The "entry" of the last element in insertion order. */ private transient int lastInInsertionOrder; /** Maps an "entry" to the "entry" that precedes it in insertion order. */ private transient int[] prevInInsertionOrder; /** Maps an "entry" to the "entry" that follows it in insertion order. */
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) -
guava-testlib/src/com/google/common/collect/testing/TestStringSetGenerator.java
* containers with a known order other than insertion order must override this method. * * <p>Note: This default implementation is overkill (but valid) for an unordered container. An * equally valid implementation for an unordered container is to throw an exception. The chosen * implementation, however, has the advantage of working for insertion-ordered containers, as * well. */ @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 2.1K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/TestIntegerSetGenerator.java
* containers with a known order other than insertion order must override this method. * * <p>Note: This default implementation is overkill (but valid) for an unordered container. An * equally valid implementation for an unordered container is to throw an exception. The chosen * implementation, however, has the advantage of working for insertion-ordered containers, as * well. */ @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 2.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Platform.java
* table. */ static <E extends @Nullable Object> Set<E> newLinkedHashSetWithExpectedSize(int expectedSize) { return CompactLinkedHashSet.createWithExpectedSize(expectedSize); } /** * Returns the platform preferred map implementation that preserves insertion order when used only * for insertions. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 4.9K bytes - Viewed (0)