develooper Front page | perl.perl6.meta | Postings from October 2000

perl should optimize for extreme cases (was Re: [FWP] Wanted - Have = Need)

From:
John Porter
Date:
October 17, 2000 07:16
Subject:
perl should optimize for extreme cases (was Re: [FWP] Wanted - Have = Need)
Message ID:
20001017101651.A2887@min.net
[Warning - mailing list violently altered!]


John Carter wrote:
> On Fri, 13 Oct 2000, John Porter wrote:
> 
> > As a concrete example, perl's data structures are always
> > managed in memory; while things like sort and merge have
> > been written to utilize on-disk buffers when necessary.
> > (Hmm... smells like an RFC...)
> 
> I would assume that perl uses glibc's qsort routine.

That would be great for perl6; but current perls implement a
custom sort routine.

The bigger issue, which I think is RFC-worthy, is that perl
ought, if possible, to optimize for extreme cases by doing,
e.g., disk caching, the way unix sort does.

This could be controlled by pragmata, if it was deemed not
useful as a default.

-- 
John Porter

	By pressing down a special key  It plays a little melody




nntp.perl.org: Perl Programming lists via nntp and http.
Comments to Ask Bjørn Hansen at ask@perl.org | Group listing | About