Logical Decomposition #1: PRIMARY

The decompositions is based on the folder structure at level 1 (relative to the source code root).

Bubble Chart | Tree Map
Component Sizes (Lines of Code)
The "primary" logical decomposition has 8 components.

sdk49958 LOC (29%) 168 files
plugins36807 LOC (21%) 118 files
github-action1243 LOC (<1%) 16 files
evals385 LOC (<1%) 9 files
.github321 LOC (<1%) 6 files
docker171 LOC (<1%) 2 files
ROOT92 LOC (<1%) 4 files
.ona25 LOC (<1%) 1 file

scope details...
  • 324 files, 89,002 LOC (52.1% vs. main code).
Component Commits
Components ordered by number of commits
Total Commits per Component
All commits, some commits may include files from multiple components.
sdk386 commits (43%)
plugins128 commits (14%)
.github10 commits (1%)
ROOT6 commits (<1%)
github-action5 commits (<1%)
evals4 commits (<1%)
.ona4 commits (<1%)
docker4 commits (<1%)
Yearly File Updates Trend per Components
The number of file changes in commits
animated commit history: all time cumulative | 12 months window
2026
sdk
386
plugins
128
.github
10
ROOT
6
github-action
5
evals
4
.ona
4
docker
4


Dependencies between components in same commits (past 180 days)
The number on the lines shows the number of shared commits.
See detailed temporal dependencies report...

flowchart TB
    n0["sdk"]
    n1["plugins"]
    n2["ROOT"]
    n3["docker"]
    n4[".github"]
    n5["evals"]
    n6["github-action"]
    n0 ---|"220"| n0
    n1 ---|"66"| n1
    n0 ---|"39"| n1
    n2 ---|"5"| n0
    n3 ---|"4"| n0
    n4 ---|"3"| n4
    n4 ---|"3"| n0
    n5 ---|"3"| n5
    n5 ---|"2"| n0
    n6 ---|"1"| n6
    n6 ---|"1"| n0
    n1 ---|"1"| n5
    n4 ---|"1"| n5
    n4 ---|"1"| n6
    n3 ---|"1"| n1
    n2 ---|"1"| n1
    n2 ---|"1"| n3
    n2 ---|"1"| n2
    n3 ---|"1"| n3
    classDef default fill:#00b2ee,stroke:#ffffff,color:#000000;
    classDef highlighted fill:#00b2ee,stroke:#ffffff,color:#000000;
    linkStyle 0 stroke:#a0a0a0FF,stroke-width:10px
    linkStyle 1 stroke:#a0a0a082,stroke-width:3px
    linkStyle 2 stroke:#00688b5E,stroke-width:1px
    linkStyle 3 stroke:#00688b4C,stroke-width:1px
    linkStyle 4 stroke:#00688b4C,stroke-width:1px
    linkStyle 5 stroke:#a0a0a04C,stroke-width:1px
    linkStyle 6 stroke:#00688b4C,stroke-width:1px
    linkStyle 7 stroke:#a0a0a04C,stroke-width:1px
    linkStyle 8 stroke:#00688b4C,stroke-width:1px
    linkStyle 9 stroke:#a0a0a04C,stroke-width:1px
    linkStyle 10 stroke:#00688b4C,stroke-width:1px
    linkStyle 11 stroke:#00688b4C,stroke-width:1px
    linkStyle 12 stroke:#00688b4C,stroke-width:1px
    linkStyle 13 stroke:#00688b4C,stroke-width:1px
    linkStyle 14 stroke:#00688b4C,stroke-width:1px
    linkStyle 15 stroke:#00688b4C,stroke-width:1px
    linkStyle 16 stroke:#00688b4C,stroke-width:1px
    linkStyle 17 stroke:#a0a0a04C,stroke-width:1px
    linkStyle 18 stroke:#a0a0a04C,stroke-width:1px

About This Analysis

Logical decomposition is a representation of the organization of the main source code, where every and each file is put in exactly one logical component.

  • A software system can have one or more logical decompositions.
  • A logical decomposition can be defined in two ways in Sokrates.
  • First approach is based on the folders structure. Components are mapped to folders at defined folder depth relative to the source code root.
  • Second approach is based on explicit definition of each component. In such explicit definitions, components are explicitly named and their files are selected based on explicitly defined path and content filters.
  • A logical decomposition is considered invalid if a file is selected into two or more components. This constraint is introduced in order to facilitate measuring of dependencies among components.
  • Files not assigned to any component are put into a special "Unclassified" component.


2026-10-07 12:00