Greetings, karlgoethebier
How fortunate for the kids to have you as a tutor.
Many years ago before releasing MCE::Shared::Ordhash, I attempted a doubly-linked list, pure-Perl ordered hash implementation. It was based on Tie::Hash::Indexed. It lives in my gist repo Indhash.pm, but never released to CPAN. That's because it consumed more memory then I had wished for.
My goal at the time was making an ordered hash implementation that was as memory efficient as Hash::Ordered but wished for performance closer to Tie::Hash::Indexed, particularly deletions. Well, reached that goal and released MCE::Shared::Ordhash.
In the event the curriculum requires a doubly-linked list, see the TIEHASH, STORE, FETCH, and DELETE routines in Tie::Hash::Indexed and Indhash.pm (gist link above).
In reply to Re: [OT:] Is this Curriculum right?
by marioroy
in thread [OT:] Is this Curriculum right?
by karlgoethebier
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |