1 ! Copyright (C) 2005, 2008 Slava Pestov.
\r
2 ! See http://factorcode.org/license.txt for BSD license.
\r
3 USING: kernel math math.order sequences
\r
4 combinators.short-circuit ;
\r
7 : ascii? ( ch -- ? ) 0 127 between? ; inline
\r
9 : blank? ( ch -- ? ) " \t\n\r" member? ; inline
\r
11 : letter? ( ch -- ? ) CHAR: a CHAR: z between? ; inline
\r
13 : LETTER? ( ch -- ? ) CHAR: A CHAR: Z between? ; inline
\r
15 : digit? ( ch -- ? ) CHAR: 0 CHAR: 9 between? ; inline
\r
17 : printable? ( ch -- ? ) CHAR: \s CHAR: ~ between? ; inline
\r
19 : control? ( ch -- ? )
\r
20 "\0\e\r\n\t\u000008\u00007f" member? ; inline
\r
22 : quotable? ( ch -- ? )
\r
23 dup printable? [ "\"\\" member? not ] [ drop f ] if ; inline
\r
25 : Letter? ( ch -- ? )
\r
26 [ [ letter? ] [ LETTER? ] ] 1|| ;
\r
28 : alpha? ( ch -- ? )
\r
29 [ [ Letter? ] [ digit? ] ] 1|| ;
\r
31 : ch>lower ( ch -- lower )
\r
32 dup CHAR: A CHAR: Z between? [ HEX: 20 + ] when ;
\r
34 : >lower ( str -- lower )
\r
37 : ch>upper ( ch -- upper )
\r
38 dup CHAR: a CHAR: z between? [ HEX: 20 - ] when ;
\r
40 : >upper ( str -- upper )
\r