33 * SPDX-License-Identifier: GPL-2.0-only */
44package de .uka .ilkd .key .proof ;
55
6+ import java .util .*;
7+
68import de .uka .ilkd .key .logic .RenamingTable ;
79import de .uka .ilkd .key .logic .op .IProgramVariable ;
810import de .uka .ilkd .key .proof .calculus .JavaDLSequentKit ;
911import de .uka .ilkd .key .proof .reference .ClosedBy ;
1012import de .uka .ilkd .key .rule .NoPosTacletApp ;
1113import de .uka .ilkd .key .rule .merge .MergeRule ;
14+ import de .uka .ilkd .key .util .Pair ;
1215
1316import org .key_project .logic .op .Function ;
1417import org .key_project .prover .rules .RuleApp ;
1518import org .key_project .prover .sequent .Sequent ;
1619import org .key_project .prover .sequent .SequentChangeInfo ;
17- import de .uka .ilkd .key .util .Pair ;
18- import org .jspecify .annotations .NonNull ;
19- import org .jspecify .annotations .Nullable ;
2020import org .key_project .util .collection .DefaultImmutableSet ;
2121import org .key_project .util .collection .ImmutableList ;
2222import org .key_project .util .collection .ImmutableSLList ;
2323import org .key_project .util .collection .ImmutableSet ;
2424import org .key_project .util .collection .Pair ;
2525import org .key_project .util .lookup .Lookup ;
2626
27- import java .util .*;
27+ import org .jspecify .annotations .NonNull ;
28+ import org .jspecify .annotations .Nullable ;
2829
2930public class Node implements Iterable <Node > {
3031 private static final String RULE_WITHOUT_NAME = "rule without name" ;
@@ -116,7 +117,7 @@ public class Node implements Iterable<Node> {
116117 * taclet with an addrule section on this node, then these taclets are stored in this list
117118 */
118119 private ImmutableSet <NoPosTacletApp > localIntroducedRules =
119- DefaultImmutableSet .nil ();
120+ DefaultImmutableSet .nil ();
120121
121122 /**
122123 * Holds the undo methods for the information added by rules to the {@code Goal.strategyInfos}.
@@ -448,7 +449,7 @@ List<Node> getLeaves() {
448449
449450 /**
450451 * @return an iterator for the leaves of the subtree below this node. The computation is called
451- * at every call!
452+ * at every call!
452453 */
453454 public Iterator <Node > leavesIterator () {
454455 return new NodeIterator (getLeaves ().iterator ());
@@ -493,7 +494,7 @@ public Node child(int i) {
493494 /**
494495 * @param child a child of this node.
495496 * @return the number of the node <code>child</code>, if it is a child of this node (starting
496- * with <code>0</code>), <code>-1</code> otherwise
497+ * with <code>0</code>), <code>-1</code> otherwise
497498 */
498499 public int getChildNr (Node child ) {
499500 int res = 0 ;
@@ -533,16 +534,16 @@ public StringBuffer getUniqueTacletId() {
533534 * Helper for {@link #toString()}
534535 *
535536 * @param prefix needed to keep track if a line has to be printed
536- * @param tree the tree representation we want to add this subtree " @param preEnumeration the
537- * enumeration of the parent without the last number
537+ * @param tree the tree representation we want to add this subtree " @param preEnumeration the
538+ * enumeration of the parent without the last number
538539 * @param postNr the last number of the parents enumeration
539- * @param maxNr the number of nodes at this level
540- * @param ownNr the place of this node at this level
540+ * @param maxNr the number of nodes at this level
541+ * @param ownNr the place of this node at this level
541542 * @return the string representation of this node.
542543 */
543544
544545 private StringBuffer toString (String prefix , StringBuffer tree , String preEnumeration ,
545- int postNr , int maxNr , int ownNr ) {
546+ int postNr , int maxNr , int ownNr ) {
546547 Iterator <Node > childrenIt = childrenIterator ();
547548 // Some constants
548549 String frontIndent = (maxNr > 1 ? " " : "" );
@@ -593,7 +594,7 @@ private StringBuffer toString(String prefix, StringBuffer tree, String preEnumer
593594 while (childrenIt .hasNext ()) {
594595 childId ++;
595596 childrenIt .next ().toString (prefix , tree , newEnumeration , newPostNr , children .size (),
596- childId );
597+ childId );
597598 }
598599
599600 return tree ;
@@ -650,7 +651,7 @@ public String name() {
650651 * this node.
651652 *
652653 * @return true iff the parent of this node has this node as child and this condition holds also
653- * for the own children.
654+ * for the own children.
654655 */
655656 public boolean sanityCheckDoubleLinks () {
656657 if (!root ()) {
@@ -777,7 +778,7 @@ public void addStrategyInfoUndoMethod(StrategyInfoUndoMethod undoMethod) {
777778 /**
778779 * Register a user-defined data in this node info.
779780 *
780- * @param obj an object to be registered
781+ * @param obj an object to be registered
781782 * @param service the key under it should be registered
782783 * @param <T> the type of the object to be registered
783784 */
@@ -788,9 +789,9 @@ public <T> void register(T obj, Class<T> service) {
788789 /**
789790 * Remove a previous registered user-defined data.
790791 *
791- * @param obj registered object
792+ * @param obj registered object
792793 * @param service the key under which the data was registered
793- * @param <T> arbitray object
794+ * @param <T> arbitray object
794795 */
795796 public <T > void deregister (T obj , Class <T > service ) {
796797 if (userData != null ) {
@@ -849,7 +850,8 @@ void setStepIndex(int stepIndex) {
849850 }
850851
851852 /**
852- * Calculates an array is the path from root node to this node. Each entry defines the child to be selected.
853+ * Calculates an array is the path from root node to this node. Each entry defines the child to
854+ * be selected.
853855 *
854856 * @see #traversePath(Iterator)
855857 */
0 commit comments