Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Re: Re: Re: Re: Any Point in Uploading Tie::SortedHash

by danger (Priest)
on Sep 06, 2003 at 18:41 UTC ( #289494=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Re: Re: Any Point in Uploading Tie::SortedHash
in thread Any Point in Uploading Tie::SortedHash

Set $DB_BTREE->{compare} before tieing the hash. However, accessing the tied hash in the compare routine leads to deep recursion (FETCH method uses the compare routine to navigate the tree).


Comment on Re: Re: Re: Re: Re: Any Point in Uploading Tie::SortedHash
Download Code
Re: Re: Re: Re: Re: Re: Any Point in Uploading Tie::SortedHash
by Limbic~Region (Chancellor) on Sep 06, 2003 at 23:12 UTC
    danger,
    While this sounded like a good thing, it doesn't provide near enough functionality for the purpose of my module.
  • Ability to change the sort routine on the fly
  • Ability to sort on anything to include values

    Thanks anyway - I learned something new which is always a good thing

    Cheers - L~R

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://289494]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (8)
As of 2015-07-02 22:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (46 votes), past polls