Devil Killer Is Here MiNi Shell
MiNi SheLL

Current Path : /proc/thread-self/root/usr/local/man/man3/
Linux boscustweb5002.eigbox.net 5.4.91 #1 SMP Wed Jan 20 18:10:28 EST 2021 x86_64
Current File : //proc/thread-self/root/usr/local/man/man3/Bit::Vector::Overload.3
.\" Automatically generated by Pod::Man v1.37, Pod::Parser v1.32
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sh \" Subsection heading
.br
.if t .Sp
.ne 5
.PP
\fB\\$1\fR
.PP
..
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" Set up some character translations and predefined strings.  \*(-- will
.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
.\" double quote, and \*(R" will give a right double quote.  | will give a
.\" real vertical bar.  \*(C+ will give a nicer C++.  Capital omega is used to
.\" do unbreakable dashes and therefore won't be available.  \*(C` and \*(C'
.\" expand to `' in nroff, nothing in troff, for use with C<>.
.tr \(*W-|\(bv\*(Tr
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
.ie n \{\
.    ds -- \(*W-
.    ds PI pi
.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
.    ds L" ""
.    ds R" ""
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds -- \|\(em\|
.    ds PI \(*p
.    ds L" ``
.    ds R" ''
'br\}
.\"
.\" If the F register is turned on, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.if \nF \{\
.    de IX
.    tm Index:\\$1\t\\n%\t"\\$2"
..
.    nr % 0
.    rr F
.\}
.\"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.hy 0
.if n .na
.\"
.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
.\" Fear.  Run.  Save yourself.  No user-serviceable parts.
.    \" fudge factors for nroff and troff
.if n \{\
.    ds #H 0
.    ds #V .8m
.    ds #F .3m
.    ds #[ \f1
.    ds #] \fP
.\}
.if t \{\
.    ds #H ((1u-(\\\\n(.fu%2u))*.13m)
.    ds #V .6m
.    ds #F 0
.    ds #[ \&
.    ds #] \&
.\}
.    \" simple accents for nroff and troff
.if n \{\
.    ds ' \&
.    ds ` \&
.    ds ^ \&
.    ds , \&
.    ds ~ ~
.    ds /
.\}
.if t \{\
.    ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
.    ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
.    ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
.    ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
.    ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
.    ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
.\}
.    \" troff and (daisy-wheel) nroff accents
.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
.ds ae a\h'-(\w'a'u*4/10)'e
.ds Ae A\h'-(\w'A'u*4/10)'E
.    \" corrections for vroff
.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
.    \" for low resolution devices (crt and lpr)
.if \n(.H>23 .if \n(.V>19 \
\{\
.    ds : e
.    ds 8 ss
.    ds o a
.    ds d- d\h'-1'\(ga
.    ds D- D\h'-1'\(hy
.    ds th \o'bp'
.    ds Th \o'LP'
.    ds ae ae
.    ds Ae AE
.\}
.rm #[ #] #H #V #F C
.\" ========================================================================
.\"
.IX Title "Bit::Vector::Overload 3"
.TH Bit::Vector::Overload 3 "2004-10-03" "perl v5.8.8" "User Contributed Perl Documentation"
.SH "NAME"
Bit::Vector::Overload \- Overloaded operators add\-on for Bit::Vector
.SH "USAGE"
.IX Header "USAGE"
Note that you do not need to "\f(CW\*(C`use Bit::Vector;\*(C'\fR"
in addition to this module.
.PP
Simply "\f(CW\*(C`use Bit::Vector::Overload;\*(C'\fR" \fB\s-1INSTEAD\s0\fR
of "\f(CW\*(C`use Bit::Vector;\*(C'\fR\*(L". You can still use all the
methods from the \*(R"Bit::Vector" module in addition
to the overloaded operators and methods provided
here after that.
.SH "SYNOPSIS"
.IX Header "SYNOPSIS"
.Vb 4
\&  Configuration
\&      $config = Bit::Vector->Configuration();
\&      Bit::Vector->Configuration($config);
\&      $oldconfig = Bit::Vector->Configuration($newconfig);
.Ve
.PP
.Vb 3
\&  String Conversion
\&      $string = "$vector";             #  depending on configuration
\&      print "\e$vector = '$vector'\en";
.Ve
.PP
.Vb 4
\&  Emptyness
\&      if ($vector)  #  if not empty (non-zero)
\&      if (! $vector)  #  if empty (zero)
\&      unless ($vector)  #  if empty (zero)
.Ve
.PP
.Vb 3
\&  Complement (one's complement)
\&      $vector2 = ~$vector1;
\&      $vector = ~$vector;
.Ve
.PP
.Vb 3
\&  Negation (two's complement)
\&      $vector2 = -$vector1;
\&      $vector = -$vector;
.Ve
.PP
.Vb 2
\&  Norm
\&      $norm = abs($vector);  #  depending on configuration
.Ve
.PP
.Vb 2
\&  Absolute
\&      $vector2 = abs($vector1);  #  depending on configuration
.Ve
.PP
.Vb 7
\&  Concatenation
\&      $vector3 = $vector1 . $vector2;
\&      $vector1 .= $vector2;
\&      $vector1 = $vector2 . $vector1;
\&      $vector2 = $vector1 . $scalar;  #  depending on configuration
\&      $vector2 = $scalar . $vector1;
\&      $vector .= $scalar;
.Ve
.PP
.Vb 3
\&  Duplication
\&      $vector2 = $vector1 x $factor;
\&      $vector x= $factor;
.Ve
.PP
.Vb 3
\&  Shift Left
\&      $vector2 = $vector1 << $bits;
\&      $vector <<= $bits;
.Ve
.PP
.Vb 3
\&  Shift Right
\&      $vector2 = $vector1 >> $bits;
\&      $vector >>= $bits;
.Ve
.PP
.Vb 5
\&  Union
\&      $vector3 = $vector1 | $vector2;
\&      $vector1 |= $vector2;
\&      $vector2 = $vector1 | $scalar;
\&      $vector |= $scalar;
.Ve
.PP
.Vb 4
\&      $vector3 = $vector1 + $vector2;  #  depending on configuration
\&      $vector1 += $vector2;
\&      $vector2 = $vector1 + $scalar;
\&      $vector += $scalar;
.Ve
.PP
.Vb 5
\&  Intersection
\&      $vector3 = $vector1 & $vector2;
\&      $vector1 &= $vector2;
\&      $vector2 = $vector1 & $scalar;
\&      $vector &= $scalar;
.Ve
.PP
.Vb 4
\&      $vector3 = $vector1 * $vector2;  #  depending on configuration
\&      $vector1 *= $vector2;
\&      $vector2 = $vector1 * $scalar;
\&      $vector *= $scalar;
.Ve
.PP
.Vb 5
\&  ExclusiveOr
\&      $vector3 = $vector1 ^ $vector2;
\&      $vector1 ^= $vector2;
\&      $vector2 = $vector1 ^ $scalar;
\&      $vector ^= $scalar;
.Ve
.PP
.Vb 7
\&  Set Difference
\&      $vector3 = $vector1 - $vector2;  #  depending on configuration
\&      $vector1 -= $vector2;
\&      $vector1 = $vector2 - $vector1;
\&      $vector2 = $vector1 - $scalar;
\&      $vector2 = $scalar - $vector1;
\&      $vector -= $scalar;
.Ve
.PP
.Vb 5
\&  Addition
\&      $vector3 = $vector1 + $vector2;  #  depending on configuration
\&      $vector1 += $vector2;
\&      $vector2 = $vector1 + $scalar;
\&      $vector += $scalar;
.Ve
.PP
.Vb 7
\&  Subtraction
\&      $vector3 = $vector1 - $vector2;  #  depending on configuration
\&      $vector1 -= $vector2;
\&      $vector1 = $vector2 - $vector1;
\&      $vector2 = $vector1 - $scalar;
\&      $vector2 = $scalar - $vector1;
\&      $vector -= $scalar;
.Ve
.PP
.Vb 5
\&  Multiplication
\&      $vector3 = $vector1 * $vector2;  #  depending on configuration
\&      $vector1 *= $vector2;
\&      $vector2 = $vector1 * $scalar;
\&      $vector *= $scalar;
.Ve
.PP
.Vb 7
\&  Division
\&      $vector3 = $vector1 / $vector2;
\&      $vector1 /= $vector2;
\&      $vector1 = $vector2 / $vector1;
\&      $vector2 = $vector1 / $scalar;
\&      $vector2 = $scalar / $vector1;
\&      $vector /= $scalar;
.Ve
.PP
.Vb 7
\&  Modulo
\&      $vector3 = $vector1 % $vector2;
\&      $vector1 %= $vector2;
\&      $vector1 = $vector2 % $vector1;
\&      $vector2 = $vector1 % $scalar;
\&      $vector2 = $scalar % $vector1;
\&      $vector %= $scalar;
.Ve
.PP
.Vb 6
\&  Exponentiation
\&      $vector3 = $vector1 ** $vector2;
\&      $vector1 **= $vector2;
\&      $vector2 = $vector1 ** $scalar;
\&      $vector2 = $scalar ** $vector1;
\&      $vector **= $scalar;
.Ve
.PP
.Vb 3
\&  Increment
\&      ++$vector;
\&      $vector++;
.Ve
.PP
.Vb 3
\&  Decrement
\&      --$vector;
\&      $vector--;
.Ve
.PP
.Vb 6
\&  Lexical Comparison (unsigned)
\&      $cmp = $vector1 cmp $vector2;
\&      if ($vector1 lt $vector2)
\&      if ($vector1 le $vector2)
\&      if ($vector1 gt $vector2)
\&      if ($vector1 ge $vector2)
.Ve
.PP
.Vb 5
\&      $cmp = $vector cmp $scalar;
\&      if ($vector lt $scalar)
\&      if ($vector le $scalar)
\&      if ($vector gt $scalar)
\&      if ($vector ge $scalar)
.Ve
.PP
.Vb 6
\&  Comparison (signed)
\&      $cmp = $vector1 <=> $vector2;
\&      if ($vector1 < $vector2)  #  depending on configuration
\&      if ($vector1 <= $vector2)
\&      if ($vector1 > $vector2)
\&      if ($vector1 >= $vector2)
.Ve
.PP
.Vb 5
\&      $cmp = $vector <=> $scalar;
\&      if ($vector < $scalar)  #  depending on configuration
\&      if ($vector <= $scalar)
\&      if ($vector > $scalar)
\&      if ($vector >= $scalar)
.Ve
.PP
.Vb 5
\&  Equality
\&      if ($vector1 eq $vector2)
\&      if ($vector1 ne $vector2)
\&      if ($vector eq $scalar)
\&      if ($vector ne $scalar)
.Ve
.PP
.Vb 4
\&      if ($vector1 == $vector2)
\&      if ($vector1 != $vector2)
\&      if ($vector == $scalar)
\&      if ($vector != $scalar)
.Ve
.PP
.Vb 2
\&  Subset Relationship
\&      if ($vector1 <= $vector2)  #  depending on configuration
.Ve
.PP
.Vb 2
\&  True Subset Relationship
\&      if ($vector1 < $vector2)  #  depending on configuration
.Ve
.PP
.Vb 2
\&  Superset Relationship
\&      if ($vector1 >= $vector2)  #  depending on configuration
.Ve
.PP
.Vb 2
\&  True Superset Relationship
\&      if ($vector1 > $vector2)  #  depending on configuration
.Ve
.SH "IMPORTANT NOTES"
.IX Header "IMPORTANT NOTES"
.IP "\(bu" 2
Boolean values
.Sp
Boolean values in this module are always a numeric zero ("\f(CW0\fR\*(L") for
\&\*(R"false\*(L" and a numeric one (\*(R"\f(CW1\fR\*(L") for \*(R"true".
.IP "\(bu" 2
Negative numbers
.Sp
Numeric factors (as needed for the "\f(CW\*(C`<<\*(C'\fR\*(L", \*(R"\f(CW\*(C`>>\*(C'\fR\*(L"
and \*(R"\f(CW\*(C`x\*(C'\fR" operators) and bit numbers are always regarded as being
\&\fB\s-1UNSIGNED\s0\fR.
.Sp
As a consequence, whenever you pass a negative number for such a factor
or bit number, it will be treated as a (usually very large) positive
number due to its internal two's complement binary representation, usually
resulting in malfunctions or an \*(L"index out of range\*(R" error message and
program abortion.
.Sp
Note that this does not apply to \*(L"big integer\*(R" decimal numbers, which
are (usually) passed as strings, and which may of course be negative
(see also the section \*(L"Big integers\*(R" a little further below).
.IP "\(bu" 2
Overloaded operators configuration
.Sp
Note that the behaviour of certain overloaded operators can be changed
in various ways by means of the "\f(CW\*(C`Configuration()\*(C'\fR" method (for more
details, see the description of this method further below).
.Sp
For instance, scalars (i.e., numbers and strings) provided as operands
to overloaded operators are automatically converted to bit vectors,
internally.
.Sp
These scalars are thereby automatically assumed to be indices or to be
in hexadecimal, binary, decimal or enumeration format, depending on the
configuration.
.Sp
Similarly, when converting bit vectors to strings using double quotes
(""), the output format will also depend on the previously chosen
configuration.
.Sp
Finally, some overloaded operators may have different semantics depending
on the proper configuration; for instance, the operator \*(L"+\*(R" can be the
\&\*(L"union\*(R" operator from set theory or the arithmetic \*(L"add\*(R" operator.
.Sp
In all cases (input, output and operator semantics), the defaults have
been chosen in such a way so that the behaviour of the module is backward
compatible with previous versions.
.IP "\(bu" 2
\&\*(L"Big integers\*(R"
.Sp
As long as \*(L"big integers\*(R" (for \*(L"big integer\*(R" arithmetic) are small enough
so that Perl doesn't need scientific notation (exponents) to be able to
represent them internally, you can provide these \*(L"big integer\*(R" constants
to the overloaded operators of this module (or to the method "\f(CW\*(C`from_Dec()\*(C'\fR")
in numeric form (i.e., either as a numeric constant or expression or as a
Perl variable containing a numeric value).
.Sp
Note that you will get an error message (resulting in program abortion)
if your \*(L"big integer\*(R" numbers exceed that limit.
.Sp
Because this limit is machine-dependent and not obvious to find out,
it is strongly recommended that you enclose \fB\s-1ALL\s0\fR your \*(L"big integer\*(R"
constants in your programs in (double or single) quotes.
.Sp
Examples:
.Sp
.Vb 1
\&    $vector /= 10;  #  ok because number is small
.Ve
.Sp
.Vb 1
\&    $vector /= -10;  #  ok for same reason
.Ve
.Sp
.Vb 1
\&    $vector /= "10";  #  always correct
.Ve
.Sp
.Vb 1
\&    $vector += "1152921504606846976";  #  quotes probably required here
.Ve
.Sp
All examples assume
.Sp
.Vb 1
\&    Bit::Vector->Configuration("input=decimal");
.Ve
.Sp
having been set beforehand.
.Sp
Note also that this module does not support scientific notation (exponents)
for \*(L"big integer\*(R" decimal numbers because you can always make the bit vector
large enough for the whole number to fit without loss of precision (as it
would occur if scientific notation were used).
.Sp
Finally, note that the only characters allowed in \*(L"big integer\*(R" constant
strings are the digits \f(CW0..9\fR and an optional leading sign ("\f(CW\*(C`+\*(C'\fR\*(L" or \*(R"\f(CW\*(C`\-\*(C'\fR").
.Sp
All other characters produce a syntax error.
.IP "\(bu" 2
Valid operands for overloaded operators
.Sp
All overloaded operators expect at least one bit vector operand,
in order for the operator to \*(L"know\*(R" that not the usual operation
is to be carried out, but rather the overloaded variant.
.Sp
This is especially true for all unary operators:
.Sp
.Vb 10
\&                    "$vector"
\&                    if ($vector)
\&                    if (!$vector)
\&                    ~$vector
\&                    -$vector
\&                    abs($vector)
\&                    ++$vector
\&                    $vector++
\&                    --$vector
\&                    $vector--
.Ve
.Sp
For obvious reasons the left operand (the \*(L"lvalue\*(R") of all
assignment operators is also required to be a bit vector:
.Sp
.Vb 13
\&                        .=
\&                        x=
\&                        <<=
\&                        >>=
\&                        |=
\&                        &=
\&                        ^=
\&                        +=
\&                        -=
\&                        *=
\&                        /=
\&                        %=
\&                       **=
.Ve
.Sp
In the case of three special operators, namely "\f(CW\*(C`<<\*(C'\fR\*(L",
\&\*(R"\f(CW\*(C`>>\*(C'\fR\*(L" and \*(R"\f(CW\*(C`x\*(C'\fR\*(L", as well as their related assignment
variants, \*(R"\f(CW\*(C`<<=\*(C'\fR\*(L", \*(R"\f(CW\*(C`>>=\*(C'\fR\*(L" and \*(R"\f(CW\*(C`x=\*(C'\fR", the
left operand is \fB\s-1ALWAYS\s0\fR a bit vector and the right operand is
\&\fB\s-1ALWAYS\s0\fR a number (which is the factor indicating how many times
the operator is to be applied).
.Sp
In all truly binary operators, i.e.,
.Sp
.Vb 17
\&                        .
\&                        |
\&                        &
\&                        ^
\&                        +
\&                        -
\&                        *
\&                        /
\&                        %
\&                       **
\&                    <=>   cmp
\&                     ==    eq
\&                     !=    ne
\&                     <     lt
\&                     <=    le
\&                     >     gt
\&                     >=    ge
.Ve
.Sp
one of either operands may be replaced by a Perl scalar, i.e.,
a number or a string, either as a Perl constant, a Perl expression
or a Perl variable yielding a number or a string.
.Sp
The same applies to the right side operand (the \*(L"rvalue\*(R") of the
remaining assignment operators, i.e.,
.Sp
.Vb 10
\&                        .=
\&                        |=
\&                        &=
\&                        ^=
\&                        +=
\&                        -=
\&                        *=
\&                        /=
\&                        %=
\&                       **=
.Ve
.Sp
Note that this Perl scalar should be of the correct type, i.e.,
numeric or string, for the chosen configuration, because otherwise
a warning message will occur if your program runs under the "\f(CW\*(C`\-w\*(C'\fR"
switch of Perl.
.Sp
The acceptable scalar types for each possible configuration are
the following:
.Sp
.Vb 6
\&    input = bit indices    (default)  :    numeric
\&    input = hexadecimal               :    string
\&    input = binary                    :    string
\&    input = decimal                   :    string     (in general)
\&    input = decimal                   :    numeric    (if small enough)
\&    input = enumeration               :    string
.Ve
.Sp
\&\s-1NOTE\s0 \s-1ALSO\s0 \s-1THAT\s0 \s-1THESE\s0 \s-1SCALAR\s0 \s-1OPERANDS\s0 \s-1ARE\s0 \s-1CONVERTED\s0 \s-1TO\s0 \s-1BIT\s0 \s-1VECTORS\s0 \s-1OF\s0
\&\s-1THE\s0 \s-1SAME\s0 \s-1SIZE\s0 \s-1AS\s0 \s-1THE\s0 \s-1BIT\s0 \s-1VECTOR\s0 \s-1WHICH\s0 \s-1IS\s0 \s-1THE\s0 \s-1OTHER\s0 \s-1OPERAND\s0.
.Sp
The only exception from this rule is the concatenation operator
("\f(CW\*(C`.\*(C'\fR\*(L") and its assignment variant (\*(R"\f(CW\*(C`.=\*(C'\fR"):
.Sp
If one of the two operands of the concatenation operator ("\f(CW\*(C`.\*(C'\fR\*(L") is
not a bit vector object but a Perl scalar, the contents of the remaining
bit vector operand are converted into a string (the format of which
depends on the configuration set with the \*(R"\f(CW\*(C`Configuration()\*(C'\fR" method),
which is then concatenated in the proper order (i.e., as indicated by the
order of the two operands) with the Perl scalar (in other words, a string
is returned in such a case instead of a bit vector object!).
.Sp
If the right side operand (the \*(L"rvalue\*(R") of the assignment variant
("\f(CW\*(C`.=\*(C'\fR") of the concatenation operator is a Perl scalar, it is converted
internally to a bit vector of the same size as the left side operand provided
that the configuration states that scalars are to be regarded as indices,
decimal strings or enumerations.
.Sp
If the configuration states that scalars are to be regarded as hexadecimal
or boolean strings, however, these strings are converted to bit vectors of
a size matching the length of the input string, i.e., four times the length
for hexadecimal strings (because each hexadecimal digit is worth 4 bits) and
once the length for binary strings.
.Sp
If a decimal number (\*(L"big integer\*(R") is too large to be stored in a
bit vector of the given size, a \*(L"numeric overflow error\*(R" occurs.
.Sp
If a bit index is out of range for the given bit vector, an \*(L"index
out of range\*(R" error occurs.
.Sp
If a scalar operand cannot be converted successfully due to invalid
syntax, a fatal \*(L"input string syntax error\*(R" is issued.
.Sp
If the two operands of the operator "\f(CW\*(C`<<\*(C'\fR\*(L", \*(R"\f(CW\*(C`>>\*(C'\fR\*(L"
or \*(R"\f(CW\*(C`x\*(C'\fR\*(L" are reversed, a fatal \*(R"reversed operands error" occurs.
.Sp
If an operand is neither a bit vector nor a scalar, then a fatal
\&\*(L"illegal operand type error\*(R" occurs.
.IP "\(bu" 2
Bit order
.Sp
Note that bit vectors are stored least order bit and least order word first
internally.
.Sp
I.e., bit #0 of any given bit vector corresponds to bit #0 of word #0 in the
array of machine words representing the bit vector.
.Sp
(Where word #0 comes first in memory, i.e., it is stored at the least memory
address in the allocated block of memory holding the given bit vector.)
.Sp
Note however that machine words can be stored least order byte first or last,
depending on your system's implementation.
.Sp
Note further that whenever bit vectors are converted to and from (binary or
hexadecimal) strings, the \fB\s-1RIGHTMOST\s0\fR bit is always the \fB\s-1LEAST\s0 \s-1SIGNIFICANT\s0\fR
one, and the \fB\s-1LEFTMOST\s0\fR bit is always the \fB\s-1MOST\s0 \s-1SIGNIFICANT\s0\fR bit.
.Sp
This is because in our western culture, numbers are always represented in this
way (least significant to most significant digits go from right to left).
.Sp
Of course this requires an internal reversion of order, which the corresponding
conversion methods perform automatically (without any additional overhead, it's
just a matter of starting the internal loop at the bottom or the top end).
.IP "\(bu" 2
Matching sizes
.Sp
In general, for methods involving several bit vectors at the same time, all
bit vector arguments must have identical sizes (number of bits), or a fatal
\&\*(L"size mismatch\*(R" error will occur.
.Sp
Exceptions from this rule are the methods "\f(CW\*(C`Concat()\*(C'\fR\*(L", \*(R"\f(CW\*(C`Concat_List()\*(C'\fR\*(L",
\&\*(R"\f(CW\*(C`Copy()\*(C'\fR\*(L", \*(R"\f(CW\*(C`Interval_Copy()\*(C'\fR\*(L" and \*(R"\f(CW\*(C`Interval_Substitute()\*(C'\fR", where no
conditions at all are imposed on the size of their bit vector arguments.
.Sp
In method "\f(CW\*(C`Multiply()\*(C'\fR", all three bit vector arguments must in principle
obey the rule of matching sizes, but the bit vector in which the result of
the multiplication is to be stored may be larger than the two bit vector
arguments containing the factors for the multiplication.
.Sp
In method "\f(CW\*(C`Power()\*(C'\fR", the bit vector for the result must be the same
size or greater than the base of the exponentiation term. The exponent
can be any size.
.Sp
The same applies to the corresponding overloaded operators.
.IP "\(bu" 2
Index ranges
.Sp
All indices for any given bits must lie between "\f(CW0\fR\*(L" and
\&\*(R"\f(CW\*(C`$vector\->Size()\-1\*(C'\fR\*(L", or a fatal \*(R"index out of range"
error will occur.
.SH "DESCRIPTION"
.IX Header "DESCRIPTION"
.IP "\(bu" 2
\&\f(CW\*(C`$config = Bit::Vector\->Configuration();\*(C'\fR
.IP "\(bu" 2
\&\f(CW\*(C`Bit::Vector\->Configuration($config);\*(C'\fR
.IP "\(bu" 2
\&\f(CW\*(C`$oldconfig = Bit::Vector\->Configuration($newconfig);\*(C'\fR
.Sp
This method serves to alter the semantics (i.e., behaviour) of certain
overloaded operators (which are all implemented in Perl, by the way).
.Sp
It does not have any effect whatsoever on anything else. In particular,
it does not affect the methods implemented in C.
.Sp
The method accepts an (optional) string as input in which certain keywords
are expected, which influence some or almost all of the overloaded operators
in several possible ways.
.Sp
The method always returns a string (which you do not need to take care of,
i.e., to store, in case you aren't interested in keeping it) which is a
complete representation of the current configuration (i.e., \fB\s-1BEFORE\s0\fR
any modifications are applied) and which can be fed back to this method
later in order to restore the previous configuration.
.Sp
There are three aspects of the way certain overloaded operators behave which
can be controlled with this method:
.Sp
.Vb 4
\&  +  the way scalar operands (replacing one of the two
\&     bit vector object operands) are automatically
\&     converted internally into a bit vector object of
\&     their own,
.Ve
.Sp
.Vb 3
\&  +  the operation certain overloaded operators perform,
\&     i.e., an operation with sets or an arithmetic
\&     operation,
.Ve
.Sp
.Vb 3
\&  +  the format to which bit vectors are converted
\&     automatically when they are enclosed in double
\&     quotes.
.Ve
.Sp
The input string may contain any number of assignments, each of which
controls one of these three aspects.
.Sp
Each assignment has the form "\f(CW\*(C`<which>=<value>\*(C'\fR".
.Sp
"\f(CW\*(C`<which>\*(C'\fR\*(L" and \*(R"\f(CW\*(C`<value>\*(C'\fR" thereby consist of letters
(\f(CW\*(C`[a\-zA\-Z]\*(C'\fR) and white space.
.Sp
Multiple assignments have to be separated by one or more comma (\*(L",\*(R"),
semi-colon (\*(L";\*(R"), colon (\*(L":\*(R"), vertical bar (\*(L"|\*(R"), slash (\*(L"/\*(R"),
newline (\*(L"\en\*(R"), ampersand (\*(L"&\*(R"), plus (\*(L"+\*(R") or dash (\*(L"\-\*(R").
.Sp
Empty lines or statements (only white space) are allowed but will be
ignored.
.Sp
"\f(CW\*(C`<which>\*(C'\fR\*(L" has to contain one or more keywords from one of
three groups, each group representing one of the three aspects that
the \*(R"\f(CW\*(C`Configuration()\*(C'\fR" method controls:
.Sp
.Vb 1
\&  +  "^scalar", "^input", "^in$"
.Ve
.Sp
.Vb 1
\&  +  "^operator", "^semantic", "^ops$"
.Ve
.Sp
.Vb 1
\&  +  "^string", "^output", "^out$"
.Ve
.Sp
The character \*(L"^\*(R" thereby denotes the beginning of a word, and \*(L"$\*(R"
denotes the end. Case is ignored (!).
.Sp
Using these keywords, you can build any phrase you like to select one
of the three aspects (see also examples given below).
.Sp
The only condition is that no other keyword from any of the other two
groups may match \- otherwise a syntax error will occur (i.e., ambiguities
are forbidden). A syntax error also occurs if none of the keywords
matches.
.Sp
This same principle applies to "\f(CW\*(C`<value>\*(C'\fR":
.Sp
Depending on which aspect you specified for "\f(CW\*(C`<which>\*(C'\fR",
there are different groups of keywords that determine the value
the selected aspect will be set to:
.Sp
.Vb 1
\&  +  "<which>" = "^scalar", "^input", "^in$":
.Ve
.Sp
.Vb 1
\&       "<value>" =
.Ve
.Sp
.Vb 5
\&       *  "^bit$", "^index", "^indice"
\&       *  "^hex"
\&       *  "^bin"
\&       *  "^dec"
\&       *  "^enum"
.Ve
.Sp
.Vb 1
\&  +  "<which>" = "^operator", "^semantic", "^ops$":
.Ve
.Sp
.Vb 1
\&       "<value>" =
.Ve
.Sp
.Vb 2
\&       *  "^set$"
\&       *  "^arithmetic"
.Ve
.Sp
.Vb 1
\&  +  "<which>" = "^string", "^output", "^out$":
.Ve
.Sp
.Vb 1
\&       "<value>" =
.Ve
.Sp
.Vb 4
\&       *  "^hex"
\&       *  "^bin"
\&       *  "^dec"
\&       *  "^enum"
.Ve
.Sp
Examples:
.Sp
.Vb 1
\&  "Any scalar input I provide should be considered to be = a bit index"
.Ve
.Sp
.Vb 1
\&  "I want to have operator semantics suitable for = arithmetics"
.Ve
.Sp
.Vb 1
\&  "Any bit vector in double quotes is to be output as = an enumeration"
.Ve
.Sp
\&\fB\s-1SCALAR\s0 \s-1INPUT:\s0\fR
.Sp
In the case of scalar input, "\f(CW\*(C`^bit$\*(C'\fR\*(L", \*(R"\f(CW\*(C`^index\*(C'\fR\*(L", or \*(R"\f(CW\*(C`^indice\*(C'\fR\*(L"
all cause scalar input to be considered to represent a bit index, i.e.,
\&\*(R"\f(CW\*(C`$vector ^= 5;\*(C'\fR\*(L" will flip bit #5 in the given bit vector (this is
essentially the same as \*(R"\f(CW\*(C`$vector\->bit_flip(5);\*(C'\fR").
.Sp
Note that \*(L"bit indices\*(R" is the default setting for \*(L"scalar input\*(R".
.Sp
The keyword "\f(CW\*(C`^hex\*(C'\fR\*(L" will cause scalar input to be considered as being in
hexadecimal, i.e., \*(R"\f(CW\*(C`$vector ^= 5;\*(C'\fR\*(L" will flip bit #0 and bit #2 (because
hexadecimal \*(R"\f(CW5\fR\*(L" is binary \*(R"\f(CW0101\fR").
.Sp
(Note though that hexadecimal input should always be enclosed in quotes,
otherwise it will be interpreted as a decimal number by Perl! The example
relies on the fact that hexadecimal \f(CW\*(C`0\-9\*(C'\fR and decimal \f(CW\*(C`0\-9\*(C'\fR are the same.)
.Sp
The keyword "\f(CW\*(C`^bin\*(C'\fR\*(L" will cause scalar input to be considered as being in
binary format. All characters except \*(R"\f(CW0\fR\*(L" and \*(R"\f(CW1\fR" are forbidden in
this case (i.e., produce a syntax error).
.Sp
"\f(CW\*(C`$vector ^= '0101';\*(C'\fR", for instance, will flip bit #0 and bit #2.
.Sp
The keyword "\f(CW\*(C`^dec\*(C'\fR\*(L" causes scalar input to be considered as integers
in decimal format, i.e., \*(R"\f(CW\*(C`$vector ^= 5;\*(C'\fR\*(L" will flip bit #0 and bit #2
(because decimal \*(R"\f(CW5\fR\*(L" is binary \*(R"\f(CW0101\fR").
.Sp
(Note though that all decimal input should be enclosed in quotes, because
for large numbers, Perl will use scientific notation internally for
representing them, which produces a syntax error because scientific
notation is neither supported by this module nor needed.)
.Sp
Finally, the keyword "\f(CW\*(C`^enum\*(C'\fR\*(L" causes scalar input to be considered
as being a list (\*(R"enumeration\*(L") of indices and ranges of (contiguous)
indices, i.e., \*(R"\f(CW\*(C`$vector |= '2,3,5,7\-13,17\-23';\*(C'\fR" will cause bits #2,
#3, #5, #7 through #13 and #17 through #23 to be set.
.Sp
\&\fB\s-1OPERATOR\s0 \s-1SEMANTICS:\s0\fR
.Sp
Several overloaded operators can have two distinct functions depending
on this setting.
.Sp
The affected operators are: "\f(CW\*(C`+\*(C'\fR\*(L", \*(R"\f(CW\*(C`\-\*(C'\fR\*(L", \*(R"\f(CW\*(C`*\*(C'\fR\*(L", \*(R"\f(CW\*(C`<\*(C'\fR\*(L", \*(R"\f(CW\*(C`<=\*(C'\fR\*(L",
\&\*(R"\f(CW\*(C`>\*(C'\fR\*(L" and \*(R"\f(CW\*(C`>=\*(C'\fR".
.Sp
With the default setting, \*(L"set operations\*(R", these operators perform:
.Sp
.Vb 7
\&  +       set union                           ( set1  u   set2 )
\&  -       set difference                      ( set1  \e   set2 )
\&  *       set intersection                    ( set1  n   set2 )
\&  <       true subset relationship            ( set1  <   set2 )
\&  <=      subset relationship                 ( set1  <=  set2 )
\&  >       true superset relationship          ( set1  >   set2 )
\&  >=      superset relationship               ( set1  >=  set2 )
.Ve
.Sp
With the alternative setting, \*(L"arithmetic operations\*(R", these operators
perform:
.Sp
.Vb 7
\&  +       addition                            ( num1  +   num2 )
\&  -       subtraction                         ( num1  -   num2 )
\&  *       multiplication                      ( num1  *   num2 )
\&  <       "less than" comparison              ( num1  <   num2 )
\&  <=      "less than or equal" comparison     ( num1  <=  num2 )
\&  >       "greater than" comparison           ( num1  >   num2 )
\&  >=      "greater than or equal" comparison  ( num1  >=  num2 )
.Ve
.Sp
Note that these latter comparison operators ("\f(CW\*(C`<\*(C'\fR\*(L", \*(R"\f(CW\*(C`<=\*(C'\fR\*(L",
\&\*(R"\f(CW\*(C`>\*(C'\fR\*(L" and \*(R"\f(CW\*(C`>=\*(C'\fR") regard their operands as being \fB\s-1SIGNED\s0\fR.
.Sp
To perform comparisons with \fB\s-1UNSIGNED\s0\fR operands, use the operators
"\f(CW\*(C`lt\*(C'\fR\*(L", \*(R"\f(CW\*(C`le\*(C'\fR\*(L", \*(R"\f(CW\*(C`gt\*(C'\fR\*(L" and \*(R"\f(CW\*(C`ge\*(C'\fR" instead (in contrast to the
operators above, these operators are \fB\s-1NOT\s0\fR affected by the
\&\*(L"operator semantics\*(R" setting).
.Sp
\&\fB\s-1STRING\s0 \s-1OUTPUT:\s0\fR
.Sp
There are four methods which convert the contents of a given bit vector
into a string: "\f(CW\*(C`to_Hex()\*(C'\fR\*(L", \*(R"\f(CW\*(C`to_Bin()\*(C'\fR\*(L", \*(R"\f(CW\*(C`to_Dec()\*(C'\fR\*(L" and \*(R"\f(CW\*(C`to_Enum()\*(C'\fR\*(L"
(not counting \*(R"\f(CW\*(C`Block_Read()\*(C'\fR", since this method does not return a
human-readable string).
.Sp
(For conversion to octal, see the description of the method
"\f(CW\*(C`Chunk_List_Read()\*(C'\fR".)
.Sp
Therefore, there are four possible formats into which a bit vector can
be converted when it is enclosed in double quotes, for example:
.Sp
.Vb 2
\&  print "\e$vector = '$vector'\en";
\&  $string = "$vector";
.Ve
.Sp
Hence you can set \*(L"string output\*(R" to four different values: To \*(L"hex\*(R"
for hexadecimal format (which is the default), to \*(L"bin\*(R" for binary
format, to \*(L"dec\*(R" for conversion to decimal numbers and to \*(L"enum\*(R"
for conversion to enumerations (\*(L".newsrc\*(R" style sets).
.Sp
\&\fB\s-1BEWARE\s0\fR that the conversion to decimal numbers is inherently slow;
it can easily take up several seconds for a single large bit vector!
.Sp
Therefore you should store the decimal strings returned to you
rather than converting a given bit vector again.
.Sp
\&\fB\s-1EXAMPLES:\s0\fR
.Sp
The default setting as returned by the method "\f(CW\*(C`Configuration()\*(C'\fR"
is:
.Sp
.Vb 3
\&        Scalar Input       = Bit Index
\&        Operator Semantics = Set Operators
\&        String Output      = Hexadecimal
.Ve
.Sp
Performing a statement such as:
.Sp
.Vb 2
\&  Bit::Vector->Configuration("in=bin,ops=arithmetic,out=bin");
\&  print Bit::Vector->Configuration(), "\en";
.Ve
.Sp
yields the following output:
.Sp
.Vb 3
\&        Scalar Input       = Binary
\&        Operator Semantics = Arithmetic Operators
\&        String Output      = Binary
.Ve
.Sp
Note that you can always feed this output back into the "\f(CW\*(C`Configuration()\*(C'\fR"
method to restore that setting later.
.Sp
This also means that you can enter the same given setting with almost any
degree of verbosity you like (as long as the required keywords appear and
no ambiguities arise).
.Sp
Note further that any aspect you do not specify is not changed, i.e.,
the statement
.Sp
.Vb 1
\&  Bit::Vector->Configuration("operators = arithmetic");
.Ve
.Sp
leaves all other aspects unchanged.
.IP "\(bu" 2
\&\f(CW"$vector"\fR
.Sp
Remember that variables enclosed in double quotes are always
interpolated in Perl.
.Sp
Whenever a Perl variable containing the reference of a \*(L"Bit::Vector\*(R"
object is enclosed in double quotes (either alone or together with
other text and/or variables), the contents of the corresponding
bit vector are converted into a printable string.
.Sp
Since there are several conversion methods available in this module
(see the description of the methods "\f(CW\*(C`to_Hex()\*(C'\fR\*(L", \*(R"\f(CW\*(C`to_Bin()\*(C'\fR\*(L",
\&\*(R"\f(CW\*(C`to_Dec()\*(C'\fR\*(L" and \*(R"\f(CW\*(C`to_Enum()\*(C'\fR"), it is of course desirable to
be able to choose which of these methods should be applied in this
case.
.Sp
This can actually be done by changing the configuration of this
module using the method "\f(CW\*(C`Configure()\*(C'\fR" (see the previous chapter,
immediately above).
.Sp
The default is conversion to hexadecimal.
.IP "\(bu" 2
\&\f(CW\*(C`if ($vector)\*(C'\fR
.Sp
It is possible to use a Perl variable containing the reference of a
\&\*(L"Bit::Vector\*(R" object as a boolean expression.
.Sp
The condition above is true if the corresponding bit vector contains
at least one set bit, and it is false if \fB\s-1ALL\s0\fR bits of the corresponding
bit vector are cleared.
.IP "\(bu" 2
\&\f(CW\*(C`if (!$vector)\*(C'\fR
.Sp
Since it is possible to use a Perl variable containing the reference of a
\&\*(L"Bit::Vector\*(R" object as a boolean expression, you can of course also negate
this boolean expression.
.Sp
The condition above is true if \fB\s-1ALL\s0\fR bits of the corresponding bit vector
are cleared, and it is false if the corresponding bit vector contains at
least one set bit.
.Sp
Note that this is \fB\s-1NOT\s0\fR the same as using the method "\f(CW\*(C`is_full()\*(C'\fR",
which returns true if \fB\s-1ALL\s0\fR bits of the corresponding bit vector are
\&\fB\s-1SET\s0\fR.
.IP "\(bu" 2
\&\f(CW\*(C`~$vector\*(C'\fR
.Sp
This term returns a new bit vector object which is the one's complement
of the given bit vector.
.Sp
This is equivalent to inverting all bits.
.IP "\(bu" 2
\&\f(CW\*(C`\-$vector\*(C'\fR (unary minus)
.Sp
This term returns a new bit vector object which is the two's complement
of the given bit vector.
.Sp
This is equivalent to inverting all bits and incrementing the result by one.
.Sp
(This is the same as changing the sign of a number in two's complement
binary representation.)
.IP "\(bu" 2
\&\f(CW\*(C`abs($vector)\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR" for more details), this term either returns
the number of set bits in the given bit vector (this is the same
as calculating the number of elements which are contained in the
given set) \- which is the default behaviour, or it returns a new
bit vector object which contains the absolute value of the number
stored in the given bit vector.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 . $vector2\*(C'\fR
.Sp
This term usually returns a new bit vector object which is the
result of the concatenation of the two bit vector operands.
.Sp
The left operand becomes the most significant, and the right operand
becomes the least significant part of the new bit vector object.
.Sp
If one of the two operands is not a bit vector object but a Perl scalar,
however, the contents of the remaining bit vector operand are converted
into a string (the format of which depends on the configuration set with
the "\f(CW\*(C`Configuration()\*(C'\fR" method), which is then concatenated in the proper
order (i.e., as indicated by the order of the two operands) with the Perl
scalar.
.Sp
In other words, a string is returned in such a case instead of a
bit vector object!
.IP "\(bu" 2
\&\f(CW\*(C`$vector x $factor\*(C'\fR
.Sp
This term returns a new bit vector object which is the concatenation
of as many copies of the given bit vector operand (the left operand)
as the factor (the right operand) specifies.
.Sp
If the factor is zero, a bit vector object with a length of zero bits
is returned.
.Sp
If the factor is one, just a new copy of the given bit vector is
returned.
.Sp
Note that a fatal \*(L"reversed operands error\*(R" occurs if the two operands
are swapped.
.IP "\(bu" 2
\&\f(CW\*(C`$vector << $bits\*(C'\fR
.Sp
This term returns a new bit vector object which is a copy of the given
bit vector (the left operand), which is then shifted left (towards the
most significant bit) by as many places as the right operand, "\f(CW$bits\fR",
specifies.
.Sp
This means that the "\f(CW$bits\fR\*(L" most significant bits are lost, all other
bits move up by \*(R"\f(CW$bits\fR\*(L" positions, and the \*(R"\f(CW$bits\fR" least significant
bits that have been left unoccupied by this shift are all set to zero.
.Sp
If "\f(CW$bits\fR" is greater than the number of bits of the given bit vector,
this term returns an empty bit vector (i.e., with all bits cleared) of
the same size as the given bit vector.
.Sp
Note that a fatal \*(L"reversed operands error\*(R" occurs if the two operands
are swapped.
.IP "\(bu" 2
\&\f(CW\*(C`$vector >> $bits\*(C'\fR
.Sp
This term returns a new bit vector object which is a copy of the given
bit vector (the left operand), which is then shifted right (towards the
least significant bit) by as many places as the right operand, "\f(CW$bits\fR",
specifies.
.Sp
This means that the "\f(CW$bits\fR\*(L" least significant bits are lost, all other
bits move down by \*(R"\f(CW$bits\fR\*(L" positions, and the \*(R"\f(CW$bits\fR" most significant
bits that have been left unoccupied by this shift are all set to zero.
.Sp
If "\f(CW$bits\fR" is greater than the number of bits of the given bit vector,
this term returns an empty bit vector (i.e., with all bits cleared) of
the same size as the given bit vector.
.Sp
Note that a fatal \*(L"reversed operands error\*(R" occurs if the two operands
are swapped.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 | $vector2\*(C'\fR
.Sp
This term returns a new bit vector object which is the result of
a bitwise \s-1OR\s0 operation between the two bit vector operands.
.Sp
This is the same as calculating the union of two sets.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 & $vector2\*(C'\fR
.Sp
This term returns a new bit vector object which is the result of
a bitwise \s-1AND\s0 operation between the two bit vector operands.
.Sp
This is the same as calculating the intersection of two sets.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 ^ $vector2\*(C'\fR
.Sp
This term returns a new bit vector object which is the result of
a bitwise \s-1XOR\s0 (exclusive\-or) operation between the two bit vector
operands.
.Sp
This is the same as calculating the symmetric difference of two sets.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 + $vector2\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR" for more details), this term either returns
a new bit vector object which is the result of a bitwise \s-1OR\s0 operation
between the two bit vector operands (this is the same as calculating
the union of two sets) \- which is the default behaviour, or it returns
a new bit vector object which contains the sum of the two numbers
stored in the two bit vector operands.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 \- $vector2\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR" for more details), this term either returns
a new bit vector object which is the set difference of the two sets
represented in the two bit vector operands \- which is the default
behaviour, or it returns a new bit vector object which contains
the difference of the two numbers stored in the two bit vector
operands.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 * $vector2\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR" for more details), this term either returns
a new bit vector object which is the result of a bitwise \s-1AND\s0 operation
between the two bit vector operands (this is the same as calculating
the intersection of two sets) \- which is the default behaviour, or it
returns a new bit vector object which contains the product of the two
numbers stored in the two bit vector operands.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 / $vector2\*(C'\fR
.Sp
This term returns a new bit vector object containing the result of the
division of the two numbers stored in the two bit vector operands.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 % $vector2\*(C'\fR
.Sp
This term returns a new bit vector object containing the remainder of
the division of the two numbers stored in the two bit vector operands.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 ** $vector2\*(C'\fR
.Sp
This term returns a new bit vector object containing the result of the
exponentiation of the left bit vector elevated to the right bit vector's
power.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 .= $vector2;\*(C'\fR
.Sp
This statement \*(L"appends\*(R" the right bit vector operand (the \*(L"rvalue\*(R")
to the left one (the \*(L"lvalue\*(R").
.Sp
The former contents of the left operand become the most significant
part of the resulting bit vector, and the right operand becomes the
least significant part.
.Sp
Since bit vectors are stored in \*(L"least order bit first\*(R" order, this
actually requires the left operand to be shifted \*(L"up\*(R" by the length
of the right operand, which is then copied to the now freed least
significant part of the left operand.
.Sp
If the right operand is a Perl scalar, it is first converted to a
bit vector of the same size as the left operand, provided that the
configuration states that scalars are to be regarded as indices,
decimal strings or enumerations.
.Sp
If the configuration states that scalars are to be regarded as hexadecimal
or boolean strings, however, these strings are converted to bit vectors of
a size matching the length of the input string, i.e., four times the length
for hexadecimal strings (because each hexadecimal digit is worth 4 bits) and
once the length for binary strings.
.IP "\(bu" 2
\&\f(CW\*(C`$vector x= $factor;\*(C'\fR
.Sp
This statement replaces the given bit vector by a concatenation of as many
copies of the original contents of the given bit vector as the factor (the
right operand) specifies.
.Sp
If the factor is zero, the given bit vector is resized to a length of zero
bits.
.Sp
If the factor is one, the given bit vector is not changed at all.
.IP "\(bu" 2
\&\f(CW\*(C`$vector <<= $bits;\*(C'\fR
.Sp
This statement moves the contents of the given bit vector left by "\f(CW$bits\fR"
positions (towards the most significant bit).
.Sp
This means that the "\f(CW$bits\fR\*(L" most significant bits are lost, all other
bits move up by \*(R"\f(CW$bits\fR\*(L" positions, and the \*(R"\f(CW$bits\fR" least significant
bits that have been left unoccupied by this shift are all set to zero.
.Sp
If "\f(CW$bits\fR" is greater than the number of bits of the given bit vector,
the given bit vector is erased completely (i.e., all bits are cleared).
.IP "\(bu" 2
\&\f(CW\*(C`$vector >>= $bits;\*(C'\fR
.Sp
This statement moves the contents of the given bit vector right by "\f(CW$bits\fR"
positions (towards the least significant bit).
.Sp
This means that the "\f(CW$bits\fR\*(L" least significant bits are lost, all other
bits move down by \*(R"\f(CW$bits\fR\*(L" positions, and the \*(R"\f(CW$bits\fR" most significant
bits that have been left unoccupied by this shift are all set to zero.
.Sp
If "\f(CW$bits\fR" is greater than the number of bits of the given bit vector,
the given bit vector is erased completely (i.e., all bits are cleared).
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 |= $vector2;\*(C'\fR
.Sp
This statement performs a bitwise \s-1OR\s0 operation between the two
bit vector operands and stores the result in the left operand.
.Sp
This is the same as calculating the union of two sets.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 &= $vector2;\*(C'\fR
.Sp
This statement performs a bitwise \s-1AND\s0 operation between the two
bit vector operands and stores the result in the left operand.
.Sp
This is the same as calculating the intersection of two sets.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 ^= $vector2;\*(C'\fR
.Sp
This statement performs a bitwise \s-1XOR\s0 (exclusive\-or) operation
between the two bit vector operands and stores the result in the
left operand.
.Sp
This is the same as calculating the symmetric difference of two sets.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 += $vector2;\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR" for more details), this statement either performs
a bitwise \s-1OR\s0 operation between the two bit vector operands (this is
the same as calculating the union of two sets) \- which is the default
behaviour, or it calculates the sum of the two numbers stored in the
two bit vector operands.
.Sp
The result of this operation is stored in the left operand.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 \-= $vector2;\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR" for more details), this statement either calculates
the set difference of the two sets represented in the two bit vector
operands \- which is the default behaviour, or it calculates the
difference of the two numbers stored in the two bit vector operands.
.Sp
The result of this operation is stored in the left operand.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 *= $vector2;\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR" for more details), this statement either performs
a bitwise \s-1AND\s0 operation between the two bit vector operands (this is
the same as calculating the intersection of two sets) \- which is the
default behaviour, or it calculates the product of the two numbers
stored in the two bit vector operands.
.Sp
The result of this operation is stored in the left operand.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 /= $vector2;\*(C'\fR
.Sp
This statement puts the result of the division of the two numbers
stored in the two bit vector operands into the left operand.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 %= $vector2;\*(C'\fR
.Sp
This statement puts the remainder of the division of the two numbers
stored in the two bit vector operands into the left operand.
.IP "\(bu" 2
\&\f(CW\*(C`$vector1 **= $vector2;\*(C'\fR
.Sp
This statement puts the result of the exponentiation of the left
operand elevated to the right operand's power into the left operand.
.IP "\(bu" 2
\&\f(CW\*(C`++$vector\*(C'\fR, \f(CW\*(C`$vector++\*(C'\fR
.Sp
This operator performs pre\- and post-incrementation of the
given bit vector.
.Sp
The value returned by this term is a reference of the given
bit vector object (after or before the incrementation,
respectively).
.IP "\(bu" 2
\&\f(CW\*(C`\-\-$vector\*(C'\fR, \f(CW\*(C`$vector\-\-\*(C'\fR
.Sp
This operator performs pre\- and post-decrementation of the
given bit vector.
.Sp
The value returned by this term is a reference of the given
bit vector object (after or before the decrementation,
respectively).
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 cmp $vector2)\*(C'\fR
.Sp
This term returns "\f(CW\*(C`\-1\*(C'\fR\*(L" if \*(R"\f(CW$vector1\fR\*(L" is less than \*(R"\f(CW$vector2\fR\*(L",
\&\*(R"\f(CW0\fR\*(L" if \*(R"\f(CW$vector1\fR\*(L" and \*(R"\f(CW$vector2\fR\*(L" are the same, and \*(R"\f(CW1\fR\*(L"
if \*(R"\f(CW$vector1\fR\*(L" is greater than \*(R"\f(CW$vector2\fR".
.Sp
This comparison assumes \fB\s-1UNSIGNED\s0\fR bit vectors.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 eq $vector2)\*(C'\fR
.Sp
This term returns true ("\f(CW1\fR\*(L") if the contents of the two bit vector
operands are the same and false (\*(R"\f(CW0\fR") otherwise.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 ne $vector2)\*(C'\fR
.Sp
This term returns true ("\f(CW1\fR\*(L") if the two bit vector operands differ
and false (\*(R"\f(CW0\fR") otherwise.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 lt $vector2)\*(C'\fR
.Sp
This term returns true ("\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is less than \*(R"\f(CW$vector2\fR\*(L",
and false (\*(R"\f(CW0\fR") otherwise.
.Sp
This comparison assumes \fB\s-1UNSIGNED\s0\fR bit vectors.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 le $vector2)\*(C'\fR
.Sp
This term returns true ("\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is less than or equal to
\&\*(R"\f(CW$vector2\fR\*(L", and false (\*(R"\f(CW0\fR") otherwise.
.Sp
This comparison assumes \fB\s-1UNSIGNED\s0\fR bit vectors.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 gt $vector2)\*(C'\fR
.Sp
This term returns true ("\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is greater than \*(R"\f(CW$vector2\fR\*(L",
and false (\*(R"\f(CW0\fR") otherwise.
.Sp
This comparison assumes \fB\s-1UNSIGNED\s0\fR bit vectors.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 ge $vector2)\*(C'\fR
.Sp
This term returns true ("\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is greater than or equal to
\&\*(R"\f(CW$vector2\fR\*(L", and false (\*(R"\f(CW0\fR") otherwise.
.Sp
This comparison assumes \fB\s-1UNSIGNED\s0\fR bit vectors.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 <=> $vector2)\*(C'\fR
.Sp
This term returns "\f(CW\*(C`\-1\*(C'\fR\*(L" if \*(R"\f(CW$vector1\fR\*(L" is less than \*(R"\f(CW$vector2\fR\*(L",
\&\*(R"\f(CW0\fR\*(L" if \*(R"\f(CW$vector1\fR\*(L" and \*(R"\f(CW$vector2\fR\*(L" are the same, and \*(R"\f(CW1\fR\*(L"
if \*(R"\f(CW$vector1\fR\*(L" is greater than \*(R"\f(CW$vector2\fR".
.Sp
This comparison assumes \fB\s-1SIGNED\s0\fR bit vectors.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 == $vector2)\*(C'\fR
.Sp
This term returns true ("\f(CW1\fR\*(L") if the contents of the two bit vector
operands are the same and false (\*(R"\f(CW0\fR") otherwise.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 != $vector2)\*(C'\fR
.Sp
This term returns true ("\f(CW1\fR\*(L") if the two bit vector operands differ
and false (\*(R"\f(CW0\fR") otherwise.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 < $vector2)\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR\*(L" for more details), this term either returns
true (\*(R"\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is a true subset of \*(R"\f(CW$vector2\fR\*(L"
(and false (\*(R"\f(CW0\fR\*(L") otherwise) \- which is the default behaviour,
or it returns true (\*(R"\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is less than
\&\*(R"\f(CW$vector2\fR\*(L" (and false (\*(R"\f(CW0\fR") otherwise).
.Sp
The latter comparison assumes \fB\s-1SIGNED\s0\fR bit vectors.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 <= $vector2)\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR\*(L" for more details), this term either returns
true (\*(R"\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is a subset of \*(R"\f(CW$vector2\fR\*(L" (and
false (\*(R"\f(CW0\fR\*(L") otherwise) \- which is the default behaviour, or it
returns true (\*(R"\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is less than or equal to
\&\*(R"\f(CW$vector2\fR\*(L" (and false (\*(R"\f(CW0\fR") otherwise).
.Sp
The latter comparison assumes \fB\s-1SIGNED\s0\fR bit vectors.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 > $vector2)\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR\*(L" for more details), this term either returns
true (\*(R"\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is a true superset of \*(R"\f(CW$vector2\fR\*(L"
(and false (\*(R"\f(CW0\fR\*(L") otherwise) \- which is the default behaviour,
or it returns true (\*(R"\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is greater than
\&\*(R"\f(CW$vector2\fR\*(L" (and false (\*(R"\f(CW0\fR") otherwise).
.Sp
The latter comparison assumes \fB\s-1SIGNED\s0\fR bit vectors.
.IP "\(bu" 2
\&\f(CW\*(C`($vector1 >= $vector2)\*(C'\fR
.Sp
Depending on the configuration (see the description of the method
"\f(CW\*(C`Configuration()\*(C'\fR\*(L" for more details), this term either returns
true (\*(R"\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is a superset of \*(R"\f(CW$vector2\fR\*(L" (and
false (\*(R"\f(CW0\fR\*(L") otherwise) \- which is the default behaviour, or it
returns true (\*(R"\f(CW1\fR\*(L") if \*(R"\f(CW$vector1\fR\*(L" is greater than or equal to
\&\*(R"\f(CW$vector2\fR\*(L" (and false (\*(R"\f(CW0\fR") otherwise).
.Sp
The latter comparison assumes \fB\s-1SIGNED\s0\fR bit vectors.
.SH "SEE ALSO"
.IX Header "SEE ALSO"
\&\fIBit::Vector\fR\|(3), \fIBit::Vector::String\fR\|(3).
.SH "VERSION"
.IX Header "VERSION"
This man page documents \*(L"Bit::Vector::Overload\*(R" version 6.4.
.SH "AUTHOR"
.IX Header "AUTHOR"
.Vb 3
\&  Steffen Beyer
\&  mailto:sb@engelschall.com
\&  http://www.engelschall.com/u/sb/download/
.Ve
.SH "COPYRIGHT"
.IX Header "COPYRIGHT"
Copyright (c) 2000 \- 2004 by Steffen Beyer. All rights reserved.
.SH "LICENSE"
.IX Header "LICENSE"
This package is free software; you can redistribute it and/or
modify it under the same terms as Perl itself, i.e., under the
terms of the \*(L"Artistic License\*(R" or the \*(L"\s-1GNU\s0 General Public License\*(R".
.PP
The C library at the core of this Perl module can additionally
be redistributed and/or modified under the terms of the \*(L"\s-1GNU\s0
Library General Public License\*(R".
.PP
Please refer to the files \*(L"Artistic.txt\*(R", \*(L"\s-1GNU_GPL\s0.txt\*(R" and
\&\*(L"\s-1GNU_LGPL\s0.txt\*(R" in this distribution for details!
.SH "DISCLAIMER"
.IX Header "DISCLAIMER"
This package is distributed in the hope that it will be useful,
but \s-1WITHOUT\s0 \s-1ANY\s0 \s-1WARRANTY\s0; without even the implied warranty of
\&\s-1MERCHANTABILITY\s0 or \s-1FITNESS\s0 \s-1FOR\s0 A \s-1PARTICULAR\s0 \s-1PURPOSE\s0.
.PP
See the \*(L"\s-1GNU\s0 General Public License\*(R" for more details.
Creat By MiNi SheLL
Email: devilkiller@gmail.com