Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 52 for outEdges (0.24 sec)

  1. docs/debugging/README.md

    Example:
    
    ```sh
    minio server /data{1...4}
    ```
    
    The command takes no flags
    
    ```sh
    mc support diagnostics myminio/
    ```
    
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Fri Feb 25 01:17:53 UTC 2022
    - 8.7K bytes
    - Viewed (0)
  2. tensorflow/cc/framework/gradients.cc

      // output nodes, and thus our stop backprop nodes.
      while (!queue.empty()) {
        std::pair<Node*, Node*> p = queue.front();
        Node* n = p.first;
        queue.pop_front();
        for (const Edge* e : n->out_edges()) {
          // If a node is not reachable from outputs_, we can stop.
          if (e->IsControlEdge() || !reachable_nodes[e->dst()->id()]) continue;
    
          auto const& pair = visited.insert(e->dst());
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Sat Apr 13 05:57:22 UTC 2024
    - 22K bytes
    - Viewed (0)
  3. tensorflow/compiler/jit/increase_dynamism_for_auto_jit_pass.cc

                                                     Node* static_shaped_slice) {
      absl::InlinedVector<const Edge*, 6> edges_to_remove;
      std::vector<const Edge*> slice_out_edges;
      absl::c_copy(slice->out_edges(), std::back_inserter(slice_out_edges));
      for (const Edge* e : slice_out_edges) {
        DCHECK(e->src_output() == 0 || e->src_output() == Graph::kControlSlot);
    
        int src_output = e->src_output();
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 13.8K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/graph/DirectedGraphConnections.java

            }
    
            orderedNodeConnectionsBuilder.add(new NodeConnection.Pred<>(predecessor));
            predecessorCount++;
          } else { // incidentEdge is an outEdge
            checkArgument(incidentEdge.nodeU().equals(thisNode));
    
            N successor = incidentEdge.nodeV();
            V value = successorNodeToValueFn.apply(successor);
    
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue Feb 20 17:00:05 UTC 2024
    - 18K bytes
    - Viewed (0)
  5. guava/src/com/google/common/graph/DirectedGraphConnections.java

            }
    
            orderedNodeConnectionsBuilder.add(new NodeConnection.Pred<>(predecessor));
            predecessorCount++;
          } else { // incidentEdge is an outEdge
            checkArgument(incidentEdge.nodeU().equals(thisNode));
    
            N successor = incidentEdge.nodeV();
            V value = successorNodeToValueFn.apply(successor);
    
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue Feb 20 17:00:05 UTC 2024
    - 18K bytes
    - Viewed (0)
  6. tensorflow/compiler/jit/xla_cluster_util.cc

          if (n->IsSource() || n->IsSink()) {
            continue;
          }
    
          bool inserted_n = false;
          const EdgeSet& edges =
              direction == Direction::kForward ? n->in_edges() : n->out_edges();
          for (const Edge* e : edges) {
            if (result->contains(direction == Direction::kForward ? e->src()
                                                                  : e->dst())) {
              result->insert(n);
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Feb 29 08:39:39 UTC 2024
    - 21.3K bytes
    - Viewed (0)
  7. tensorflow/compiler/jit/deadness_analysis.cc

                  << insert_result.first->second << " to " << pred->ToString()
                  << " " << pred;
          insert_result.first->second = pred;
          if (should_revisit != nullptr) {
            for (const Edge* e : n->out_edges()) {
              (*should_revisit)[e->dst()->id()] = true;
            }
          }
        }
      }
    
      void SetPredicate(Node* n, absl::Span<const int> output_idxs, Predicate* pred,
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 60.4K bytes
    - Viewed (0)
  8. tensorflow/compiler/jit/mark_for_compilation_pass.cc

                 : nullptr;
    }
    
    bool MarkForCompilationPassImpl::IsSinkLike(const Cluster& cluster) {
      if (Node* n = GetOnlyNodeIn(cluster)) {
        return n->type_string() == "NoOp" && n->out_edges().size() == 1 &&
               (*n->out_edges().begin())->dst()->IsSink();
      }
    
      return false;
    }
    
    bool MarkForCompilationPassImpl::IsScalarIntegerResourceOperation(
        const Cluster& cluster) {
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Feb 21 12:19:41 UTC 2024
    - 85.3K bytes
    - Viewed (0)
  9. tensorflow/c/c_api.cc

      for (const auto* edge : oper_out.oper->node.out_edges()) {
        if (edge->src_output() == oper_out.index) {
          ++count;
        }
      }
      return count;
    }
    
    int TF_OperationOutputConsumers(TF_Output oper_out, TF_Input* consumers,
                                    int max_consumers) {
      int count = 0;
      for (const auto* edge : oper_out.oper->node.out_edges()) {
        if (edge->src_output() == oper_out.index) {
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Mon Apr 15 03:35:10 UTC 2024
    - 102.3K bytes
    - Viewed (0)
  10. pilot/pkg/config/kube/gateway/deploymentcontroller.go

    // but does not have the ManagedGatewayLabel, we won't overwrite it.
    // This ensures we don't accidentally take over some resource we weren't supposed to, which could cause outages.
    // Note K8s doesn't have a perfect way to "conditionally SSA", but its close enough (https://github.com/kubernetes/kubernetes/issues/116156).
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Mon May 13 21:43:20 UTC 2024
    - 26.3K bytes
    - Viewed (0)
Back to top