Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for TF_ShapeAndTypeListSetUnknownShape (0.23 sec)

  1. tensorflow/c/c_api_experimental.h

        int num_shapes);
    TF_CAPI_EXPORT extern void TF_ShapeAndTypeListSetShape(
        TF_ShapeAndTypeList* shape_list, int index, const int64_t* dims,
        int num_dims);
    TF_CAPI_EXPORT extern void TF_ShapeAndTypeListSetUnknownShape(
        TF_ShapeAndTypeList* shape_list, int index);
    TF_CAPI_EXPORT extern void TF_ShapeAndTypeListSetDtype(
        TF_ShapeAndTypeList* shape_list, int index, TF_DataType dtype);
    C
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Thu Apr 27 21:07:00 GMT 2023
    - 15.1K bytes
    - Viewed (0)
  2. tensorflow/c/c_api_experimental_test.cc

          if (input_shape.has_value()) {
            TF_ShapeAndTypeListSetShape(input_shapes, i, input_shape->data(),
                                        input_shape->size());
          } else {
            TF_ShapeAndTypeListSetUnknownShape(input_shapes, i);
          }
        }
        TF_ShapeAndTypeList* output_shapes;
        TFE_InferShapes(op, input_shapes,
                        input_tensors.empty()
                            ? nullptr
    C++
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Tue Jan 17 22:27:52 GMT 2023
    - 13.1K bytes
    - Viewed (1)
  3. tensorflow/c/c_api_experimental.cc

      DCHECK(num_dims >= 0) << "Number of dimensions cannot be negative!";
      shape.num_dims = num_dims;
      shape.dims = new int64_t[num_dims];
      memcpy(shape.dims, dims, sizeof(int64_t) * num_dims);
    }
    
    void TF_ShapeAndTypeListSetUnknownShape(TF_ShapeAndTypeList* shape_list,
                                            int index) {
      DCHECK(index >= 0 && index < shape_list->num_items);
      TF_ShapeAndType& shape = shape_list->items[index];
    C++
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 29.4K bytes
    - Viewed (0)
Back to top