Search Options

Results per page
Sort
Preferred Languages
Advance

Results 351 - 360 of 800 for Len (0.02 sec)

  1. cmd/erasure_test.go

    	data := make([]byte, 256)
    	if _, err := io.ReadFull(rand.Reader, data); err != nil {
    		t.Fatalf("Failed to read random data: %v", err)
    	}
    	for i, test := range erasureEncodeDecodeTests {
    		buffer := make([]byte, len(data), 2*len(data))
    		copy(buffer, data)
    
    		erasure, err := NewErasure(t.Context(), test.dataBlocks, test.parityBlocks, blockSizeV2)
    		if err != nil {
    			t.Fatalf("Test %d: failed to create erasure: %v", i, err)
    		}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Apr 09 14:28:39 UTC 2025
    - 4.8K bytes
    - Viewed (0)
  2. src/main/java/jcifs/internal/smb1/trans2/Trans2QueryPathInformation.java

            return 0;
        }
    
        @Override
        protected int readParametersWireFormat(final byte[] buffer, final int bufferIndex, final int len) {
            return 0;
        }
    
        @Override
        protected int readDataWireFormat(final byte[] buffer, final int bufferIndex, final int len) {
            return 0;
        }
    
        @Override
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 4K bytes
    - Viewed (0)
  3. cmd/notification-summary.go

    func GetTotalUsableCapacity(diskInfo []madmin.Disk, s StorageInfo) (capacity uint64) {
    	for _, disk := range diskInfo {
    		// Ignore invalid.
    		if disk.PoolIndex < 0 || len(s.Backend.StandardSCData) <= disk.PoolIndex {
    			// https://github.com/minio/minio/issues/16500
    			continue
    		}
    		// Ignore parity disks
    		if disk.DiskIndex < s.Backend.StandardSCData[disk.PoolIndex] {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Jun 20 00:53:08 UTC 2023
    - 2.2K bytes
    - Viewed (0)
  4. clause/order_by.go

    func (orderBy OrderBy) MergeClause(clause *Clause) {
    	if v, ok := clause.Expression.(OrderBy); ok {
    		for i := len(orderBy.Columns) - 1; i >= 0; i-- {
    			if orderBy.Columns[i].Reorder {
    				orderBy.Columns = orderBy.Columns[i:]
    				clause.Expression = orderBy
    				return
    			}
    		}
    
    		copiedColumns := make([]OrderByColumn, len(v.Columns))
    		copy(copiedColumns, v.Columns)
    		orderBy.Columns = append(copiedColumns, orderBy.Columns...)
    	}
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Tue Nov 03 02:30:05 UTC 2020
    - 1.1K bytes
    - Viewed (0)
  5. cmd/xl-storage.go

    func checkPathLength(pathName string) error {
    	// Apple OS X path length is limited to 1016
    	if runtime.GOOS == "darwin" && len(pathName) > 1016 {
    		return errFileNameTooLong
    	}
    
    	// Disallow more than 1024 characters on windows, there
    	// are no known name_max limits on Windows.
    	if runtime.GOOS == "windows" && len(pathName) > 1024 {
    		return errFileNameTooLong
    	}
    
    	// On Unix we reject paths if they are just '.', '..' or '/'
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Jun 13 11:33:47 UTC 2025
    - 91.7K bytes
    - Viewed (0)
  6. src/main/java/org/codelibs/core/io/CopyUtil.java

            try {
                final byte[] buf = new byte[DEFAULT_BUF_SIZE];
                int len;
                int amount = 0;
                while ((len = in.read(buf)) != -1) {
                    out.write(buf, 0, len);
                    amount += len;
                }
                out.flush();
                return amount;
            } catch (final IOException e) {
    Registered: Fri Sep 05 20:58:11 UTC 2025
    - Last Modified: Thu Jul 31 08:16:49 UTC 2025
    - 45.2K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/hash/HashTestUtils.java

            hashFunction.hashBytes(bytes), hashFunction.newHasher(size).putBytes(bytes).hash());
        int off = random.nextInt(size);
        int len = random.nextInt(size - off);
        assertEquals(
            hashFunction.hashBytes(bytes, off, len),
            hashFunction.newHasher(size).putBytes(bytes, off, len).hash());
      }
    
      private static void assertHashByteBufferEquivalence(HashFunction hashFunction, Random random) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 25.6K bytes
    - Viewed (0)
  8. src/archive/zip/reader_test.go

    	}
    	r.Close()
    
    	if g := uint64(b.Len()); g != size {
    		t.Errorf("%v: read %v bytes but f.UncompressedSize == %v", f.Name, g, size)
    	}
    
    	var c []byte
    	if ft.Content != nil {
    		c = ft.Content
    	} else if c, err = os.ReadFile("testdata/" + ft.File); err != nil {
    		t.Error(err)
    		return
    	}
    
    	if b.Len() != len(c) {
    		t.Errorf("%s: len=%d, want %d", f.Name, b.Len(), len(c))
    		return
    	}
    
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Mar 11 22:19:38 UTC 2025
    - 56.6K bytes
    - Viewed (0)
  9. src/main/java/jcifs/netbios/NbtAddress.java

            if (Character.isDigit(this.calledName.charAt(0))) {
                int i, len, dots;
                char[] data;
    
                i = dots = 0; /* quick IP address validation */
                len = this.calledName.length();
                data = this.calledName.toCharArray();
                while (i < len && Character.isDigit(data[i++])) {
                    if (i == len && dots == 3) {
                        // probably an IP address
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 15.1K bytes
    - Viewed (0)
  10. tensorflow/c/c_api_experimental.h

    // `len`. The format is subject to change in the future.
    // The returned string is heap-allocated, and caller should call free() on it.
    TF_CAPI_EXPORT extern const char* TF_GraphDebugString(TF_Graph* graph,
                                                          size_t* len);
    
    // Returns the function content in a human-readable format, with length set in
    // `len`. The format is subject to change in the future.
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Thu Apr 27 21:07:00 UTC 2023
    - 15.1K bytes
    - Viewed (0)
Back to top