Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for RngAlgorithm (0.21 sec)

  1. tensorflow/compiler/mlir/lite/flatbuffer_export.cc

      tflite::RngAlgorithm algorithm = tflite::RngAlgorithm_DEFAULT;
      switch (rng_op.getRngAlgorithm()) {
        case mlir::stablehlo::RngAlgorithm::THREE_FRY:
          algorithm = tflite::RngAlgorithm_THREEFRY;
          break;
        case mlir::stablehlo::RngAlgorithm::PHILOX:
          algorithm = tflite::RngAlgorithm_PHILOX;
          break;
        case mlir::stablehlo::RngAlgorithm::DEFAULT:
          break;
      }
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Jun 12 21:41:49 UTC 2024
    - 164.5K bytes
    - Viewed (2)
  2. tensorflow/compiler/mlir/lite/schema/schema.fbs

      update_window_dims: [long];
      inserted_window_dims: [long];
      scatter_dims_to_operand_dims: [long];
      index_vector_dim: long;
      unique_indices: bool;
      update_computation_subgraph_index: int;
    }
    
    enum RngAlgorithm : byte {
      // An algorithm auto-selected by the system according to device type.
      DEFAULT = 0,
      // The Philox algorithm, as described in paper
      // ['Parallel Random Numbers: As Easy as 1, 2, 3']
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Fri May 03 18:01:23 UTC 2024
    - 41.7K bytes
    - Viewed (0)
  3. tensorflow/compiler/mlir/lite/schema/schema_generated.h

      return EnumNamesStablehloComparisonType()[index];
    }
    
    enum RngAlgorithm : int8_t {
      RngAlgorithm_DEFAULT = 0,
      RngAlgorithm_PHILOX = 1,
      RngAlgorithm_THREEFRY = 2,
      RngAlgorithm_MIN = RngAlgorithm_DEFAULT,
      RngAlgorithm_MAX = RngAlgorithm_THREEFRY
    };
    
    inline const RngAlgorithm (&EnumValuesRngAlgorithm())[3] {
      static const RngAlgorithm values[] = {
        RngAlgorithm_DEFAULT,
        RngAlgorithm_PHILOX,
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue May 21 18:21:50 UTC 2024
    - 1M bytes
    - Viewed (0)
Back to top