YW. I later looked inside some of the existing getopts modules to see what other rules they implement, and boy are they ever complicated. Reverse engineering the rules from them would be a nightmare.

Here's a slightly cleaner refactoring of the above:

sub getOpts {
    my %opts;
    my @toDelete;
    for( my $i=0; $i < @ARGV; ++$i ) {
        $_ = $ARGV[ $i ];
        if( m[^-(.)(.*)$] ) {
            my( $first, $rest ) = ( $1, $2 );
            push @toDelete, $i;
            next unless defined $first;
            if( $first ne '-' ) {
                $opts{ $_ } = 1 for $first, split'',$rest;
                next;
            }
            last if $rest eq '';
            if( $ARGV[ $i+1 ] !~ m[^-] ) {
                $opts{ $rest } = $ARGV[ ++$i ];
                push @toDelete, $i;
            }
            if( $rest =~ m[^no(.+)$] ) {
                $opts{ $1 } = 0;
            }
            else {
                $opts{ $rest } = 1;
            }
        }
    }
    splice @ARGV, $_, 1 for reverse @toDelete;
    return %opts;
}
[download]