1 ! Copyright (C) 2005, 2008 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 ;
7 : ?head ( seq begin -- newseq ? )
8 2dup head? [ length tail t ] [ drop f ] if ;
10 : ?head-slice ( seq begin -- newseq ? )
11 2dup head? [ length tail-slice t ] [ drop f ] if ;
13 : ?tail ( seq end -- newseq ? )
14 2dup tail? [ length head* t ] [ drop f ] if ;
16 : ?tail-slice ( seq end -- newseq ? )
17 2dup tail? [ length head-slice* t ] [ drop f ] if ;
19 : split1 ( seq subseq -- before after )
21 [ >r over r> head -rot length ] keep + tail
26 : last-split1 ( seq subseq -- before after )
27 [ <reversed> ] bi@ split1 [ reverse ] bi@
30 : (split) ( separators n seq -- )
31 3dup rot [ member? ] curry find-from drop
32 [ [ swap subseq , ] 2keep 1+ swap (split) ]
33 [ swap dup zero? [ drop ] [ tail ] if , drop ] if* ; inline recursive
35 : split, ( seq separators -- ) 0 rot (split) ;
37 : split ( seq separators -- pieces ) [ split, ] { } make ;
39 : string-lines ( str -- seq )
40 dup "\r\n" intersect empty? [
45 "\r" ?tail drop "\r" split
47 ] keep peek "\r" split suffix concat