Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 20 for assertj (0.18 sec)

  1. tensorflow/c/eager/c_api_test.cc

      ASSERT_EQ(TF_INVALID_ARGUMENT, TF_GetCode(status.get()));
      ASSERT_EQ(device_name, nullptr);
      ASSERT_EQ("Invalid handle", string(TF_Message(status.get())));
    
      TF_SetStatus(status.get(), TF_OK, "");
    
      int num_dims = TFE_TensorHandleNumDims(h, status.get());
      ASSERT_EQ(TF_INVALID_ARGUMENT, TF_GetCode(status.get()));
      ASSERT_EQ(num_dims, -1);
      ASSERT_EQ("Invalid handle", string(TF_Message(status.get())));
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Aug 03 20:50:20 GMT 2023
    - 94.6K bytes
    - Viewed (1)
  2. tensorflow/c/eager/c_api_unified_experimental_test.cc

      ASSERT_EQ(TF_OK, TF_GetCode(status.get())) << TF_Message(status.get());
    
      // Execute.
      TF_ExecuteOperation(add_op, 2, inputs, add_outputs, status.get());
      ASSERT_EQ(TF_OK, TF_GetCode(status.get())) << TF_Message(status.get());
    
      // Test that full type information can be accessed.
      auto outs = unwrap(add_outputs);
      auto h = outs->outputs[0];
      ASSERT_NE(h, nullptr);
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Fri May 19 21:44:52 GMT 2023
    - 39.1K bytes
    - Viewed (0)
  3. tensorflow/c/eager/c_api_experimental_test.cc

      ASSERT_EQ(TF_INVALID_ARGUMENT, TF_GetCode(status.get()));
      ASSERT_EQ(device_type, nullptr);
      ASSERT_EQ("Invalid handle", string(TF_Message(status.get())));
    
      TF_SetStatus(status.get(), TF_OK, "");
    
      int device_id = TFE_TensorHandleDeviceID(h, status.get());
      ASSERT_EQ(TF_INVALID_ARGUMENT, TF_GetCode(status.get()));
      ASSERT_EQ(device_id, -1);
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Aug 03 03:14:26 GMT 2023
    - 31.5K bytes
    - Viewed (1)
  4. 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)
  5. tensorflow/c/experimental/gradients/nn_grad_test.cc

        ASSERT_EQ(errors::OK, status_.code()) << status_.message();
        Y.reset(Y_raw);
      }
    
      std::vector<AbstractTensorHandle*> outputs(1);
      status_ = RunModel(ReluGradModel, immediate_execution_ctx_.get(), {Y.get()},
                         absl::MakeSpan(outputs), UseFunction());
      ASSERT_EQ(errors::OK, status_.code()) << status_.message();
    C++
    - Registered: Tue Mar 26 12:39:09 GMT 2024
    - Last Modified: Wed Feb 28 13:53:47 GMT 2024
    - 8.3K bytes
    - Viewed (0)
  6. tensorflow/c/eager/dlpack_test.cc

      TFE_TensorHandle* handle = TFE_HandleFromDLPack(&dlm_in, status, ctx);
      ASSERT_NE(handle, nullptr)
          << TF_Message(status) << " (shape=[" << absl::StrJoin(shape, ",")
          << "], strides=[" << absl::StrJoin(strides, ",") << "])";
    
      auto* dlm_out =
          static_cast<DLManagedTensor*>(TFE_HandleToDLPack(handle, status));
      ASSERT_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status);
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Fri Jun 30 03:04:46 GMT 2023
    - 4.4K bytes
    - Viewed (0)
  7. tensorflow/c/experimental/gradients/array_grad_test.cc

        status_ = StatusFromTF_Status(status.get());
        ASSERT_EQ(errors::OK, status_.code()) << status_.message();
    
        {
          AbstractContext* ctx_raw = nullptr;
          status_ =
              BuildImmediateExecutionContext(std::get<1>(GetParam()), &ctx_raw);
          ASSERT_EQ(errors::OK, status_.code()) << status_.message();
          immediate_execution_ctx_.reset(ctx_raw);
        }
    
    C++
    - Registered: Tue Mar 26 12:39:09 GMT 2024
    - Last Modified: Wed Feb 28 13:53:47 GMT 2024
    - 5K bytes
    - Viewed (0)
  8. tensorflow/c/eager/c_api_unified_experimental.cc

      static FactoriesMap* factories = new FactoriesMap;
      return *factories;
    }
    
    static tracing::FactoryFunction default_factory;
    
    void RegisterTracingEngineFactory(const string& name, FactoryFunction factory) {
      assert((!GetFactories().count(name)) ||
             (GetFactories()[name] == factory) &&
                 "Duplicate tracing factory registration");
      GetFactories()[name] = factory;
    }
    
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Feb 15 09:49:45 GMT 2024
    - 9K bytes
    - Viewed (0)
  9. tensorflow/c/c_api.cc

          // Adding the gradients to the graph can alter the prefix to prevent
          // name collisions only if this prefix has not been provided explicitly
          // by the user. If it was provided, assert that it remained intact.
          if (prefix != nullptr && !absl::StartsWith(n->name(), prefix_cmp)) {
            status->status = tensorflow::errors::Internal(
    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)
  10. tensorflow/c/eager/unified_api_test.cc

        ASSERT_EQ(errors::OK, s.code()) << s.message();
        s = dyn_cast<tracing::TracingContext>(ctx.get())->AddParameter(
            DT_FLOAT, shape, &x_raw);
        ASSERT_EQ(errors::OK, s.code()) << s.message();
        x.reset(x_raw);
      }
    
      PartialTensorShape shape;
      Status s = x->Shape(&shape);
      ASSERT_EQ(errors::OK, s.code()) << s.message();
      ASSERT_FALSE(shape.unknown_rank());
    
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Tue Feb 27 13:57:45 GMT 2024
    - 6.7K bytes
    - Viewed (0)
Back to top