- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for structure (0.24 sec)
-
android/guava/src/com/google/common/collect/TreeTraverser.java
}; } /** Returns the children of the specified node. Must not contain null. */ public abstract Iterable<T> children(T root); /** * Returns an unmodifiable iterable over the nodes in a tree structure, using pre-order traversal. * That is, each node's subtrees are traversed after the node itself is returned. * * <p>No guarantees are made about the behavior of the traversal when nodes change while iteration
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.2K 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) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* from uniform), and amortized since some operations can trigger a hash table resize. * * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@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) -
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) -
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) -
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)