1 ! Copyright (C) 2005, 2009 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: kernel math make strings arrays vectors sequences
4 sets math.order accessors ;
9 : ?chomp ( seq begin tester chopper -- newseq ? )
10 [ [ 2dup ] dip call ] dip
11 [ [ length ] dip call t ] curry
12 [ drop f ] if ; inline
16 : ?head ( seq begin -- newseq ? )
17 [ head? ] [ tail ] ?chomp ;
19 : ?head-slice ( seq begin -- newseq ? )
20 [ head? ] [ tail-slice ] ?chomp ;
22 : ?tail ( seq end -- newseq ? )
23 [ tail? ] [ head* ] ?chomp ;
25 : ?tail-slice ( seq end -- newseq ? )
26 [ tail? ] [ head-slice* ] ?chomp ;
30 : (split1) ( seq subseq quot -- before after )
33 [ drop length ] [ start dup ] 2bi
34 [ [ nip ] [ + ] 2bi t ]
38 ] dip [ 2nip f ] if ; inline
42 : split1 ( seq subseq -- before after )
45 : split1-slice ( seq subseq -- before-slice after-slice )
46 [ snip-slice ] (split1) ;
48 : split1-last ( seq subseq -- before after )
49 [ <reversed> ] bi@ split1 [ reverse ] bi@
52 : split1-last-slice ( seq subseq -- before-slice after-slice )
53 [ <reversed> ] bi@ split1-slice [ <reversed> ] bi@
54 [ f ] [ swap ] if-empty ;
58 : (split) ( separators n seq -- )
59 3dup rot [ member? ] curry find-from drop
60 [ [ swap subseq , ] 2keep 1 + swap (split) ]
61 [ swap dup zero? [ drop ] [ tail ] if , drop ] if* ; inline recursive
63 : split, ( seq separators -- ) 0 rot (split) ;
67 : split ( seq separators -- pieces )
70 GENERIC: string-lines ( str -- seq )
72 M: string string-lines
73 dup "\r\n" intersects? [
76 "\r" ?tail drop "\r" split
78 ] keep last "\r" split suffix concat