Topic: priority of built-in function vs coded function...

[ribarm]

Hi all,
I have a question : Recently I've coded function (_vl-sort) to which I changed it's name to match built-in (vl-sort)... My question is : will coded (vl-sort) take priority over built-in (vl-sort) on all places where it occurs, or will built-in (vl-sort) win over coded version in this cases... The point is that I've coded it because I don't know how do Object Arx handle (vl-sort), so I left it coded in case that translation from LISP to ARX is possible...

[Marc'Antonio Alessi]

I didn't understand your question well but I'll tell you what Tony Tanzillo wrote many years ago (maybe 23):

Code: [Select]

If you search this newsgroup (nda: Autodesk old NG), you'll find a much more powerful sorting function along with a good discussion on why (vl-sort) can be very dangerous.
For that reason, I suggest you replace the built-in vl-sort with this:

(defun vl-sort (lst func)
   (mapcar
     '(lambda (x) (nth x lst))
      (vl-sort-i lst func)
   )
)

This will ensure that (vl-sort) does not removeelements that it sees as equal.

[ribarm]

Thanks, just forgot ab (vl-sort-i)... I just don't know ab ObjectArx... It seems that (vl-sort-i) is much faster than my (_vl-sort), so I'll revise my codes...
Thanks again... This topic is for now closed...