Search Options

Results per page
Sort
Preferred Languages
Advance

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

  1. tensorflow/c/eager/c_api_unified_experimental_test.cc

        // create a new list and populate it.
        TF_OutputList* func_outputs = TF_NewOutputList();
        TF_OutputListPushBack(func_outputs, add_output1, s);
        ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
        TF_OutputListPushBack(func_outputs, add_output2, s);
        ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
        TF_OutputListPushBack(func_outputs, mm_output, s);
        ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    C++
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Fri May 19 21:44:52 GMT 2023
    - 39.1K bytes
    - Viewed (0)
  2. tensorflow/c/eager/c_api_unified_experimental.h

    // Return the `i`th output in the list.
    TF_AbstractTensor* TF_OutputListGet(TF_OutputList* o, int i);
    // Append a tensor at the end of the output list, growing its size by one.
    void TF_OutputListPushBack(TF_OutputList* o, TF_AbstractTensor* tensor,
                               TF_Status*);
    
    // TF_ExecuteOperation will, if in eager mode, execute, if in graph mode, maybe
    C
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Sun Oct 24 11:27:00 GMT 2021
    - 7K bytes
    - Viewed (0)
  3. tensorflow/c/eager/c_api_unified_experimental.cc

    }
    int TF_OutputListNumOutputs(TF_OutputList* o) {
      return unwrap(o)->outputs.size();
    }
    TF_AbstractTensor* TF_OutputListGet(TF_OutputList* o, int i) {
      return wrap(unwrap(o)->outputs[i]);
    }
    void TF_OutputListPushBack(TF_OutputList* o, TF_AbstractTensor* tensor,
                               TF_Status* s) {
      unwrap(o)->outputs.push_back(unwrap(tensor));
    }
    
    void TF_AbstractOpSetOpType(TF_AbstractOp* op, const char* const op_type,
    C++
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Thu Feb 15 09:49:45 GMT 2024
    - 9K bytes
    - Viewed (0)
Back to top