my %opts;
#Arguments that take no options
$opts{$_} = undef for qw(A D E L R X c demo help l r x);
#Arguments that must take options
# (may is easily doable with a lookahead in the do but
#  then you cannot accept negative numbers as values
#  without them being adjoined to the switch)
# do{ if( $ARGV[$i+1] =~ /^-/ ){ 1; }else{ $i--; shift;} }
$opts{$_} = "0 but true" for qw(I d f m w);
for(my $i=0; $i <= scalar @ARGV; $i++){
  #End arguments at --
  shift && last if $ARGV[$i] eq '--';
#UPDATE: The sort gives priority to longer switches
  foreach my $key ( sort { length($b)-length($a) } keys %opts){
    if( $ARGV[$i] =~ /^-$key=?(.*)/ ){
      #Get rid of the switch, keep $i in sync
      shift; $i--;
      #Set the value (if adjoined or shift else 1)
      $opts{$key} = defined($1) && $1 ne '' ?
        $1 : defined($opts{$key}) ? do{$i--; shift} : 1;
      #Short circuit
      last;
    }
  }
}
#Clear unseen switches that take values to not pass along false positi
+ves
$_ eq '0 but true' && ($_ = undef) for values %opts;
[download]