- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 99 for insertion (0.16 sec)
-
guava/src/com/google/common/collect/HashBiMap.java
/** * A {@link BiMap} backed by two hash tables. This implementation allows null keys and values. A * {@code HashBiMap} and its inverse are both serializable. * * <p>This implementation guarantees insertion-based iteration order of its keys. * * <p>See the Guava User Guide article on <a href= * "https://github.com/google/guava/wiki/NewCollectionTypesExplained#bimap">{@code BiMap} </a>. * * @author Louis Wasserman
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
// type V, PRED (representing predecessor), or an instance of type V (representing successor). private final Map<N, Object> adjacentNodeValues; /** * All node connections in this graph, in edge insertion order. * * <p>Note: This field and {@link #adjacentNodeValues} cannot be combined into a single * LinkedHashMap because one target node may be mapped to both a predecessor and a successor. A
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
*/ public long approximateElementCount() { long bitSize = bits.bitSize(); long bitCount = bits.bitCount(); /** * Each insertion is expected to reduce the # of clear bits by a factor of * `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 - * numHashFunctions/bitSize)^n)`. Solving that for n, and approximating `ln x` as `x - 1` when x
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/Platform.java
/** * Returns the platform preferred map implementation that preserves insertion order when used only * for insertions. */ static <K, V> Map<K, V> preservesInsertionOrderOnPutsMap() { return Maps.newLinkedHashMap(); } /** * Returns the platform preferred set implementation that preserves insertion order when used only * for insertions. */ static <E> Set<E> preservesInsertionOrderOnAddsSet() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Jun 29 18:16:45 GMT 2023 - 4.7K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* specified access policy. * * @param capacity the capacity of this queue * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal, * are processed in FIFO order; if {@code false} the access order is unspecified. * @throws IllegalArgumentException if {@code capacity} is less than 1 */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
} /** * Populates the graph with nodes and edges in a star shape with node `1` in the middle. * * <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateTShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(1, 2); // Duplicate putEdge(4, 5); } // Element Mutation
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K 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,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* average, in the marking phase, not {@code 5.0} as in {@code java.util.HashSet}. * * <p>If there are no removals, then {@link #iterator iteration} order is the same as insertion * order. Any removal invalidates any ordering guarantees. * * <p>This class should not be assumed to be universally superior to {@code java.util.HashSet}.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
ImmutableCollection.Builder.expandedCapacity(dedupedElements.length, minCapacity); dedupedElements = Arrays.copyOf(dedupedElements, newCapacity); } } /** Adds e to the insertion-order array of deduplicated elements. Calls ensureCapacity. */ final void addDedupedElement(E e) { ensureCapacity(distinct + 1); dedupedElements[distinct++] = e; } /**
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.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 * </ul> * * <p>{@code Graph} explicitly does not support parallel edges, and forbids implementations or * extensions with parallel edges. If you need parallel edges, use {@link Network}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0)