- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 75 for Structures (0.32 sec)
-
android/guava/src/com/google/common/hash/package-info.java
* or implied. See the License for the specific language governing permissions and limitations under * the License. */ // TODO(user): when things stabilize, flesh this out /** * Hash functions and related structures. * * <p>See the Guava User Guide article on <a * href="https://github.com/google/guava/wiki/HashingExplained">hashing</a>. */ @CheckReturnValue @ParametersAreNonnullByDefault package com.google.common.hash;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 1021 bytes - Viewed (0) -
api/maven-api-xml/src/main/java/org/apache/maven/api/xml/XmlNode.java
String SELF_COMBINATION_MERGE = "merge"; String SELF_COMBINATION_REMOVE = "remove"; /** * In case of complex XML structures, combining can be done based on id. */ String ID_COMBINATION_MODE_ATTRIBUTE = "combine.id"; /** * In case of complex XML structures, combining can be done based on keys. * This is a comma separated list of attribute names. */
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Mon Nov 27 23:11:34 GMT 2023 - 4.3K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/MetadataGraph.java
import java.util.ArrayList; import java.util.Collection; /** * This is the main graph data structure used by the RepositorySystem to present tree and graph objects. * * */ @Deprecated public class MetadataGraph { /** all graph nodes */ Collection<MetadataGraphNode> nodes; /** entry point for tree-like structures */ MetadataGraphNode entry; public MetadataGraph(MetadataGraphNode entry) {
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
return set; } /** * Creates a {@code CompactLinkedHashSet} 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 CompactLinkedHashSet} with enough capacity to hold {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/ArrayBasedEscaperMap.java
* underlying (implementation specific) data structures to be shared. * * <p>The size of the data structure used by ArrayBasedCharEscaper and ArrayBasedUnicodeEscaper is * proportional to the highest valued character that has a replacement. For example a replacement * map containing the single character '{@literal \}u1000' will require approximately 16K of memory.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jan 18 20:55:09 GMT 2022 - 3.2K bytes - Viewed (0) -
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 Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/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 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K 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) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
return set; } /** * Creates a {@code CompactLinkedHashSet} 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 CompactLinkedHashSet} with enough capacity to hold {@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K 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)