Skip to content

Commit f4af016

Browse files
authored
Merge pull request #2183 from strictdoc-project/stanislaw/remove_free_text
Code climate: traceability_index: remove unused code
2 parents 7c36f17 + 3162143 commit f4af016

File tree

3 files changed

+19
-40
lines changed

3 files changed

+19
-40
lines changed

strictdoc/core/traceability_index.py

Lines changed: 9 additions & 38 deletions
Original file line numberDiff line numberDiff line change
@@ -99,9 +99,6 @@ def has_parent_requirements(self, requirement: SDocNode) -> bool:
9999
if not isinstance(requirement.reserved_uid, str):
100100
return False
101101

102-
if len(requirement.reserved_uid) == 0:
103-
return False
104-
105102
parent_requirements = self.graph_database.get_link_values(
106103
link_type=GraphLinkType.NODE_TO_PARENT_NODES,
107104
lhs_node=requirement,
@@ -114,9 +111,6 @@ def has_children_requirements(self, requirement: SDocNode):
114111
if not isinstance(requirement.reserved_uid, str):
115112
return False
116113

117-
if len(requirement.reserved_uid) == 0:
118-
return False
119-
120114
children_requirements = self.graph_database.get_link_values(
121115
link_type=GraphLinkType.NODE_TO_CHILD_NODES,
122116
lhs_node=requirement,
@@ -159,9 +153,6 @@ def get_parent_requirements(self, requirement: SDocNode) -> List[SDocNode]:
159153
if not isinstance(requirement.reserved_uid, str):
160154
return []
161155

162-
if len(requirement.reserved_uid) == 0:
163-
return []
164-
165156
return list(
166157
self.graph_database.get_link_values(
167158
link_type=GraphLinkType.NODE_TO_PARENT_NODES,
@@ -172,10 +163,7 @@ def get_parent_requirements(self, requirement: SDocNode) -> List[SDocNode]:
172163

173164
def get_parent_relations_with_roles(self, requirement: SDocNode):
174165
assert isinstance(requirement, SDocNode)
175-
if (
176-
requirement.reserved_uid is None
177-
or len(requirement.reserved_uid) == 0
178-
):
166+
if requirement.reserved_uid is None:
179167
return
180168

181169
return list(
@@ -190,10 +178,7 @@ def get_parent_relations_with_role(
190178
self, requirement: SDocNode, role: Optional[str]
191179
) -> List[Any]: # FIXME: Make Any->SDocNode
192180
assert isinstance(requirement, SDocNode)
193-
if (
194-
requirement.reserved_uid is None
195-
or len(requirement.reserved_uid) == 0
196-
):
181+
if requirement.reserved_uid is None:
197182
return []
198183

199184
return list(
@@ -208,10 +193,7 @@ def get_child_relations_with_roles(
208193
self, requirement: SDocNode
209194
) -> List[Any]: # FIXME: Make Any->SDocNode
210195
assert isinstance(requirement, SDocNode)
211-
if (
212-
requirement.reserved_uid is None
213-
or len(requirement.reserved_uid) == 0
214-
):
196+
if requirement.reserved_uid is None:
215197
return []
216198

217199
return list(
@@ -226,10 +208,7 @@ def get_child_relations_with_role(
226208
self, requirement: SDocNode, role: Optional[str]
227209
) -> List[Any]: # FIXME: Make Any->SDocNode
228210
assert isinstance(requirement, SDocNode)
229-
if (
230-
requirement.reserved_uid is None
231-
or len(requirement.reserved_uid) == 0
232-
):
211+
if requirement.reserved_uid is None:
233212
return []
234213

235214
return list(
@@ -247,9 +226,6 @@ def get_children_requirements(
247226
if not isinstance(requirement.reserved_uid, str):
248227
return []
249228

250-
if len(requirement.reserved_uid) == 0:
251-
return []
252-
253229
return list(
254230
self.graph_database.get_link_values(
255231
link_type=GraphLinkType.NODE_TO_CHILD_NODES,
@@ -271,8 +247,6 @@ def get_counted_tags(
271247
link_type=GraphLinkType.DOCUMENT_TO_TAGS,
272248
lhs_node=document.reserved_mid,
273249
)
274-
if document_tags_or_none is None:
275-
return
276250
document_tags: Dict = assert_cast(document_tags_or_none, dict)
277251

278252
tags = sorted(document_tags.keys(), key=alphanumeric_sort)
@@ -938,14 +912,11 @@ def validate_node_against_anchors(
938912
# that case, we need to check if these anchors are used by any LINKs,
939913
# raising a validation if they do.
940914
existing_node_anchor_uids = set()
941-
if isinstance(node, SDocNode):
942-
for node_anchor_ in node.get_anchors():
943-
existing_node_anchor_uids.add(node_anchor_.value)
944-
else:
945-
if len(node.free_texts) > 0:
946-
for part in node.free_texts[0].parts:
947-
if isinstance(part, Anchor):
948-
existing_node_anchor_uids.add(part.value)
915+
916+
# FIXME: No test reaches this for Section or Document.
917+
assert isinstance(node, SDocNode)
918+
for node_anchor_ in node.get_anchors():
919+
existing_node_anchor_uids.add(node_anchor_.value)
949920

950921
"""
951922
Validation 1: Assert all UIDs are either:

strictdoc/helpers/math.py

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -6,8 +6,6 @@ def round_up(number: float, decimals):
66
assert isinstance(number, float)
77
assert isinstance(decimals, int)
88
assert decimals >= 0
9-
if decimals == 0:
10-
return ceil(number)
119

1210
factor = 10**decimals
1311

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
from strictdoc.helpers.math import round_up
2+
3+
4+
def test_round_up():
5+
assert round_up(1.3333, 0) == 2
6+
assert round_up(1.3333, 1) == 1.4
7+
assert round_up(1.3333, 2) == 1.34
8+
assert round_up(1.3333, 3) == 1.334
9+
assert round_up(1.3333, 4) == 1.3333
10+
assert round_up(1.3333, 5) == 1.3333

0 commit comments

Comments
 (0)