comment on

I think that I would splurge a little on memory and use a hash (or maybe an array if the names are really '1' .. '9'). All the operations you want are easy and straightforward with a hash:

my %state;
@state{1..9}=();
[download]

have name, clear bit
```
$state{$name} = undef;
[download]
```

have name(s), set bit(s)

@state{@names} = (1) x @names;
[download]

get count of set bits

my $count = grep {$_} values %state;
[download]

have one set bit, get its name

my $setname = (grep {$state{$_}} keys %state)[0];
[download]

have multiple set bits, get names (debugging only)

my @setnames = grep {$state{$_}} keys %state;
[download]

bit-wise logical ops, OR, AND, ...

# same as ordinary perl
print $foo if $state{$one} && $state{$tother};
[download]

A small hash like this isn't going to break the bank, and the perl operations to maintain it are much simpler than bit-twiddling.

Fixed typo in #2, thanks blokhead++

After Compline,
Zaxo

In reply to Re: bit-wise by Zaxo
in thread bit-wise by rir

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


more useful options
	PerlMonks