From 8c1ff5d5e0c8019bb8a692a0c842d4cf1bbb99aa Mon Sep 17 00:00:00 2001
From: Eli Barzilay <eli@racket-lang.org>
Date: Mon, 25 Feb 2008 15:02:56 +0000
Subject: [PATCH] strict comparators

svn: r8800
---
 collects/scribblings/reference/pairs.scrbl | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/collects/scribblings/reference/pairs.scrbl b/collects/scribblings/reference/pairs.scrbl
index 85aba51206..ee4279c582 100644
--- a/collects/scribblings/reference/pairs.scrbl
+++ b/collects/scribblings/reference/pairs.scrbl
@@ -332,7 +332,7 @@ The sort is stable: if two elements of @scheme[lst] are ``equal''
  in either order), then the elements preserve their relative order
  from @scheme[lst] in the output list.  You should therefore use
  @scheme[sort] with strict comparison functions (e.g., @scheme[<] or
- @scheme[string<?]; not @scheme[<=] or @scheme[string<=?])}
+ @scheme[string<?]; not @scheme[<=] or @scheme[string<=?]).}
 
 @; ----------------------------------------
 @section{List Searching}