Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for argMap (0.04 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/cmd/asm/internal/lex/input.go

    		args = nil
    	} else if len(args) != len(macro.args) {
    		in.Error("wrong arg count for macro", macro.name)
    	}
    	argMap := make(map[string][]Token)
    	for i, arg := range args {
    		argMap[macro.args[i]] = arg
    	}
    	return argMap
    }
    
    // collectArgument returns the actual tokens for a single argument of a macro.
    // It also returns the token that terminated the argument, which will always
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Nov 12 03:59:40 GMT 2025
    - 12.4K bytes
    - Click Count (0)
  2. internal/s3select/sql/aggregation.go

    		e.aggregate.runningCount++
    		// Convert to float.
    		f, ok := argVal.ToFloat()
    		if !ok {
    			return fmt.Errorf("Could not convert value %v (%s) to a number", argVal.value, argVal.GetTypeString())
    		}
    		argVal.setFloat(f)
    		err = e.aggregate.runningSum.arithOp(opPlus, argVal)
    
    	case aggFnMin:
    		err = e.aggregate.runningMin.minmax(argVal, false, isFirstRow)
    
    	case aggFnMax:
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sat Dec 23 07:19:11 GMT 2023
    - 7.9K bytes
    - Click Count (0)
  3. docs/debugging/reorder-disks/main.go

    	return fmt.Sprintf("%d:%d", major, minor), nil
    }
    
    func filterLocalDisks(node, args string) ([]localDisk, error) {
    	var result []localDisk
    
    	argP, err := ellipses.FindEllipsesPatterns(args)
    	if err != nil {
    		return nil, err
    	}
    	exp := argP.Expand()
    
    	if node == "" {
    		for index, e := range exp {
    			result = append(result, localDisk{index: index, path: strings.Join(e, "")})
    		}
    	} else {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri May 24 23:05:23 GMT 2024
    - 5.4K bytes
    - Click Count (0)
Back to Top