:gem:Collection of algorithms and data structures
This report summarizes scanner evidence for indy256/codelibrary, a Java project with 2,026 GitHub stars. SynthScan examined 31,422 lines of code across 366 source files, recording 144 pattern matches distributed across 6 syntactic categories. The legacy adjusted pattern signal is 6.8 (Moderate 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? 139 finding(s).
Are imports declared and package/API names verified? 5 finding(s).
Are wrappers, guards, and repeated structures necessary? 0 finding(s).
Which changes need focused human review? 144 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 144 distinct pattern matches across 6 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 | java/misc/AllNearestSmallerValues.java | 56 | // Usage example | COMMENT |
| LOW | java/strings/SuffixArray.java | 96 | // Usage example | COMMENT |
| LOW | java/strings/StringDistances.java | 59 | // Usage example | COMMENT |
| LOW | java/strings/SuffixArrayDC3.java | 126 | // Usage example | COMMENT |
| LOW | java/strings/Manacher.java | 42 | // Usage example | COMMENT |
| LOW | java/strings/AhoCorasick.java | 45 | // Usage example | COMMENT |
| LOW | java/strings/SuffixTree.java | 73 | // Usage example | COMMENT |
| LOW | java/strings/AhoCorasickSimple.java | 34 | // Usage example | COMMENT |
| LOW | java/strings/ZFunction.java | 21 | // Usage example | COMMENT |
| LOW | java/strings/Trie.java | 32 | // Usage example | COMMENT |
| LOW | java/structures/BinaryHeapIndexed.java | 86 | // Usage example | COMMENT |
| LOW | java/structures/HeavyLight.java | 88 | // Usage example | COMMENT |
| LOW | java/structures/MergeableHeap.java | 55 | // Usage example | COMMENT |
| LOW | java/structures/DisjointSets.java | 23 | // Usage example | COMMENT |
| LOW | java/structures/PersistentTree.java | 44 | // Usage example | COMMENT |
| LOW | java/structures/SegmentTree.java | 163 | // Usage example | COMMENT |
| LOW | java/structures/QueueMin.java | 29 | // Usage example | COMMENT |
| LOW | java/structures/BinarySearchTree.java | 99 | // Usage example | COMMENT |
| LOW | java/structures/DoublyLinkedList.java | 25 | // Usage example | COMMENT |
| LOW | java/structures/FenwickTree.java | 30 | // Usage example | COMMENT |
| LOW | java/structures/FenwickTree2D.java | 30 | // Usage example | COMMENT |
| LOW | java/structures/SegmentTreeWithoutRecursion.java | 25 | // Usage example | COMMENT |
| LOW | java/structures/Tree2d.java | 43 | // Usage example | COMMENT |
| LOW | java/structures/WaveletTree.java | 90 | // Usage example | COMMENT |
| LOW | java/structures/QuadTree.java | 62 | // Usage example | COMMENT |
| LOW | java/structures/CentroidDecomposition.java | 57 | // Usage example | COMMENT |
| LOW | java/structures/FenwickTreeExtended.java | 83 | // Usage example | COMMENT |
| LOW | java/structures/KdTreeRectQuery.java | 124 | // Usage example | COMMENT |
| LOW | java/numbertheory/Euclid.java | 104 | // Usage example | COMMENT |
| LOW | java/numbertheory/Rational.java | 95 | // Usage example | COMMENT |
| LOW | java/numbertheory/Factorization.java | 80 | // Usage example | COMMENT |
| LOW | java/numbertheory/MultiplicativeFunction.java | 61 | // Usage example | COMMENT |
| LOW | java/numbertheory/PrimesAndDivisors.java | 103 | // Usage example | COMMENT |
| LOW | java/optimization/Simplex.java | 93 | // Usage example | COMMENT |
| LOW | java/optimization/HillClimbing.java | 39 | // Usage example | COMMENT |
| LOW | java/optimization/MeetInTheMiddle.java | 36 | // Usage example | COMMENT |
| LOW | java/optimization/ConvexHullOptimization.java | 31 | // Usage example | COMMENT |
| LOW | java/numeric/KaratsubaMultiply.java | 42 | // Usage example | COMMENT |
| LOW | java/numeric/Fraction.java | 50 | // Usage example | COMMENT |
| LOW | java/numeric/NewtonInterpolation.java | 40 | // Usage example | COMMENT |
| LOW | java/numeric/SimpsonIntegration.java | 21 | // Usage example | COMMENT |
| LOW | java/numeric/WalshHadamarTransform.java | 52 | // Usage example | COMMENT |
| LOW | java/combinatorics/NumberIterator.java | 22 | // Usage example | COMMENT |
| LOW | java/combinatorics/PruferCode.java | 77 | // Usage example | COMMENT |
| LOW | java/combinatorics/Partitions.java | 101 | // Usage example | COMMENT |
| LOW | java/combinatorics/RandomPermutation.java | 59 | // Usage example | COMMENT |
| LOW | java/combinatorics/Combinations.java | 75 | // Usage example | COMMENT |
| LOW | java/combinatorics/Arrangements.java | 81 | // Usage example | COMMENT |
| LOW | java/combinatorics/Permutations.java | 106 | // Usage example | COMMENT |
| LOW | java/combinatorics/SetPartitions.java | 34 | // Usage example | COMMENT |
| LOW | java/combinatorics/RandomGraph.java | 96 | // Usage example | COMMENT |
| LOW | java/combinatorics/BinomialCoefficients.java | 56 | // Usage example | COMMENT |
| LOW | java/combinatorics/BracketSequences.java | 23 | // Usage example | COMMENT |
| LOW | java/dp/ShortestHamiltonianCycle.java | 46 | // Usage example | COMMENT |
| LOW | java/dp/MaxPalindrome.java | 58 | // Usage example | COMMENT |
| LOW | java/dp/ShortestHamiltonianPath.java | 49 | // Usage example | COMMENT |
| LOW | java/dp/Lis.java | 41 | // Usage example | COMMENT |
| LOW | java/dp/LisSlow.java | 33 | // Usage example | COMMENT |
| LOW | java/linearalgebra/Matrix.java | 63 | // Usage example | COMMENT |
| LOW | java/linearalgebra/Gauss.java | 36 | // Usage example | COMMENT |
| 61 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | python/segment_tree_interval_add_max.py | 12 | self.push(node) | CODE |
| HIGH | python/segment_tree_interval_add_max.py | 27 | self.push(node) | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | python/mwmatching.py | 101 | neighbend = [ [ ] for i in range(nvertex) ] | COMMENT |
| LOW | python/mwmatching.py | 121 | # Labels are assigned during a stage and reset after each augmentation. | COMMENT |
| LOW | python/mwmatching.py | 141 | # If b is a top-level blossom, blossomparent[b] is -1. | COMMENT |
| LOW | python/mwmatching.py | 161 | # or -1 if there is no such edge. | COMMENT |
| LOW | java/structures/LinkCutTreeConnectivity.java | 61 | } | COMMENT |
| LOW | java/structures/LinkCutTreeLca.java | 41 | boolean leftChildX = (x == p.left); | COMMENT |
| LOW | java/structures/LinkCutTree.java | 101 | } | COMMENT |
| LOW | java/parsing/ExpressionParserRecursiveDescent.java | 41 | } | COMMENT |
| LOW | cpp/structures/link_cut_tree.cpp | 101 | // zig-zig case | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | python/min_cost_flow.py | 19 | CODE | |
| LOW | python/min_cost_flow.py | 47 | CODE | |
| LOW | python/mwmatching.py | 42 | CODE | |
| LOW | python/mwmatching.py | 200 | CODE | |
| LOW | python/mwmatching.py | 273 | CODE | |
| LOW | python/mwmatching.py | 362 | CODE | |
| LOW | python/mwmatching.py | 581 | CODE | |
| LOW | python/mwmatching.py | 599 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | python/min_cost_flow.py | 2 | CODE | |
| LOW | python/dijkstra_heap.py | 2 | CODE | |
| LOW | python/mwmatching.py | 25 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | python/mwmatching.py | 316 | # Set label to S. | COMMENT |