Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 9 of 9 for remainder (0.12 seconds)

  1. 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)
  2. 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)
  3. 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)
  4. 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)
  5. 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)
  6. doc/go_spec.html

    -    difference             integers, floats, complex values
    *    product                integers, floats, complex values
    /    quotient               integers, floats, complex values
    %    remainder              integers
    
    &amp;    bitwise AND            integers
    |    bitwise OR             integers
    ^    bitwise XOR            integers
    &amp;^   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)
  7. 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)
  8. 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)
  9. tensorflow/c/c_api.cc

          // Adding the gradients to the graph can alter the prefix to prevent
          // name collisions only if this prefix has not been provided explicitly
          // by the user. If it was provided, assert that it remained intact.
          if (prefix != nullptr && !absl::StartsWith(n->name(), prefix_cmp)) {
            status->status = tensorflow::errors::Internal(
                "BUG: The gradients prefix have been unexpectedly altered when "
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Sat Oct 04 05:55:32 GMT 2025
    - 102.4K bytes
    - Click Count (0)
Back to Top