- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 502 for zOrder (0.14 sec)
-
android/guava-tests/test/com/google/common/collect/Collections2Test.java
.withFeatures( CollectionFeature.SUPPORTS_ADD, CollectionFeature.SUPPORTS_REMOVE, CollectionFeature.ALLOWS_NULL_VALUES, CollectionFeature.KNOWN_ORDER, CollectionSize.ANY) .createTestSuite(); } @J2ktIncompatible @GwtIncompatible // suite private static Test testsForFilterAll() { return CollectionTestSuiteBuilder.using(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 19.7K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/Helpers.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 17.7K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/IteratorTester.java
import java.util.Iterator; import org.checkerframework.checker.nullness.qual.Nullable; /** * A utility for testing an Iterator implementation by comparing its behavior to that of a "known * good" reference implementation. In order to accomplish this, it's important to test a great * variety of sequences of the {@link Iterator#next}, {@link Iterator#hasNext} and {@link * Iterator#remove} operations. This utility takes the brute-force approach of trying <i>all</i>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. * * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
return ((Integer) object) % 5; // fake tons of collisions! } }; // Don't let the elements be in such a predictable order list = shuffledCopy(list, new Random(1)); Collections.sort(list, arbitrary); // Now we don't care what order it's put the list in, only that // comparing any pair of elements gives the answer we expect. Helpers.testComparator(arbitrary, list); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
return ((Integer) object) % 5; // fake tons of collisions! } }; // Don't let the elements be in such a predictable order list = shuffledCopy(list, new Random(1)); Collections.sort(list, arbitrary); // Now we don't care what order it's put the list in, only that // comparing any pair of elements gives the answer we expect. Helpers.testComparator(arbitrary, list); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeMultisetTest.java
} @Override public List<String> order(List<String> insertionOrder) { return Ordering.natural().sortedCopy(insertionOrder); } }) .withFeatures( CollectionSize.ANY, CollectionFeature.KNOWN_ORDER, CollectionFeature.GENERAL_PURPOSE, CollectionFeature.SERIALIZABLE,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 12.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/service/SearchLogService.java
op.calendarInterval(DateHistogramInterval.HOUR); op.minDocCount(0); op.order(BucketOrder.key(true)); }, null); }); final Histogram agg = list.getAggregations().get(SearchLogPager.LOG_TYPE_SEARCH_COUNT_HOUR);
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 28.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
putEdge(N1, N1); assertThat(graph.outDegree(N1)).isEqualTo(1); putEdge(N1, N2); assertThat(graph.outDegree(N1)).isEqualTo(2); } // Stable order tests // Note: Stable order means that the ordering doesn't change between iterations and versions. // Ideally, the ordering in test should never be updated. @Test public void stableIncidentEdgeOrder_edges_returnsInStableOrder() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
@Override public String toString() { return "Floats.lexicographicalComparator()"; } } /** * Sorts the elements of {@code array} in descending order. * * <p>Note that this method uses the total order imposed by {@link Float#compare}, which treats * all NaN values as equal and 0.0 as greater than -0.0. * * @since 23.1 */ public static void sortDescending(float[] array) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 25.2K bytes - Viewed (0)