Bit Operations

Next: Comparisons Up: Integer (integer.h) Previous: Arithmetical Operations

Bit Operations

Shifting

Algorithm:      c := a << b

Input:      $a\in\textsf{Integer}, b\in\texttt{size\_t}$ .

Output:      $c\in\textsf{Integer}$ such that $c = a\cdot 2^b\quad\Box$

Algorithm:      c := c <<= a

Input:      $a\in\texttt{size\_t}, c\in\textsf{Integer}$ .

Output:      $c\in\textsf{Integer}$ such that $c := c\cdot 2^a\quad\Box$

Algorithm:      c := a >> b

Input:      $a\in\textsf{Integer}, b\in\texttt{size\_t}$ .

Output:      $c\in\textsf{Integer}$ such that $c = \mathrm{sign}(a)\lfloor\frac{\vert a\vert}{2^b}\rfloor\quad\Box$

Algorithm:      c := c >>= a

Input:      $a\in\texttt{size\_t}, c\in\textsf{Integer}$ .

Output:      $c\in\textsf{Integer}$ such that $c := \mathrm{sign}(c)\lfloor\frac{\vert c\vert}{2^a}\rfloor\quad\Box$
Both arguments of the same type:

Algorithm:      c := a & b

Input:      $a,b\in\textsf{Integer}$ .

Output:      $c\in\textsf{Integer}$ such that $c = a\wedge b\quad\Box$

Algorithm:      c := c &= a

Input:      $a,c\in\textsf{Integer}$ .

Output:      $c\in\textsf{Integer}$ such that $c := c\wedge a\quad\Box$

Algorithm:      c := a | b

Input:      $a,b\in\textsf{Integer}$ .

Output:      $c\in\textsf{Integer}$ such that $c = a\vee b\quad\Box$

Algorithm:      c := c |= a

Input:      $a,c\in\textsf{Integer}$ .

Output:      $c\in\textsf{Integer}$ such that $c := c\vee a\quad\Box$

Algorithm:      c := a ^ b

Input:      $a,b\in\textsf{Integer}$ .

Output:      $c\in\textsf{Integer}$ such that $c = \neg a\wedge b\vee a\wedge\neg b\quad\Box$

Algorithm:      c := c ^= a

Input:      $a,c\in\textsf{Integer}$ .

Output:      $c\in\textsf{Integer}$ such that $c := \neg c\wedge a\vee c\wedge\neg a\quad\Box$

Algorithm:      c := ~a

Input:      $a\in\textsf{Integer}$ .

Output:      $c\in\textsf{Integer}$ such that $c = \neg a\quad\Box$
Mixed mode expression:

Algorithm:      c := a & b

Input:      $a\in\textsf{Integer}, b\in\textsf{Digit}$ .

Output:      $c\in\textsf{Digit}$ such that $c = a\wedge b\quad\Box$

Algorithm:      c := a &= b

Input:      $a\in\textsf{Integer}, b\in\textsf{Digit}$ .

Output:      $a\in\textsf{Integer}, c\in\textsf{Digit}$ such that $a := a \wedge b, c = a\quad\Box$

Algorithm:      c := a | b

Input:      $a\in\textsf{Integer}, b\in\textsf{Digit}$ .

Output:      $c\in\textsf{Integer}$ such that $c = a\vee b\quad\Box$

Algorithm:      c := c |= a

Input:      $c\in\textsf{Integer}, a\in\textsf{Digit}$ .

Output:      $c\in\textsf{Integer}$ such that $c := c\vee a\quad\Box$

Algorithm:		`c := a << b`
Input:		$a\in\textsf{Integer}, b\in\texttt{size\_t}$ .
Output:		$c\in\textsf{Integer}$ such that $c = a\cdot 2^b\quad\Box$

Algorithm:		`c := c <<= a`
Input:		$a\in\texttt{size\_t}, c\in\textsf{Integer}$ .
Output:		$c\in\textsf{Integer}$ such that $c := c\cdot 2^a\quad\Box$

Algorithm:		`c := a >> b`
Input:		$a\in\textsf{Integer}, b\in\texttt{size\_t}$ .
Output:		$c\in\textsf{Integer}$ such that $c = \mathrm{sign}(a)\lfloor\frac{\vert a\vert}{2^b}\rfloor\quad\Box$

Algorithm:		`c := c >>= a`
Input:		$a\in\texttt{size\_t}, c\in\textsf{Integer}$ .
Output:		$c\in\textsf{Integer}$ such that $c := \mathrm{sign}(c)\lfloor\frac{\vert c\vert}{2^a}\rfloor\quad\Box$

Algorithm:		`c := a & b`
Input:		$a,b\in\textsf{Integer}$ .
Output:		$c\in\textsf{Integer}$ such that $c = a\wedge b\quad\Box$

Algorithm:		`c := c &= a`
Input:		$a,c\in\textsf{Integer}$ .
Output:		$c\in\textsf{Integer}$ such that $c := c\wedge a\quad\Box$

Algorithm:		`c := a \| b`
Input:		$a,b\in\textsf{Integer}$ .
Output:		$c\in\textsf{Integer}$ such that $c = a\vee b\quad\Box$

Algorithm:		`c := c \|= a`
Input:		$a,c\in\textsf{Integer}$ .
Output:		$c\in\textsf{Integer}$ such that $c := c\vee a\quad\Box$

Algorithm:		`c := a ^ b`
Input:		$a,b\in\textsf{Integer}$ .
Output:		$c\in\textsf{Integer}$ such that $c = \neg a\wedge b\vee a\wedge\neg b\quad\Box$

Algorithm:		`c := c ^= a`
Input:		$a,c\in\textsf{Integer}$ .
Output:		$c\in\textsf{Integer}$ such that $c := \neg c\wedge a\vee c\wedge\neg a\quad\Box$

Algorithm:		`c := ~a`
Input:		$a\in\textsf{Integer}$ .
Output:		$c\in\textsf{Integer}$ such that $c = \neg a\quad\Box$

Algorithm:		`c := a & b`
Input:		$a\in\textsf{Integer}, b\in\textsf{Digit}$ .
Output:		$c\in\textsf{Digit}$ such that $c = a\wedge b\quad\Box$

Algorithm:		`c := a &= b`
Input:		$a\in\textsf{Integer}, b\in\textsf{Digit}$ .
Output:		$a\in\textsf{Integer}, c\in\textsf{Digit}$ such that $a := a \wedge b, c = a\quad\Box$

Algorithm:		`c := a \| b`
Input:		$a\in\textsf{Integer}, b\in\textsf{Digit}$ .
Output:		$c\in\textsf{Integer}$ such that $c = a\vee b\quad\Box$

Algorithm:		`c := c \|= a`
Input:		$c\in\textsf{Integer}, a\in\textsf{Digit}$ .
Output:		$c\in\textsf{Integer}$ such that $c := c\vee a\quad\Box$

Next: Comparisons Up: Integer (integer.h) Previous: Arithmetical Operations

Piologie Version 1.2
3/3/1998