43 lines
995 B
Factor
43 lines
995 B
Factor
! Copyright (C) 2008 Alex Chapman
|
|
! Copyright (C) 2012 John Benediktsson
|
|
! See http://factorcode.org/license.txt for BSD license
|
|
USING: accessors circular kernel math sequences sequences.private ;
|
|
IN: sequences.repeating
|
|
|
|
TUPLE: cycles
|
|
{ circular circular read-only }
|
|
{ length integer read-only } ;
|
|
|
|
: <cycles> ( seq length -- cycles )
|
|
[ <circular> ] dip cycles boa ;
|
|
|
|
: cycle ( seq length -- new-seq )
|
|
dupd <cycles> swap like ;
|
|
|
|
M: cycles length length>> ;
|
|
|
|
M: cycles set-length length<< ;
|
|
|
|
M: cycles virtual@ ( n seq -- n' seq' ) circular>> ;
|
|
|
|
M: cycles virtual-exemplar circular>> ;
|
|
|
|
INSTANCE: cycles virtual-sequence
|
|
|
|
TUPLE: repeats
|
|
{ seq sequence read-only }
|
|
{ length integer read-only } ;
|
|
|
|
: <repeats> ( seq times -- repeats )
|
|
over length * repeats boa ;
|
|
|
|
: repeat ( seq times -- new-seq )
|
|
dupd <repeats> swap like ;
|
|
|
|
M: repeats length length>> ;
|
|
|
|
M: repeats nth-unsafe
|
|
[ length>> / ] [ seq>> [ length * >integer ] keep nth ] bi ;
|
|
|
|
INSTANCE: repeats immutable-sequence
|