< prev index next >

modules/graphics/src/test/java/test/javafx/scene/NodeTest.java

Print this page

        

@@ -259,14 +259,14 @@
         // needed since picking doesn't work unless rooted in a scene and visible
         Scene scene = new Scene(new Group());
         ParentShim.getChildren(scene.getRoot()).add(rect);
 
         PickResultChooser res = new PickResultChooser();
-        rect.impl_pickNode(new PickRay(50, 50, 1, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY), res);
+        NodeHelper.pickNode(rect, new PickRay(50, 50, 1, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY), res);
         assertSame(rect, res.getIntersectedNode());
         res = new PickResultChooser();
-        rect.impl_pickNode(new PickRay(0, 0, 1, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY), res);
+        NodeHelper.pickNode(rect, new PickRay(0, 0, 1, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY), res);
         assertNull(res.getIntersectedNode());
     }
 
     @Test public void testPickingNodeDirectlyWithTransforms() {
         Rectangle rect = new Rectangle();

@@ -278,14 +278,14 @@
         // needed since picking doesn't work unless rooted in a scene and visible
         Scene scene = new Scene(new Group());
         ParentShim.getChildren(scene.getRoot()).add(rect);
 
         PickResultChooser res = new PickResultChooser();
-        rect.impl_pickNode(new PickRay(50, 50, 1, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY), res);
+        NodeHelper.pickNode(rect, new PickRay(50, 50, 1, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY), res);
         assertSame(rect, res.getIntersectedNode());
         res = new PickResultChooser();
-        rect.impl_pickNode(new PickRay(0, 0, 1, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY), res);
+        NodeHelper.pickNode(rect, new PickRay(0, 0, 1, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY), res);
         assertNull(res.getIntersectedNode());
     }
 
     @Test public void testEffectSharedOnNodes() {
         Effect effect = new DropShadow();
< prev index next >