Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Unusual sorting requirements; comparing three implementations.

by moritz (Cardinal)
on Oct 24, 2012 at 17:11 UTC ( #1000670=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    sub two_pass {
        my @sorted =
    ...
            sort { $a->name cmp $b->name }
            @employees;
    }
    
  2. or download this
                Rate    obvious     subtle   two_pass functional
    obvious    173/s         --       -22%       -30%       -61%
    subtle     222/s        28%         --       -11%       -50%
    two_pass   249/s        44%        12%         --       -44%
    functional 444/s       156%       100%        79%         --
    
  3. or download this
    use v6;
    class Person {
    ...
        .sort.map(*.value.sort(*.name));
    
    say .perl for @sorted;
    
  4. or download this
    Person.new(name => "Alice", title => "Sales Manager")
    Person.new(name => "Carol", title => "Marketing Manager")
    ...
    Person.new(name => "Dave", title => "Janitor")
    Person.new(name => "Eve", title => "Tech Support")
    Person.new(name => "Fred", title => "Receptionist")
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1000670]
help
Chatterbox?
[Eily]: yes we're pretty prawn to making puns around here
Eily went to the wiktionary to check that the pronunciations of prawn and prone are actually similar. Turns out prawn can be an alternative form of porn...

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (6)
As of 2017-06-29 12:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many monitors do you use while coding?















    Results (662 votes). Check out past polls.