- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 197 for Hedger (2.19 sec)
-
android/guava/src/com/google/common/graph/NetworkConnections.java
* * <p>In the undirected case, returns {@code null} if {@code isSelfLoop} is true. */ @CanIgnoreReturnValue @CheckForNull N removeInEdge(E edge, boolean isSelfLoop); /** Remove {@code edge} from the set of outgoing edges. Returns the former successor node. */ @CanIgnoreReturnValue N removeOutEdge(E edge); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
tensorflow/c/eager/abstract_op_attrs.h
See the License for the specific language governing permissions and limitations under the License. ==============================================================================*/ #ifndef TENSORFLOW_C_EAGER_ABSTRACT_OP_ATTRS_H_ #define TENSORFLOW_C_EAGER_ABSTRACT_OP_ATTRS_H_ #include "absl/container/inlined_vector.h" #include "tensorflow/core/framework/attr_value.pb.h" #include "tensorflow/core/framework/types.pb.h"
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Wed May 26 22:20:27 GMT 2021 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MultiEdgesConnecting.java
import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #outEdgeToNode} map allows this class to work on networks with parallel edges. See * {@link EdgesConnecting} for a class that is more efficient but forbids parallel edges. * * @author James Sexton * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 2.2K bytes - Viewed (0) -
tensorflow/c/eager/abstract_tensor_handle.h
See the License for the specific language governing permissions and limitations under the License. ==============================================================================*/ #ifndef TENSORFLOW_C_EAGER_ABSTRACT_TENSOR_HANDLE_H_ #define TENSORFLOW_C_EAGER_ABSTRACT_TENSOR_HANDLE_H_ #include <memory> #include "tensorflow/core/framework/full_type.pb.h" #include "tensorflow/core/framework/tensor_shape.h"
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Fri Mar 03 00:30:36 GMT 2023 - 3K bytes - Viewed (0) -
tensorflow/c/eager/immediate_execution_operation.h
==============================================================================*/ #ifndef TENSORFLOW_C_EAGER_IMMEDIATE_EXECUTION_OPERATION_H_ #define TENSORFLOW_C_EAGER_IMMEDIATE_EXECUTION_OPERATION_H_ #include <memory> #include "absl/types/optional.h" #include "absl/types/span.h" #include "tensorflow/c/eager/abstract_operation.h" #include "tensorflow/c/eager/immediate_execution_tensor_handle.h" #include "tensorflow/c/tensor_interface.h"
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Sep 26 22:40:32 GMT 2022 - 3.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
ArrayList<Object> edgeList = new ArrayList<>(network.edges()); assertThat(network.nodes()).hasSize(NUM_NODES); assertThat(network.edges()).hasSize(NUM_EDGES); AbstractNetworkTest.validateNetwork(network); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { Object edge = edgeList.get(i);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EdgesConnecting.java
import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <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
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/AbstractValueGraph.java
+ nodes() + ", edges: " + edgeValueMap(this); } private static <N, V> Map<EndpointPair<N>, V> edgeValueMap(final ValueGraph<N, V> graph) { return Maps.asMap( graph.edges(), edge -> // requireNonNull is safe because the endpoint pair comes from the graph. requireNonNull(graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null))); }
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/UndirectedMultiNetworkConnections.java
} }; } @Override @CheckForNull public N removeInEdge(E edge, boolean isSelfLoop) { if (!isSelfLoop) { return removeOutEdge(edge); } return null; } @Override public N removeOutEdge(E edge) { N node = super.removeOutEdge(edge); Multiset<N> adjacentNodes = getReference(adjacentNodesReference); if (adjacentNodes != null) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingNetwork.java
public Set<E> outEdges(N node) { return delegate().outEdges(node); } @Override public EndpointPair<N> incidentNodes(E edge) { return delegate().incidentNodes(edge); } @Override public Set<E> adjacentEdges(E edge) { return delegate().adjacentEdges(edge); } @Override public int degree(N node) { return delegate().degree(node); } @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)