- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 740 for order (0.15 sec)
-
guava-testlib/test/com/google/common/collect/testing/IteratorTesterTest.java
@Override protected Iterator<Integer> newTargetIterator() { return ImmutableList.of(1, 2).iterator(); } }; assertFailure(tester); } public void testUnknownOrder() { new IteratorTester<Integer>( 3, MODIFIABLE, newArrayList(1, 2), IteratorTester.KnownOrder.UNKNOWN_ORDER) { @Override
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 17 12:41:04 GMT 2023 - 10.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphBuilder.java
* user-defined properties. * * <p>A {@code Graph} built by this class has the following default properties: * * <ul> * <li>does not allow self-loops * <li>orders {@link Graph#nodes()} in the order in which the elements were added (insertion * order) * </ul> * * <p>{@code Graph}s built by this class also guarantee that each collection-returning accessor * returns a <b>(live) unmodifiable view</b>; see <a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* @since 2.0 */ @GwtCompatible @ElementTypesAreNonnullByDefault public abstract class Ordering<T extends @Nullable Object> implements Comparator<T> { // Natural order /** * Returns a serializable ordering that uses the natural order of the values. The ordering throws * a {@link NullPointerException} when passed a null parameter. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K 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 * node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMap.java
* were inserted into the builder, equivalently to {@code LinkedHashMap}. For example, in the * above example, {@code WORD_TO_INT.entrySet()} is guaranteed to iterate over the entries in the * order {@code "one"=1, "two"=2, "three"=3}, and {@code keySet()} and {@code values()} respect * the same order. If you want a different order, consider using {@link ImmutableSortedMap} to
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 44.1K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/TestIntegerSetGenerator.java
return new Integer[length]; } /** * {@inheritDoc} * * <p>By default, returns the supplied elements in their given order; however, generators for * 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
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/TestsForMapsInJavaUtil.java
MapFeature.ALLOWS_NULL_VALUES, MapFeature.FAILS_FAST_ON_CONCURRENT_MODIFICATION, MapFeature.RESTRICTS_KEYS, MapFeature.RESTRICTS_VALUES, CollectionFeature.KNOWN_ORDER, CollectionFeature.SUPPORTS_ITERATOR_REMOVE, CollectionFeature.SERIALIZABLE, CollectionSize.ANY) .suppressing(suppressForCheckedSortedMap()) .createTestSuite(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 17K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Stable order * <li>{@code inEdges(node)}: Edge insertion order * <li>{@code outEdges(node)}: Edge insertion order * <li>{@code adjacentEdges(edge)}: Stable order
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) -
guava-testlib/src/com/google/common/collect/testing/SortedMapTestSuiteBuilder.java
testers.add(SortedMapNavigationTester.class); return testers; } @Override public TestSuite createTestSuite() { if (!getFeatures().contains(KNOWN_ORDER)) { List<Feature<?>> features = Helpers.copyToList(getFeatures()); features.add(KNOWN_ORDER); withFeatures(features); } return super.createTestSuite(); } @Override protected List<TestSuite> createDerivedSuites(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* the order of a depth-first pre-order traversal. "Pre-order" implies that nodes appear in the * {@code Iterable} in the order in which they are first visited. * * <p><b>Example:</b> The following graph with {@code startNode} {@code a} would return nodes in * the order {@code abecfd} (assuming successors are returned in alphabetical order). * * <pre>{@code * b ---- a ---- d
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0)