-
Notifications
You must be signed in to change notification settings - Fork 32
/
cyclomatic_complexity.py
executable file
·69 lines (62 loc) · 2.81 KB
/
cyclomatic_complexity.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#!/usr/bin/env python3
# The MIT License (MIT)
#
# Copyright (c) 2021-2024 Yegor Bugayenko
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included
# in all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
import sys
from typing import Final
from javalang import tree, parse
sys.setrecursionlimit(10000)
def branches(parser_class: tree.CompilationUnit) -> int:
"""Determines the number of branches for a node
according to the Extended Cyclomatic Complexity metric.
Binary operations (&&, ||) and each case statement
are taken into account.
"""
count = 0
if isinstance(parser_class, tree.BinaryOperation):
if parser_class.operator in ('&&', '||'):
count = 1
elif (isinstance(parser_class, (tree.ForStatement, tree.IfStatement, tree.WhileStatement, tree.DoStatement, tree.TernaryExpression))):
count = 1
elif isinstance(parser_class, tree.SwitchStatementCase):
count = 1
elif isinstance(parser_class, tree.TryStatement):
count = 1
return count
if __name__ == '__main__':
if len(sys.argv) != 3:
print("Usage: python cyclomatic_complexity.py <path to the .java file> <output file with metrics>")
sys.exit(1)
java: Final[str] = sys.argv[1]
metrics: Final[str] = sys.argv[2]
with open(java, encoding='utf-8', errors='ignore') as f:
try:
complexity: int = 1
ast = parse.parse(f.read())
for path, node in ast:
complexity += branches(node)
with open(metrics, 'a', encoding='utf-8') as m:
m.write(f'CC {complexity} Total \
\\href{{https://en.wikipedia.org/wiki/Cyclomatic_complexity}}{{Cyclomatic Complexity}} \
of all methods\n')
except FileNotFoundError as exception:
message = f"{type(exception).__name__} {str(exception)}: {java}"
sys.exit(message)