Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Find

by l3nz (Friar)
on Nov 26, 2003 at 09:00 UTC ( [id://310170]=note: print w/replies, xml ) Need Help??


in reply to Creating a text index for a text file

This is quite easy: you want single letters between ':'s to be sorted as if they were without the ':'. As we're at it, we do a case-insensitive sort. That's the beauty of perl hashes! :-)
use strict; my %aq = map ( (lc ((/^:(.):/) ? $1 : $_) => $_) , <DATA>); foreach my $k ( sort keys %aq ) { print $aq{$k}; } __DATA__ D for Donkey B for Box B for Bubble C for Cat A for Alpha :A: :B: :C: :D:
This stuff prints:
:A: A for Alpha :B: B for Box B for Bubble :C: C for Cat :D: D for Donkey
Hope this is what you were looking for.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://310170]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others surveying the Monastery: (5)
As of 2024-04-24 06:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found