Reformat python with black (#671)

update should be good.

Author: sei-vsarvepalli

src/SSVC_csv-to-latex.py

@@ -238,7 +238,9 @@ def print_forest_options(
 """
     )
     location.write(pri5string)
-    location.write("}\n")  # close the last tikzset; forestset is already closed
+    location.write(
+        "}\n"
+    )  # close the last tikzset; forestset is already closed
 
 
 def begin_forest(location):
@@ -348,7 +350,9 @@ def main():
             if path[i] not in dpoint_values[i]:
                 dpoint_values[i].append(path[i])
     for i in range(depth):
-        dpoint_values[i].sort(key=lambda j: sort_order[i].index(j), reverse=True)
+        dpoint_values[i].sort(
+            key=lambda j: sort_order[i].index(j), reverse=True
+        )
         # reverse because the latex will flip it again
         # loop twice so we don't sort every time we check a new path
 
@@ -380,7 +384,9 @@ def main():
                 del tmp_path[-1]
             i = i - 1
             ofile.write(latex_brace_close)  # close each latex brace
-            del tmp_path[-1]  # every time we close a brace, update the path to reflect
+            del tmp_path[
+                -1
+            ]  # every time we close a brace, update the path to reflect
         else:  # "Normal" case
             if counts[i] == len(dpoint_values[i]):
                 try:

src/ssvc/csv_analyzer.py

@@ -95,7 +95,9 @@ def _imp_df(column_names: list, importances: list) -> pd.DataFrame:
         a dataframe of feature importances
     """
     df = (
-        pd.DataFrame({"feature": column_names, "feature_importance": importances})
+        pd.DataFrame(
+            {"feature": column_names, "feature_importance": importances}
+        )
         .sort_values("feature_importance", ascending=False)
         .reset_index(drop=True)
     )
@@ -184,7 +186,9 @@ def _perm_feat_imp(model, x, y):
 
 def _parse_args(args) -> argparse.Namespace:
     # parse command line
-    parser = argparse.ArgumentParser(description="Analyze an SSVC tree csv file")
+    parser = argparse.ArgumentParser(
+        description="Analyze an SSVC tree csv file"
+    )
     parser.add_argument(
         "csvfile", metavar="csvfile", type=str, help="the csv file to analyze"
     )
@@ -371,8 +375,12 @@ def check_topological_order(df, target):
     for u in H.nodes:
         H.nodes[u]["outcome"] = G.nodes[u]["outcome"]
 
-    logger.debug(f"Original graph: {len(G.nodes)} nodes with {len(G.edges)} edges")
-    logger.debug(f"Reduced graph: {len(H.nodes)} nodes with {len(H.edges)} edges")
+    logger.debug(
+        f"Original graph: {len(G.nodes)} nodes with {len(G.edges)} edges"
+    )
+    logger.debug(
+        f"Reduced graph: {len(H.nodes)} nodes with {len(H.edges)} edges"
+    )
 
     problems = []
     # check if the outcome is topologically sorted

src/ssvc/decision_points/cvss/attack_vector.py

@@ -194,7 +194,12 @@
     ),
 )
 
-versions = [ACCESS_VECTOR_1, ACCESS_VECTOR_2, ATTACK_VECTOR_3, ATTACK_VECTOR_3_0_1]
+versions = [
+    ACCESS_VECTOR_1,
+    ACCESS_VECTOR_2,
+    ATTACK_VECTOR_3,
+    ATTACK_VECTOR_3_0_1,
+]
 
 
 def main():

src/ssvc/decision_points/cvss/availability_impact.py

@@ -127,7 +127,11 @@
     ),
 )
 
-versions = [AVAILABILITY_IMPACT_1, AVAILABILITY_IMPACT_2, AVAILABILITY_IMPACT_2_0_1]
+versions = [
+    AVAILABILITY_IMPACT_1,
+    AVAILABILITY_IMPACT_2,
+    AVAILABILITY_IMPACT_2_0_1,
+]
 
 
 def main():

src/ssvc/decision_points/cvss/availability_requirement.py

@@ -17,7 +17,10 @@
 #  U.S. Patent and Trademark Office by Carnegie Mellon University
 
 from ssvc.decision_points.base import SsvcDecisionPointValue
-from ssvc.decision_points.cvss._not_defined import NOT_DEFINED_ND, NOT_DEFINED_X
+from ssvc.decision_points.cvss._not_defined import (
+    NOT_DEFINED_ND,
+    NOT_DEFINED_X,
+)
 from ssvc.decision_points.cvss.base import CvssDecisionPoint
 from ssvc.decision_points.helpers import print_versions_and_diffs
 

src/ssvc/decision_points/cvss/confidentiality_requirement.py

@@ -17,7 +17,10 @@
 #  U.S. Patent and Trademark Office by Carnegie Mellon University
 
 from ssvc.decision_points.base import SsvcDecisionPointValue
-from ssvc.decision_points.cvss._not_defined import NOT_DEFINED_ND, NOT_DEFINED_X
+from ssvc.decision_points.cvss._not_defined import (
+    NOT_DEFINED_ND,
+    NOT_DEFINED_X,
+)
 from ssvc.decision_points.cvss.base import CvssDecisionPoint
 from ssvc.decision_points.helpers import print_versions_and_diffs
 

src/ssvc/decision_points/cvss/exploitability.py

@@ -17,7 +17,10 @@
 #  U.S. Patent and Trademark Office by Carnegie Mellon University
 
 from ssvc.decision_points.base import SsvcDecisionPointValue
-from ssvc.decision_points.cvss._not_defined import NOT_DEFINED_ND, NOT_DEFINED_X
+from ssvc.decision_points.cvss._not_defined import (
+    NOT_DEFINED_ND,
+    NOT_DEFINED_X,
+)
 from ssvc.decision_points.cvss.base import CvssDecisionPoint
 from ssvc.decision_points.helpers import print_versions_and_diffs
 

src/ssvc/decision_points/cvss/integrity_requirement.py

@@ -17,7 +17,10 @@
 #  U.S. Patent and Trademark Office by Carnegie Mellon University
 
 from ssvc.decision_points.base import SsvcDecisionPointValue
-from ssvc.decision_points.cvss._not_defined import NOT_DEFINED_ND, NOT_DEFINED_X
+from ssvc.decision_points.cvss._not_defined import (
+    NOT_DEFINED_ND,
+    NOT_DEFINED_X,
+)
 from ssvc.decision_points.cvss.base import CvssDecisionPoint
 from ssvc.decision_points.helpers import print_versions_and_diffs
 

src/ssvc/decision_points/cvss/report_confidence.py

@@ -17,7 +17,10 @@
 #  U.S. Patent and Trademark Office by Carnegie Mellon University
 
 from ssvc.decision_points.base import SsvcDecisionPointValue
-from ssvc.decision_points.cvss._not_defined import NOT_DEFINED_ND, NOT_DEFINED_X
+from ssvc.decision_points.cvss._not_defined import (
+    NOT_DEFINED_ND,
+    NOT_DEFINED_X,
+)
 from ssvc.decision_points.cvss.base import CvssDecisionPoint
 from ssvc.decision_points.helpers import print_versions_and_diffs
 

src/ssvc/decision_points/helpers.py

@@ -126,7 +126,9 @@ def dp_diff(dp1: SsvcDecisionPoint, dp2: SsvcDecisionPoint) -> list[str]:
         major = True
 
     for name in dp2_names.difference(dp1_names):
-        diffs.append(f"(major or minor) {dp2.name} v{dp2.version} adds value {name}")
+        diffs.append(
+            f"(major or minor) {dp2.name} v{dp2.version} adds value {name}"
+        )
         maybe_major = True
         maybe_minor = True
 
@@ -139,17 +141,27 @@ def dp_diff(dp1: SsvcDecisionPoint, dp2: SsvcDecisionPoint) -> list[str]:
         v2 = v2[name]
 
         if v1 != v2:
-            diffs.append(f"(minor) {dp2.name} v{dp2.version} value {name} key changed")
+            diffs.append(
+                f"(minor) {dp2.name} v{dp2.version} value {name} key changed"
+            )
             minor = True
         else:
-            diffs.append(f"{dp2.name} v{dp2.version} value {name} key did not change")
+            diffs.append(
+                f"{dp2.name} v{dp2.version} value {name} key did not change"
+            )
 
     # did the value descriptions change?
     for name in intersection:
-        v1 = {value["name"]: value["description"] for value in dp1.to_dict()["values"]}
+        v1 = {
+            value["name"]: value["description"]
+            for value in dp1.to_dict()["values"]
+        }
         v1 = v1[name]
 
-        v2 = {value["name"]: value["description"] for value in dp2.to_dict()["values"]}
+        v2 = {
+            value["name"]: value["description"]
+            for value in dp2.to_dict()["values"]
+        }
         v2 = v2[name]
 
         if v1 != v2: