- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 164 for James (0.15 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() {
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/AbstractGraphBuilder.java
*/ package com.google.common.graph; import com.google.common.base.Optional; /** * A base class for builders that construct graphs with user-defined properties. * * @author James Sexton */ @ElementTypesAreNonnullByDefault abstract class AbstractGraphBuilder<N> { final boolean directed; boolean allowsSelfLoops = false; ElementOrder<N> nodeOrder = ElementOrder.insertion();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 1.4K 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/EdgesConnecting.java
* * <p>The {@link #nodeToOutEdge} map means this class only works on networks without parallel edges. * See {@link MultiEdgesConnecting} for a class that works with parallel edges. * * @author James Sexton * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault final class EdgesConnecting<E> extends AbstractSet<E> { private final Map<?, E> nodeToOutEdge; private final Object targetNode;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphBuilder.java
* .<String>immutable() * .putEdge("bread", "bread") * .putEdge("chocolate", "peanut butter") * .putEdge("peanut butter", "jelly") * .build(); * }</pre> * * @author James Sexton * @author Joshua O'Madadhain * @param <N> The most general node type this builder will support. This is normally {@code Object} * unless it is constrained by using a method like {@link #nodeOrder}, or the builder is
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableGraph.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 * @param <N> Node parameter type */ @ElementTypesAreNonnullByDefault final class StandardMutableGraph<N> extends ForwardingGraph<N> implements MutableGraph<N> {
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/ImmutableGraph.java
* of the {@code Immutable*} types</a> for more information on the properties and guarantees * provided by this class. * * @author James Sexton * @author Joshua O'Madadhain * @author Omar Darwish * @author Jens Nyman * @param <N> Node parameter type * @since 20.0 */ @Beta @Immutable(containerOf = {"N"}) @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K 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)