in reply to Re^2: Sorting or Aligning Parallel Hashes
in thread Sorting or Aligning Parallel Hashes
There's no such thing as a sorted hash(*), and I don't know what kind of terminology "align" is. You're confusing yourself by trying to be technical. Your data does NOT consist of unsorted hashes, sorted hashes and alignments; your data consists of scores, keywords, line numbers, text and the relationships between them.
Your question is then "Could you explain further how to get the keywords for a list of (sorted) scores?" I used:
I could also have used:my @sorted_words = map { $HashA{$_} } @sorted_scores;
my @sorted_words; foreach (@sorted_scores) { push(@sorted_words, $HashA{$_}; }
%HashA defines the relationship between scores and keywords. To get a list of keywords for a list of scores, simply loop over all the scores and use %HashA to find the corresponding keywords.
* - Well, it's possible using tie, but that's neither needed nor relevant here.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^4: Sorting or Aligning Parallel Hashes
by bart (Canon) on Apr 03, 2006 at 09:05 UTC | |
by ikegami (Patriarch) on Apr 03, 2006 at 14:09 UTC |