- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 28 for structure (0.23 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) -
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/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) -
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) -
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) -
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) -
android/guava/src/com/google/common/graph/MapRetrievalCache.java
import java.util.Map; import javax.annotation.CheckForNull; /** * A {@link MapIteratorCache} that adds additional caching. In addition to the caching provided by * {@link MapIteratorCache}, this structure caches values for the two most recently retrieved keys. * * @author James Sexton */ @ElementTypesAreNonnullByDefault final class MapRetrievalCache<K, V> extends MapIteratorCache<K, V> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.2K bytes - Viewed (0) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 17:52:55 GMT 2023 - 4.6K bytes - Viewed (0)