Re: sorting headers in a file

[2teez]

Hi utpalmtbi,
I agree totally with the advice of usage of some kind of database as mentioned by hdb.
However, using your dataset one can get his/her dirty using perl hash and a kind of "modified" Schwartzian transform like so:

use warnings;
use strict;

my %hash;
my $key;

while (<DATA>) {
    next if /^\s+$/;
    if (/^>/) {
        $key = $_;
    }
    else {
        $hash{$key} = $_;
    }
}

print map { $_->[0], $hash{ $_->[0] }, $/ }
  sort { $a->[1] <=> $b->[1] }
  map { [ $_, /(\d+$)/ ] } keys %hash;

__DATA__
>or3
agagatgatagat

>or10

aacctttagtag

>or1

gtatatatata

>or2

tactacatgagg

NOTE:
I can't tell how this is do using a larger datasets..

[hdb]

Your code relies on a number of implicit assumptions:

• Using a hash implies that the ">or..." bits are unique. If two or more identical appear, your code would lose data.
• You also assume that blank lines are of no significance.
• If there is a multiline sequence, you will only store the last line.

[2teez]

Your code relies on a number of implicit assumptions:...

Assumptions that are savely ok considering the OP dataset.
And that was why I said ..using your dataset.. i.e that of the OP in my previous reply, which I don't suppose have anything which follows "THE" assumptions, you stated. Except the OP has said otherwise to you privately.

[hdb]

I did not want to say that anything is wrong with your code. I only thought it useful to highlight the assumptions which you were aware of but probably not every reader of the thread. And I have no additional information about the question.