I promise this is mathematically equivalent-ish to the original. (0.2 and its multiples are nonterminating decimals in base 2, so there's a little jank when the negative shift right is a shift left.)
don't bother exploding crates into four bools, and then comparing them all individually to a bunch of conditions. absurd bit manipulation bullshit saves cycles and tokens. leaving a crate's movement rule represented as four bits means we can exploit our previous calculation of dx1 and dy1, which must each either be 0x0001 or 0x8FFF, and violently hammer them down to align with this bit-packed representation, giving this glorious little atrocity.
integers in the range [0, 15] fit entirely in the bit mask 0x000F. integers out of that range will have at least one bit 0x0010 or higher, or will have the sign bit 0x8000 set. so to find out if one of two numbers is out of range [0, 15], we can check the bit mask of their bitwise or.
this saves tokens and cycles. it is also completely illegible. very in the spirit of Pico-8, I love it.
Rope rewrite, part one
We should only care about anchors on the old path
Add comment expressing uncertainty
Add further algo notes
One final note
Well, this is closer to right!!
Elide points as needed
Save current changes
First version I couldn't immediately break
Everything _seems_ to work
Clean up some residual messes
Tidy up more loose ends
Co-authored-by: Nyeogmi <economicsbat@gmail.com>
Reviewed-on: #11
2022-12-21 05:44:15 +00:00
1 changed files with 427 additions and 377 deletions
File diff suppressed because it is too large
Load Diff
Reference in New Issue
Block a user
Blocking a user prevents them from interacting with repositories, such as opening or commenting on pull requests or issues. Learn more about blocking a user.
