Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 66 for encodedCh (0.04 seconds)

  1. cmd/admin-handlers.go

    				case <-ctx.Done():
    					return
    				case encodedCh <- append(grid.GetByteBuffer()[:0], buf.Bytes()...):
    				}
    			}
    		}
    	}()
    
    	// Collect from matching peers
    	for _, peer := range peers {
    		if peer == nil {
    			continue
    		}
    		if node == "" || strings.EqualFold(peer.host.Name, node) {
    			peer.ConsoleLog(ctx, logKind, encodedCh)
    		}
    	}
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 99.7K bytes
    - Click Count (0)
  2. src/bytes/bytes.go

    // ContainsAny reports whether any of the UTF-8-encoded code points in chars are within b.
    func ContainsAny(b []byte, chars string) bool {
    	return IndexAny(b, chars) >= 0
    }
    
    // ContainsRune reports whether the rune is contained in the UTF-8-encoded byte slice b.
    func ContainsRune(b []byte, r rune) bool {
    	return IndexRune(b, r) >= 0
    }
    
    // ContainsFunc reports whether any of the UTF-8-encoded code points r within b satisfy f(r).
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Sep 16 16:42:15 GMT 2025
    - 35.5K bytes
    - Click Count (0)
  3. cmd/erasure_test.go

    			t.Fatalf("Test %d: failed to create erasure: %v", i, err)
    		}
    		encoded, err := erasure.EncodeData(t.Context(), buffer)
    		if err != nil {
    			t.Fatalf("Test %d: failed to encode data: %v", i, err)
    		}
    
    		for j := range encoded[:test.missingData] {
    			encoded[j] = nil
    		}
    		for j := test.dataBlocks; j < test.dataBlocks+test.missingParity; j++ {
    			encoded[j] = nil
    		}
    
    		if test.reconstructParity {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Apr 09 14:28:39 GMT 2025
    - 4.8K bytes
    - Click Count (0)
  4. internal/hash/checksum_test.go

    	readParts := ReadPartCheckSums(serializedOut)
    	expectedChecksums := []string{
    		part1Checksum.Encoded,
    		part2Checksum.Encoded,
    		part3Checksum.Encoded,
    	}
    	for i, expected := range expectedChecksums {
    		if got := readParts[i][ChecksumCRC32C.String()]; got != expected {
    			t.Fatalf("want part%dChecksum.Encoded %s, got %s", i+1, expected, got)
    		}
    	}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 22 14:15:21 GMT 2025
    - 7.1K bytes
    - Click Count (0)
  5. internal/hash/checksum.go

    	}
    	return map[string]string{
    		c.Type.String():       c.Encoded,
    		xhttp.AmzChecksumType: c.Type.ObjType(),
    	}
    }
    
    // Equal returns whether two checksum structs are equal in all their fields.
    func (c *Checksum) Equal(s *Checksum) bool {
    	if c == nil || s == nil {
    		return c == s
    	}
    	return c.Type == s.Type &&
    		c.Encoded == s.Encoded &&
    		bytes.Equal(c.Raw, s.Raw) &&
    		c.WantParts == s.WantParts
    }
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 22 14:15:21 GMT 2025
    - 18.3K bytes
    - Click Count (0)
  6. cmd/erasure-coding.go

    				ok = false
    				continue
    			}
    			// Delete first shard and reconstruct...
    			first := encoded[0]
    			encoded[0] = nil
    			failOnErr(e.DecodeDataBlocks(encoded))
    			if a, b := first, encoded[0]; !bytes.Equal(a, b) {
    				fmt.Fprintf(os.Stderr, "%v: error on self-test [d:%d,p:%d]: want %#v, got %#v\n", algo, conf[0], conf[1], hex.EncodeToString(a), hex.EncodeToString(b))
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 8.5K bytes
    - Click Count (0)
  7. src/bufio/scan.go

    // ScanRunes is a split function for a [Scanner] that returns each
    // UTF-8-encoded rune as a token. The sequence of runes returned is
    // equivalent to that from a range loop over the input as a string, which
    // means that erroneous UTF-8 encodings translate to U+FFFD = "\xef\xbf\xbd".
    // Because of the Scan interface, this makes it impossible for the client to
    // distinguish correctly encoded replacement runes from encoding errors.
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed May 21 18:05:26 GMT 2025
    - 14.2K bytes
    - Click Count (0)
  8. internal/hash/reader.go

    		if r.contentHasher != nil {
    			if r.contentHash.Type.Trailing() {
    				var err error
    				r.contentHash.Encoded = r.trailer.Get(r.contentHash.Type.Key())
    				r.contentHash.Raw, err = base64.StdEncoding.DecodeString(r.contentHash.Encoded)
    				if err != nil || len(r.contentHash.Raw) == 0 {
    					return 0, ChecksumMismatch{Got: r.contentHash.Encoded}
    				}
    			}
    			if sum := r.contentHasher.Sum(nil); !bytes.Equal(r.contentHash.Raw, sum) {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Jun 25 15:08:54 GMT 2025
    - 11.8K bytes
    - Click Count (0)
  9. src/archive/tar/strconv_test.go

    		}
    	}
    }
    
    func TestParseNumeric(t *testing.T) {
    	vectors := []struct {
    		in   string
    		want int64
    		ok   bool
    	}{
    		// Test base-256 (binary) encoded values.
    		{"", 0, true},
    		{"\x80", 0, true},
    		{"\x80\x00", 0, true},
    		{"\x80\x00\x00", 0, true},
    		{"\xbf", (1 << 6) - 1, true},
    		{"\xbf\xff", (1 << 14) - 1, true},
    		{"\xbf\xff\xff", (1 << 22) - 1, true},
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 11 17:52:43 GMT 2025
    - 15K bytes
    - Click Count (0)
  10. src/archive/zip/struct.go

    	// always emitted. The legacy MS-DOS date field is encoded according to the
    	// location of the Modified time.
    	Modified time.Time
    
    	// ModifiedTime is an MS-DOS-encoded time.
    	//
    	// Deprecated: Use Modified instead.
    	ModifiedTime uint16
    
    	// ModifiedDate is an MS-DOS-encoded date.
    	//
    	// Deprecated: Use Modified instead.
    	ModifiedDate uint16
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue May 28 21:41:09 GMT 2024
    - 12.1K bytes
    - Click Count (0)
Back to Top