Well, here is what I've decided. I'll use both. It does a quick test if there are more than 50 elements to sort, it uses one, if not, it uses the other. At this point 100 bytes of programming space is a fairly small price to pay for speed.
As for your point, that option will always be available. When you get a name list with one of the (now) four methods the sort method only sorts what is in the name list. So if you do that, you will get the fastest results.
As for your point, that option will always be available. When you get a name list with one of the (now) four methods the sort method only sorts what is in the name list. So if you do that, you will get the fastest results.
Comments
As for your point, that option will always be available. When you get a name list with one of the (now) four methods the sort method only sorts what is in the name list. So if you do that, you will get the fastest results.
Alright then, I'll do just that. Thanks!
Download here: http://obex.parallax.com/objects/493/
The changes (short list):
Name list can now be sorted alphabetically.
Added a method to get values of a specified type.