Count metrics for TS, to set the start for our sonarless parser

[ChristianHuehn]

Feature request

Description

As a user I want to have a parser that has basic metrics like LOC/RLOC/COMPLEXITY/COMMENT_LINES without using sonar, so that I can use this in any environment.

Therefor we want to evaluate, how much time we will need to implement this for Kotlin & TS as it is used by CodeCharta. From there we will branch of to: Java / C# / C / C++ / JS / PHP

We do this in multiple steps, the first will be to evaluate TS and run some tests against our code map that already exists.

Next would be to integrate this into either a new parser or into an existing one.

If for example we do this with Regex, please provide a rough time estimation on how long for example codecharta takes to be parsed.

Acceptance criteria

• Count Lines of Code
• Count Real Lines of Code (a line that does not just contain whitespaces or comments)
• Count Comment Lines
• Count complexity

Assumptions & Exclusions

Complexity will probably be the hardest part to get right. Therefor we can use 2 things:

• The Java part of https://docs.sonarsource.com/sonarqube/latest/user-guide/code-metrics/metrics-definition/ Complexity
• Our code in CodeCharta already gets analyzed by sonar. If possible we want to get the exact same number for "complexity" as we get from sonar atm "sonar_complexity"

In general we can and will always check against the CodeCharta map that we currently have in our Web Demo.
https://docs.sonarsource.com/sonarqube/latest/user-guide/code-metrics/metrics-definition/ can also help to find some of the metrics and how they are calculated.

This task will contain probably some kind of research that has to go into it. Which is expected and needed.