🚀 go-pugleaf

Hello, everybody.

Matt Austern (matt@cyclops5.berkeley.edu) wrote:

: In article <48h0vg$8i6@meg.tesser.com> ralphs@tesser.com (Ralph Shnelvar) writes:

: > I haven't even peeked at the STL but am wondering if there is support
: > for a disk based sorting and/or indexing algorithms.
: > 
: > That is, is there support for sorting monster arrays.

... skipped ...

: The good news, though, is that the STL isn't a container class library
: in any conventional sense; it isn't even a container, iterator, and
: algorithm library either, although that comes closer.  What it really
: is is a set of requirements that containers, iterators, and algorithms
: must satisfy if they are to work together, and a fairly large but
: deliberately incomplete set of predefined containers, iterators, and
: algorithms.

: In other words: if you define iterators that point into data files
: (depending on your design, and on your OS's file I/O capabilities, you
: might choose to use input iterators, forward iterators, or even random
: access iterators), then you can use all of the STL algorithms that
: make sense for iterators of that category.

OK, I wrote some useful(IMHO) iterators family. I would like to share
it with others STL explorers/users. STL FAQ seems to keep silence
about this question. Where can I upload my codes related to STL?

Recently I saw message from Meng Lee that STL is not longer supported
by authors. Thanks them very much for such really great thing as STL.
Others could continue.

The positive part of my message could be let's somebody (not me,
sorry) establish some kind of network rescource as STL-related code
repository. Maillist would be useful too.

In the case such place(s) or something similar already exists please
post coords. And this case it should be reflected in STL FAQ.

Andy.

[ comp.std.c++ is moderated.  Submission address: std-c++@ncar.ucar.edu.
  Contact address: std-c++-request@ncar.ucar.edu.  The moderation policy
  is summarized in http://dogbert.lbl.gov/~matt/std-c++/policy.html. ]