I have been thinking about making an explicitly stable sort operator for tiddlywiki so this is easier.
In general unstable sorts can be much faster than stable sorts so by default some (or most?) browsers use unstable sorting algorithms like quicksort. A stable sort keeps elements that have the same ranking in the sorting in the order they were at the input. A stable sorting operator would allow you to do this in one filter, the only problem is that it may be slower than the normal sort operator. Unless you are doing thousands of these operations in a row that shouldn't matter. My biggest concern with making this is having multiple sort operators might be confusing without good detailed documentation about what stable vs unstable means. -- You received this message because you are subscribed to the Google Groups "TiddlyWiki" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/tiddlywiki/46446788-16b5-4515-9ce3-84af3bd75862%40googlegroups.com.
