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 combinators combinators.short-circuit deques
5 hashtables kernel kernel.private math math.order parser
6 search-deques sequences vocabs.loader ;
10 { prev maybe{ dlist-link } }
11 { next maybe{ dlist-link } } ;
13 TUPLE: dlist-node < dlist-link obj ;
17 M: dlist-link node-value obj>> ;
19 : new-dlist-link ( obj prev next class -- node )
25 : <dlist-node> ( obj prev next -- dlist-node )
26 \ dlist-node new-dlist-link ; inline
29 { front maybe{ dlist-link } }
30 { back maybe{ dlist-link } } ;
35 : <hashed-dlist> ( -- search-deque )
36 20 <hashtable> <dlist> <search-deque> ;
38 M: dlist deque-empty? front>> not ; inline
43 [ 2dup { [ and ] [ [ obj>> ] same? ] } 2&& ]
44 [ [ next>> ] bi@ ] while
50 : set-prev-when ( dlist-node dlist-node/f -- )
51 [ prev<< ] [ drop ] if* ; inline
53 : set-next-when ( dlist-node dlist-node/f -- )
54 [ next<< ] [ drop ] if* ; inline
56 : set-next-prev ( dlist-node -- )
57 dup next>> set-prev-when ; inline
59 : set-prev-next ( dlist-node -- )
60 dup prev>> set-next-when ;
62 : normalize-front ( dlist -- )
63 dup back>> [ f >>front ] unless drop ; inline
65 : normalize-back ( dlist -- )
66 dup front>> [ f >>back ] unless drop ; inline
68 : set-back-to-front ( dlist -- )
69 dup back>> [ dup front>> >>back ] unless drop ; inline
71 : set-front-to-back ( dlist -- )
72 dup front>> [ dup back>> >>front ] unless drop ; inline
74 : (dlist-find-node) ( ... dlist-node quot: ( ... node -- ... ? ) -- ... node/f )
77 [ drop ] [ [ next>> ] dip (dlist-find-node) ] if
78 ] [ 2drop f ] if ; inline recursive
80 : dlist-find-node ( ... dlist quot: ( ... node -- ... ? ) -- ... node/f )
81 [ front>> ] dip (dlist-find-node) ; inline
83 : dlist-find-node-prev ( ... dlist quot: ( ... value -- ... ? ) -- ... obj/f ? )
84 dlist-find-node [ prev>> ] [ f ] if* ; inline
86 : dlist-each-node ( ... dlist quot: ( ... node -- ... ) -- ... )
87 '[ @ f ] dlist-find-node drop ; inline
89 : unlink-node ( dlist-node -- )
90 [ prev>> ] [ next>> ] bi
92 [ swap set-next-when ] 2bi ; inline
96 f swap <dlist-node> dup dup set-next-prev
97 ] change-front set-back-to-front ;
99 : push-node-front ( dlist-node dlist -- )
100 dupd [ >>next ] change-front
101 [ set-next-prev ] [ set-back-to-front ] bi* ;
103 : push-node-back ( dlist-node dlist -- )
104 dupd [ >>prev ] change-back
105 [ set-prev-next ] [ set-front-to-back ] bi* ;
109 [ f <dlist-node> dup dup ]
111 ] change-back set-front-to-back ;
114 front>> [ obj>> t ] [ f f ] if* ;
117 back>> [ obj>> t ] [ f f ] if* ;
121 [ empty-deque ] unless*
124 ] change-front normalize-back ;
128 [ empty-deque ] unless*
131 ] change-back normalize-front ;
133 : dlist-find ( ... dlist quot: ( ... value -- ... ? ) -- ... obj/f ? )
134 '[ obj>> @ ] dlist-find-node [ obj>> t ] [ f f ] if* ; inline
136 : dlist-any? ( ... dlist quot: ( ... value -- ... ? ) -- ... ? )
137 dlist-find nip ; inline
139 M: dlist deque-member?
140 [ = ] with dlist-any? ;
145 { [ 2dup front>> eq? ] [ nip pop-front* ] }
146 { [ 2dup back>> eq? ] [ nip pop-back* ] }
149 ] [ drop f >>prev f >>next drop ] 2bi ;
151 : delete-node-if* ( ... dlist quot: ( ... value -- ... ? ) -- ... obj/f ? )
152 dupd dlist-find-node [
154 [ swap delete-node ] keep obj>> t
162 : delete-node-if ( ... dlist quot: ( ... value -- ... ? ) -- ... obj/f )
163 '[ obj>> @ ] delete-node-if* drop ; inline
166 f >>front f >>back drop ;
168 : dlist-length ( dlist -- n )
170 drop { fixnum } declare 1 + f
171 ] dlist-find-node drop ; flushable
173 : dlist-each ( ... dlist quot: ( ... value -- ... ) -- ... )
174 '[ obj>> @ ] dlist-each-node ; inline
176 : dlist>sequence ( dlist -- seq )
177 [ ] collector [ dlist-each ] dip ;
179 : >dlist ( seq -- dlist )
180 <dlist> [ '[ _ push-back ] each ] keep ;
182 : 1dlist ( obj -- dlist ) <dlist> [ push-front ] keep ;
184 : dlist-filter ( ... dlist quot: ( ... value -- ... ? ) -- ... dlist' )
186 '[ _ keep swap [ _ push-back ] [ drop ] if ] dlist-each
190 <dlist> [ '[ _ push-back ] dlist-each ] keep ;
194 : (push-before-node) ( obj dlist-node -- new-dlist-node )
195 [ [ prev>> ] keep <dlist-node> dup ] keep
196 [ dupd next<< ] change-prev drop ; inline
198 : push-before-node ( obj dlist-node dlist -- new-dlist-node )
202 drop (push-before-node)
207 : push-before ( ... obj dlist quot: ( ... obj -- ... ? ) -- ... dlist-node )
208 [ obj>> ] prepose over [ dlist-find-node ] dip swap
209 [ swap push-before-node ] [ push-back* ] if* ; inline
211 : push-sorted ( obj dlist -- dlist-node )
212 dupd [ before? ] with push-before ; inline
214 INSTANCE: dlist deque
216 SYNTAX: DL{ \ } [ >dlist ] parse-literal ;
218 { "dlists" "prettyprint" } "dlists.prettyprint" require-when