Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 631 for lengths (0.17 sec)

  1. tensorflow/c/eager/abstract_operation.h

      std::vector<size_t> lengths;
      raw_strs.reserve(values.size());
      lengths.reserve(values.size());
      for (const auto& s : values) {
        raw_strs.emplace_back(s.data());
        lengths.emplace_back(s.size());
      }
      return SetAttrStringList(attr_name,
                               reinterpret_cast<const void**>(raw_strs.data()),
                               lengths.data(), values.size());
    }
    
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 7.3K bytes
    - Viewed (0)
  2. compat/maven-artifact/src/test/java/org/apache/maven/artifact/versioning/ComparableVersionTest.java

            Comparable[] c = new Comparable[versions.length];
            for (int i = 0; i < versions.length; i++) {
                c[i] = newComparable(versions[i]);
            }
    
            for (int i = 1; i < versions.length; i++) {
                Comparable low = c[i - 1];
                for (int j = i; j < versions.length; j++) {
                    Comparable high = c[j];
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 14K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/collect/TreeMultimapExplicitTest.java

          if (first == second) {
            return 0;
          } else if (first == null) {
            return -1;
          } else if (second == null) {
            return 1;
          } else if (first.length() != second.length()) {
            return first.length() - second.length();
          } else {
            return first.compareTo(second);
          }
        }
      }
    
      /** Decreasing integer values. A {@code null} comes before any non-null value. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  4. tensorflow/c/eager/c_api_unified_experimental_graph.cc

                                     const size_t* lengths,
                                     int num_values) override {
        if (strcmp(attr_name, tensorflow::kColocationAttrName) == 0) {
          op_->colocation_constraints.clear();
          for (int i = 0; i < num_values; ++i) {
            op_->colocation_constraints.emplace(static_cast<const char*>(values[i]),
                                                lengths[i]);
          }
        } else {
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 15.7K bytes
    - Viewed (0)
  5. tensorflow/c/eager/gradients.cc

                                   int num_values, ForwardOperation* forward_op_) {
      std::vector<StringPiece> v(num_values);
      for (int i = 0; i < num_values; ++i) {
        v[i] = StringPiece(static_cast<const char*>(values[i]), lengths[i]);
      }
      forward_op_->attrs.Set(attr_name, v);
      return op_->SetAttrStringList(attr_name, values, lengths, num_values);
    }
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 19.7K bytes
    - Viewed (0)
  6. tensorflow/c/eager/gradients_internal.h

                                     ForwardOperation*);
    absl::Status SetAttrTensor(AbstractOperation*, const char* attr_name,
                               AbstractTensorInterface* tensor, ForwardOperation*);
    absl::Status SetAttrStringList(AbstractOperation*, const char* attr_name,
                                   const void* const* values, const size_t* lengths,
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 4.7K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/hash/Fingerprint2011Test.java

      private static long fingerprint(byte[] bytes) {
        return fingerprint(bytes, bytes.length);
      }
    
      /** Convenience method to compute a fingerprint on a subset of a byte array. */
      private static long fingerprint(byte[] bytes, int length) {
        return HASH_FN.hashBytes(bytes, 0, length).asLong();
      }
    
      /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:22:54 UTC 2024
    - 7.6K bytes
    - Viewed (0)
  8. src/archive/tar/common.go

    //
    //	var spd sparseDatas = []sparseEntry{
    //		{Offset: 2,  Length: 5},  // Data fragment for 2..6
    //		{Offset: 18, Length: 3},  // Data fragment for 18..20
    //	}
    //	var sph sparseHoles = []sparseEntry{
    //		{Offset: 0,  Length: 2},  // Hole fragment for 0..1
    //		{Offset: 7,  Length: 11}, // Hole fragment for 7..17
    //		{Offset: 21, Length: 4},  // Hole fragment for 21..24
    //	}
    //
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Sep 13 21:03:27 UTC 2024
    - 24.5K bytes
    - Viewed (0)
  9. tensorflow/c/eager/parallel_device/parallel_device_lib.cc

                "shape ",
                first_shape.DebugString(), " and another had shape ",
                component_shape.DebugString()));
          } else {
            // Generalize differing axis lengths to "variable"/"unknown".
            for (int axis_index = 0; axis_index < combined_shape.dims();
                 ++axis_index) {
              int64_t axis_length = combined_shape.dim_size(axis_index);
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Mon Oct 21 04:14:14 UTC 2024
    - 25.9K bytes
    - Viewed (0)
  10. docs/en/docs/features.md

    ### Validation
    
    * Validation for most (or all?) Python **data types**, including:
        * JSON objects (`dict`).
        * JSON array (`list`) defining item types.
        * String (`str`) fields, defining min and max lengths.
        * Numbers (`int`, `float`) with min and max values, etc.
    
    * Validation for more exotic types, like:
        * URL.
        * Email.
        * UUID.
        * ...and others.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Thu Aug 15 23:30:12 UTC 2024
    - 9.2K bytes
    - Viewed (0)
Back to top