- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for Parker (0.3 sec)
-
src/archive/tar/strconv.go
b = append(b, byte(c)) } } return string(b) } type parser struct { err error // Last error seen } type formatter struct { err error // Last error seen } // parseString parses bytes as a NUL-terminated C-style string. // If a NUL byte is not found then the whole slice is returned as a string. func (*parser) parseString(b []byte) string { if i := bytes.IndexByte(b, 0); i >= 0 {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 01 14:28:42 GMT 2023 - 9K bytes - Viewed (0) -
.github/ISSUE_TEMPLATE/11-language-change.yml
validations: required: false - type: textarea id: learning-curve attributes: label: "Would this change make Go easier or harder to learn, and why?" - type: textarea id: cost-description attributes: label: "Cost Description" description: "What is the cost of this proposal? (Every language change has a cost)"
Others - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Nov 22 20:49:24 GMT 2023 - 4.7K bytes - Viewed (0) -
src/bytes/compare_test.go
// difference that for some j, a[j]>b[j] and a[j+1]<b[j+1]. If the implementation // compares large chunks with wrong endianness, it gets wrong result. // no vector register is larger than 512 bytes for now const maxLength = 512 a := make([]byte, maxLength) b := make([]byte, maxLength) // randomish but deterministic data. No 0 or 255. for i := 0; i < maxLength; i++ {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Jul 13 23:11:42 GMT 2023 - 6.8K bytes - Viewed (0)