1 ! Copyright (C) 2008 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors assocs deques kernel ;
6 TUPLE: search-deque assoc deque ;
8 C: <search-deque> search-deque
10 M: search-deque deque-empty? deque>> deque-empty? ;
12 M: search-deque peek-front* deque>> peek-front* ;
14 M: search-deque peek-back* deque>> peek-back* ;
16 M: search-deque push-front*
17 2dup assoc>> at* [ 2nip ] [
19 [ deque>> push-front* dup ] [ assoc>> set-at ] 2bi
22 M: search-deque push-back*
23 2dup assoc>> at* [ 2nip ] [
25 [ deque>> push-back* dup ] [ assoc>> set-at ] 2bi
28 M: search-deque pop-front*
29 [ deque>> pop-front ] [ assoc>> ] bi delete-at ;
31 M: search-deque pop-back*
32 [ deque>> pop-back ] [ assoc>> ] bi delete-at ;
34 M: search-deque delete-node
35 [ deque>> delete-node ]
36 [ [ node-value ] [ assoc>> ] bi* delete-at ] 2bi ;
38 M: search-deque clear-deque
39 [ deque>> clear-deque ] [ assoc>> clear-assoc ] bi ;
41 M: search-deque deque-member?
44 INSTANCE: search-deque deque