🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.std.c++
Article #2613

Re: STL and sorted disk based list

#2613
From: Matt Austern
Date: Fri, 17 Nov 1995 23:20
43 lines
2700 bytes
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.

No.  The closest thing the STL has to what you're looking for is its
istream_iterator and ostream_iterator.  I don't think they'd really 
be appropriate for this task, though.

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.

If you look in the draft standard, by the way, you'll see no mention
of the STL in the table of contents.  It's a very important part of
the standard C++ class library, so the original STL manual has been
distributed into various parts of the draft standard.  The most
important places to look are Chapter 20 (General Utilities), Chapter
23 (Containers), Chapter 24 (Iterators), and Chapter 25 (Algorithms).
Other parts of the standard library are influenced by the STL too,
though; strings, for example, are now STL containers.
-- 
  Matt Austern                             He showed his lower teeth.  "We 
  matt@physics.berkeley.edu                all have flaws," he said, "and 
  http://dogbert.lbl.gov/~matt             mine is being wicked."

---
[ 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. ]
Technical Details
Message-ID: <MATT.95Nov17161728@cyclops5.berkeley.edu>
Path: arc1-ca.pugleaf.net!128.32.155.1!matt
References: <48h0vg$8i6@meg.tesser.com>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!128.32.155.1!matt
From: matt@cyclops5.berkeley.edu (Matt Austern)
Newsgroups: comp.std.c++
Subject: Re: STL and sorted disk based list
Date: 17 Nov 1995 23:20:36 GMT
Organization: University of California at Berkeley (computational neuroscience)
Approved: matt@physics2.Berkeley.EDU (Matt Austern)
Message-ID: <MATT.95Nov17161728@cyclops5.berkeley.edu>
References: <48h0vg$8i6@meg.tesser.com>
Reply-To: matt@physics.berkeley.edu
NNTP-Posting-Host: physics2.berkeley.edu