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.

lambda2210 LOC (22%) 32 files
lib1987 LOC (20%) 29 files
cdk1195 LOC (12%) 9 files
retired1007 LOC (10%) 12 files
printable-recipe-generator740 LOC (7%) 6 files
tools554 LOC (5%) 4 files
.github35 LOC (<1%) 1 file
.devcontainer10 LOC (<1%) 1 file

scope details...
  • 94 files, 7,738 LOC (80.4% 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.
lib310 commits (24%)
lambda235 commits (18%)
cdk204 commits (16%)
printable-recipe-generator85 commits (6%)
tools28 commits (2%)
.github3 commits (<1%)
retired2 commits (<1%)
.devcontainer2 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 2025 2024 2023
cdk
29
75
65
35
lambda
39
52
98
46
printable-recipe-generator
2
83
lib
21
49
147
93
tools
12
1
8
7
.github
3
retired
2
.devcontainer
2


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["retired"]
    n1["cdk"]
    n2["lib"]
    n3["lambda"]
    n0 ---|"2"| n0
    n0 ---|"1"| n1
    n2 ---|"1"| n1
    n3 ---|"1"| n1
    classDef default fill:#00b2ee,stroke:#ffffff,color:#000000;
    classDef highlighted fill:#00b2ee,stroke:#ffffff,color:#000000;
    linkStyle 0 stroke:#a0a0a070,stroke-width:2px
    linkStyle 1 stroke:#00688b5E,stroke-width:1px
    linkStyle 2 stroke:#00688b5E,stroke-width:1px
    linkStyle 3 stroke:#00688b5E,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:31