opensearch-project / opensearch-java

Components & Dependencies

An overview of source code logical components.

Intro

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.

Logical Decompositions Overview

Analyzed system has 1 logical decomposition:

primary (23 components)

Logical Decomposition #1: PRIMARY

The decompositions is based on the folder structure (relative to the source code root), with automatically defined folder depth to have at least 10 components.

Bubble Chart | Tree Map

Components

The "primary" logical decomposition has 23 components.

906 files, 115,734 lines of code (100.0% vs. main code).

"java-client/src/main/java/org/opensearch/client/opensearch/_global" is biggest, containing 21.3% of code.
"buildSrc" is smallest, containing 0.01% of code.

Dependencies

Dependencies among components are static code dependencies among files in different components.

No component dependencies found.

2022-02-01 05:05