Date (UTC) | User | Event |
---|---|---|
2025-03-19 19:46 | Demindiro | Reference refs/heads/master created (470b1563b2fb2f4ed3240159339974e59c0277fb) |
2025-03-19 19:45 | Demindiro | Repository has been created |
Compute "ternary logic" using an 8-entry lookup table.
For each bit, the expression will be computed as: | a
|
b
| c
| lut
| | — | — | — |
——————— | | 0
| 0
| 0
|
lut & (1 << 0) != 0
| |
0
| 0
| 1
|
lut & (1 << 1) != 0
| |
0
| 1
| 0
|
lut & (1 << 2) != 0
| |
0
| 1
| 1
|
lut & (1 << 3) != 0
| |
1
| 0
| 0
|
lut & (1 << 4) != 0
| |
1
| 0
| 1
|
lut & (1 << 5) != 0
| |
1
| 1
| 0
|
lut & (1 << 6) != 0
| |
1
| 1
| 1
|
lut & (1 << 7) != 0
|
// if sprite_mask { background } else { sprite }
background.ternlog(sprite, sprite_mask, 0xe4)