Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Investigate bit-shift optimisation for division/multiplication by powers of 2 #43

Closed
saxbophone opened this issue May 15, 2022 · 0 comments · Fixed by #132
Closed

Investigate bit-shift optimisation for division/multiplication by powers of 2 #43

saxbophone opened this issue May 15, 2022 · 0 comments · Fixed by #132
Labels
optimisation

Comments

@saxbophone
Copy link
Owner

saxbophone commented May 15, 2022 •
edited
Loading

Depends on #6
For getting the remainder from division, depends on #44 in order to get the remainder that would be shifted out easily, although we can implement floor-division without remainder by ignoring that dependency...

Depends on #114 if wanted to implement this outside of Nat class
@saxbophone saxbophone added the blocked This cannot be started until prerequisite(s) are completed label May 15, 2022
@saxbophone saxbophone added optimisation blocked This cannot be started until prerequisite(s) are completed and removed blocked This cannot be started until prerequisite(s) are completed labels May 25, 2022
@saxbophone saxbophone removed the blocked This cannot be started until prerequisite(s) are completed label Feb 1, 2023
@saxbophone saxbophone mentioned this issue Feb 18, 2023
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
optimisation
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Optimise multiplication and division by powers of two saxbophone/arby
1 participant
@saxbophone