# Difference between revisions of "Bit.bor"

From ComputerCraft Wiki

m (Mapped "int" to "int (type)") |
m (Use type template) |
||

Line 2: | Line 2: | ||

{{Function | {{Function | ||

|name=bit.bor | |name=bit.bor | ||

− | |args= | + | |args={{Type|int}} m, {{Type|int}} n |

|api=bit | |api=bit | ||

− | |returns= | + | |returns={{Type|int}} the value of <var>m</var> OR <var>n</var> |

|addon=ComputerCraft | |addon=ComputerCraft | ||

|desc=Computes the bitwise inclusive OR of two numbers | |desc=Computes the bitwise inclusive OR of two numbers |

## Revision as of 14:16, 22 April 2013

Function bit.bor | |

Computes the bitwise inclusive OR of two numbers | |

Syntax | bit.bor(int m, int n) |

Returns | int the value of m OR n |

Part of | ComputerCraft |

API | bit |

## Examples

Example | |

OR the number 18 (10010) with the number 3 (00011), yielding 19 (10011) | |

Code |
print(bit.bor(18, 3)) |

Output |
19 |

## Explanation

All bit operations operate in binary numeral system [1]. An inclusive OR operation between two bits yields a 1 if either of the bits is 1 and a 0 if they are both 0. This function produces an output by computing the OR of each bit of its two inputs independently. So, for the example above:

Bit index: | 4 | 3 | 2 | 1 | 0 |
---|---|---|---|---|---|

Input 1 (18): | 1 | 0 | 0 | 1 | 0 |

Input 2 (3): | 0 | 0 | 0 | 1 | 1 |

Calculation: | 18 has a 1 | Both 0 | Both 0 | Both 1 | 3 has a 1 |

Output (19): | 1 | 0 | 0 | 1 | 1 |