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.

lambda7436 LOC (2%) 99 files
stateMachine481 LOC (<1%) 2 files
android-price-rise443 LOC (<1%) 5 files
tools121 LOC (<1%) 2 files
dynamoDb77 LOC (<1%) 5 files
project22 LOC (<1%) 1 file
.github8 LOC (<1%) 1 file
ROOT7 LOC (<1%) 1 file

scope details...
  • 116 files, 8,595 LOC (2.8% 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.
lambda1908 commits (47%)
project635 commits (15%)
stateMachine81 commits (2%)
dynamoDb45 commits (1%)
android-price-rise22 commits (<1%)
tools16 commits (<1%)
ROOT4 commits (<1%)
.github3 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 2022 2021 2020
lambda
384
534
259
261
103
9
358
project
90
89
116
187
47
52
54
stateMachine
16
7
11
16
6
1
24
android-price-rise
14
8
tools
12
4
ROOT
4
dynamoDb
3
5
2
35
.github
2
1


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["lambda"]
    n1["stateMachine"]
    n2["tools"]
    n3["ROOT"]
    n4["project"]
    n0 ---|"209"| n0
    n1 ---|"10"| n0
    n2 ---|"4"| n3
    n2 ---|"4"| n0
    n2 ---|"3"| n2
    n3 ---|"2"| n0
    n4 ---|"1"| n0
    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:#00688b4C,stroke-width:1px
    linkStyle 2 stroke:#00688b4C,stroke-width:1px
    linkStyle 3 stroke:#00688b4C,stroke-width:1px
    linkStyle 4 stroke:#a0a0a04C,stroke-width:1px
    linkStyle 5 stroke:#00688b4C,stroke-width:1px
    linkStyle 6 stroke:#00688b4C,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:24