Article View: comp.std.c++
Article #2637Re: STL and sorted disk based list
From: Andrew Koenig
Date: Sat, 18 Nov 1995 20:09
Date: Sat, 18 Nov 1995 20:09
18 lines
1076 bytes
1076 bytes
Distribution: 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. 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. -- --Andrew Koenig ark@research.att.com --- [ 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:
<DI8rpv.H5x@research.att.com>Path:
arc1-ca.pugleaf.net!news.mindlink.net!agate!agate!MattReferences:
<48h0vg$8i6@meg.tesser.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!news.mindlink.net!agate!agate!Matt From: ark@research.att.com (Andrew Koenig) Newsgroups: comp.std.c++ Subject: Re: STL and sorted disk based list Date: 18 Nov 1995 20:09:33 GMT Organization: AT&T Bell Laboratories, Murray Hill NJ Approved: Matt@Austern Message-ID: <DI8rpv.H5x@research.att.com> References: <48h0vg$8i6@meg.tesser.com> NNTP-Posting-Host: austern.hip.berkeley.edu