Simon Cozens:
# $a = 2 | 3;
# print $a;
#
# but here's another way of looking at it. Given that we have a
# junction of two integers, we look at the zeroth bit of the
# junction. If ANY of the zeroth bits in 2 and 3 are set, then
# we set the zeroth bit in the result. If ANY of the first bits
# in 2 and 3 are set, then we set the first bit in the result.
# Hey presto, we've just defined bitwise or in terms of junctions.
Yup, and that's what we're doing (last I heard). Except that we'll make
them say something like C<bitwise(2 | 3)> so they don't accidentally do
the Wrong Thing. (Of course, the C<bitvector> (or whatever) class would
probably do this conversion implicitly for, say, passing into a
subroutine.)
--Brent Dax <[EMAIL PROTECTED]>
@roles=map {"Parrot $_"} qw(embedding regexen Configure)
"If you want to propagate an outrageously evil idea, your conclusion
must be brazenly clear, but your proof unintelligible."
--Ayn Rand, explaining how today's philosophies came to be
