bitwise
Bitwise atoms: Python's bit-level operators.
Module nu.core.bitwise.
Bitwise atoms: Python's bit-level operators.
Maps Python's bitwise operators onto Nu ScalarQueries over integers. Pure compute; no Context effect of their own.
Operators to cover (Python -> Nu):
&->BitAnd,|->BitOr,^->BitXor~->BitNot(unary)<<->LShift,>>->RShift
Sorts: all ScalarQuery (Q). BitAnd / BitOr / BitXor fold over
their children from the first one with Python's operator (with no children
they yield the int identity, -1 for AND, 0 for OR / XOR); the shifts are
binary and BitNot is unary. Each atom defines compile (sync hot path)
and acompile (async hot path), both returning a thunk that captures the
precompiled child thunks. Sentinel propagation is inlined: an EMPTY operand
collapses the result to EMPTY.
| Name | Sort | Call | Meaning |
|---|---|---|---|
| BitAnd | scalar_query | BitAnd(*children) | The bitwise AND of its scalar children. |
| BitNot | scalar_query | BitNot(value) | The bitwise NOT of its one child. |
| BitOr | scalar_query | BitOr(*children) | The bitwise OR of its scalar children. |
| BitXor | scalar_query | BitXor(*children) | The bitwise XOR of its scalar children. |
| LShift | scalar_query | LShift(value, count) | The first child shifted left by the second. |
| RShift | scalar_query | RShift(value, count) | The first child shifted right by the second. |
BitAnd
The bitwise AND of its scalar children.
BitAnd(*children)Path nu.core.BitAnd. Kind ScalarQuery, sort scalar_query, cardinality scalar. Arity None (0 required).
Arguments
| Name | Type | Default | Meaning |
|---|---|---|---|
*children | the integers to AND together, folded left to right. |
Yields
The AND. EMPTY when any child is EMPTY.
Notes
- Folds from the first child with Python's
&, so it keeps the operands' own meaning (bools stay bool, sets intersect). No children at all yields -1, the int AND identity. - Operands are Python ints, two's-complement under the hood, so a negative operand ANDs its infinite leading 1s in.
- Children are evaluated in order and the fold stops at the first sentinel it meets.
Example
nu.run(nu.BitAnd(12, 10))[0]8BitNot
The bitwise NOT of its one child.
BitNot(value)Path nu.core.BitNot. Kind ScalarQuery, sort scalar_query, cardinality scalar. Arity 1 (1 required).
Arguments
| Name | Type | Default | Meaning |
|---|---|---|---|
value | the integer to invert. |
Yields
The inverted value. EMPTY when the child is EMPTY.
Notes
- Python ints have no fixed width, so NOT is the identity
~x == -x - 1: flipping every bit of a two's-complement number just negates it and subtracts one.
Example
nu.run(nu.BitNot(5))[0]-6BitOr
The bitwise OR of its scalar children.
BitOr(*children)Path nu.core.BitOr. Kind ScalarQuery, sort scalar_query, cardinality scalar. Arity None (0 required).
Arguments
| Name | Type | Default | Meaning |
|---|---|---|---|
*children | the integers to OR together, folded left to right. |
Yields
The OR. EMPTY when any child is EMPTY.
Notes
- Folds from the first child with Python's
|, so it keeps the operands' own meaning (bools stay bool, sets union, dicts merge). No children at all yields 0, the int OR identity. - Operands are Python ints, two's-complement under the hood, so a negative operand carries its infinite leading 1s through.
- Children are evaluated in order and the fold stops at the first sentinel it meets.
Example
nu.run(nu.BitOr(12, 10))[0]14BitXor
The bitwise XOR of its scalar children.
BitXor(*children)Path nu.core.BitXor. Kind ScalarQuery, sort scalar_query, cardinality scalar. Arity None (0 required).
Arguments
| Name | Type | Default | Meaning |
|---|---|---|---|
*children | the integers to XOR together, folded left to right. |
Yields
The XOR. EMPTY when any child is EMPTY.
Notes
- Folds from the first child with Python's
^, so it keeps the operands' own meaning (bools stay bool, sets take the symmetric difference). No children at all yields 0, the int XOR identity. - Operands are Python ints, two's-complement under the hood, so a negative operand flips its infinite leading 1s in the fold.
- Children are evaluated in order and the fold stops at the first sentinel it meets.
Example
nu.run(nu.BitXor(12, 10))[0]6LShift
The first child shifted left by the second.
LShift(value, count)Path nu.core.LShift. Kind ScalarQuery, sort scalar_query, cardinality scalar. Arity 2 (2 required).
Arguments
| Name | Type | Default | Meaning |
|---|---|---|---|
value | the integer to shift. | ||
count | how many bits to shift by. |
Yields
The shifted value. EMPTY when either child is EMPTY.
Notes
- Equivalent to multiplying by
2 ** count; sign is preserved since Python ints have no fixed width to overflow out of. - A negative count raises. Only EMPTY collapses to EMPTY; a real error stays a real error.
- The count child is evaluated only after the value yields, so a sentinel on the value short-circuits without touching the count.
Example
nu.run(nu.LShift(1, 4))[0]16RShift
The first child shifted right by the second.
RShift(value, count)Path nu.core.RShift. Kind ScalarQuery, sort scalar_query, cardinality scalar. Arity 2 (2 required).
Arguments
| Name | Type | Default | Meaning |
|---|---|---|---|
value | the integer to shift. | ||
count | how many bits to shift by. |
Yields
The shifted value. EMPTY when either child is EMPTY.
Notes
- Arithmetic shift: floor division by
2 ** count, sign extended, as Python's>>does. -16 shifted right by 2 is -4, not -3. - A negative count raises. Only EMPTY collapses to EMPTY; a real error stays a real error.
- The count child is evaluated only after the value yields, so a sentinel on the value short-circuits without touching the count.
Example
nu.run(nu.RShift(-16, 2))[0]-4