Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for Round (0.13 sec)

  1. tensorflow/c/c_api.cc

      mutex_lock l(graph->mu);
      tensorflow::shape_inference::InferenceContext* ic =
          graph->refiner.GetContext(node);
      if (ic == nullptr) {
        status->status =
            InvalidArgument("Node ", node->name(), " was not found in the graph");
        return;
      }
    
      auto shape_and_type_vec =
          std::vector<tensorflow::shape_inference::ShapeAndType>(
              num_shapes_and_types);
      for (int i = 0; i < num_shapes_and_types; ++i) {
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 102.3K bytes
    - Viewed (0)
  2. tensorflow/c/eager/c_api_unified_experimental_graph.cc

        TF_RETURN_IF_ERROR(operation->Execute(
            absl::Span<AbstractTensorHandle*>(outputs), &num_outputs));
    
        if (num_outputs != 1) {
          return errors::Internal("Expected 1 output but found ", num_outputs);
        }
        auto* t = dyn_cast<GraphTensor>(outputs[0]);
        if (!t) {
          return tensorflow::errors::InvalidArgument(
              "Unable to cast input to GraphTensor");
        }
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Tue Mar 12 20:00:09 GMT 2024
    - 15.4K bytes
    - Viewed (1)
  3. tensorflow/c/c_api_test.cc

      // Validate GraphDef is what we expect.
      bool found_placeholder = false;
      bool found_scalar_const = false;
      bool found_add = false;
      for (const auto& n : graph_def.node()) {
        if (IsPlaceholder(n)) {
          EXPECT_FALSE(found_placeholder);
          found_placeholder = true;
        } else if (IsScalarConst(n, 3)) {
          EXPECT_FALSE(found_scalar_const);
          found_scalar_const = true;
        } else if (IsAddN(n, 2)) {
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 96.9K bytes
    - Viewed (3)
Back to top