cha-parser 0.6.3

Tree-sitter based AST parser for Cha (TypeScript, Rust)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

package main

// CognitiveComplexity should be:
// for: +1
//   for: +2 (nesting=1)
//     if: +3 (nesting=2)
//       continue: +1 (label)
// Total = 7
func SumOfPrimes(max int) int {
	var total int
OUT:
	for i := 1; i < max; i++ {
		for j := 2; j < i; j++ {
			if i%j == 0 {
				continue OUT
			}
		}
		total += i
	}
	return total
}