Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for insert (0.19 sec)

  1. tensorflow/c/c_api_experimental.cc

                               TF_DataType value) {
      auto iter = builder->attr_names.insert(attr_name).first;
      builder->Set(*iter, static_cast<tensorflow::DataType>(value));
    }
    
    void TF_AttrBuilderSetTypeList(TF_AttrBuilder* builder, const char* attr_name,
                                   const TF_DataType* values, int num_values) {
      auto iter = builder->attr_names.insert(attr_name).first;
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 29.4K bytes
    - Viewed (0)
  2. tensorflow/c/c_api_test.cc

      // Create a simple graph.
      Placeholder(graph, s);
      ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
      ASSERT_TRUE(TF_GraphOperationByName(graph, "feed") != nullptr);
      TF_Operation* oper = ScalarConst(3, graph, s);
      ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
      ASSERT_TRUE(TF_GraphOperationByName(graph, "scalar") != nullptr);
      Neg(oper, graph, s);
      ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    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)
  3. tensorflow/c/c_api.cc

          return;
        }
        desc->colocation_constraints.clear();
        for (const string& location : attr_value.list().s()) {
          desc->colocation_constraints.insert(location);
        }
      } else {
        desc->node_builder.Attr(attr_name, std::move(attr_value));
      }
    
      status->status = absl::OkStatus();
    }
    
    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)
  4. tensorflow/c/c_api_function.cc

                                        " into function '", fn_name, "'");
    
        input_tensors->emplace_back(node, idx);
    
        const auto& iter = input_nodes->find(node);
        if (iter == input_nodes->end()) {
          input_nodes->insert({node, {idx}});
        } else {
          auto& indices = iter->second;
          if (std::find(indices.begin(), indices.end(), idx) != indices.end()) {
            return InvalidArgument("TF_Output ", node->name(), ":", idx,
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 13.6K bytes
    - Viewed (2)
  5. RELEASE.md

    ## Thanks to our Contributors
    
    This release contains contributions from many people at Google, as well as:
    
    <INSERT>, <NAME>, <HERE>, <USING>, <GITHUB>, <HANDLE>
    
    # Release 2.16.0
    
    ## TensorFlow
    
    <INSERT SMALL BLURB ABOUT RELEASE FOCUS AREA AND POTENTIAL TOOLCHAIN CHANGES>
    
    *   TensorFlow Windows Build:
    
    Plain Text
    - Registered: Tue May 07 12:40:20 GMT 2024
    - Last Modified: Mon Apr 29 19:17:57 GMT 2024
    - 727.7K bytes
    - Viewed (8)
  6. configure.py

        # Check whether all capabilities from the input is valid
        all_valid = True
        # Remove all whitespace characters before splitting the string
        # that users may insert by accident, as this will result in error
        tf_cuda_compute_capabilities = ''.join(tf_cuda_compute_capabilities.split())
        for compute_capability in tf_cuda_compute_capabilities.split(','):
    Python
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 18:25:36 GMT 2024
    - 53.8K bytes
    - Viewed (1)
  7. .bazelrc

    # do not run them. By prefixing the configs with "build", we can run both
    # `bazel build` and `bazel test` commands with the same config as test configs
    # inherit from build.
    build:linux_arm64_pycpp_test_filters --test_tag_filters=-no_oss,-no_aarch64,-oss_excluded,-oss_serial,-gpu,-tpu,-benchmark-test,-v1only
    Plain Text
    - Registered: Tue May 07 12:40:20 GMT 2024
    - Last Modified: Thu May 02 19:34:20 GMT 2024
    - 52.8K bytes
    - Viewed (2)
Back to top