Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for intero (0.3 sec)

  1. tensorflow/c/c_api_experimental.cc

      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/eager/gradients.cc

    Status GradientRegistry::Register(
        const string& op_name, GradientFunctionFactory gradient_function_factory) {
      auto iter = registry_.find(op_name);
      if (iter != registry_.end()) {
        const string error_msg = "Gradient already exists for op: " + op_name + ".";
        return errors::AlreadyExists(error_msg);
      }
      registry_.insert({op_name, gradient_function_factory});
      return absl::OkStatus();
    }
    Status GradientRegistry::Lookup(
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Feb 15 09:49:45 GMT 2024
    - 19.3K bytes
    - Viewed (0)
  3. tensorflow/c/eager/gradients_test.cc

                          /*use_function=*/!std::get<2>(GetParam()));
      ASSERT_EQ(error::INVALID_ARGUMENT, s.code());
      ASSERT_EQ(
          "Provided null gradient_function for 'Neg'.\nIf the intent is to treat "
          "this op as non-differentiable consider using RegisterNotDifferentiable "
          "or NotDifferentiableGradientFunction.",
          s.message());
      ASSERT_EQ(nullptr, outputs[0]);
    }
    
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Feb 15 09:49:45 GMT 2024
    - 7K bytes
    - Viewed (0)
  4. tensorflow/c/c_api_function.cc

        } else {
          auto& indices = iter->second;
          if (std::find(indices.begin(), indices.end(), idx) != indices.end()) {
            return InvalidArgument("TF_Output ", node->name(), ":", idx,
                                   " appears more than once in the input list");
          }
          indices.push_back(idx);
        }
      }
      return absl::OkStatus();
    }
    
    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)
Back to top