anchor.diff:      // Iterate "upwards" starting with the child towards the parents
       // starting with this child's parent.
       BaseNode p = _parent;
  -    
  +
       while (p != null) {
         AffineTransform parentT = p.calcTransform(); // Non-pooled object 
   
  
positive.code:    * The result are in [Point]s.
     * Note: The returned object is poolable.
     *     Remember to call the object's [moveToPool] method when finished.
     */
    Vector2P convertWorldToNodeSpace(Vector2 point) {
      AffineTransform wnt = worldToNodeTransform();
      Vector2P p = PointApplyAffineTransform(point, wnt);
      wnt.moveToPool();
      return p; // Remember to call moveToPool on "p"
  
negative.code:    * If you don't move the object back to the pool
     * the GC will have something to collect and you may not want that.
     */
    AffineTransform nodeToWorldTransform([BaseNode psuedoRoot]) {
      // Get a pooled transform to accumulate the parent transforms.
      // child = comp
      AffineTransform comp = new AffineTransform.withAffineTransformP(calcTransform());
  