Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 11 - 20 of 2,286 for lengths (0.06 seconds)

  1. tensorflow/c/eager/gradients.cc

                                   int num_values, ForwardOperation* forward_op_) {
      std::vector<absl::string_view> v(num_values);
      for (int i = 0; i < num_values; ++i) {
        v[i] = absl::string_view(static_cast<const char*>(values[i]), lengths[i]);
      }
      forward_op_->attrs.Set(attr_name, v);
      return op_->SetAttrStringList(attr_name, values, lengths, num_values);
    }
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Tue Feb 24 06:18:31 GMT 2026
    - 19.6K bytes
    - Click Count (0)
  2. cmd/erasure-decode_test.go

    	r := rand.New(rand.NewSource(UTCNow().UnixNano()))
    
    	buf := &bytes.Buffer{}
    
    	// Verify erasure.Decode() for random offsets and lengths.
    	for range iterations {
    		offset := r.Int63n(length)
    		readLen := r.Int63n(length - offset)
    
    		expected := data[offset : offset+readLen]
    
    		// Get the checksums of the current part.
    		bitrotReaders := make([]io.ReaderAt, len(disks))
    		for index, disk := range disks {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 21K bytes
    - Click Count (0)
  3. 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,
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sat Oct 12 05:11:17 GMT 2024
    - 4.7K bytes
    - Click Count (0)
  4. tensorflow/c/c_api.h

    // keep.
    
    // `value` must point to a string of length `length` bytes.
    TF_CAPI_EXPORT extern void TF_SetAttrString(TF_OperationDescription* desc,
                                                const char* attr_name,
                                                const void* value, size_t length);
    // `values` and `lengths` each must have lengths `num_values`.
    // `values[i]` must point to a string of length `lengths[i]` bytes.
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Thu Oct 26 21:08:15 GMT 2023
    - 82.3K bytes
    - Click Count (0)
  5. src/test/java/jcifs/NetbiosNameTest.java

            // When
            String scope = mockNetbiosName.getScope();
    
            // Then
            assertNull(scope);
        }
    
        @Test
        @DisplayName("Should handle various name lengths")
        void testVariousNameLengths() {
            // NetBIOS names can be up to 15 characters
            String[] testNames = { "A", "SERVER", "LONGSERVERNAME", "EXACTLY15CHARS1" };
    
            for (String testName : testNames) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 8K bytes
    - Click Count (0)
  6. src/bufio/scan_test.go

    		}
    		buf.WriteByte('\n')
    	}
    }
    
    // Test the line splitter, including some carriage returns but no long lines.
    func TestScanLongLines(t *testing.T) {
    	// Build a buffer of lots of line lengths up to but not exceeding smallMaxTokenSize.
    	tmp := new(bytes.Buffer)
    	buf := new(bytes.Buffer)
    	lineNum := 0
    	j := 0
    	for i := 0; i < 2*smallMaxTokenSize; i++ {
    		genLine(tmp, lineNum, j, true)
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Sep 22 16:22:42 GMT 2023
    - 14.3K bytes
    - Click Count (0)
  7. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt

            }
    
            if (compareResult < 0) {
              high = mid - 1
            } else if (compareResult > 0) {
              low = mid + end + 1
            } else {
              // We found a match, but are the lengths equal?
              val publicSuffixBytesLeft = publicSuffixLength - publicSuffixByteIndex
              var labelBytesLeft = labels[currentLabelIndex].size - currentLabelByteIndex
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Mon Jul 28 07:33:49 GMT 2025
    - 8.5K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/hash/Fingerprint2011.java

          result = murmurHash64WithSeed(bytes, offset, length, K0 ^ K1 ^ K2);
        } else if (length <= 64) {
          result = hashLength33To64(bytes, offset, length);
        } else {
          result = fullFingerprint(bytes, offset, length);
        }
    
        long u = length >= 8 ? load64(bytes, offset) : K0;
        long v = length >= 9 ? load64(bytes, offset + length - 8) : K0;
        result = hash128to64(result + v, u);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Aug 11 19:31:30 GMT 2025
    - 6.5K bytes
    - Click Count (0)
  9. 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.
    //
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Wed Jan 07 04:56:09 GMT 2026
    - 7.5K bytes
    - Click Count (0)
  10. src/test/java/jcifs/smb/NtlmPasswordAuthenticatorTimingAttackTest.java

            try {
                // Time comparison between different length passwords
                long timeDiffLength = measureEqualsTime(auth1, auth2, TIMING_ITERATIONS);
    
                // Create same length passwords for comparison
                char[] password3 = "short".toCharArray();
                char[] password4 = "shore".toCharArray(); // Same length, different content
    
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 11.2K bytes
    - Click Count (0)
Back to Top