10:31:52flip214Shinmera: it would be allowed to produce a list (cons (funcall key object) object)) and then remove duplicates on that, right? so two times O(n), which means O(n) overall.
10:32:19flip214"The elements of sequence are compared pairwise" doesn't say that KEY is called more than once per element, does it?
10:33:10ShinmeraI'm no spec expert though so I'll leave it up to others.
10:33:53flip214and yes, could be done via a hashtable as well, replacing elements (or not, depending on :from-end)
10:34:20lukegoI think I'll just eschew these complicates standard functions in favor of serapeum e.g. (filter (distinct) list :key #'foo)
10:36:47flip214lukego: well, having the language primitives as efficient as possible wouldn't hurt
10:46:48lukegoI'll also stay out of that. I'm MTV generation and don't have the temperament for trying to respect the standards at this level of detail