Checking if your kit is complete...
Looks good
Writing Makefile for Sort::ArbBiLex
cp ArbBiLex.pm blib/lib/Sort/ArbBiLex.pm
Manifying blib/man3/Sort::ArbBiLex.3
PERL_DL_NONLAZY=1 /home/cpanrun/pa-risc1.1/build/5.6.1/bin/perl -Iblib/arch -Iblib/lib -I/home/cpanrun/pa-risc1.1/build/5.6.1/lib/5.6.1/PA-RISC1.1-thread-multi -I/home/cpanrun/pa-risc1.1/build/5.6.1/lib/5.6.1 -e 'use Test::Harness qw(&runtests $verbose); $verbose=1; runtests @ARGV;' t/*.t
t/00_about.............1..1
#
#
# Sort::ArbBiLex v4.01
#
#
# Running in a Unicodey world
# Running under perl version 5.006001 for hpux
# Current time local: Sat Nov 17 16:24:03 2007
# Current time GMT:   Sat Nov 17 08:24:03 2007
# Using Test.pm v1.15
ok 1
ok
t/10_basic.............1..20
ok 1
 Output  : Aba ~ aba ~ ax'ub ~ ahub iki ~ ahuba ~ ahubiki ~ hub ~ x'ub
 Expected: Aba ~ aba ~ ax'ub ~ ahub iki ~ ahuba ~ ahubiki ~ hub ~ x'ub
ok 2
ok 3
ok 4
ok 5
ok 6
ok 7
ok 8
ok 9
ok 10
ok 11
ok 12
ok 13
ok 14
ok 15
ok 16
ok 17
ok 18
ok 19
ok 20
ok
t/15_basic_source......1..8
ok 1
#: -- two-level multichar: --
#: # Generated by Sort::ArbBiLex v4.01 at Sat Nov 17 16:24:06 2007 GMT
#: { # Multi-character mode.  So we need a closure for these variables.
#: my(%major, %minor);
#: @major{"\x20","A","a","b","h","x\x27","i","u"}
#:  = ("\x00","\x01","\x01","\x02","\x03","\x03","\x04","\x05");
#: @minor{"\x20","A","a","b","h","x\x27","i","u"}
#:  = ("\x00","\x00","\x01","\x00","\x00","\x01","\x00","\x00");
#: my $glyph_re = join "|", map(quotemeta,
#:                              sort {length($b) <=> length($a)} keys %major);
#:                              # put the longest glyphs first
#: 
#: # Two-level mode
#: sub {   # change that to "sub whatever {" to name this function
#:   no locale; # we need the real 8-bit ASCIIbetical sort()
#:   use strict;
#:   return
#:     # map sort map is the Schwartzian Transform.  See perlfaq4.
#:     map { $_->[0] }
#:     sort {
#:            $a->[1] cmp $b->[1] ||
#:            do {
#:              foreach my $x ($a, $b) {
#:                if( !defined($x->[2]) and defined($x->[0]) ) {
#:                  $x->[2] = join '',
#:                                 map $minor{$_},
#:                                     $x->[0] =~ m<($glyph_re)>go;
#: 
#:                }
#:              }
#:              $a->[2] cmp $b->[2]; # return value of this do-block
#:            }
#:          }
#:     map { [ $_,
#:             join('', map $major{$_}, m<($glyph_re)>go)  # major keymaker
#: 
#:             , undef
#:           ]
#:         }
#:     @_;
#: }
#: } # end of closure.
#: 
#:----
ok 2
#: -- two-level singlechar: --
#: # Generated by Sort::ArbBiLex v4.01 at Sat Nov 17 16:24:06 2007 GMT
#: # Single character mode.
#: # Two-level mode
#: sub {   # change that to "sub whatever {" to name this function
#:   no locale; # we need the real 8-bit ASCIIbetical sort()
#:   use strict;
#:   return
#:     # map sort map is the Schwartzian Transform.  See perlfaq4.
#:     map { $_->[0] }
#:     sort {
#:            $a->[1] cmp $b->[1] ||
#:            do {
#:              foreach my $x ($a, $b) {
#:                if( !defined($x->[2]) and defined($x->[0]) ) {
#:                  $x->[2] =  $x->[0];
#:                  $x->[2] =~ tr[\x20Aabhxiu][]cd;
#:                  $x->[2] =~ tr[\x20Aabhxiu]
#:                              [\x00\x00\x01\x00\x00\x01\x00\x00];
#: 
#:                }
#:              }
#:              $a->[2] cmp $b->[2]; # return value of this do-block
#:            }
#:          }
#:     map { [ $_,
#:             do { # major keymaker
#:                my($key) = $_;
#:                $key =~ tr[\x20Aabhxiu][]cd;
#:                $key =~ tr[\x20Aabhxiu]
#:                          [\x00\x01\x01\x02\x03\x03\x04\x05];
#:                scalar($key);
#:             }
#: 
#:             , undef
#:           ]
#:         }
#:     @_;
#: }
#: 
#: 
#:----
ok 3
#: -- one-level singlechar: --
#: # Generated by Sort::ArbBiLex v4.01 at Sat Nov 17 16:24:06 2007 GMT
#: # Single character mode.
#: # One-level mode
#: sub {   # change that to "sub whatever {" to name this function
#:   no locale; # we need the real 8-bit ASCIIbetical sort()
#:   use strict;
#:   return
#:     # map sort map is the Schwartzian Transform.  See perlfaq4.
#:     map { $_->[0] }
#:     sort { $a->[1] cmp $b->[1] }
#:     map { [ $_,
#:             do { # major keymaker
#:                my($key) = $_;
#:                $key =~ tr[\x20Aabhxiu][]cd;
#:                $key =~ tr[\x20Aabhxiu]
#:                          [\x00\x01\x02\x03\x04\x05\x06\x07];
#:                scalar($key);
#:             }
#: 
#:           ]
#:         }
#:     @_;
#: }
#: 
#: 
#:----
ok 4
#: -- one-level singlechar: --
#: # Generated by Sort::ArbBiLex v4.01 at Sat Nov 17 16:24:06 2007 GMT
#: # Single character mode.
#: # One-level mode
#: sub {   # change that to "sub whatever {" to name this function
#:   no locale; # we need the real 8-bit ASCIIbetical sort()
#:   use strict;
#:   return
#:     # map sort map is the Schwartzian Transform.  See perlfaq4.
#:     map { $_->[0] }
#:     sort { $a->[1] cmp $b->[1] }
#:     map { [ $_,
#:             do { # major keymaker
#:                my($key) = $_;
#:                $key =~ tr[\x20Aabhxiu][]cd;
#:                $key =~ tr[\x20Aabhxiu]
#:                          [\x00\x01\x02\x03\x04\x05\x06\x07];
#:                scalar($key);
#:             }
#: 
#:           ]
#:         }
#:     @_;
#: }
#: 
#: 
#:----
ok 5
#: -- variant one-level singlechar: --
#: # Generated by Sort::ArbBiLex v4.01 at Sat Nov 17 16:24:06 2007 GMT
#: # Single character mode.
#: # One-level mode
#: sub {   # change that to "sub whatever {" to name this function
#:   no locale; # we need the real 8-bit ASCIIbetical sort()
#:   use strict;
#:   return
#:     # map sort map is the Schwartzian Transform.  See perlfaq4.
#:     map { $_->[0] }
#:     sort { $a->[1] cmp $b->[1] }
#:     map { [ $_,
#:             do { # major keymaker
#:                my($key) = $_;
#:                $key =~ tr[\x20Aabhxiu][]cd;
#:                $key =~ tr[\x20Aabhxiu]
#:                          [\x00\x01\x02\x03\x04\x05\x06\x07];
#:                scalar($key);
#:             }
#: 
#:           ]
#:         }
#:     @_;
#: }
#: 
#: 
#:----
ok 6
#: -- one-level multichar: --
#: # Generated by Sort::ArbBiLex v4.01 at Sat Nov 17 16:24:06 2007 GMT
#: { # Multi-character mode.  So we need a closure for these variables.
#: my(%major); # just one-level mode, tho.
#: @major{"\x20","A","a","b","h","xh","i","u"}
#:  = ("\x00","\x01","\x02","\x03","\x04","\x05","\x06","\x07");
#: my $glyph_re = join "|", map(quotemeta,
#:                              sort {length($b) <=> length($a)} keys %major);
#:                              # put the longest glyphs first
#: 
#: # One-level mode
#: sub {   # change that to "sub whatever {" to name this function
#:   no locale; # we need the real 8-bit ASCIIbetical sort()
#:   use strict;
#:   return
#:     # map sort map is the Schwartzian Transform.  See perlfaq4.
#:     map { $_->[0] }
#:     sort { $a->[1] cmp $b->[1] }
#:     map { [ $_,
#:             join('', map $major{$_}, m<($glyph_re)>go)  # major keymaker
#: 
#:           ]
#:         }
#:     @_;
#: }
#: } # end of closure.
#: 
#:----
ok 7
#: -- variant one-level multichar: --
#: # Generated by Sort::ArbBiLex v4.01 at Sat Nov 17 16:24:06 2007 GMT
#: { # Multi-character mode.  So we need a closure for these variables.
#: my(%major); # just one-level mode, tho.
#: @major{"\x20","A","a","b","h","xh","i","u"}
#:  = ("\x00","\x01","\x02","\x03","\x04","\x05","\x06","\x07");
#: my $glyph_re = join "|", map(quotemeta,
#:                              sort {length($b) <=> length($a)} keys %major);
#:                              # put the longest glyphs first
#: 
#: # One-level mode
#: sub {   # change that to "sub whatever {" to name this function
#:   no locale; # we need the real 8-bit ASCIIbetical sort()
#:   use strict;
#:   return
#:     # map sort map is the Schwartzian Transform.  See perlfaq4.
#:     map { $_->[0] }
#:     sort { $a->[1] cmp $b->[1] }
#:     map { [ $_,
#:             join('', map $major{$_}, m<($glyph_re)>go)  # major keymaker
#: 
#:           ]
#:         }
#:     @_;
#: }
#: } # end of closure.
#: 
#:----
ok 8
# Bye!
ok
t/20_unicode...........1..20
ok 1
Unknown discipline ':utf8' at t/20_unicode.t line 22.
dubious
	Test returned status 255 (wstat 65280, 0xff00)
DIED. FAILED tests 2-20
	Failed 19/20 tests, 5.00% okay
t/25_unicode_source....1..8
ok 1
Unknown discipline ':utf8' at t/25_unicode_source.t line 23.
dubious
	Test returned status 255 (wstat 65280, 0xff00)
DIED. FAILED tests 2-8
	Failed 7/8 tests, 12.50% okay
Failed 2/5 test scripts, 60.00% okay. 26/57 subtests failed, 54.39% okay.
Failed Test           Stat Wstat Total Fail  Failed  List of Failed
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
t/20_unicode.t         255 65280    20   38 190.00%  2-20
t/25_unicode_source.t  255 65280     8   14 175.00%  2-8
make: *** [test_dynamic] Error 2