- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 82 for accessors (4.07 sec)
-
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* * <pre>{@code * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.mother(), node.father())); * }</pre> * * <p>Graph algorithms that need additional capabilities (accessing both predecessors and * successors, iterating over the edges, etc.) should declare their input to be of a type that * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}. * * <h3>Additional documentation</h3> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* contention levels will recur, so the cells will eventually be * needed again; and for short-lived ones, it does not matter. */ /** * Padded variant of AtomicLong supporting only raw accesses plus CAS. The value field is placed * between pads, hoping that the JVM doesn't reorder them. * * <p>JVM intrinsics note: It would be possible to use a release-only form of CAS here, if it were * provided. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/StandardTable.java
StandardTable(Map<R, Map<C, V>> backingMap, Supplier<? extends Map<C, V>> factory) { this.backingMap = backingMap; this.factory = factory; } // Accessors @Override public boolean contains(@CheckForNull Object rowKey, @CheckForNull Object columnKey) { return rowKey != null && columnKey != null && super.contains(rowKey, columnKey); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 29.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
*/ @GwtIncompatible // not worth using in GWT for now @ElementTypesAreNonnullByDefault class CompactHashSet<E extends @Nullable Object> extends AbstractSet<E> implements Serializable { // TODO(user): cache all field accesses in local vars /** Creates an empty {@code CompactHashSet} instance. */ public static <E extends @Nullable Object> CompactHashSet<E> create() { return new CompactHashSet<>(); } /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractCollectionTester.java
@ElementTypesAreNonnullByDefault public abstract class AbstractCollectionTester<E extends @Nullable Object> extends AbstractContainerTester<Collection<E>, E> { // TODO: replace this with an accessor. protected Collection<E> collection; @Override protected Collection<E> actualContents() { return collection; } // TODO: dispose of this once collection is encapsulated. @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 2.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
* and updates {@link #successorIterator} to iterate through the successors of {@link #node}. */ final boolean advance() { checkState(!successorIterator.hasNext()); if (!nodeIterator.hasNext()) { return false; } node = nodeIterator.next(); successorIterator = graph.successors(node).iterator(); return true; } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/Parameter.java
* the Android flavor of Guava). The field is declared with a type of {@code Object} to avoid * compatibility problems on Android VMs. The corresponding accessor method, however, can have the * more specific return type as long as users are careful to guard calls to it with version checks * or reflection: Android VMs ignore the types of elements that aren't used. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Nov 16 15:12:31 GMT 2023 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
int expectedSize) { return new CompactLinkedHashSet<>(expectedSize); } private static final int ENDPOINT = -2; // TODO(user): predecessors and successors should be collocated (reducing cache misses). // Might also explore collocating all of [hash, next, predecessor, successor] fields of an
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) -
android/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
checkState(selfLoopCount <= inEdgeMap.size() && selfLoopCount <= outEdgeMap.size()); } @Override public Set<N> adjacentNodes() { return Sets.union(predecessors(), successors()); } @Override public Set<E> incidentEdges() { return new AbstractSet<E>() { @Override public UnmodifiableIterator<E> iterator() { Iterable<E> incidentEdges =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* higher than performing just the operation without enforcing the capacity constraint. * * This implementation uses a per-segment queue to record a memento of the additions, removals, * and accesses that were performed on the map. The queue is drained on writes and when it exceeds * its capacity threshold. * * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0)