1 ! Copyright (C) 2007, 2009 Mackenzie Straight, Doug Coleman,
2 ! Slava Pestov, John Benediktsson.
3 ! See http://factorcode.org/license.txt for BSD license.
4 USING: accessors arrays combinators combinators.short-circuit
5 deques fry hashtables kernel math.order parser search-deques
6 sequences summary vocabs.loader ;
9 TUPLE: dlist-link { prev maybe{ dlist-link } } { next maybe{ dlist-link } } ;
11 TUPLE: dlist-node < dlist-link obj ;
15 M: dlist-link node-value obj>> ;
17 : new-dlist-link ( obj prev next class -- node )
23 : <dlist-node> ( obj prev next -- dlist-node )
24 \ dlist-node new-dlist-link ; inline
27 { front maybe{ dlist-link } }
28 { back maybe{ dlist-link } } ;
33 : <hashed-dlist> ( -- search-deque )
34 20 <hashtable> <dlist> <search-deque> ;
36 M: dlist deque-empty? front>> not ; inline
41 [ 2dup { [ and ] [ [ obj>> ] same? ] } 2&& ]
42 [ [ next>> ] bi@ ] while
48 : set-prev-when ( dlist-node dlist-node/f -- )
49 [ prev<< ] [ drop ] if* ; inline
51 : set-next-when ( dlist-node dlist-node/f -- )
52 [ next<< ] [ drop ] if* ; inline
54 : set-next-prev ( dlist-node -- )
55 dup next>> set-prev-when ; inline
57 : set-prev-next ( dlist-node -- )
58 dup prev>> set-next-when ;
60 : normalize-front ( dlist -- )
61 dup back>> [ f >>front ] unless drop ; inline
63 : normalize-back ( dlist -- )
64 dup front>> [ f >>back ] unless drop ; inline
66 : set-back-to-front ( dlist -- )
67 dup back>> [ dup front>> >>back ] unless drop ; inline
69 : set-front-to-back ( dlist -- )
70 dup front>> [ dup back>> >>front ] unless drop ; inline
72 : (dlist-find-node) ( ... dlist-node quot: ( ... node -- ... ? ) -- ... node/f )
75 [ drop ] [ [ next>> ] dip (dlist-find-node) ] if
76 ] [ 2drop f ] if ; inline recursive
78 : dlist-find-node ( ... dlist quot: ( ... node -- ... ? ) -- ... node/f )
79 [ front>> ] dip (dlist-find-node) ; inline
81 : dlist-find-node-prev ( ... dlist quot: ( ... value -- ... ? ) -- ... obj/f ? )
82 dlist-find-node [ prev>> ] [ f ] if* ; inline
84 : dlist-each-node ( ... dlist quot: ( ... node -- ... ) -- ... )
85 '[ @ f ] dlist-find-node drop ; inline
89 : unlink-node ( dlist-node -- )
90 [ prev>> ] [ next>> ] bi
92 [ swap set-next-when ] 2bi ; inline
94 M: dlist push-front* ( obj dlist -- dlist-node )
95 [ front>> f swap <dlist-node> dup dup set-next-prev ] keep
99 : push-node-front ( dlist-node dlist -- )
100 [ front>> >>next drop ]
102 [ [ set-next-prev ] [ set-back-to-front ] bi* ] 2tri ;
104 : push-node-back ( dlist-node dlist -- )
105 [ back>> >>prev drop ]
107 [ [ set-prev-next ] [ set-front-to-back ] bi* ] 2tri ;
109 M: dlist push-back* ( obj dlist -- dlist-node )
110 [ back>> f <dlist-node> ] keep
111 [ back>> set-next-when ] 2keep
115 M: dlist peek-front* ( dlist -- obj/f ? )
116 front>> [ obj>> t ] [ f f ] if* ;
118 M: dlist peek-back* ( dlist -- obj/f ? )
119 back>> [ obj>> t ] [ f f ] if* ;
121 M: dlist pop-front* ( dlist -- )
124 [ empty-deque ] unless*
131 M: dlist pop-back* ( dlist -- )
134 [ empty-deque ] unless*
141 : dlist-find ( ... dlist quot: ( ... value -- ... ? ) -- ... obj/f ? )
142 '[ obj>> @ ] dlist-find-node [ obj>> t ] [ f f ] if* ; inline
144 : dlist-any? ( ... dlist quot: ( ... value -- ... ? ) -- ... ? )
145 dlist-find nip ; inline
147 M: dlist deque-member? ( value dlist -- ? )
148 [ = ] with dlist-any? ;
150 M: dlist delete-node ( dlist-node dlist -- )
153 { [ 2dup front>> eq? ] [ nip pop-front* ] }
154 { [ 2dup back>> eq? ] [ nip pop-back* ] }
157 ] [ drop f >>prev f >>next drop ] 2bi ;
159 : delete-node-if* ( ... dlist quot: ( ... value -- ... ? ) -- ... obj/f ? )
160 dupd dlist-find-node [
162 [ swap delete-node ] keep obj>> t
170 : delete-node-if ( ... dlist quot: ( ... value -- ... ? ) -- ... obj/f )
171 '[ obj>> @ ] delete-node-if* drop ; inline
173 M: dlist clear-deque ( dlist -- )
178 : dlist-each ( ... dlist quot: ( ... value -- ... ) -- ... )
179 '[ obj>> @ ] dlist-each-node ; inline
181 : dlist>sequence ( dlist -- seq )
182 [ ] collector [ dlist-each ] dip ;
184 : >dlist ( seq -- dlist )
185 <dlist> [ '[ _ push-back ] each ] keep ;
187 : 1dlist ( obj -- dlist ) <dlist> [ push-front ] keep ;
189 : dlist-filter ( ... dlist quot: ( ... value -- ... ? ) -- ... dlist' )
191 <dlist> [ '[ dup obj>> @ [ drop ] [ obj>> _ push-back ] if ] dlist-each-node ] keep ; inline
194 <dlist> [ '[ _ push-back ] dlist-each ] keep ;
198 : (push-before-node) ( obj dlist-node -- new-dlist-node )
199 [ [ prev>> ] keep <dlist-node> ] keep {
200 [ prev>> [ next<< ] [ drop ] if* ]
205 : push-before-node ( obj dlist-node dlist -- new-dlist-node )
209 drop (push-before-node)
214 : push-before ( ... obj dlist quot: ( ... obj -- ... ? ) -- ... dlist-node )
215 [ obj>> ] prepose over [ dlist-find-node ] dip swap
216 [ swap push-before-node ] [ push-back* ] if* ; inline
218 : push-sorted ( obj dlist -- dlist-node )
219 dupd [ before? ] with push-before ; inline
221 INSTANCE: dlist deque
223 SYNTAX: DL{ \ } [ >dlist ] parse-literal ;
225 { "dlists" "prettyprint" } "dlists.prettyprint" require-when