# HG changeset patch
# User Steve Losh <steve@stevelosh.com>
# Date 1459020065 0
# Node ID d4ba6547d8a1dd692becf4fc58c6c1b6cc9e4e50
# Parent  fcec9e0c9c6701467a3da1e1341b943bfdcd3655
Fix up docstring

diff -r fcec9e0c9c67 -r d4ba6547d8a1 src/wam/topological-sort.lisp
--- a/src/wam/topological-sort.lisp	Sat Mar 26 19:19:07 2016 +0000
+++ b/src/wam/topological-sort.lisp	Sat Mar 26 19:21:05 2016 +0000
@@ -9,11 +9,10 @@
 
   `elements` should be a sequence of elements to be sorted.
 
-  `constraints` should be a list of `(element . element)` conses where
-  `(foo . bar)` means that element `foo` must precede `bar` in the result.
+  `constraints` should be a list of `(key . key)` conses where `(foo . bar)`
+  means element `foo` must precede `bar` in the result.
 
-  `key` will be used to turn items in `elements` into the items in
-  `constraints`.
+  `key` will be used to turn items in `elements` into the keys in `constraints`.
 
   `key-test` is the equality predicate for keys.