Gecko [ www.plinplanplanner.net ]

Name	Size	Permission
brp-fix-pyc-reproducibility	560 B	-rwxr-xr-x
brp-ldconfig	417 B	-rwxr-xr-x
brp-mangle-shebangs	4.41 KB	-rwxr-xr-x
brp-python-bytecompile	5.64 KB	-rwxr-xr-x
brp-strip-lto	575 B	-rwxr-xr-x
compileall2.py	21.59 KB	-rw-r--r--
config.guess	42.91 KB	-rwxr-xr-x
config.sub	35.46 KB	-rwxr-xr-x
dist.sh	1.94 KB	-rwxr-xr-x
find-provides	1.19 KB	-rwxr-xr-x
find-requires	1013 B	-rwxr-xr-x
gpgverify	3.54 KB	-rwxr-xr-x
kmodtool	9.03 KB	-rwxr-xr-x
macros	15.85 KB	-rw-r--r--
redhat-annobin-cc1	89 B	-r--r--r--
redhat-annobin-plugin-select.s...	6.05 KB	-rwxr-xr-x
redhat-annobin-select-annobin-...	89 B	-r--r--r--
redhat-annobin-select-gcc-buil...	93 B	-r--r--r--
redhat-hardened-cc1	153 B	-r--r--r--
redhat-hardened-clang.cfg	6 B	-r--r--r--
redhat-hardened-ld	47 B	-r--r--r--
rpmrc	5.52 KB	-rw-r--r--
rpmsort	2.11 KB	-rwxr-xr-x

Code Editor : rpmsort

#! /usr/bin/perl -w

# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License
# as published by the Free Software Foundation; either version 2
# of the License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
# MA 02110-1301 USA.

use Getopt::Long qw(:config gnu_getopt);

sub rpm_cmp_versions {
    my ($evr1, $evr2) = @_;

sub _rpm_cmp {
	my ($s1, $s2) = @_;

return defined $s1 <=> defined $s2
	    unless defined $s1 && defined $s2;

my ($r, $x1, $x2);
	do {
	    $s1 =~ s/^[^a-zA-Z0-9]+//;
	    $s2 =~ s/^[^a-zA-Z0-9]+//;
	    if ($s1 =~ /^\d/ || $s2 =~ /^\d/) {
		$s1 =~ s/^0*(\d*)//;  $x1 = $1;
		$s2 =~ s/^0*(\d*)//;  $x2 = $1;
		$r = length $x1 <=> length $x2 || $x1 cmp $x2;
	    } else {
		$s1 =~ s/^([a-zA-Z]*)//;  $x1 = $1;
		$s2 =~ s/^([a-zA-Z]*)//;  $x2 = $1;
		return 0
		    if $x1 eq '' && $x2 eq '';
		$r = $x1 cmp $x2;
	    }
	} until $r;
	return $r;
    }

my ($e1, $v1, $r1) = $evr1 =~ /^(?:(\d*):)?(.*?)(?:-([^-]*))?$/;
    my ($e2, $v2, $r2) = $evr2 =~ /^(?:(\d*):)?(.*?)(?:-([^-]*))?$/;
    my $r = _rpm_cmp($e1 || 0, $e2 || 0);
    $r = _rpm_cmp($v1, $v2)
	unless $r;
    $r = _rpm_cmp($r1, $r2)
	unless $r;
    return $r;
}

my $reorder = sub { return @_ };
my $key = 0;

GetOptions ("r|reverse"	    => sub { $reorder = sub { return reverse @_ } },
	    "k|key=i"	    => \$key)
or do {
    print STDERR "Usage\n";
    exit 1;
};

if ($key == 0) {
    # Sort by entire lines
    map { print } &$reorder(sort { rpm_cmp_versions($a, $b) } <>);
} else {
    # Sort by field $key
    my @data = map { [(split)[$key-1], $_] } <>;
    map { print } &$reorder(map { $_->[1] }
        sort { rpm_cmp_versions($a->[0], $b->[0]) } @data);
}

${this.title}

Code Editor : rpmsort