-! Copyright (C) 2008 James Cash
+! Copyright (C) 2008 James Cash, Daniel Ehrenberg, Chris Double.
! See http://factorcode.org/license.txt for BSD license.
-USING: kernel sequences accessors math arrays vectors classes words
-combinators.short-circuit combinators locals ;
+USING: accessors combinators combinators.short-circuit kernel
+lexer make math namespaces parser sequences words ;
IN: lists
! List Protocol
GENERIC: car ( cons -- car )
GENERIC: cdr ( cons -- cdr )
GENERIC: nil? ( object -- ? )
-
-TUPLE: cons { car read-only } { cdr read-only } ;
-C: cons cons
+TUPLE: cons-state { car read-only } { cdr read-only } ;
-M: cons car ( cons -- car )
- car>> ;
+C: cons cons-state
-M: cons cdr ( cons -- cdr )
- cdr>> ;
+M: cons-state car car>> ;
+
+M: cons-state cdr cdr>> ;
SINGLETON: +nil+
M: +nil+ nil? drop t ;
M: object nil? drop f ;
-: atom? ( obj -- ? )
- list? not ;
+: atom? ( obj -- ? ) list? not ; inline
+
+: nil ( -- symbol ) +nil+ ; inline
+
+: uncons ( cons -- car cdr ) [ car ] [ cdr ] bi ; inline
-: nil ( -- symbol ) +nil+ ;
+: swons ( cdr car -- cons ) swap cons ; inline
-: uncons ( cons -- car cdr )
- [ car ] [ cdr ] bi ;
+: unswons ( cons -- cdr car ) uncons swap ; inline
-: swons ( cdr car -- cons )
- swap cons ;
+: 1list ( obj -- cons ) nil cons ; inline
-: unswons ( cons -- cdr car )
- uncons swap ;
+: 1list? ( list -- ? ) { [ nil? not ] [ cdr nil? ] } 1&& ; inline
-: 1list ( obj -- cons )
- nil cons ;
+: 2list ( a b -- cons ) 1list cons ; inline
-: 1list? ( list -- ? )
- { [ nil? not ] [ cdr nil? ] } 1&& ;
+: 3list ( a b c -- cons ) 2list cons ; inline
-: 2list ( a b -- cons )
- nil cons cons ;
+: cadr ( list -- elt ) cdr car ; inline
-: 3list ( a b c -- cons )
- nil cons cons cons ;
+: 2car ( list -- car cadr ) uncons car ; inline
-: cadr ( list -- elt )
- cdr car ;
-
-: 2car ( list -- car caar )
- [ car ] [ cdr car ] bi ;
-
-: 3car ( list -- car cadr caddr )
- [ car ] [ cdr car ] [ cdr cdr car ] tri ;
+: 3car ( list -- car cadr caddr ) uncons uncons car ; inline
-: lnth ( n list -- elt )
- swap [ cdr ] times car ;
+: lnth ( n list -- elt ) swap [ cdr ] times car ; inline
<PRIVATE
+
: (leach) ( list quot -- cdr quot )
[ [ car ] dip call ] [ [ cdr ] dip ] 2bi ; inline
+
+: (2leach) ( list1 list2 quot -- cdr1 cdr2 quot )
+ [ [ [ car ] bi@ ] dip call ] [ [ [ cdr ] bi@ ] dip ] 3bi ; inline
+
PRIVATE>
-: leach ( list quot: ( elt -- ) -- )
+: leach ( ... list quot: ( ... elt -- ... ) -- ... )
over nil? [ 2drop ] [ (leach) leach ] if ; inline recursive
-: lmap ( list quot: ( elt -- ) -- result )
- over nil? [ drop ] [ (leach) lmap cons ] if ; inline recursive
+: 2leach ( ... list1 list2 quot: ( ... elt1 elt2 -- ... ) -- ... )
+ 2over [ nil? ] either? [ 3drop ] [ (2leach) 2leach ] if ; inline recursive
-: foldl ( list identity quot: ( obj1 obj2 -- obj ) -- result )
+: lreduce ( ... list identity quot: ( ... prev elt -- ... next ) -- ... result )
swapd leach ; inline
-:: foldr ( list identity quot: ( obj1 obj2 -- obj ) -- result )
- list nil? [ identity ] [
+: 2lreduce ( ... list1 list2 identity quot: ( ... prev elt1 elt2 -- ... next ) -- ... result )
+ -rotd 2leach ; inline
+
+: foldl ( ... list identity quot: ( ... prev elt -- ... next ) -- ... result )
+ swapd leach ; inline
+
+:: foldr ( ... list identity quot: ( ... prev elt -- ... next ) -- ... result )
+ list nil? [
+ identity
+ ] [
list cdr identity quot foldr
list car quot call
] if ; inline recursive
: llength ( list -- n )
- 0 [ drop 1+ ] foldl ;
+ 0 [ drop 1 + ] foldl ;
-: lreverse ( list -- newlist )
- nil [ swap cons ] foldl ;
+: lreverse ( list -- newlist )
+ nil [ swons ] foldl ;
-: lappend ( list1 list2 -- newlist )
- [ lreverse ] dip [ swap cons ] foldl ;
+: lmap ( ... list quot: ( ... elt -- ... newelt ) -- ... result )
+ [ nil ] dip [ swapd dip cons ] curry foldl lreverse ; inline
+
+: lappend ( list1 list2 -- newlist )
+ [ lreverse ] dip [ swons ] foldl ;
: lcut ( list index -- before after )
- [ nil ] dip
- [ [ [ cdr ] [ car ] bi ] dip cons ] times
- lreverse swap ;
+ [ nil ] dip [ [ unswons ] dip cons ] times lreverse swap ;
-: sequence>cons ( sequence -- list )
- <reversed> nil [ swap cons ] reduce ;
+: sequence>list ( sequence -- list )
+ <reversed> nil [ swons ] reduce ;
-<PRIVATE
-: same? ( obj1 obj2 -- ? )
- [ class ] bi@ = ;
-PRIVATE>
+: lmap>array ( ... list quot: ( ... elt -- ... newelt ) -- ... array )
+ collector [ leach ] dip { } like ; inline
-: deep-sequence>cons ( sequence -- cons )
- [ <reversed> ] keep nil
- [ [ nip ] [ same? ] 2bi [ deep-sequence>cons ] when swons ]
- with reduce ;
+: list>array ( list -- array )
+ [ ] lmap>array ;
-<PRIVATE
-:: (lmap>vector) ( acc list quot: ( elt -- elt' ) -- acc )
- list nil? [ acc ] [
- list car quot call acc push
- acc list cdr quot (lmap>vector)
- ] if ; inline recursive
+: deeplist>array ( list -- array )
+ [ dup list? [ deeplist>array ] when ] lmap>array ;
-: lmap>vector ( list quot -- array )
- [ V{ } clone ] 2dip (lmap>vector) ; inline
-PRIVATE>
+INSTANCE: cons-state list
+INSTANCE: +nil+ list
-: lmap-as ( list quot exemplar -- sequence )
- [ lmap>vector ] dip like ; inline
+GENERIC: >list ( object -- list )
-: lmap>array ( list quot -- array )
- { } lmap-as ; inline
+M: list >list ;
-: deep-list>array ( list -- array )
- [
- {
- { [ dup nil? ] [ drop { } ] }
- { [ dup list? ] [ deep-list>array ] }
- [ ]
- } cond
- ] lmap>array ;
+M: sequence >list sequence>list ;
-: list>array ( list -- array )
- [ ] lmap>array ;
+ERROR: list-syntax-error ;
-:: traverse ( list pred quot: ( list/elt -- result ) -- result )
- list [| elt |
- elt dup pred call [ quot call ] when
- dup list? [ pred quot traverse ] when
- ] lmap ; inline recursive
+<PRIVATE
-INSTANCE: cons list
-INSTANCE: +nil+ list
+: items>list ( sequence -- list )
+ [ +nil+ ] [
+ <reversed> unclip-slice [ swons ] reduce
+ ] if-empty ;
+
+: ?list-syntax-error ( right-of-dot? -- )
+ building get empty? or [ list-syntax-error ] when ;
+
+: (parse-list-literal) ( right-of-dot? -- )
+ scan-token {
+ { "}" [ drop +nil+ , ] }
+ { "." [ ?list-syntax-error t (parse-list-literal) ] }
+ [
+ parse-datum dup parsing-word? [
+ V{ } clone swap execute-parsing first
+ ] when
+ , [ "}" expect ] [ f (parse-list-literal) ] if
+ ]
+ } case ;
+
+: parse-list-literal ( -- list )
+ [ f (parse-list-literal) ] { } make items>list ;
+
+PRIVATE>
+
+SYNTAX: L{ parse-list-literal suffix! ;
projects / factor.git / blobdiff