Cost that scales
Find loops, calls, and collection operations whose cost grows with input.
An ecosystem to estimate Big-O, measure structure, and explain results in builds, automation, and AI tools — without executing your code.
foreach (var item in items)
{
if (otherItems.Contains(item))
{
matches.Add(item);
}
}Different metrics answer different questions. This portal separates asymptotic cost, control structure, size, and inconclusive evidence so you can choose the right action.
Find loops, calls, and collection operations whose cost grows with input.
Track cyclomatic, cognitive, and nesting measures without confusing them with Big-O.
See Unknown when the supported subset cannot prove a safe conclusion.
Choose the integration by when and where you need evidence.
Support is deliberately documented, and every result preserves its assumptions.
O(n log n)Big-OSupported asymptotic growthCC = 11CyclomaticStructural pathsCOG = 17CognitiveComprehension loadUnknownInconclusiveNo invented assumptionDepth = 4NestingControl-flow depthNLOC = 42SizeLines, statements, and tokensHalsteadVocabularyAvailable internal metricsLINQOperationsMaterialization and orderingThe packages are independent. Adopt one surface or combine all three.
when feedback must travel with compilation and editing.
when you need reports, snapshots, and explicit gates.
when an agent needs local analysis and evidence.
The CLI returns stable exit codes; gates are opt-in, and Unknown results do not become proven regressions.
GitHub Actionsdotnet tool restore
mkdir -p artifacts
dotnet complexity-analysis analyze App.slnx \
--format sarif \
--max-cyclomatic-complexity 10 \
--output artifacts/complexity.sarifInstall it, produce the first result, then explore the models, contracts, and technical limits.