Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Re: (corrections) Re: Answer: Efficient access to sparse lists?

by BoredByPolitics (Scribe)
on Jan 26, 2001 at 06:08 UTC ( #54465=note: print w/replies, xml ) Need Help??


in reply to Re: (corrections) Re: Answer: Efficient access to sparse lists?
in thread Efficient access to sparse lists?

Have you considered a linked list in a hash?

Update: Apologies for the redundant post - I hadn't discovered the notes depth setting until a few moments ago, so hadn't noticed tye's post.

Pete

  • Comment on Re: Re: (corrections) Re: Answer: Efficient access to sparse lists?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (2)
As of 2022-01-25 05:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:












    Results (65 votes). Check out past polls.

    Notices?