@@ -325,7 +325,7 @@ def replace_target(self, node: KCFG.Node) -> KCFG.NDBranch:
325
325
_edges : dict [int , Edge ]
326
326
_covers : dict [int , Cover ]
327
327
_splits : dict [int , Split ]
328
- _ndbranches : dict [int , NDBranch ]
328
+ _ndbranches : dict [int , KCFG . NDBranch ]
329
329
_vacuous : set [int ]
330
330
_stuck : set [int ]
331
331
_aliases : dict [str , int ]
@@ -827,7 +827,9 @@ def create_split(self, source_id: NodeIdLike, splits: Iterable[tuple[NodeIdLike,
827
827
self .add_successor (split )
828
828
return split
829
829
830
- def ndbranches (self , * , source_id : NodeIdLike | None = None , target_id : NodeIdLike | None = None ) -> list [NDBranch ]:
830
+ def ndbranches (
831
+ self , * , source_id : NodeIdLike | None = None , target_id : NodeIdLike | None = None
832
+ ) -> list [KCFG .NDBranch ]:
831
833
source_id = self ._resolve (source_id ) if source_id is not None else None
832
834
target_id = self ._resolve (target_id ) if target_id is not None else None
833
835
return [
@@ -836,7 +838,7 @@ def ndbranches(self, *, source_id: NodeIdLike | None = None, target_id: NodeIdLi
836
838
if (source_id is None or source_id == b .source .id ) and (target_id is None or target_id in b .target_ids )
837
839
]
838
840
839
- def contains_ndbranch (self , ndbranch : NDBranch ) -> bool :
841
+ def contains_ndbranch (self , ndbranch : KCFG . NDBranch ) -> bool :
840
842
return ndbranch in self ._ndbranches
841
843
842
844
def create_ndbranch (
0 commit comments