use Perl

• fwiw ... (Score:1)

  by Limbic Region (3985)

  if ( keys %order_by ne @names ) {
  
  # should probably be
  
  if ( keys %order_by != @names ) {
  
  If you didn't mind the performance hit of a tied hash, you could use my Tie::Hash::Sorted
  
  You could combine your order sub and your sort routine in 1 by using lexicals and references. This way all you would need to do to change the sort order would be to change the array containing the list of keys - the rest would automagically happen. It would also allow you to add/delete/modify keys and values and always have the resul
  • Re:fwiw ... (Score:2)

    by Ovid (2709)

    Yup. That's a bug in my code, thanks :)

    I can't use Tie::Hash::Sorted. I'm getting the hash from an external source. Thanks for the idea, though.
    • Re:fwiw ... (Score:1)

      by Limbic Region (3985)

      Well, I am certainly not trying to push Tie::Hash::Sorted as I have never found a use for it myself. I wrote it because my efforts to contact Casey to correct the glaring problems of Tie::SortHash went unanswered (I later learned my emails went to a bit bucket). The original motivation was because it solved a problem a monk was having.
      
      It does allow you to use an existing hash without damaging it in any way (it makes a copy).
• Sounds like.... (Score:2)

  by Simon (89)

  Sort::ArbiLex? That's helped me out for this sort of thing innumerable times.
• File::Sort (Score:2)

  by pudge (1)

  Years and years ago I wrote File::Sort (which became a sort(1) for the Perl Power Tools project), and it has some stub function names in the File::Sort namespace that it modifies on the fly. I actually put together a sort subroutine as a string then eval it, and assign the result to *sortsub or whatever.
  
• Passing sort subs (Score:1)

  by osfameron (3135)

  You can also accept a subref, and do something like

  sort { $mysub->($a, $b) }

  That's slower, though my benchmarks didn't make it that much slower (though I may be wrong on that, writing good benchmarks is an art).

  --
  

  osfameron
• Anon subs work in sort as of 5.6.2 (Score:1)

  by kappa (294)

  As far as I understand perlfunc, sort accepts refs to anonymous subs. And I use such code all the time:

  sort $sorter{$field}, @objs;
  • Re:Anon subs work in sort as of 5.6.2 (Score:1)

    by kappa (294)

    Sorry, stray comma.
  • Re:Anon subs work in sort as of 5.6.2 (Score:2)

    by Ovid (2709)

    Oops. You're quite right.

    perl -Mstrict -le 'my $x= sub{$b<=>$a};print sort $x qw/3 1 2/;'

    I tried it along time ago and found out it didn't work. I suppose I should have tried again :)