Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Custom Sort An AoA

by davido (Archbishop)
on Apr 01, 2014 at 18:30 UTC ( #1080621=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    use Test::More tests => 1;
    
    ...
    diag "@{$_}\n" for @sorted;
    
    is_deeply( \@sorted, \@wanted, 'Sorted array matches expectation.' );
    
  2. or download this
    1..1
    # one
    ...
    # zzz def ghi
    # blah asdf foo bar
    ok 1 - Sorted array matches expectation.
    
  3. or download this
    use Test::More tests => 1;
    
    ...
    diag "@{$_}\n" for @sorted;
    
    is_deeply( \@sorted, \@wanted, 'Sorted array matches expectation.' );
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1080621]
help
Chatterbox?
[Lady_Aleena]: shmem, geany on Debian jessie.
[shmem]: some experience with vim?
[Lady_Aleena]: None
[shmem]: I don't know geany, and don't know whether it has support for ctags.
[Lady_Aleena]: ctags?
[shmem]: ctags is a program which (recursively) extracts the symbols from source and stores them in a one-file database. This allows you to query the locations where these symbols (e.g. a subroutine name) are used anywhere in the source code tree...
[shmem]: ...from inside the editor.
[shmem]: apt-get install exuberant-ctags
[Lady_Aleena]: I think I heard vim has a big learning curve.
[shmem]: then in the root of your source tree run: ctags -R

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (9)
As of 2017-04-27 12:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (505 votes). Check out past polls.