172 lines
4.8 KiB
Factor
172 lines
4.8 KiB
Factor
|
!:folding=indent:collapseFolds=1:
|
||
|
|
||
|
! $Id$
|
||
|
!
|
||
|
! Copyright (C) 2003, 2004 Slava Pestov.
|
||
|
!
|
||
|
! Redistribution and use in source and binary forms, with or without
|
||
|
! modification, are permitted provided that the following conditions are met:
|
||
|
!
|
||
|
! 1. Redistributions of source code must retain the above copyright notice,
|
||
|
! this list of conditions and the following disclaimer.
|
||
|
!
|
||
|
! 2. Redistributions in binary form must reproduce the above copyright notice,
|
||
|
! this list of conditions and the following disclaimer in the documentation
|
||
|
! and/or other materials provided with the distribution.
|
||
|
!
|
||
|
! THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
||
|
! INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||
|
! FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
||
|
! DEVELOPERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
! SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
||
|
! PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
||
|
! OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
||
|
! WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
||
|
! OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
||
|
! ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
||
|
IN: strings
|
||
|
USE: arithmetic
|
||
|
USE: combinators
|
||
|
USE: kernel
|
||
|
USE: lists
|
||
|
USE: logic
|
||
|
USE: stack
|
||
|
|
||
|
: f-or-"" ( obj -- ? )
|
||
|
dup not swap "" = or ;
|
||
|
|
||
|
: str-length< ( str str -- boolean )
|
||
|
#! Compare string lengths.
|
||
|
[ str-length ] 2apply < ;
|
||
|
|
||
|
: cat ( [ "a" "b" "c" ] -- "abc" )
|
||
|
! If f appears in the list, it is not appended to the
|
||
|
! string.
|
||
|
80 <sbuf> swap [ [ over sbuf-append ] when* ] each sbuf>str ;
|
||
|
|
||
|
: cat2 ( "a" "b" -- "ab" )
|
||
|
swap
|
||
|
80 <sbuf>
|
||
|
dup >r sbuf-append r>
|
||
|
dup >r sbuf-append r>
|
||
|
sbuf>str ;
|
||
|
|
||
|
: cat3 ( "a" "b" "c" -- "abc" )
|
||
|
[ ] cons cons cons cat ;
|
||
|
|
||
|
: cat4 ( "a" "b" "c" "d" -- "abcd" )
|
||
|
[ ] cons cons cons cons cat ;
|
||
|
|
||
|
: cat5 ( "a" "b" "c" "d" "e" -- "abcde" )
|
||
|
[ ] cons cons cons cons cons cat ;
|
||
|
|
||
|
: index-of ( string substring -- index )
|
||
|
0 -rot index-of* ;
|
||
|
|
||
|
: str-lexi> ( str1 str2 -- ? )
|
||
|
! Returns if the first string lexicographically follows str2
|
||
|
str-compare 0 > ;
|
||
|
|
||
|
: str-head ( str index -- str )
|
||
|
#! Returns a new string, from the beginning of the string
|
||
|
#! until the given index.
|
||
|
0 transp substring ;
|
||
|
|
||
|
: str-contains? ( substr str -- ? )
|
||
|
swap index-of -1 = not ;
|
||
|
|
||
|
: str-tail ( str index -- str )
|
||
|
#! Returns a new string, from the given index until the end
|
||
|
#! of the string.
|
||
|
over str-length rot substring ;
|
||
|
|
||
|
: str/ ( str index -- str str )
|
||
|
#! Returns 2 strings, that when concatenated yield the
|
||
|
#! original string.
|
||
|
2dup str-tail [ str-head ] dip ;
|
||
|
|
||
|
: str// ( str index -- str str )
|
||
|
#! Returns 2 strings, that when concatenated yield the
|
||
|
#! original string, without the character at the given
|
||
|
#! index.
|
||
|
2dup succ str-tail [ str-head ] dip ;
|
||
|
|
||
|
: >title ( str -- str )
|
||
|
1 str/ [ >upper ] dip >lower cat2 ;
|
||
|
|
||
|
: str-headcut ( str begin -- str str )
|
||
|
str-length str/ ;
|
||
|
|
||
|
: str-head? ( str begin -- str )
|
||
|
#! If the string starts with begin, return the rest of the
|
||
|
#! string after begin. Otherwise, return f.
|
||
|
2dup str-length< [
|
||
|
2drop f
|
||
|
] [
|
||
|
tuck str-headcut
|
||
|
[ = ] dip f ?
|
||
|
] ifte ;
|
||
|
|
||
|
: str-tailcut ( str end -- str str )
|
||
|
str-length [ dup str-length ] dip - str/ ;
|
||
|
|
||
|
: str-tail? ( str end -- str )
|
||
|
#! If the string ends with end, return the start of the
|
||
|
#! string before end. Otherwise, return f.
|
||
|
2dup str-length< [
|
||
|
2drop f
|
||
|
] [
|
||
|
tuck str-tailcut swap
|
||
|
[ = ] dip f ?
|
||
|
] ifte ;
|
||
|
|
||
|
: split ( string split -- list )
|
||
|
2dup index-of dup -1 = [
|
||
|
2drop dup str-length 0 = [
|
||
|
drop f
|
||
|
] [
|
||
|
unit
|
||
|
] ifte
|
||
|
] [
|
||
|
swap [ str// ] dip split cons
|
||
|
] ifte ;
|
||
|
|
||
|
: split1 ( string split -- pair )
|
||
|
#! The car of the pair is the string up to the first
|
||
|
#! occurrence of split; the cdr is the remainder of
|
||
|
#! the string.
|
||
|
dupd index-of dup -1 = [
|
||
|
drop dup str-length 0 = [
|
||
|
drop f
|
||
|
] [
|
||
|
unit
|
||
|
] ifte
|
||
|
] [
|
||
|
str// cons
|
||
|
] ifte ;
|
||
|
|
||
|
: max-str-length ( list -- len )
|
||
|
#! Returns the length of the longest string in the given
|
||
|
#! list.
|
||
|
0 swap [ str-length max ] each ;
|
||
|
|
||
|
: ends-with-newline? ( string -- string )
|
||
|
#! Test if the string ends with a newline or not.
|
||
|
"\n" str-tail? ;
|
||
|
|
||
|
: str-each ( str [ code ] -- )
|
||
|
#! Execute the code, with each character of the string
|
||
|
#! pushed onto the stack.
|
||
|
over str-length [
|
||
|
-rot 2dup [ [ str-nth ] dip call ] 2dip
|
||
|
] times* 2drop ;
|
||
|
|
||
|
: str-sort ( list -- sorted )
|
||
|
#! Sorts the list into ascending lexicographical string
|
||
|
#! order.
|
||
|
[ str-lexi> ] sort ;
|
||
|
|
||
|
: blank? ( ch -- ? )
|
||
|
" \t\n\r" str-contains? ;
|