Would there be any interest sorting functions that sort data that is written to disk? I know that it sounds somewhat useless, but if the data on disk takes up 10gb, I know that no computer can load all of that data at once, even with virtual memory. This type of sort is also useful for low-memory machines, like a roadside speedometer, where large amounts of data need to be sorted but cannot fit into memory.
Sam Schetterer wrote:
Would there be any interest sorting functions that sort data that is written to disk?
Yes, as I wrote before, this would probably be more useful than having more kinds of in-memory sorting implementations. I know that it sounds somewhat useless, but if the data on
disk takes up 10gb, I know that no computer can load all of that data at once, even with virtual memory.
What? Of course there are computers that can do that, even PCs, even without virtual memory. (I see that your statement doesn't affect the interest in such a sorting facility. However, statements like this one make your other statements look questionable.) Regards, m
On 3/31/07, Martin Wille <mw8329@yahoo.com.au> wrote:
Sam Schetterer wrote:
Would there be any interest sorting functions that sort data that is written to disk?
Yes, as I wrote before, this would probably be more useful than having more kinds of in-memory sorting implementations.
I know that it sounds somewhat useless, but if the data on
disk takes up 10gb, I know that no computer can load all of that data at once, even with virtual memory.
What? Of course there are computers that can do that, even PCs, even without virtual memory. (I see that your statement doesn't affect the interest in such a sorting facility. However, statements like this one make your other statements look questionable.)
Regards, m
There is a small typo on line 42 of external_base.hpp. It says count[y] != count[y + 1], but it should say count[y] != nums[y + 1]. Sorry.
Just one suggestion: Have you checked http://stxxl.sourceforge.net/ ? On Mar 30, 2007, at 9:53 PM, Sam Schetterer wrote:
Would there be any interest sorting functions that sort data that is written to disk? I know that it sounds somewhat useless, but if the data on disk takes up 10gb, I know that no computer can load all of that data at once, even with virtual memory. This type of sort is also useful for low-memory machines, like a roadside speedometer, where large amounts of data need to be sorted but cannot fit into memory. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/ listinfo.cgi/boost
participants (3)
-
Hervé Brönnimann -
Martin Wille -
Sam Schetterer