1 ! Copyright (C) 2007, 2008 Mackenzie Straight, Doug Coleman,
3 ! See http://factorcode.org/license.txt for BSD license.
4 USING: combinators kernel math sequences accessors dequeues ;
7 TUPLE: dlist front back length ;
13 M: dlist dequeue-length length>> ;
17 TUPLE: dlist-node obj prev next ;
19 C: <dlist-node> dlist-node
21 M: dlist-node node-value obj>> ;
23 : inc-length ( dlist -- )
24 [ 1+ ] change-length drop ; inline
26 : dec-length ( dlist -- )
27 [ 1- ] change-length drop ; inline
29 : set-prev-when ( dlist-node dlist-node/f -- )
30 [ (>>prev) ] [ drop ] if* ;
32 : set-next-when ( dlist-node dlist-node/f -- )
33 [ (>>next) ] [ drop ] if* ;
35 : set-next-prev ( dlist-node -- )
36 dup next>> set-prev-when ;
38 : normalize-front ( dlist -- )
39 dup back>> [ f >>front ] unless drop ;
41 : normalize-back ( dlist -- )
42 dup front>> [ f >>back ] unless drop ;
44 : set-back-to-front ( dlist -- )
45 dup back>> [ dup front>> >>back ] unless drop ;
47 : set-front-to-back ( dlist -- )
48 dup front>> [ dup back>> >>front ] unless drop ;
50 : (dlist-find-node) ( dlist-node quot: ( node -- ? ) -- node/f ? )
53 [ drop t ] [ >r next>> r> (dlist-find-node) ] if
54 ] [ 2drop f f ] if ; inline recursive
56 : dlist-find-node ( dlist quot -- node/f ? )
57 >r front>> r> (dlist-find-node) ; inline
59 : dlist-each-node ( dlist quot -- )
60 [ f ] compose dlist-find-node 2drop ; inline
62 : unlink-node ( dlist-node -- )
63 dup prev>> over next>> set-prev-when
64 dup next>> swap prev>> set-next-when ;
68 M: dlist push-front* ( obj dlist -- dlist-node )
69 [ front>> f swap <dlist-node> dup dup set-next-prev ] keep
71 [ set-back-to-front ] keep
74 M: dlist push-back* ( obj dlist -- dlist-node )
75 [ back>> f <dlist-node> ] keep
76 [ back>> set-next-when ] 2keep
78 [ set-front-to-back ] keep
83 M: dlist peek-front ( dlist -- obj )
84 front>> [ obj>> ] [ empty-dlist ] if* ;
86 M: dlist pop-front* ( dlist -- )
87 dup front>> [ empty-dlist ] unless
95 [ normalize-back ] keep
98 M: dlist peek-back ( dlist -- obj )
99 back>> [ obj>> ] [ empty-dlist ] if* ;
101 M: dlist pop-back* ( dlist -- )
102 dup back>> [ empty-dlist ] unless
110 [ normalize-front ] keep
113 : dlist-find ( dlist quot -- obj/f ? )
115 dlist-find-node [ obj>> t ] [ drop f f ] if ; inline
117 : dlist-contains? ( dlist quot -- ? )
118 dlist-find nip ; inline
120 M: dlist dequeue-member? ( value dlist -- ? )
121 [ = ] with dlist-contains? ;
123 M: dlist delete-node ( dlist-node dlist -- )
125 { [ 2dup front>> eq? ] [ nip pop-front* ] }
126 { [ 2dup back>> eq? ] [ nip pop-back* ] }
127 [ dec-length unlink-node ]
130 : delete-node-if* ( dlist quot -- obj/f ? )
131 dupd dlist-find-node [
133 [ swap delete-node ] keep obj>> t
141 : delete-node-if ( dlist quot -- obj/f )
142 [ obj>> ] prepose delete-node-if* drop ; inline
144 M: dlist clear-dequeue ( dlist -- )
150 : dlist-each ( dlist quot -- )
151 [ obj>> ] prepose dlist-each-node ; inline
153 : 1dlist ( obj -- dlist ) <dlist> [ push-front ] keep ;
155 INSTANCE: dlist dequeue