- Sort Score
- Result 10 results
- Languages All
Results 41 - 43 of 43 for exists (0.13 sec)
-
android/guava/src/com/google/common/graph/Graphs.java
} } } return transitiveClosure.build(); } /** * Returns the set of nodes that are reachable from {@code node}. Node B is defined as reachable * from node A if there exists a path (a sequence of adjacent outgoing edges) starting at node A * and ending at node B. Note that a node is always reachable from itself via a zero-length path. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MultimapsCollectionTest.java
multimap.put(elements[i], i); } } /** * Implements {@code Multimap.put()} -- and no other methods -- for a {@code Map} by ignoring all * but the latest value for each key. This class exists only so that we can use {@link * MultimapsCollectionTest#populateMultimapForGet(Multimap, String[])} and similar methods to * populate a map to be passed to {@link Multimaps#forMap(Map)}. All tests should run against the
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 20:09:59 GMT 2024 - 29.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
* iterator containing two inner lists of three elements each, all in the original order. * * <p>The returned lists implement {@link java.util.RandomAccess}. * * @param iterator the iterator to return a partitioned view of * @param size the desired size of each partition * @return an iterator of immutable lists containing the elements of {@code iterator} divided into
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 51.1K bytes - Viewed (0)