Use non-deprecated methods of Node

Author: oowekyala

src/main/java/net/sourceforge/pmd/util/fxdesigner/util/AstTraversalUtil.java

@@ -34,8 +34,8 @@ private AstTraversalUtil() {
 
     public static Node getRoot(Node n) {
         return n == null ? null
-                         : n.jjtGetParent() == null
-                           ? n : getRoot(n.jjtGetParent());
+                         : n.getParent() == null
+                           ? n : getRoot(n.getParent());
     }
 
     /**
@@ -86,7 +86,7 @@ public static Optional<Node> mapToMyTree(final Node myRoot, final Node node, Tex
      * @param newRoot      Not null
      */
     public static Optional<Node> findOldNodeInNewAst(final Node oldSelection, final Node newRoot) {
-        if (oldSelection.jjtGetParent() == null) {
+        if (oldSelection.getParent() == null) {
             return Optional.of(newRoot);
         }
 
@@ -98,10 +98,10 @@ public static Optional<Node> findOldNodeInNewAst(final Node oldSelection, final
 
         for (Node step : toIterable(pathFromOldRoot)) {
 
-            int n = step.jjtGetChildIndex();
+            int n = step.getIndexInParent();
 
-            if (n >= 0 && n < currentNewNode.jjtGetNumChildren()) {
-                currentNewNode = currentNewNode.jjtGetChild(n);
+            if (n >= 0 && n < currentNewNode.getNumChildren()) {
+                currentNewNode = currentNewNode.getChild(n);
             } else {
                 return Optional.empty();
             }
@@ -115,7 +115,7 @@ public static Optional<Node> findOldNodeInNewAst(final Node oldSelection, final
      * Returns an iterator over the parents of the given node, in innermost to outermost order.
      */
     public static Iterator<Node> parentIterator(Node deepest, boolean includeSelf) {
-        return iteratorFrom(deepest, n -> n.jjtGetParent() != null, Node::jjtGetParent, includeSelf);
+        return iteratorFrom(deepest, n -> n.getParent() != null, Node::getParent, includeSelf);
     }
 
     /**

src/main/java/net/sourceforge/pmd/util/fxdesigner/util/codearea/PmdCoordinatesSystem.java

@@ -134,11 +134,11 @@ private static Node findNodeRec(Node subject, TextPos2D target) {
     private static Node binarySearchInChildren(Node parent, TextPos2D target) {
 
         int low = 0;
-        int high = parent.jjtGetNumChildren() - 1;
+        int high = parent.getNumChildren() - 1;
 
         while (low <= high) {
             int mid = (low + high) / 2;
-            Node child = parent.jjtGetChild(mid);
+            Node child = parent.getChild(mid);
             int cmp = startPosition(child).compareTo(target);
 
             if (cmp < 0) {

src/main/java/net/sourceforge/pmd/util/fxdesigner/util/controls/ASTTreeItem.java

@@ -127,9 +127,9 @@ static ASTTreeItem buildRoot(Node n) {
     /** Builds an ASTTreeItem recursively from a node. */
     private static ASTTreeItem buildRootImpl(Node n, MutableInt idx) {
         ASTTreeItem item = new ASTTreeItem(n, idx.getAndIncrement());
-        if (n.jjtGetNumChildren() > 0) {
-            for (int i = 0; i < n.jjtGetNumChildren(); i++) {
-                item.getChildren().add(buildRootImpl(n.jjtGetChild(i), idx));
+        if (n.getNumChildren() > 0) {
+            for (int i = 0; i < n.getNumChildren(); i++) {
+                item.getChildren().add(buildRootImpl(n.getChild(i), idx));
             }
         }
         return item;

src/main/java/net/sourceforge/pmd/util/fxdesigner/util/controls/NodeParentageCrumbBar.java

@@ -192,7 +192,7 @@ public void setFocusNode(final Node newSelection, DataHolder options) {
                 @SuppressWarnings("unchecked")
                 TreeItem<Node> userData = (TreeItem<Node>) child.getUserData();
                 userData.setValue(cur);
-                cur = cur.jjtGetParent();
+                cur = cur.getParent();
             }
         }
     }
@@ -208,7 +208,7 @@ public void setFocusNode(final Node newSelection, DataHolder options) {
     private void setDeepestNode(Node node, Function<Node, Double> widthEstimator) {
         TreeItem<Node> deepest = new TreeItem<>(node);
         TreeItem<Node> current = deepest;
-        Node parent = node.jjtGetParent();
+        Node parent = node.getParent();
         double pathLength = widthEstimator.apply(node);
 
         final double maxPathLength = getWidth() * 0.9;
@@ -218,7 +218,7 @@ private void setDeepestNode(Node node, Function<Node, Double> widthEstimator) {
             newItem.getChildren().add(current);
             current = newItem;
             pathLength += widthEstimator.apply(parent);
-            parent = current.getValue().jjtGetParent();
+            parent = current.getValue().getParent();
         }
 
         if (pathLength >= maxPathLength