Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for increment_op (0.29 sec)

  1. tensorflow/compiler/jit/mark_for_compilation_pass_test.cc

      Output matmul_1 =
          ops::MatMul(scope.WithOpName("matmul_1"), matmul_input, matmul_input);
    
      AddCtrlEdge(scope, increment_op, group_deps);
      AddCtrlEdge(scope, weights_0_update_op, increment_op);
      AddCtrlEdge(scope, weights_1_update_op, increment_op);
    
      AddCtrlEdge(scope, some_ctrl_input, weights_0_update_op);
      AddCtrlEdge(scope, some_ctrl_input, weights_1_update_op);
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Feb 14 10:11:10 UTC 2024
    - 79.6K bytes
    - Viewed (0)
  2. tensorflow/compiler/mlir/tf2xla/internal/test_matchers_test.cc

    TEST(TestUtil, DoesntMatchesFailure) {
      ASSERT_THAT(failed(), Not(IsOkOrFiltered()));
    }
    
    TEST(TestUtil, MatchesFiltered) { ASSERT_THAT(filtered(), IsOkOrFiltered()); }
    
    TEST(TestUtil, IncrementsOk) {
      CellReader<int64_t> reader(kMetric);
      counter->GetCell(kOkStatus)->IncrementBy(1);
    
      ASSERT_THAT(success(), IncrementedOrFiltered(reader.Delta(kOkStatus), 1));
    }
    
    TEST(TestUtil, FilteredDoesntIncrementsOk) {
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Sun Apr 14 20:29:34 UTC 2024
    - 4.3K bytes
    - Viewed (0)
  3. tensorflow/compiler/jit/deadness_analysis_test.cc

                                latch.output_true, increment_by);
      Output next_iteration =
          ops::NextIteration(root.WithOpName(prefix + "/next_iteration"), iv_next);
    
      CHECK(root.graph()
                ->UpdateEdge(next_iteration.node(), 0, iv.output.node(), 1)
                .ok());
      root.graph()->AddControlEdge(iv.output.node(), increment_by.node());
      root.graph()->AddControlEdge(iv.output.node(), final_value.node());
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Feb 22 06:59:07 UTC 2024
    - 51.6K bytes
    - Viewed (0)
Back to top