Hi Hans,
These things are learning exercises for me too. I agree that PARI/GP (and
Gap)
are interesting. I copied some algorithms from PARI for PermutationsA.jl.
Still, I find it interesting that the nextprime functions from (your)
Numbers.jl, Mathematica,
and PARI are very close in speed for
Yes, there are two end's missing. The iterating variable in the
(incomplete) for loop only appears in the return statement,
which is probably not what you want. The best thing after fixing this is to
read the top of the julia-users web page about what to do before posting
and read the section
Can someone point me to examples of C code in Julia packages ? I am using
BinDeps to download two C++ libraries. After a lot of blind trial and error
I have a build.jl that does what I need. But, I need to write a c wrapper
for the C++ libraries. One idea is to have BinDeps handle the build,
Does it make sense to have a list of unregistered packages ? I'd like to
make my packages visible, for feedback or whatever, and also to see what
other packages are out there.
Putting a new package that no one has used in the same list as a heavily
used/developed package doesn't seem right.
For generating primes, the Julia interface to libprimesieve is 100 times
faster than the current Julia code, for every number of primes that I
tried. (not bad for your code considering Kim Walisch has poured his soul
into this for several years!) It also generates the nth prime, primes in an
Here are some packages for people to look at. In particular,
I don't want to duplicate effort.
PrimeSieve: This is an interface to the (probably) fastest
opensource prime number sieve, and the (probably) most extensive
tables of the prime pi function (but only about 4 megabytes). It
also
101 - 106 of 106 matches
Mail list logo
