Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for ASSERT_TRUE (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  2. github.com/tensorflow/tensorflow

    tensorflow/c/eager/c_api_test.cc 

      }
  const string gpu_1_name(TF_DeviceListName(devices, 1, status.get()));
  ASSERT_TRUE(TF_GetCode(status.get()) == TF_OK);
  const string gpu_2_name(TF_DeviceListName(devices, 2, status.get()));
  ASSERT_TRUE(TF_GetCode(status.get()) == TF_OK);
  TFE_TensorHandle* hdevice =
      TFE_TensorHandleCopyToDevice(hcpu, ctx, gpu_1_name.c_str(), status.get());
  ASSERT_TRUE(TF_GetCode(status.get()) == TF_OK);
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Thu Oct 09 05:56:18 GMT 2025
    - 94.6K bytes
    - Click Count (0)
  3. github.com/tensorflow/tensorflow

    tensorflow/c/c_api_test.cc 

      EXPECT_TRUE(neg == neg2);
  NodeDef node_def2;
  ASSERT_TRUE(GetNodeDef(neg2, &node_def2));
  EXPECT_EQ(node_def.DebugString(), node_def2.DebugString());

  TF_Operation* feed2 = TF_GraphOperationByName(graph, "feed");
  EXPECT_TRUE(feed == feed2);
  ASSERT_TRUE(GetNodeDef(feed, &node_def));
  ASSERT_TRUE(GetNodeDef(feed2, &node_def2));
  EXPECT_EQ(node_def.DebugString(), node_def2.DebugString());
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Wed Jan 07 04:56:09 GMT 2026
    - 97.3K bytes
    - Click Count (0)
  4. github.com/tensorflow/tensorflow

    tensorflow/c/c_api_function_test.cc 

            const auto& v = a_edges.insert({iter->second, arg.name()});
        ASSERT_TRUE(v.second) << "Duplicate edge " << iter->second << " -> "
                              << arg.name() << ". fdef: " << fdef.DebugString();
      } else {
        const auto& v = a_edges.insert({arg.name(), arg.name()});
        ASSERT_TRUE(v.second) << "Duplicate edge " << arg.name() << " -> "
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Wed Jan 07 04:56:09 GMT 2026
    - 63.9K bytes
    - Click Count (1)
Back to Top