in reply to (almost) Unique elements of an array
I'm somewhat confused by wanting to identify unique words regardless of case, while still needing the case information. Perhaps that says you need two hashes - one that uses uc'd1 case, and the other using words as-is.
1 I seem to recall that upper-casing works in more encodings/languages than lower-casing, and this has nothing to do with perl. There just aren't lower-case equivalents of all upper-case characters in all languages. There are some characters which are defined to be "upper-case" even though there is no "lower-case" equivalent. If you're just dealing with English letters, then this distinction is irrelevant to you.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: (almost) Unique elements of an array
by Roy Johnson (Monsignor) on Jul 14, 2005 at 14:17 UTC | |
by Transient (Hermit) on Jul 14, 2005 at 14:23 UTC | |
by Roy Johnson (Monsignor) on Jul 14, 2005 at 15:12 UTC | |
by Anonymous Monk on Jul 14, 2005 at 14:43 UTC | |
by tlm (Prior) on Jul 14, 2005 at 15:03 UTC |