Mostafa skrev:
On Sun, 16 May 2010 03:06:07 -0700, Neil Groves <neil@grovescomputing.com> wrote:
Of course if you wish to contribute to the tutorial that would be very welcome.
Let me see what I can come up with.
Attached is a sketch of my proposed tutorial. Please comment/amend as appropriate.
"Informally, a Range is any type that can be associated with a collection of objects of some arbitrary type or types. Hence, a Range is a concept, like that of an STL Container. The motivation for the Range concept is that there are many useful Container-like types that do not meet the full requirements of Container, and many algorithms that can be written with this reduced set of requirements" - I would refrase the first sentence to "Informally, a Range is any type that can be associated with a collection of objects and which allows one to iterate over all the elements of the collection." - I would refrase the third sentence as "The motivation for the Range concept is that is provides a simpler and more expressive encapsulation of a half-open iterator range [begin,end) that is normally used in interfaces of containers and in specification of generic algorithms." -Thorsten