- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 338 for Reachable (0.11 sec)
-
android/guava/src/com/google/common/graph/Traverser.java
} /** * Creates a new traverser for the given general {@code graph}. * * <p>Traversers created using this method are guaranteed to visit each node reachable from the * start node(s) at most once. * * <p>If you know that no node in {@code graph} is reachable by more than one path from the start * node(s), consider using {@link #forTree(SuccessorsFunction)} instead. * * <p><b>Performance notes</b> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Traverser.java
} /** * Creates a new traverser for the given general {@code graph}. * * <p>Traversers created using this method are guaranteed to visit each node reachable from the * start node(s) at most once. * * <p>If you know that no node in {@code graph} is reachable by more than one path from the start * node(s), consider using {@link #forTree(SuccessorsFunction)} instead. * * <p><b>Performance notes</b> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/tpu_cluster_util.cc
}); }); if (result.wasInterrupted()) return failure(); // Traverse ops that are reachable from some TPU cluster. // node_to_cluster is used to avoid traversing the same node twice, and to // check that no node is reachable from multiple TPU clusters. std::unordered_map<CallGraphNode*, tf_device::ClusterOp> node_to_cluster; while (!pending_call_nodes.empty()) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 06 04:50:13 UTC 2023 - 4.7K bytes - Viewed (0) -
pkg/apis/flowcontrol/internalbootstrap/default-internal.go
// reachable from this map. var MandatoryFlowSchemas = internalizeFSes(bootstrap.MandatoryFlowSchemas) // MandatoryPriorityLevelConfigurations holds the untyped renditions of the // mandatory priority level configuration objects. In this map the // key is the object's name and the value is the // `*PriorityLevelConfiguration`. Nobody should mutate anything // reachable from this map.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Oct 30 12:18:35 UTC 2023 - 2.5K bytes - Viewed (0) -
pkg/test/framework/components/istio/ingress.go
func (c *ingressImpl) Cluster() cluster.Cluster { return c.cluster } // HTTPAddresses returns the externally reachable HTTP hosts and port (80) of the component. func (c *ingressImpl) HTTPAddresses() ([]string, []int) { return c.AddressesForPort(80) } // TCPAddresses returns the externally reachable TCP hosts and port (31400) of the component. func (c *ingressImpl) TCPAddresses() ([]string, []int) {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Feb 29 17:13:34 UTC 2024 - 8K bytes - Viewed (0) -
releasenotes/notes/35884.yaml
area: traffic-management releaseNotes: - | **Updated** `WorkloadEntry` resources will be read across clusters and no longer need to be manually mirrored to other
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Nov 03 22:48:19 UTC 2021 - 335 bytes - Viewed (0) -
platforms/ide/tooling-api/src/main/java/org/gradle/tooling/internal/adapter/ViewBuilder.java
import javax.annotation.Nullable; public interface ViewBuilder<T> { /** * Mixes the given object into all views of the given type created using {@link #build(Object)}. * Applied to all views reachable from created views. The mix-in object should be serializable. * * When a given method cannot be found on the source object for a view, the mix-in object is searched for a compatible method.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Sep 26 14:49:20 UTC 2023 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
} return transitiveClosure.build(); } /** * Returns the set of nodes that are reachable from {@code node}. Node B is defined as reachable * from node A if there exists a path (a sequence of adjacent outgoing edges) starting at node A * and ending at node B. Note that a node is always reachable from itself via a zero-length path. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/graph_pruning.cc
// A graph has a single block which forms a DAG: operations that aren't // reachable from the `fetch` operands can be eliminated. llvm::SmallPtrSet<Operation*, 8> reachable_ops; llvm::SmallVector<Operation*, 8> ops_to_visit; // Visit fetches first to create a starting point for ops that are reachable. reachable_ops.insert(graph.GetFetch());
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Oct 05 23:50:19 UTC 2022 - 7.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/tpu_identity_pruning.mlir
tf_device.return %1#0, %1#1 : tensor<i32>, tensor<f32> }) : () -> (tensor<i32>, tensor<f32>) func.return } // Tests transitive Identity ops reachable from the cluster are pruned away. // CHECK-LABEL: func @testTransitiveIdentity // CHECK-SAME: ([[ARG0:%.*]]: tensor<i32>) func.func @testTransitiveIdentity(%arg0: tensor<i32>) { // CHECK: "tf_device.cluster"
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Mar 28 12:06:33 UTC 2022 - 3.5K bytes - Viewed (0)