factor: trim using lists

[factor.git] / basis / binary-search / binary-search.factor

diff --git a/basis/binary-search/binary-search.factor b/basis/binary-search/binary-search.factor
index 976f5fbb71c346e8b78fe3a1de65b43a276bcfd9..6de32d8f7ad7e4d4914440f325301a7c6fd55055 100644 (file)
--- a/basis/binary-search/binary-search.factor
+++ b/basis/binary-search/binary-search.factor
@@ -1,7 +1,7 @@
 ! Copyright (C) 2008, 2010 Slava Pestov.
 ! See http://factorcode.org/license.txt for BSD license.
-USING: accessors arrays combinators kernel locals math
-math.order sequences sequences.private vectors ;
+USING: arrays combinators kernel math math.order sequences
+sequences.private vectors ;
 IN: binary-search
 
 <PRIVATE
@@ -23,8 +23,7 @@ IN: binary-search
 PRIVATE>
 
 : search ( seq quot: ( elt -- <=> ) -- i elt )
-    over empty? [ 2drop f f ] [ [ 0 over length ] dip (search) ] if ;
-    inline
+    over empty? [ 2drop f f ] [ [ 0 over length ] dip (search) ] if ; inline
 
 GENERIC: natural-search ( obj seq -- i elt )
 M: object natural-search [ <=> ] with search ;