factor/basis/circular/circular.factor

80 lines
2.0 KiB
Factor
Raw Normal View History

2007-09-20 18:09:08 -04:00
! Copyright (C) 2005, 2006 Alex Chapman, Daniel Ehrenberg
! See http://factorcode.org/license.txt for BSD license
2008-04-13 01:52:49 -04:00
USING: kernel sequences math sequences.private strings
accessors locals fry ;
2007-09-20 18:09:08 -04:00
IN: circular
TUPLE: circular { seq read-only } { start integer } ;
2007-09-20 18:09:08 -04:00
: <circular> ( seq -- circular )
0 circular boa ; inline
2007-09-20 18:09:08 -04:00
2008-09-15 00:27:37 -04:00
<PRIVATE
2007-09-20 18:09:08 -04:00
: circular-wrap ( n circular -- n circular )
2008-04-13 01:52:49 -04:00
[ start>> + ] keep
[ seq>> length rem ] keep ; inline
2008-09-15 00:27:37 -04:00
PRIVATE>
2007-09-20 18:09:08 -04:00
M: circular length seq>> length ; inline
2007-09-20 18:09:08 -04:00
M: circular virtual@ circular-wrap seq>> ; inline
2007-09-20 18:09:08 -04:00
M: circular virtual-exemplar seq>> ; inline
2008-04-13 01:52:49 -04:00
2007-09-20 18:09:08 -04:00
: change-circular-start ( n circular -- )
#! change start to (start + n) mod length
circular-wrap start<< ; inline
2007-09-20 18:09:08 -04:00
2009-05-13 20:31:58 -04:00
: rotate-circular ( circular -- )
[ 1 ] dip change-circular-start ; inline
2009-05-13 20:31:58 -04:00
: circular-push ( elt circular -- )
2009-06-09 19:28:53 -04:00
[ set-first ] [ rotate-circular ] bi ;
2007-09-20 18:09:08 -04:00
: <circular-string> ( n -- circular )
0 <string> <circular> ; inline
2007-09-20 18:09:08 -04:00
INSTANCE: circular virtual-sequence
2008-05-25 16:19:26 -04:00
2009-12-08 18:05:17 -05:00
TUPLE: growing-circular < circular { length integer } ;
2008-05-25 16:19:26 -04:00
M: growing-circular length length>> ; inline
2008-05-25 16:19:26 -04:00
2008-09-15 00:27:37 -04:00
<PRIVATE
2008-05-25 16:19:26 -04:00
: full? ( circular -- ? )
[ length ] [ seq>> length ] bi = ; inline
2008-05-25 16:19:26 -04:00
2008-09-15 00:27:37 -04:00
PRIVATE>
2008-05-25 16:19:26 -04:00
: growing-circular-push ( elt circular -- )
dup full? [ circular-push ]
[ [ 1 + ] change-length set-last ] if ;
2008-05-25 16:19:26 -04:00
: <growing-circular> ( capacity -- growing-circular )
{ } new-sequence 0 0 growing-circular boa ; inline
TUPLE: circular-iterator
{ circular read-only } { n integer } { last-start integer } ;
2009-12-07 20:27:36 -05:00
: <circular-iterator> ( circular -- obj )
0 0 circular-iterator boa ; inline
<PRIVATE
: (circular-while) ( ... iterator quot: ( ... obj -- ... ? ) -- ... )
2009-12-07 20:27:36 -05:00
[ [ [ n>> ] [ circular>> ] bi nth ] dip call ] 2keep
rot [ [ dup n>> >>last-start ] dip ] when
over [ n>> ] [ [ last-start>> ] [ circular>> length ] bi + 1 - ] bi = [
2drop
] [
2009-12-07 20:27:36 -05:00
[ [ 1 + ] change-n ] dip (circular-while)
] if ; inline recursive
PRIVATE>
: circular-while ( ... circular quot: ( ... obj -- ... ? ) -- ... )
2009-12-07 20:27:36 -05:00
[ clone ] dip [ <circular-iterator> ] dip (circular-while) ; inline