- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for maintainers (0.45 sec)
-
android/guava/src/com/google/common/collect/ObjectArrays.java
* returns the elements in the order they are returned by the collection's iterator. The returned * array is "safe" in that no references to it are maintained by the collection. The caller is * thus free to modify the returned array. * * <p>This method assumes that the collection size doesn't change while the method is running. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 12 15:59:22 GMT 2023 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
import java.util.Map; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order, * maintained with a doubly linked list through the entries. All optional operations (put and * remove) are supported. Null keys and values are supported. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
import java.util.TreeMap; import javax.annotation.CheckForNull; /** * Standard implementation of {@link ValueGraph} that supports the options supplied by {@link * AbstractGraphBuilder}. * * <p>This class maintains a map of nodes to {@link GraphConnections}. * * <p>Collection-returning accessors return unmodifiable views: the view returned will reflect * changes to the graph (if the graph is mutable) but may not be modified by the user.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
import java.util.Set; import java.util.TreeMap; /** * Standard implementation of {@link Network} that supports the options supplied by {@link * NetworkBuilder}. * * <p>This class maintains a map of nodes to {@link NetworkConnections}. This class also maintains a * map of edges to reference nodes. The reference node is defined to be the edge's source node on * directed graphs, and an arbitrary endpoint of the edge on undirected graphs. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0)