Dimitri Lesnoff
Dimitri Lesnoff
Currently, it is possible to output the dependencies with a graph representation using GraphViz. See: https://github.com/nim-lang/atlas/blob/master/src/atlas.nim#L446 « Ideally Atlas would output a graph representation that is not only useful for...
I added random as std dependency. It is now possible to generate a BigInt which is exactly nbits long. I also added a file for tests specific for probabilistic tests.
I benchmarked multiplication, division, random generation of bigints. Without flags, the operations are slow, with flags, the timings looks correct to me. The code source quality of benchBigints.nim can be...
This is still a draft. I get a strange error in one test of the tliterals.nim file. I have no clue why this test is wrong when I switch the...
I would like a function to generate a *uniformly* (as much as possible) random BigInt inferior to some upper bound. This would enable to randomize tests.
It has been almost a year since last release of BigInts. I would like to prioritize issues, and know which features are expected for the next release (next tag) of...
As written in the Readme.md file, we need to implement fast multiplication to improve many different algorithms (at once). I prefer to write a Github issue, as it is easier...
I am doing a state-of-the-art of the existing libraries on GPU, and I stumbled upon your project. What exactly finite fields are supported ? Only fields of characteristic 2 ?...
There is this new style formatter [nph](https://github.com/arnetheduck/nph) proposed by @arnetheduck that could be used in place of nimpretty. What do you think?
Manacher's Algorithm finds the longest palindromic factor (substring) in linear time in the length of the string input.