Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for great (0.2 sec)

  1. tensorflow/c/experimental/filesystem/plugins/posix/posix_filesystem_helper.cc

      // When creating file, use the same permissions as original
      mode_t open_mode = mode & (S_IRWXU | S_IRWXG | S_IRWXO);
    
      // O_WRONLY | O_CREAT | O_TRUNC:
      //   Open file for write and if file does not exist, create the file.
      //   If file exists, truncate its size to 0.
      int dst_fd = open(dst, O_WRONLY | O_CREAT | O_TRUNC, open_mode);
      if (dst_fd < 0) {
        close(src_fd);
        return -1;
      }
    
    C++
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Thu Jan 16 05:36:52 GMT 2020
    - 2.1K bytes
    - Viewed (1)
  2. 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)
  3. tensorflow/c/eager/gradients.cc

        absl::Span<AbstractTensorHandle*> result) const {
      if (gradient_function == nullptr) {
        return errors::InvalidArgument(
            "Provided null gradient_function for '", op_type, "'.\n",
            "If the intent is to treat this op as non-differentiable consider "
            "using RegisterNotDifferentiable or "
            "NotDifferentiableGradientFunction.");
      }
      return gradient_function->Compute(ctx_, output_gradients, result);
    }
    
    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)
Back to top