- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 81 for structure (0.16 sec)
-
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) -
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/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) -
src/main/java/jcifs/internal/smb2/tree/Smb2TreeConnectResponse.java
int start = bufferIndex; int structureSize = SMBUtil.readInt2(buffer, bufferIndex); if ( structureSize != 16 ) { throw new SMBProtocolDecodingException("Structure size is not 16"); } this.shareType = buffer[ bufferIndex + 2 ]; bufferIndex += 4; this.shareFlags = SMBUtil.readInt4(buffer, bufferIndex); bufferIndex += 4;
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Mon May 23 14:35:20 GMT 2022 - 6.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MapIteratorCache.java
import java.util.Map.Entry; import java.util.Set; import javax.annotation.CheckForNull; /** * A map-like data structure that wraps a backing map and caches values while iterating through * {@link #unmodifiableKeySet()}. By design, the cache is cleared when this structure is mutated. If * this structure is never mutated, it provides a thread-safe view of the backing map. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
import com.google.errorprone.annotations.Immutable; import java.util.Comparator; import java.util.Map; import javax.annotation.CheckForNull; /** * Used to represent the order of elements in a data structure that supports different options for * iteration order guarantees. * * <p>Example usage: * * <pre>{@code * MutableGraph<Integer> graph =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 6.7K 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) -
src/main/java/jcifs/internal/smb2/tree/Smb2TreeDisconnectResponse.java
int structureSize = SMBUtil.readInt2(buffer, bufferIndex); if ( structureSize != 4 ) { throw new SMBProtocolDecodingException("Structure size != 4"); } return 4; }
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 1.9K 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)