 : push-front ( obj dlist -- )
     push-front* drop ;
 
+: push-all-front ( seq dlist -- )
+    [ push-front ] curry each ;
+
 : push-back* ( obj dlist -- dlist-node )
     [ dlist-back f <dlist-node> ] keep
     [ dlist-back set-next-when ] 2keep

! Copyright (C) 2007 Mackenzie Straight, Doug Coleman.
! See http://factorcode.org/license.txt for BSD license.
USING: combinators kernel math ;
IN: dlists

TUPLE: dlist front back length ;

    over dlist-empty?
    [ 2drop ] [ [ >r pop-back r> call ] 2keep dlist-slurp ] if ;
    inline

: 1dlist ( obj -- dlist ) <dlist> [ push-front ] keep ;

