guardian/newswires
Logical Components
An overview of source code logical components.

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 12 components.

newswires20364 LOC (66%) 135 files
ingestion-lambda5010 LOC (16%) 17 files
shared2127 LOC (6%) 13 files
poller-lambdas1163 LOC (3%) 13 files
cdk1121 LOC (3%) 7 files
db416 LOC (1%) 34 files
fingerpost-queueing-lambda147 LOC (<1%) 3 files
recomputation-lambda101 LOC (<1%) 3 files
ROOT41 LOC (<1%) 2 files
.github39 LOC (<1%) 1 file
email-filter-lambda20 LOC (<1%) 1 file
cleanup-lambda18 LOC (<1%) 1 file

scope details...
  • 230 files, 30,567 LOC (100.0% 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.
newswires1342 commits (52%)
ingestion-lambda238 commits (9%)
cdk231 commits (8%)
db181 commits (7%)
poller-lambdas86 commits (3%)
shared58 commits (2%)
fingerpost-queueing-lambda30 commits (1%)
.github20 commits (<1%)
cleanup-lambda17 commits (<1%)
ROOT15 commits (<1%)
recomputation-lambda15 commits (<1%)
email-filter-lambda10 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
newswires
446
751
145
ingestion-lambda
53
148
37
cdk
54
124
53
db
60
101
20
poller-lambdas
11
59
16
shared
51
7
fingerpost-queueing-lambda
20
10
.github
6
14
cleanup-lambda
2
15
ROOT
7
8
recomputation-lambda
2
13
email-filter-lambda
3
7


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["newswires"]
    n1["shared"]
    n2["ingestion-lambda"]
    n3["fingerpost-queueing-lambda"]
    n4["cdk"]
    n5["db"]
    n6["poller-lambdas"]
    n7["ROOT"]
    n8[".github"]
    n0 ---|"75"| n0
    n1 ---|"17"| n1
    n2 ---|"11"| n1
    n2 ---|"9"| n3
    n1 ---|"8"| n3
    n2 ---|"8"| n2
    n3 ---|"5"| n3
    n0 ---|"4"| n4
    n0 ---|"3"| n5
    n6 ---|"3"| n1
    n4 ---|"2"| n5
    n4 ---|"2"| n4
    n0 ---|"2"| n2
    n7 ---|"2"| n0
    n8 ---|"2"| n5
    n8 ---|"2"| n4
    n8 ---|"2"| n0
    n3 ---|"1"| n4
    n1 ---|"1"| n4
    n6 ---|"1"| n3
    n6 ---|"1"| n2
    n6 ---|"1"| n6
    n6 ---|"1"| n0
    n6 ---|"1"| n4
    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:#a0a0a070,stroke-width:2px
    linkStyle 2 stroke:#00688b5E,stroke-width:1px
    linkStyle 3 stroke:#00688b5E,stroke-width:1px
    linkStyle 4 stroke:#00688b5E,stroke-width:1px
    linkStyle 5 stroke:#a0a0a05E,stroke-width:1px
    linkStyle 6 stroke:#a0a0a04C,stroke-width:1px
    linkStyle 7 stroke:#00688b4C,stroke-width:1px
    linkStyle 8 stroke:#00688b4C,stroke-width:1px
    linkStyle 9 stroke:#00688b4C,stroke-width:1px
    linkStyle 10 stroke:#00688b4C,stroke-width:1px
    linkStyle 11 stroke:#a0a0a04C,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:#00688b4C,stroke-width:1px
    linkStyle 18 stroke:#00688b4C,stroke-width:1px
    linkStyle 19 stroke:#00688b4C,stroke-width:1px
    linkStyle 20 stroke:#00688b4C,stroke-width:1px
    linkStyle 21 stroke:#a0a0a04C,stroke-width:1px
    linkStyle 22 stroke:#00688b4C,stroke-width:1px
    linkStyle 23 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:23