X-Git-Url: https://git.distorted.org.uk/~mdw/sod/blobdiff_plain/ed3ce6c2352d76442b79badfbe08bc6ecde6934d..9a3cb4610ab59001fd44c13dcdc6ea206acf0e50:/doc/misc.tex?ds=sidebyside

diff --git a/doc/misc.tex b/doc/misc.tex
index 51767f6..ac89b6c 100644
--- a/doc/misc.tex
+++ b/doc/misc.tex
@@ -513,9 +513,14 @@ be implemented fairly easily using @|merge-lists| below.
   and $y$ are considered equal if and only if @|(funcall @<test> (funcall
   @<key> $x$) (funcall @<key> $y$))| returns non-nil.
 
+  The @<report> function is called as @|(funcall @<report> @<duplicate>
+  @<previous>)|.  Duplicates are reported in order; the @<previous> item is
+  always the first matching item in the sequence.
+
   This function will work for arbitrary @<test> functions, but it will run
-  much more efficiently if @<test> is @|eq|, @|eql|, @|equal|, or @|equalp|
-  (because it can use hash-tables).
+  much more efficiently if @<test> is @|eq|, @|eql|, @|equal|, or @|equalp|,
+  because it can use hash-tables.  (The generic implementation for lists is
+  especially inefficient.)
 \end{describe}
 
 
