- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 13 for remainder (0.09 seconds)
-
internal/grid/types.go
// Set a key, value pair. func (m *MSS) Set(key, value string) { if m == nil { *m = mssPool.Get() } (*m)[key] = value } // UnmarshalMsg deserializes m from the provided byte slice and returns the // remainder of bytes. func (m *MSS) UnmarshalMsg(bts []byte) (o []byte, err error) { if m == nil { return bts, errors.New("MSS: UnmarshalMsg on nil pointer") } if msgp.IsNil(bts) { bts = bts[1:] *m = nil
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 15.5K bytes - Click Count (0) -
internal/s3select/sql/jsonpath.go
default: return nil, false, errWildcardObjectLookup } case p[0].ArrayWildcard: arr, ok := v.([]any) if !ok { return nil, false, errWildcardArrayLookup } // Lookup remainder of path in each array element and // make result array. var result []any for _, a := range arr { rval, flatten, err := jsonpathEval(p[1:], a) if err != nil { return nil, false, err }Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 3.4K bytes - Click Count (0) -
internal/s3select/sql/stringfuncs.go
s = append(s, r) } } if hasLeadingPercent { return strings.HasSuffix(text, string(s)), nil } return string(s) == text, nil } // matcher - Finds `pat` in `text`, and returns the part remainder of // `text`, after the match. If leadingPercent is false, `pat` must be // the prefix of `text`, otherwise it must be a substring. func matcher(text, pat string, leadingPercent bool) (res string, match bool) {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Feb 18 16:25:55 GMT 2025 - 4.2K bytes - Click Count (0) -
internal/ioutil/ioutil.go
// closing 'w'. if err = disk.DisableDirectIO(file); err != nil { return written, err } // buf is not aligned, hence use writeUnaligned() // for the remainder un, err = w.Write(buf[len(buf)-remain:]) nw += int64(un) } if nw > 0 { written += nw } if err != nil { return written, err } if nw != int64(len(buf)) {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Feb 18 16:25:55 GMT 2025 - 11.1K bytes - Click Count (0) -
src/archive/tar/strconv.go
} // parsePAXRecord parses the input PAX record string into a key-value pair. // If parsing is successful, it will slice off the currently read record and // return the remainder as r. func parsePAXRecord(s string) (k, v, r string, err error) { // The size field ends at the first space. nStr, rest, ok := strings.Cut(s, " ") if !ok { return "", "", s, ErrHeader }
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Mon Sep 08 17:08:20 GMT 2025 - 9.1K bytes - Click Count (0) -
src/bytes/bytes.go
// If sep is empty, SplitN splits after each UTF-8 sequence. // The count determines the number of subslices to return: // - n > 0: at most n subslices; the last subslice will be the unsplit remainder; // - n == 0: the result is nil (zero subslices); // - n < 0: all subslices. // // To split around the first instance of a separator, see [Cut].
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) -
src/archive/tar/reader.go
// normally be visible to the outside. As such, this loop iterates through // one or more "header files" until it finds a "normal file". format := FormatUSTAR | FormatPAX | FormatGNU for { // Discard the remainder of the file and any padding. if err := discard(tr.r, tr.curr.physicalRemaining()); err != nil { return nil, err } if _, err := tryReadFull(tr.r, tr.blk[:tr.pad]); err != nil { return nil, err }
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Oct 07 19:46:36 GMT 2025 - 26.9K bytes - Click Count (0) -
doc/go_spec.html
- difference integers, floats, complex values * product integers, floats, complex values / quotient integers, floats, complex values % remainder integers & bitwise AND integers | bitwise OR integers ^ bitwise XOR integers &^ bit clear (AND NOT) integers
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Dec 02 23:07:19 GMT 2025 - 286.5K bytes - Click Count (1) -
lib/fips140/v1.0.0-c2097c7c.zip
// [ q/2, q + q/2 ) -> round to 1 // [ q + q/2, 2q ) -> round to 2 // // We can convert that to the following logic: add 1 if remainder > q/2, // then add 1 again if remainder > q + q/2. // // Note that if remainder > x, then ⌊x⌋ - remainder underflows, and the top // bit of the difference will be set. quotient += (q/2 - remainder) >> 31 & 1 quotient += (q + q/2 - remainder) >> 31 & 1 // quotient might have overflowed at this point, so reduce it by masking. var mask uint32 = (1 << d) - 1 return uint16(quotient...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
lib/fips140/v1.1.0-rc1.zip
// [ q/2, q + q/2 ) -> round to 1 // [ q + q/2, 2q ) -> round to 2 // // We can convert that to the following logic: add 1 if remainder > q/2, // then add 1 again if remainder > q + q/2. // // Note that if remainder > x, then ⌊x⌋ - remainder underflows, and the top // bit of the difference will be set. quotient += (q/2 - remainder) >> 31 & 1 quotient += (q + q/2 - remainder) >> 31 & 1 // quotient might have overflowed at this point, so reduce it by masking. var mask uint32 = (1 << d) - 1 return uint16(quotient...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)