Sloc, Cloc and Code: scc is a very fast accurate code counter with complexity calculations and COCOMO estimates written in pure Go
This report summarizes scanner evidence for boyter/scc, a Go project with 8,808 GitHub stars. SynthScan examined 87,048 lines of code across 272 source files, recording 204 pattern matches distributed across 11 syntactic categories. The legacy adjusted pattern signal is 4.2 (Low pattern signal); it is not an authorship estimate.
Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.
Use each vector to guide manual verification of the underlying findings.
Can maintainers explain intent, assumptions, and trade-offs? 184 finding(s).
Are imports declared and package/API names verified? 19 finding(s).
Are wrappers, guards, and repeated structures necessary? 1 finding(s).
Which changes need focused human review? 204 finding(s).
This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.
Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.
This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.
The scanner identified 204 distinct pattern matches across 11 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.
Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | config.go | 481 | } | COMMENT |
| LOW | test-all.sh | 41 | #if ./scc "examples/language/" --format cloc-yaml -o .tmp_scc_yaml >/dev/null && python <<EOS | COMMENT |
| LOW | test-all.sh | 61 | # rm -f .tmp_scc_yaml | COMMENT |
| LOW | README.md | 1301 | # HELP scc_lines Number of lines. | COMMENT |
| LOW | .goreleaser.yml | 41 | COMMENT | |
| LOW | regression_test.go | 21 | // changed by the registerFlags refactor, the shared @file tokenizer and the | COMMENT |
| LOW | regression_test.go | 561 | // TestRegressionConfigMinFlagClassifies fills a behavioural gap the existing | COMMENT |
| LOW | cmd/badges/example.py | 261 | # j = json.loads(content) | COMMENT |
| LOW | processor/counters_javascript.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/counters_javascript.go | 21 | // And a slash that is a division, a comment, or a regular expression literal | COMMENT |
| LOW | processor/counters_javascript.go | 61 | COMMENT | |
| LOW | processor/counters_javascript.go | 81 | // c 2.44% against a 3.61% and s 3.31% for case. | COMMENT |
| LOW | processor/counters_javascript.go | 121 | COMMENT | |
| LOW | processor/counters_javascript.go | 181 | } | COMMENT |
| LOW | processor/counters_fuzz_test.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/history_worktree_test.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/counters_php.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/counters_php.go | 21 | // counters_shared.go. | COMMENT |
| LOW | processor/counters_php.go | 61 | // l else | COMMENT |
| LOW | processor/counters_php.go | 101 | // phpStopTable picks the table the scan runs with. The global reads as | COMMENT |
| LOW | processor/counters_php.go | 161 | COMMENT | |
| LOW | processor/counters_scala.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/counters_scala.go | 21 | // | COMMENT |
| LOW | processor/counters_scala.go | 61 | // | COMMENT |
| LOW | processor/counters_scala.go | 181 | // checks anchored on their own first byte are looked for here; the rest are | COMMENT |
| LOW | processor/summary_totals.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/detector_plan.go | 21 | // candidate languages and then: | COMMENT |
| LOW | processor/detector_plan.go | 41 | // isAnchorSkip reports whether a byte is one the line walk steps over before | COMMENT |
| LOW | processor/detector_plan.go | 81 | // matches at the start of the text it is given, so it can be tried at a known | COMMENT |
| LOW | processor/counters_java.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/counters_java.go | 61 | // h catch | COMMENT |
| LOW | processor/counters_java.go | 101 | return &javaStopNoComplexity | COMMENT |
| LOW | processor/counters_java.go | 341 | return index, state | COMMENT |
| LOW | processor/counters_swift.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/counters_swift.go | 21 | // Swift also writes most of its keywords with a space and no bracket form: | COMMENT |
| LOW | processor/counters_swift.go | 61 | } | COMMENT |
| LOW | processor/counters_swift.go | 81 | // The bytes are chosen so that no check holds the anchor of another check in a | COMMENT |
| LOW | processor/counters_swift.go | 181 | // swiftComplexityAtLineStart is swiftComplexityAnchored for the first byte of | COMMENT |
| LOW | processor/formatters_test.go | 781 | Debug = false | COMMENT |
| LOW | processor/formatters_test.go | 1201 | res := fileSummarize(inputChan) | COMMENT |
| LOW | processor/formatters_test.go | 1261 | # TYPE scc_code gauge | COMMENT |
| LOW | processor/counters_shared_test.go | 381 | } | COMMENT |
| LOW | processor/processor.go | 581 | // languages share extensions so we take the first registered language | COMMENT |
| LOW | processor/counters_ruby.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/counters_ruby.go | 21 | // counters_shared.go. | COMMENT |
| LOW | processor/counters_ruby.go | 41 | // same flag. | COMMENT |
| LOW | processor/counters_ruby.go | 81 | // over 19.3MB of rails: f 1.18% against i 3.82%, o 4.40% and r 4.21% for if and | COMMENT |
| LOW | processor/counters_ruby.go | 101 | // and pay the extra stops, or to prove the backwards read still cannot cross a | COMMENT |
| LOW | processor/counters_ruby.go | 121 | // wants an i behind it, w an s, l an e, and = an = or a !. For any of those to | COMMENT |
| LOW | processor/counters_ruby.go | 161 | COMMENT | |
| LOW | processor/counters_ruby.go | 241 | return wordStartsAt(content, index, floor) && hasPrefixAt(content, index+1, floor, "& ") | COMMENT |
| LOW | processor/report_render.go | 101 | // - bare `--report` and the file doesn't exist: proceed. | COMMENT |
| LOW | processor/git_open.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/counters_assembly.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | processor/counters_assembly.go | 21 | // else, so the opener test for them is spaceOpens rather than cOpens. Reading | COMMENT |
| LOW | processor/counters_assembly.go | 61 | COMMENT | |
| LOW | processor/counters_assembly.go | 121 | // Where the anchor is not the first byte of the check the bytes in front of it | COMMENT |
| LOW | processor/counters_assembly.go | 221 | // | COMMENT |
| LOW | processor/cocomo_test.go | 41 | // TestEstimateCostMonthlyWagePrecision guards the monthly-wage division: the annual | COMMENT |
| LOW | processor/cognitive_nesting_test.go | 1 | // SPDX-License-Identifier: MIT | COMMENT |
| 102 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 55 | if (o.toString().length() == word.length()) { | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 55 | if (o.toString().length() == word.length()) { | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 56 | bestMatch = o.toString(); | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 83 | if (o.toString().length() == word.length()) { | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 83 | if (o.toString().length() == word.length()) { | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 84 | bestMatch = o.toString(); | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 110 | for (int i = 1; i < word.length() + 1; i++) { | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 114 | closeWords.add(sb.toString()); | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 118 | for (int i = 1; i < word.length(); i++) { | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 122 | closeWords.add(sb.toString()); | CODE |
| HIGH⚡ | examples/performance_tests/create_performance_test.py | 126 | closeWords.add(sb.toString()); | CODE |
| HIGH | examples/performance_tests/create_performance_test.py | 12 | private Map<String, Integer> dictionary = null; | CODE |
| HIGH | examples/performance_tests/create_performance_test.py | 31 | if (word == null || word.trim().isEmpty()) { | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM⚡ | examples/performance_tests/create_folders_with_files.py | 15 | # Create a directory thats quite deep and put a 10000 files at the end | COMMENT |
| MEDIUM⚡ | examples/performance_tests/create_folders_with_files.py | 23 | # Create a directory thats quite deep and put 100 files in each folder | COMMENT |
| MEDIUM⚡ | examples/performance_tests/create_folders_with_files.py | 33 | # Create a directory that has a single level and put 10000 files in it | COMMENT |
| MEDIUM⚡ | examples/performance_tests/create_folders_with_files.py | 41 | # Create a directory that has a two levels with 10000 directories in the second with a single file in each | COMMENT |
| MEDIUM⚡ | examples/performance_tests/create_folders_with_files.py | 51 | # Create a directory that with 10 subdirectories and 1000 files in each | COMMENT |
| MEDIUM | examples/performance_tests/create_folders_with_files.py | 62 | # Create a directory that with 20 subdirectories and 500 files in each | COMMENT |
| MEDIUM | examples/performance_tests/create_folders_with_files.py | 73 | # Create a directory that with 5 subdirectories and 2000 files in each | COMMENT |
| MEDIUM | examples/performance_tests/create_folders_with_files.py | 84 | # Create a directory that with 100 subdirectories and 100 files in each | COMMENT |
| MEDIUM⚡ | examples/performance_tests/create_performance_test.py | 165 | # Create a directory thats quite deep and put a 10000 files at the end | COMMENT |
| MEDIUM⚡ | examples/performance_tests/create_performance_test.py | 173 | # Create a directory thats quite deep and put 100 files in each folder | COMMENT |
| MEDIUM⚡ | examples/performance_tests/create_performance_test.py | 183 | # Create a directory that has a single level and put 10000 files in it | COMMENT |
| MEDIUM⚡ | examples/performance_tests/create_performance_test.py | 191 | # Create a directory that has a two levels with 10000 directories in the second with a single file in each | COMMENT |
| MEDIUM⚡ | examples/performance_tests/create_performance_test.py | 201 | # Create a directory that with 10 subdirectories and 1000 files in each | COMMENT |
| MEDIUM | examples/performance_tests/create_performance_test.py | 212 | # Create a directory that with 20 subdirectories and 500 files in each | COMMENT |
| MEDIUM | examples/performance_tests/create_performance_test.py | 223 | # Create a directory that with 5 subdirectories and 2000 files in each | COMMENT |
| MEDIUM | examples/performance_tests/create_performance_test.py | 234 | # Create a directory that with 100 subdirectories and 100 files in each | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| CRITICAL | examples/minified/jquery-3.1.1.min.js | 4 | void 0!==c?null===c?void r.removeAttr(a,b):e&&"set"in e&&void 0!==(d=e.set(a,c,b))?d:(a.setAttribute(b,c+""),c):e&&"get" | CODE |
| CRITICAL⚡ | examples/minified/app-5cddf2000f4491a89a40.js | 1 | (window.webpackJsonp=window.webpackJsonp||[]).push([[2],[function(e,t,n){"use strict";e.exports=n(184)},function(e,t,n){ | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | README.md | 667 | - < 55% (High Boilerplate): High repetition. Likely due to mandatory error handling, auto-generated code, or verbose con | CODE |
| HIGH | processor/processor.go | 708 | // LoadLanguageFeature will load a single feature as requested given the name | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM⚡ | examples/minified/app-5cddf2000f4491a89a40.js | 1 | (window.webpackJsonp=window.webpackJsonp||[]).push([[2],[function(e,t,n){"use strict";e.exports=n(184)},function(e,t,n){ | CODE |
| MEDIUM⚡ | examples/minified/app-5cddf2000f4491a89a40.js | 1 | (window.webpackJsonp=window.webpackJsonp||[]).push([[2],[function(e,t,n){"use strict";e.exports=n(184)},function(e,t,n){ | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | examples/minified/jquery.dataTables.min.js | 41 | g):j+g,b=h("<div/>",{id:!f.f?c+"_filter":null,"class":b.sFilter}).append(h("<label/>").append(j)),f=function(){var b=!th | CODE |
| LOW⚡ | examples/minified/app-5cddf2000f4491a89a40.js | 1 | (window.webpackJsonp=window.webpackJsonp||[]).push([[2],[function(e,t,n){"use strict";e.exports=n(184)},function(e,t,n){ | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | cmd/badges/example.py | 10 | CODE | |
| LOW | examples/oneline.py | 1 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | processor/workers.go | 834 | // If so we need to check if where we are falls into these conditions | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | cmd/badges/example.py | 100 | except Exception: | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | cmd/badges/example.py | 19 | CODE |