- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 22 for uniqBy (0.26 sec)
-
android/guava/src/com/google/common/graph/ValueGraph.java
import java.util.Set; import javax.annotation.CheckForNull; /** * An interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data, * whose edges have associated non-unique values. * * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. * * <p>There are three primary interfaces provided to represent graphs. In order of increasing
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/FreshValueGenerator.java
freshness.incrementAndGet(); return proxy; } /** * Generates an instance for {@code type} using the current {@link #freshness}. The generated * instance may or may not be unique across different calls. */ private @Nullable Object generate(TypeToken<?> type) { Class<?> rawType = type.getRawType(); List<Object> samples = sampleInstances.get(rawType);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 28.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/IterablesTest.java
} iterables.add(Ordering.<Integer>natural().sortedCopy(list)); } verifyMergeSorted(iterables, allIntegers); } // Like the pyramid, but creates more unique values, along with repeated ones. public void testMergeSorted_skipping_pyramid() { List<Iterable<Integer>> iterables = Lists.newLinkedList(); List<Integer> allIntegers = Lists.newArrayList();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* * @param set the set of elements to construct a power set from * @return the power set, as an immutable set of immutable sets * @throws IllegalArgumentException if {@code set} has more than 30 unique elements (causing the * power set size to exceed the {@code int} range) * @throws NullPointerException if {@code set} is or contains {@code null}
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/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. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 11.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Cut.java
import java.io.Serializable; import java.util.NoSuchElementException; import javax.annotation.CheckForNull; /** * Implementation detail for the internal structure of {@link Range} instances. Represents a unique * way of "cutting" a "number line" (actually of instances of type {@code C}, not necessarily * "numbers") into two sections; this can be done below a certain value, above a certain value,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 12.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/IterablesTest.java
} iterables.add(Ordering.<Integer>natural().sortedCopy(list)); } verifyMergeSorted(iterables, allIntegers); } // Like the pyramid, but creates more unique values, along with repeated ones. public void testMergeSorted_skipping_pyramid() { List<Iterable<Integer>> iterables = Lists.newLinkedList(); List<Integer> allIntegers = Lists.newArrayList();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 46K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
import java.util.Set; import javax.annotation.CheckForNull; /** * An interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data, * whose edges are unique objects. * * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. * * <p>There are three primary interfaces provided to represent graphs. In order of increasing
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableSortedSet.java
this.sortedDelegate = Collections.unmodifiableSortedSet(sortedDelegate); } public Comparator<? super E> comparator() { return sortedDelegate.comparator(); } @Override // needed to unify SortedIterable and Collection iterator() methods public UnmodifiableIterator<E> iterator() { return super.iterator(); } @Override public Object[] toArray() { /*
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 15.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSet.java
} /** * Constructs an {@code ImmutableSet} from the first {@code n} elements of the specified array. If * {@code k} is the size of the returned {@code ImmutableSet}, then the unique elements of {@code * elements} will be in the first {@code k} positions, and {@code elements[i] == null} for {@code * k <= i < n}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.6K bytes - Viewed (0)