http://www.perlmonks.org?node_id=382977


in reply to Re^2: Re-orderable keyed access structure?
in thread Re-orderable keyed access structure?

BrowserUk,
Ok, in light of this further explanation - Tie::Hash::Sorted isn't for you. To be honest, I only read the root node in the thread which didn't include these details. I do want to point out that sorted can be equal to ordered if the sort routine uses a lexical that defines that order. That is one of the great things about the module - the sort routine can be anything you dream up to include defining the specific order 1 by 1.

Cheers - L~R

  • Comment on Re^3: Re-orderable keyed access structure?