|
|
Boost : |
From: Ullrich Koethe (u.koethe_at_[hidden])
Date: 2001-03-30 09:41:34
David Abrahams wrote:
>
> Interesting ideas with obvious advantages in the dense matrix case (e.g.,
> image processing). I think the approach has undesirable characteristics when
> dealing with sparse matrices, though. The advantage of MTL iterators is that
> you can avoid processing elements that aren't stored. Probably we'd want
> both approaches for dealing with different problem domains.
>
I agree. But the problem is not so much 'two-dimensional iterators' vs.
'hierarchical iterators'. The real problem is the lack of a proper
hierarchy of multi-dimensional iterator categories which describes
different data structure capabilities/algorithm requirements (analogous
to
the STL). I belive that we need such categories in order to build a
really
good array library, and we can only find them if all interested
application domains work together. Currently, the discussion is biased
towards linear algebra, which I believe will not lead to the optimum
categorization.
Ulli
-- ________________________________________________________________ | | | Ullrich Koethe Universität Hamburg / University of Hamburg | | FB Informatik / Dept. of Computer Science | | AB Kognitive Systeme / Cognitive Systems Group | | | | Phone: +49 (0)40 42883-2573 Vogt-Koelln-Str. 30 | | Fax: +49 (0)40 42883-2572 D - 22527 Hamburg | | Email: u.koethe_at_[hidden] Germany | | koethe_at_[hidden] | | WWW: http://kogs-www.informatik.uni-hamburg.de/~koethe/ | |________________________________________________________________|
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk