Method Parser.parseSimpleStmt has 71 lines of code (exceeds 50 allowed). Consider refactoring.

Open

func (p *Parser) parseSimpleStmt(forIn bool) Stmt {
    if p.trace {
        defer untracep(tracep(p, "SimpleStmt"))
    }

Method SimpleOptimizer.unaryop has 69 lines of code (exceeds 50 allowed). Consider refactoring.

Open

func (so *SimpleOptimizer) unaryop(
    op token.Token,
    expr parser.Expr,
) (parser.Expr, bool) {

Method VM.xOpUnary has 69 lines of code (exceeds 50 allowed). Consider refactoring.

Confirmed

func (vm *VM) xOpUnary() error {
    tok := token.Token(vm.curInsts[vm.ip+1])
    right := vm.stack[vm.sp-1]
    var value Object

Method Compiler.compileImportExpr has 66 lines of code (exceeds 50 allowed). Consider refactoring.

Open

func (c *Compiler) compileImportExpr(node *parser.ImportExpr) error {
    moduleName := node.ModuleName
    if moduleName == "" {
        return c.errorf(node, "empty module name")
    }

Method Scanner.scanNumber has 65 lines of code (exceeds 50 allowed). Consider refactoring.

Open

func (s *Scanner) scanNumber(seenDecimalPoint bool) (tok token.Token, lit string) {
    // digitVal(s.ch) < 10
    offs := s.offset
    tok = token.Int

Method VM.xOpSliceIndex has 65 lines of code (exceeds 50 allowed). Consider refactoring.

Confirmed

func (vm *VM) xOpSliceIndex() error {
    obj := vm.stack[vm.sp-3]
    left := vm.stack[vm.sp-2]
    right := vm.stack[vm.sp-1]
    vm.stack[vm.sp-3] = nil

Method VM.xOpUnary has a Cognitive Complexity of 28 (exceeds 20 allowed). Consider refactoring.

Confirmed

func (vm *VM) xOpUnary() error {
    tok := token.Token(vm.curInsts[vm.ip+1])
    right := vm.stack[vm.sp-1]
    var value Object

• Read up
  Read up

Method Compiler.compileForInStmt has 54 lines of code (exceeds 50 allowed). Consider refactoring.

Open

func (c *Compiler) compileForInStmt(stmt *parser.ForInStmt) error {
    c.symbolTable = c.symbolTable.Fork(true)
    defer func() {
        c.symbolTable = c.symbolTable.Parent(false)
    }()

Method RuntimeError.Format has a Cognitive Complexity of 25 (exceeds 20 allowed). Consider refactoring.

Open

func (o *RuntimeError) Format(s fmt.State, verb rune) {
    switch verb {
    case 'v', 's':
        switch {
        case s.Flag('+'):

• Read up
  Read up

Function builtinSortReverseFunc has 10 return statements (exceeds 4 allowed).

Open

func builtinSortReverseFunc(arg Object) (Object, error) {
    switch obj := arg.(type) {
    case Array:
        var err error
        sort.Slice(obj, func(i, j int) bool {

Method SimpleOptimizer.unaryop has 9 return statements (exceeds 4 allowed).

Open

func (so *SimpleOptimizer) unaryop(
    op token.Token,
    expr parser.Expr,
) (parser.Expr, bool) {

Method Parser.parseOperand has 9 return statements (exceeds 4 allowed).

Open

func (p *Parser) parseOperand() Expr {
    if p.trace {
        defer untracep(tracep(p, "Operand"))
    }

Function parseFuncEx has 8 return statements (exceeds 4 allowed).

Confirmed

func parseFuncEx(c ugo.Call) (ugo.Object, error) {
    size := c.Len()
    if size != 2 && size != 3 {
        return ugo.Undefined, ugo.ErrWrongNumArguments.NewError(
            "want=2..3 got=" + strconv.Itoa(size))

Avoid deeply nested control flow statements.

Open

                    switch err {
                    case ErrNotIndexable:
                        err = ErrNotIndexable.NewError(target.TypeName())
                    case ErrIndexOutOfBounds:
                        err = ErrIndexOutOfBounds.NewError(index.String())

Avoid deeply nested control flow statements.

Open

                    if err = vm.throwGenErr(err); err != nil {
                        vm.err = err
                        return
                    }

Avoid deeply nested control flow statements.

Open

                for i := vm.sp; i >= handler.sp; i-- {
                    vm.stack[i] = nil
                }

Method SimpleOptimizer.optimize has 6 return statements (exceeds 4 allowed).

Open

func (so *SimpleOptimizer) optimize(node parser.Node) (parser.Expr, bool) {
    if so.trace != nil {
        if node != nil {
            defer untraceoptim(traceoptim(so, fmt.Sprintf("%s (%s)",
                node.String(), reflect.TypeOf(node).Elem().Name())))

Method Compiler.compileForInStmt has 6 return statements (exceeds 4 allowed).

Open

func (c *Compiler) compileForInStmt(stmt *parser.ForInStmt) error {
    c.symbolTable = c.symbolTable.Fork(true)
    defer func() {
        c.symbolTable = c.symbolTable.Parent(false)
    }()

Method Compiler.compileModule has 6 return statements (exceeds 4 allowed).

Open

func (c *Compiler) compileModule(
    node parser.Node,
    modulePath string,
    moduleMap *ModuleMap,
    src []byte,

Method Compiler.Compile has 6 return statements (exceeds 4 allowed).

Open

func (c *Compiler) Compile(node parser.Node) error {
    if c.trace != nil {
        if node != nil {
            defer untracec(tracec(c, fmt.Sprintf("%s (%s)",
                node.String(), reflect.TypeOf(node).Elem().Name())))