- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 50 for Saxton (0.19 sec)
-
android/guava/src/com/google/common/graph/ForwardingGraph.java
import java.util.Set; /** * A class to allow {@link Graph} implementations to be backed by a {@link BaseGraph}. This is not * currently planned to be released as a general-purpose forwarding class. * * @author James Sexton */ @ElementTypesAreNonnullByDefault abstract class ForwardingGraph<N> extends AbstractGraph<N> { abstract BaseGraph<N> delegate(); @Override public Set<N> nodes() { return delegate().nodes();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
import java.util.Set; import javax.annotation.CheckForNull; /** * An interface for representing and manipulating an origin node's adjacent nodes and edge values in * a {@link Graph}. * * @author James Sexton * @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault interface GraphConnections<N, V> { Set<N> adjacentNodes(); Set<N> predecessors();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
* * <p>Time complexities for mutation methods are all O(1) except for {@code removeNode(N node)}, * which is in O(d_node) where d_node is the degree of {@code node}. * * @author James Sexton * @author Joshua O'Madadhain * @author Omar Darwish * @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractGraph.java
import javax.annotation.CheckForNull; /** * This class provides a skeletal implementation of {@link Graph}. It is recommended to extend this * class rather than implement {@link Graph} directly. * * @author James Sexton * @param <N> Node parameter type * @since 20.0 */ @Beta @ElementTypesAreNonnullByDefault public abstract class AbstractGraph<N> extends AbstractBaseGraph<N> implements Graph<N> { @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 1.8K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/util/concurrent/testing/AbstractListenableFutureTest.java
} /** Constructs a listenable future with a value available after the latch has counted down. */ protected abstract <V> ListenableFuture<V> createListenableFuture( V value, @Nullable Exception except, CountDownLatch waitOn); /** Tests that the {@link Future#get()} method blocks until a value is available. */ public void testGetBlocksUntilValueAvailable() throws Throwable { assertFalse(future.isDone());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 18:30:30 GMT 2023 - 6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingNetwork.java
/** * A class to allow {@link Network} implementations to be backed by a provided delegate. This is not * currently planned to be released as a general-purpose forwarding class. * * @author James Sexton * @author Joshua O'Madadhain */ @ElementTypesAreNonnullByDefault abstract class ForwardingNetwork<N, E> extends AbstractNetwork<N, E> { abstract Network<N, E> delegate(); @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
import java.util.Collections; import java.util.Map; import java.util.Set; import javax.annotation.CheckForNull; /** * A base implementation of {@link NetworkConnections} for directed networks. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault abstract class AbstractDirectedNetworkConnections<N, E> implements NetworkConnections<N, E> {
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/graph/AbstractValueGraph.java
* this class rather than implement {@link ValueGraph} directly. * * <p>The methods implemented in this class should not be overridden unless the subclass admits a * more efficient implementation. * * @author James Sexton * @param <N> Node parameter type * @param <V> Value parameter type * @since 20.0 */ @Beta @ElementTypesAreNonnullByDefault public abstract class AbstractValueGraph<N, V> extends AbstractBaseGraph<N>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
import java.util.Set; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A class to facilitate the set returned by {@link Graph#edges()}. * * @author James Sexton */ @ElementTypesAreNonnullByDefault abstract class EndpointPairIterator<N> extends AbstractIterator<EndpointPair<N>> { private final BaseGraph<N> graph; private final Iterator<N> nodeIterator; @CheckForNull
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/graph/DirectedMultiNetworkConnections.java
import java.util.Map; import java.util.Set; import javax.annotation.CheckForNull; /** * An implementation of {@link NetworkConnections} for directed networks with parallel edges. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault final class DirectedMultiNetworkConnections<N, E> extends AbstractDirectedNetworkConnections<N, E> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.6K bytes - Viewed (0)