|
Boost-Commit : |
From: joel_at_[hidden]
Date: 2007-11-06 07:17:26
Author: djowel
Date: 2007-11-06 07:17:26 EST (Tue, 06 Nov 2007)
New Revision: 40833
URL: http://svn.boost.org/trac/boost/changeset/40833
Log:
todo update
Text files modified:
trunk/libs/fusion/todo.txt | 12 ++++++++----
1 files changed, 8 insertions(+), 4 deletions(-)
Modified: trunk/libs/fusion/todo.txt
==============================================================================
--- trunk/libs/fusion/todo.txt (original)
+++ trunk/libs/fusion/todo.txt 2007-11-06 07:17:26 EST (Tue, 06 Nov 2007)
@@ -1,7 +1,11 @@
+* Improve extension docs
+
+* Document sequence/convert
+
* Consider object equivalent of functions and algorithms (so you can do
transform(iterators, deref()) with needing to put together a wrapper for deref).
-* Make algorithms work with mutable data
+* Make algorithms work with mutable data
* Consider segmented sequence / algorithm support
@@ -81,17 +85,17 @@
* Provide infinity-aware default implementation for Incrementable Sequences
Thoughts: It would probably be cleaner to have infinity conceptually
- orthogonal so there can be infinite Bidi/RA/Assoc Sequences.
+ orthogonal so there can be infinite Bidi/RA/Assoc Sequences.
OTOH it complicates things in way that might not be worth it...
-* Implement always_view/always with repetitive_view<single_view<T> >
+* Implement always_view/always with repetitive_view<single_view<T> >
semantics - using repetitive_view will for this purpose will be way
too much overhead.
? Functional wrappers for intrinsics/algorithms.
* Rewrite functional benchmark
-
+
==========================================================
From the fusion review (please mark all done items):
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk