- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 167 for sortBy (0.34 sec)
-
guava/src/com/google/common/collect/Sets.java
int expectedSize) { return new LinkedHashSet<>(Maps.capacity(expectedSize)); } // TreeSet /** * Creates a <i>mutable</i>, empty {@code TreeSet} instance sorted by the natural sort ordering of * its elements. * * <p><b>Note:</b> if mutability is not required, use {@link ImmutableSortedSet#of()} instead. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 78.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java
static void testSort(byte[] input, byte[] expected) { input = Arrays.copyOf(input, input.length); UnsignedBytes.sort(input); assertThat(input).isEqualTo(expected); } static void testSort(byte[] input, int from, int to, byte[] expected) { input = Arrays.copyOf(input, input.length); UnsignedBytes.sort(input, from, to); assertThat(input).isEqualTo(expected); } public void testSortIndexed() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 13.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Tables.java
return Collections.unmodifiableCollection(super.values()); } private static final long serialVersionUID = 0; } /** * Returns an unmodifiable view of the specified row-sorted table. This method allows modules to * provide users with "read-only" access to internal tables. Query operations on the returned * table "read through" to the specified table, and attempts to modify the returned table, whether
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 04 22:45:41 UTC 2024 - 26.3K 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,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 15K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/ArbitraryInstances.java
return arbitraryConstantInstanceOrNull(type); } } private static <T> @Nullable T arbitraryConstantInstanceOrNull(Class<T> type) { Field[] fields = type.getDeclaredFields(); Arrays.sort(fields, BY_FIELD_NAME); for (Field field : fields) { if (Modifier.isPublic(field.getModifiers()) && Modifier.isStatic(field.getModifiers()) && Modifier.isFinal(field.getModifiers())) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 17 16:33:44 UTC 2024 - 20.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
Comparator<? super E> comparator, Collection<? extends E> elements) { return copyOf(comparator, (Iterable<? extends E>) elements); } /** * Returns an immutable sorted set containing the elements of a sorted set, sorted by the same * {@code Comparator}. That behavior differs from {@link #copyOf(Iterable)}, which always uses the * natural ordering of the elements. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 08 03:01:02 UTC 2024 - 38.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
if (k == 0 || !iterator.hasNext()) { return Collections.emptyList(); } else if (k >= Integer.MAX_VALUE / 2) { // k is really large; just do a straightforward sorted-copy-and-sublist ArrayList<E> list = Lists.newArrayList(iterator); Collections.sort(list, this); if (list.size() > k) { list.subList(k, list.size()).clear(); } list.trimToSize();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
return "UnsignedLongs.lexicographicalComparator()"; } } /** * Sorts the array, treating its elements as unsigned 64-bit integers. * * @since 23.1 */ public static void sort(long[] array) { checkNotNull(array); sort(array, 0, array.length); } /** * Sorts the array between {@code fromIndex} inclusive and {@code toIndex} exclusive, treating its
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 17.6K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/TestEnumMultisetGenerator.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 1.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeBasedTable.java
* quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer, * since an iteration across all row keys occurs. * * <p>Because a {@code TreeBasedTable} has unique sorted values for a given row, both {@code * row(rowKey)} and {@code rowMap().get(rowKey)} are {@link SortedMap} instances, instead of the * {@link Map} specified in the {@link Table} interface. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 11.4K bytes - Viewed (0)