As Ed Jobe eluded to.. to solve for the fact that multileaders do not allow the nea osnap.
The code I presented below uses activex to trace over the leaders with polylines.
The routine iterates through the leaders one at a time and measure the distance from the entsel point to the closest point on the polyline.
It deletes the polyline after getting the closest point.
It adds the information to a list of sublists.
It then sorts the list of sublists so the leader that is the closest to the entsel point is first in the list.
Then the closest point from the polyline is returned.
It is kinda convoluted...
There is always a work around.
Peter
Sorry my code is so verbose... I would rather be verbose and easy to read.