Add apint to README as another alternative #21
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
The ApInt crate is a pure rust implementation for arbitrary fixed bitwidth modulo arithmetics of integers with a focus on correctness and efficiency - especially for smaller bit widths. It features a generic signless `ApInt` as well as signed counterparts `Int` (signed int) and `UInt` (unsigned int) that are thin wrappers around it. The implementation is unfinished in some parts but that should be fixed over time.
|
Sure, thanks! bors r+ |
bors bot
added a commit
that referenced
this pull request
Feb 15, 2018
21: Add apint to README as another alternative r=cuviper a=Robbepop The ApInt crate is a pure rust implementation for arbitrary fixed bitwidth modulo arithmetics of integers with a focus on correctness and efficiency - especially for smaller bit widths. It features a generic signless `ApInt` as well as signed counterparts `Int` (signed int) and `UInt` (unsigned int) that are thin wrappers around it. The implementation is unfinished in some parts but that should be fixed over time. Link to crate at crates.io: https://crates.io/crates/apint Link to repo at GitHub: https://github.com/robbepop/apint
Build failed |
|
Thanks for trying to merge! :] I don't understand why bors build (travisCI) failed for this PR. I don't think it is a problem with the PR itself. |
|
Hmm, especially weird since CI already passed the PR initially -- nevermind the fact that you're not even changing the code... let's try again. bors r+ |
bors bot
added a commit
that referenced
this pull request
Feb 15, 2018
21: Add apint to README as another alternative r=cuviper a=Robbepop The ApInt crate is a pure rust implementation for arbitrary fixed bitwidth modulo arithmetics of integers with a focus on correctness and efficiency - especially for smaller bit widths. It features a generic signless `ApInt` as well as signed counterparts `Int` (signed int) and `UInt` (unsigned int) that are thin wrappers around it. The implementation is unfinished in some parts but that should be fixed over time. Link to crate at crates.io: https://crates.io/crates/apint Link to repo at GitHub: https://github.com/robbepop/apint
Timed out |
|
Meh, I'll just merge this. But some of those compile times are looking pretty horrible... |
|
Thanks for merging! :] |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The ApInt crate is a pure rust implementation for arbitrary fixed bitwidth modulo arithmetics of integers with a focus on correctness and efficiency - especially for smaller bit widths. It features a generic signless
ApIntas well as signed counterpartsInt(signed int) andUInt(unsigned int) that are thin wrappers around it. The implementation is unfinished in some parts but that should be fixed over time.Link to crate at crates.io: https://crates.io/crates/apint
Link to repo at GitHub: https://github.com/robbepop/apint