- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 15 for Structures (0.18 sec)
-
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 May 05 03:35:11 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 May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2K 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 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/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 May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K 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) -
maven-core/src/main/java/org/apache/maven/lifecycle/MavenExecutionPlan.java
pre-calculated execution plan that stays the same during the execution. If deciding to add mutable state to this class, it should be at least considered to separate this into a separate mutable structure. */ private final List<ExecutionPlanItem> planItem; private final Map<String, ExecutionPlanItem> lastMojoExecutionForAllPhases; final List<String> phasesInExecutionPlan;
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Jan 10 12:55:54 GMT 2024 - 6.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java
*/ Set<Throwable> seenExceptionsLocal = seenExceptions; if (seenExceptionsLocal == null) { // TODO(cpovirk): Should we use a simpler (presumably cheaper) data structure? /* * Using weak references here could let us release exceptions earlier, but: * * 1. On Android, querying a WeakReference blocks if the GC is doing an otherwise-concurrent * pass.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 8.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/ClusterException.java
import com.google.common.annotations.GwtCompatible; import java.util.ArrayList; import java.util.Arrays; import java.util.Collection; import java.util.Collections; /** * An {@link ClusterException} is a data structure that allows for some code to "throw multiple * exceptions", or something close to it. The prototypical code that calls for this class is * presented below: * * <pre>
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/ArrayBasedUnicodeEscaper.java
* contains information about the named HTML entities such as {@code &} and {@code "} while * {@link #escapeUnsafe} is overridden to handle general escaping of the form {@code &#NNNNN;}. * * <p>The size of the data structure used by {@link ArrayBasedUnicodeEscaper} is proportional to the * highest valued code point that requires escaping. For example a replacement map containing the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/EvictingQueue.java
/** * A non-blocking queue which automatically evicts elements from the head of the queue when * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e., * cyclic buffer or ring buffer). * * <p>An evicting queue must be configured with a maximum size. Each time an element is added to a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri May 12 17:52:55 GMT 2023 - 4.6K bytes - Viewed (0)