Article View: comp.std.c++
Article #2695Re: STL and sorted disk based list
From: Fergus Henderson
Date: Tue, 21 Nov 1995 16:03
Date: Tue, 21 Nov 1995 16:03
22 lines
1455 bytes
1455 bytes
ark@research.att.com (Andrew Koenig) writes: >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. > >Sure. All you have to do is write a class that meets the >relevant iterator constraints and grants access to your >disk file. Then all the algorithms will work. That misses the point a bit doesn't it? To get reasonable efficiency, wouldn't you want to use a different algorithm for disk based sorting than for in-memory sorting? -- Fergus Henderson WWW: http://www.cs.mu.oz.au/~fjh fjh@cs.mu.oz.au PGP: finger fjh@128.250.37.3 [ 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:
<9532600.2695@mulga.cs.mu.OZ.AU>Path:
arc1-ca.pugleaf.net!engnews1.Eng.Sun.COM!taumet!clamageReferences:
<48h0vg$8i6@meg.tesser.com> <DI8rpv.H5x@research.att.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!engnews1.Eng.Sun.COM!taumet!clamage From: fjh@munta.cs.mu.OZ.AU (Fergus Henderson) Newsgroups: comp.std.c++ Subject: Re: STL and sorted disk based list Date: 21 Nov 1995 16:03:45 GMT Organization: Computer Science, University of Melbourne, Australia Sender: news@cs.mu.OZ.AU (CS-Usenet) Approved: clamage@eng.sun.com (comp.std.c++) Message-ID: <9532600.2695@mulga.cs.mu.OZ.AU> References: <48h0vg$8i6@meg.tesser.com> <DI8rpv.H5x@research.att.com> NNTP-Posting-Host: taumet.eng.sun.com Originator: clamage@taumet