anchor.diff:          {$endif}
   
           // child node info (with new parent bits)
  -        (*ChildNodeInfo := ChildNode.NodeInfo;
  +        ChildNodeInfo := ChildNode.NodeInfo;
           ParentBits := ParentBits + (ChildNodeInfo and PARENT_BITS_CLEAR_MASK);
           if (ParentBits and ((ChildNodeInfo and $ff00) shl 8) = 0) then goto nextchild_continue;
   
  
positive.code: 
          heuristics_data:
            // (dX, dY) = ChildNode.Coordinates - Store.Info.FinishPoint;
           (* dX := Cardinal(ChildNode.Coordinates);
            dY := Word(dX);
            dX := dX shr 16;
            Mask := Cardinal(Store.Info.FinishPoint);
  
negative.code:             X := X - ((Mask xor PNativeInt(@Store.Info.FinishPoint)^) and Y and 1) - (Y shr 1);
              ChildNode.SortValue := {$ifdef CPUX86}ChildNode.{$endif}Path +
                 Cardinal(Store.Info.HeuristicsLine * (Y + (X and ((X shr HIGH_NATIVE_BIT) - 1))));
            end;
          end;
        end else
        begin
  