Re: [boost] (infinite) sequences using recurrence relations

From: David Abrahams (david.abrahams_at_[hidden])
Date: 2001-08-04 14:58:48

----- Original Message -----
From: "Eric Ford" <eford_at_[hidden]>
To: <boost_at_[hidden]>
Sent: Saturday, August 04, 2001 7:49 AM
Subject: [boost] (infinite) sequences using recurrence relations

> I created a directory "recurrence relation iterator" which has my
> first crack at pseudo iterator and container classes for
> (mathematical, not stl) sequences generated on the fly using a
> recurrence relation (e.g. infinite sequences).  If people are still
> interested, I'd be interested in getting comments.

Doesn't a range of STL input iterators model a mathematical sequence?
These don't have to be stored in memory all at once. In fact, that's also
true of bidirectional and random-access iterators, since they are allowed to
cache their lvalue internally. Do we need a new concept?

-Dave