10:18:59lukegoInteresting that remove-duplicates is O(n) on lists by default but O(n^2) if a :KEY argument is given. any particular reason for not using the hashtable approach together with :key too or just not yet implemented so?
10:25:26Shinmera"The elements of sequence are compared pairwise, and if any two match, then the one occurring earlier in sequence is discarded, unless from-end is true, in which case the one later in sequence is discarded."
10:25:39Shinmeraso because with key this behaviour is observable it has to be squared.
10:28:42lukegoI suppose this is where you want to have a language lawyer on retainer who can say, well actually, the current optimization is also detectable - using TIME to establish that pairwise comparisions aren't happening - so that sets the necessary precedent for extending the optimization to the KEY case...
10:29:35Shinmerathe only thing it needs changed is to have it say 'as if pairwise'
10:30:59Shinmerathough I suppose in cases where equality is sort of ambiguous the pairwise comparison is the only way to do it.