Arithmetic combinator

Arithmetic combinator/infobox The arithmetic combinator is part of the circuit network and one of three types of combinators available in the game (along with the constant combinator and decider combinator). Each arithmetic combinator can perform any one of the following mathematical operations on signals, and will show the corresponding symbol on its top:

• addition (+)
• subtraction (-)
• multiplication (*)
• division (/)
• modulo (%)
• exponentiation (^)
• left bit shift (<<)
• right bit shift (>>)
• bitwise AND (&)
• bitwise OR (|)
• bitwise XOR (^)

The arithmetic combinator accepts two input connections (red and green wires), and sends its output to both output connections. The input wires connect to the nubs on the left side of the sprite in the sidebar, while the outputs connect to the right side.

Function

The internal logic process has three steps:

1. All input signals on the red and green wires are summed within the combinator.
2. The specified operation is performed on the selected signal(s).
3. The result of this operation is output as the selected output signal.

The left operand of the operation can be any single signal or the each virtual signal, and the right operand can be any single signal or a constant value.

If the left operand is a single signal, the output must be a single signal. The operation is performed on the values of the chosen left and right signals, and the result is sent to the output on the specified signal.

If the left operand is the each signal, then the output can be a single signal or the each signal. If the output is the each signal, then the operation is performed individually on the value of each input signal along with the value of the right operand, and each result is sent to the output on the same signal. If the output is a single signal, the operation is done on each of the input signals, the individual results are all added together, and that result is sent to the output on the specified signal.

Notes on operations

When using division, the result is truncated:

• 21 / 10 = 2
• 19 / 10 = 1
• -21 / 10 = -2
• -19 / 10 = -1
• 21 / -10 = -2
• 19 / -10 = -1
• -21 / -10 = 2
• -19 / -10 = 1

Modulo, indicated using % as it is in most programming languages, is the remainder after division. For example, 13 % 3 is 1 (13 = 4 * 3 + 1). This can be used, for example, to separate out individual digits of a number for use in building visual indicators, along with division:

• (24321 / 10000) % 10 = 2
• (24321 / 1000) % 10 = 4
• (24321 / 100) % 10 = 3
• (24321 / 10) % 10 = 2
• (24321 / 1) % 10 = 1

Negating the left operand of a modulo negates the result, while negating the right operand does nothing:

• 13 % 3 = 1
• 13 % -3 = 1
• -13 % 3 = -1
• -13 % -3 = -1

History

• 0.15.0:
  • Added Modulo, Power, Left Bit Shift, Right Bit Shift, Bitwise AND, Bitwise OR and Bitwise XOR to the Arithmetic Combinator.

• 0.13.0:
  • Connected wires are highlighted when hovering over a combinator connected to the circuit network.
  • Combinators show input and output in alt mode.
  • More virtual signals for combinators.
  • Constant combinator can be rotated.
  • Decider combinator "input count" option makes the combinator copy the count of the specified output signal from the input signals, instead of copying the count from the condition.
  • New combinator graphics.

• 0.12.5:
  • Combinators now emit light.

• 0.12.2:
  • Combinators no longer turn off when no wires are connected.

• 0.12.0:
  • Introduced

See Also

• Decider combinator
• Constant combinator
• Combinator tutorial
• Circuit network
• Circuit network cookbook