Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 629 for shapes (0.23 sec)

  1. tensorflow/c/c_api_experimental_test.cc

                        /*input_tensors*/ {},
                        /*expected_shape*/ make_shape({3, kUnknownDim}));
    
      // Infer shape when some dimensions are unknown.
      CheckOutputShapes(
          matmul_op,
          /*input_shapes*/ {make_shape({kUnknownDim, 2}), make_shape({2, 4})},
          /*input_tensors*/ {},
          /*expected_shape*/ make_shape({kUnknownDim, 4}));
    
      // Infer shape when everything is unknown.
    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)
  2. tensorflow/c/c_api.cc

                             int num_shapes) {
      std::vector<PartialTensorShape> shapes;
      shapes.reserve(num_shapes);
      for (int i = 0; i < num_shapes; ++i) {
        if (num_dims[i] < 0) {
          shapes.emplace_back();
        } else {
          shapes.emplace_back(ArraySlice<int64_t>(
              reinterpret_cast<const int64_t*>(dims[i]), num_dims[i]));
        }
      }
      desc->node_builder.Attr(attr_name, shapes);
    }
    
    C++
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 102.3K bytes
    - Viewed (0)
  3. tensorflow/c/c_api_internal.h

    namespace tensorflow {
    
    // Set the shapes and types of the output's handle.
    //
    // The lengths of the arrays pointed to by `shapes`, `ranks`, and `types` must
    // all be equal to `num_shapes_and_types`. If `ranks[i] != -1`, (i.e., if the
    // rank is known), then it must be equal to the length of `shapes[i]`; if
    // `ranks[i] == 1`, then `shapes[i]` may be nullptr.
    //
    C
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Sat May 13 00:49:12 GMT 2023
    - 7.6K bytes
    - Viewed (0)
  4. tensorflow/c/c_api_experimental.h

    //     if you want shape inference to consider the input tensors of the
    //     op for shape inference.
    //   - The types need not be set in `input_shapes` as it is not used.
    //   - The number of `input_tensors` should be the same as the number of items
    //     in `input_shapes`.
    //
    // The results are returned in `output_shapes` and
    // `output_resource_shapes_and_types`. The caller is responsible for freeing the
    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)
  5. tensorflow/c/c_api_experimental.cc

          shape.dims = nullptr;
          continue;
        }
        shape.dims = new int64_t[shape.num_dims];
        for (size_t j = 0; j < shape.num_dims; ++j) {
          shape.dims[j] = c.Value(c.Dim(shape_handle, j));
        }
      }
      if (output_shapes != nullptr) *output_shapes = output_shapes_result;
    
      // TODO(bgogul): Set output_resource_shapes_and_types.
    }
    
    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)
  6. okhttp/src/test/resources/okhttp3/internal/idn/rfc3454.C.8.txt

       202E; RIGHT-TO-LEFT OVERRIDE
       206A; INHIBIT SYMMETRIC SWAPPING
       206B; ACTIVATE SYMMETRIC SWAPPING
       206C; INHIBIT ARABIC FORM SHAPING
       206D; ACTIVATE ARABIC FORM SHAPING
       206E; NATIONAL DIGIT SHAPES
    Plain Text
    - Registered: Fri Mar 29 11:42:11 GMT 2024
    - Last Modified: Wed Dec 20 23:27:07 GMT 2023
    - 501 bytes
    - Viewed (0)
  7. tensorflow/c/eager/parallel_device/parallel_device_lib.h

      // device-specific executors have scheduled the op.
      //
      // Accepts inferred shapes for outputs (`expected_output_shapes`), which if
      // fully defined will avoid querying the shapes of the underlying
      // TensorHandles when ParallelTensor::Shape is called. This allows async
      // computation to continue without blocking.
      //
      // The return status and value is the same as `Execute`.
    C
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Tue Apr 25 15:21:13 GMT 2023
    - 12.9K bytes
    - Viewed (0)
  8. okhttp/src/test/java/okhttp3/internal/idn/StringprepTest.kt

        assertThat(stringPrep("\u200e")).isNull() // LEFT-TO-RIGHT MARK
        assertThat(stringPrep("\u206e")).isNull() // NATIONAL DIGIT SHAPES
        assertThat(stringPrep("\u206f")).isNull() // NOMINAL DIGIT SHAPES
      }
    
      @Test fun prohibitionTaggingCharacters() {
        assertThat(stringPrep("\udb40\udc01")).isNull() // Note that this is one code point.
    Plain Text
    - Registered: Fri Mar 29 11:42:11 GMT 2024
    - Last Modified: Mon Jan 08 01:13:22 GMT 2024
    - 4.7K bytes
    - Viewed (0)
  9. tensorflow/c/eager/parallel_device/parallel_device_lib.cc

          if (combined_shape.dims() < 0 ||
              combined_shape.dims() != component_shape.dims()) {
            PartialTensorShape first_shape;
            TF_RETURN_IF_ERROR(unwrap(tensors_[0].get())->Shape(&first_shape));
            return errors::Unimplemented(absl::StrCat(
                "Computing the shape of a ParallelTensor when the components do "
                "not all have the same rank is not supported. One tensor had "
                "shape ",
    C++
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Fri Feb 09 07:47:20 GMT 2024
    - 25.4K bytes
    - Viewed (1)
  10. tensorflow/c/eager/c_api_unified_experimental_graph.cc

        std::vector<PartialTensorShape> shapes;
        shapes.reserve(num_values);
        for (int i = 0; i < num_values; ++i) {
          if (num_dims[i] < 0) {
            shapes.emplace_back();
          } else {
            shapes.emplace_back(ArraySlice<int64_t>(
                reinterpret_cast<const int64_t*>(dims[i]), num_dims[i]));
          }
        }
        op_->node_builder.Attr(attr_name, shapes);
        return absl::OkStatus();
      }
    C++
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Tue Mar 12 20:00:09 GMT 2024
    - 15.4K bytes
    - Viewed (1)
Back to top