- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 44 for structure (0.27 sec)
-
android/guava-tests/test/com/google/common/collect/ListsImplTest.java
public class ListsImplTest extends TestCase { /** Describes how a list is modifiable */ public enum Modifiability { NONE, // immutable lists BY_ELEMENT, // elements can change (set), but not structure DIRECT_ONLY, // Element can be added and removed only via direct calls, not through iterators ALL // Elements can be added and removed as well as modified. }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 16:35:21 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* any other start node, such as a tree or forest. * * <p>{@code forTree()} is especially useful (versus {@code forGraph()}) in cases where the data * structure being traversed is, in addition to being a tree/forest, also defined <a * href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursively</a>.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K 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) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* * (The index actually stored is the index of the key in alternatingKeysAndValues, which is * double the index of the entry in entrySet.asList.) * * The basic data structure is described in https://en.wikipedia.org/wiki/Open_addressing. * The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length],
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Cut.java
import com.google.common.primitives.Booleans; import java.io.Serializable; import java.util.NoSuchElementException; import javax.annotation.CheckForNull; /** * Implementation detail for the internal structure of {@link Range} instances. Represents a unique * way of "cutting" a "number line" (actually of instances of type {@code C}, not necessarily
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 12.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/MoreFilesTest.java
} } /** * Creates a new file system for testing that supports the given features in addition to * supporting symbolic links. The file system is created initially having the following file * structure: * * <pre> * / * work/ * dir/ * a * b/ * g * h -> ../a * i/
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 29 22:57:05 GMT 2024 - 27.2K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/ClassSanityTester.java
return createInstance(factory, tentativeArgs).hashCode() == createInstance(factory, args).hashCode(); } // distinctValues is a type-safe class-values mapping, but we don't have a type-safe data // structure to hold the mappings. @SuppressWarnings({"unchecked", "rawtypes"}) private FreshValueGenerator newFreshValueGenerator() { FreshValueGenerator generator = new FreshValueGenerator() { @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 08 17:31:55 GMT 2024 - 33K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
* which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure places significantly reduced load on the garbage * collector by only using a constant number of internal objects. * * <p>If there are no removals, then iteration order for the {@link #entrySet}, {@link #keySet}, and
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
* very compact {@code Striped<Lock>} of {@code availableProcessors() * 4} stripes, instead of * possibly thousands of locks which could be created in a {@code Map<K, Lock>} structure. * * @author Dimitris Andreou * @since 13.0 */ @J2ktIncompatible @GwtIncompatible @ElementTypesAreNonnullByDefault public abstract class Striped<L> { /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1)