- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 31 for Structures (0.38 sec)
-
android/guava/src/com/google/common/collect/HashBiMap.java
Arrays.fill(result, oldSize, newSize, ABSENT); return result; } @Override public int size() { return size; } /** * Ensures that all of the internal structures in the HashBiMap are ready for this many elements. */ private void ensureCapacity(int minCapacity) { if (nextInBucketKToV.length < minCapacity) { int oldCapacity = nextInBucketKToV.length;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
*/ abstract SetBuilderImpl<E> copy(); /** * Call this before build(). Does a final check on the internal data structures, e.g. shrinking * unnecessarily large structures or detecting previously unnoticed hash flooding. */ SetBuilderImpl<E> review() { return this; } abstract ImmutableSet<E> build(); }
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) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
} /** * Creates a {@code CompactLinkedHashMap} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactLinkedHashMap} with enough capacity to hold {@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultiset.java
Builder(int estimatedDistinct) { this.contents = ObjectCountHashMap.createWithExpectedSize(estimatedDistinct); } Builder(boolean forSubtype) { // for ImmutableSortedMultiset not to allocate data structures not used there this.contents = null; } /** * Adds {@code element} to the {@code ImmutableMultiset}. * * @param element the element to add
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) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
/** * Returns an estimate of the number of threads waiting to enter this monitor. The value is only * an estimate because the number of threads may change dynamically while this method traverses * internal data structures. This method is designed for use in monitoring of the system state, * not for synchronization control. */ public int getQueueLength() { return lock.getQueueLength(); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al. * Unlike many other double-ended priority queues, it stores elements in a single array, as compact * as the traditional heap data structure used in {@link PriorityQueue}. * * <p>This class is not thread-safe, and does not accept null elements. * * <p><i>Performance notes:</i> * * <ul>
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* any other start node, such as a tree or forest. * * <p>{@code forTree()} is especially useful (versus {@code forGraph()}) in cases where the data * structure being traversed is, in addition to being a tree/forest, also defined <a * href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursively</a>.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
import com.google.common.annotations.Beta; 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. *
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-tests/test/com/google/common/io/MoreFilesTest.java
} } /** * Creates a new file system for testing that supports the given features in addition to * supporting symbolic links. The file system is created initially having the following file * structure: * * <pre> * / * work/ * dir/ * a * b/ * g * h -> ../a * i/
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 29 22:57:05 GMT 2024 - 27.2K bytes - Viewed (0)