Tie:IxHash simply adds one feature to hashes; it keeps track of the order in which the keys are inserted into the hash, allowing you to get the keys out in the same order. Everything else is just like a regular hash, whether the values are references or plain old scalars.

Note that if you wanted something like an order hash of ordered hashes, you would have to tie the outermost hash and each of the inner hashes to Tie::IxHash. If only the outermost hash needs to be ordered, you only need to tie the outermost hash, of course.

Update: Here's a quick LoH example, with ordered hashes.

  use Tie::IxHash;

  my @Loh;

  for (1..5) {
    my %hash;
    tie %hash, 'Tie::IxHash';
    push @LoH, \%hash;
    # a separate instance of the lexical %hash
    #   is created each time through the loop
  }
[download]

@LoH now contains references to 5 ordered hashes. You can treat this structure exactly like an ordinary list of hashes; plus you can use the special features of a Tie::IxHash hash whenever you want.

  for (qw/Just another Perl hacker/) {
    $LoH[0]{$_} = $_;
  }
  print join(' ', keys %{ $LoH[0] }), "\n";
[download]

This will print 'Just another Perl hacker', because Tie::IxHash returns the keys in the same order they were created. Yay!

Many thanks to tilly for help working out a frustrating problem I ran into with my example. Upshot: do not put the tied reference itself (the return value from tie) in the data structure! Instead, tie the hash first, and put a plain old reference to the hash in the data structure.

Update: Tie::IxHash should be quoted in the call to tie. Thanks ybiC!