On Wednesday 01 February 2012, 07:53:03, wren ng thornton wrote:
The primes function in the combinat package is based on an old Cafe
thread, and actually seems to be faster than the one in the
combinatorics package.
Yes, but it has a memory leak. On my box at least, with ghc 6.12, 7.0 and
On 2/5/12 10:21 AM, Daniel Fischer wrote:
Why not use one of the packages on hackage which offer faster prime
generators?
Mostly because I hadn't looked, having had the code already laying
around. I'm not opposed to it, however another goal is to remain
portable to other compilers, which
On Sunday 05 February 2012, 23:14:35, wren ng thornton wrote:
On 2/5/12 10:21 AM, Daniel Fischer wrote:
Why not use one of the packages on hackage which offer faster prime
generators?
Mostly because I hadn't looked, having had the code already laying
around.
Yeah, that's fine, it was
On 2/5/12 5:40 PM, Daniel Fischer wrote:
On Sunday 05 February 2012, 23:14:35, wren ng thornton wrote:
On 2/5/12 10:21 AM, Daniel Fischer wrote:
Why not use one of the packages on hackage which offer faster prime
generators?
Mostly because I hadn't looked, having had the code already laying
On Fri, Feb 03, 2012 at 01:06:16AM -0500, wren ng thornton wrote:
On 2/2/12 6:46 PM, Carter Schonwald wrote:
On Thu, Feb 2, 2012 at 4:06 PM, Ivan Lazar Miljenovic wrote:
On 3 February 2012 07:11, Brent Yorgey wrote:
On Wed, Feb 01, 2012 at 01:53:03AM -0500, wren ng thornton wrote:
[2]
On Wed, Feb 01, 2012 at 01:53:03AM -0500, wren ng thornton wrote:
[2] HaskellForMaths, gamma, statistics, erf, math-functions,
combinat,...
To this list I'd like to add 'species' and also the specialized
'multiset-comb' packages. The former doesn't build under recent GHCs
but I plan to fix
On 3 February 2012 07:11, Brent Yorgey byor...@seas.upenn.edu wrote:
On Wed, Feb 01, 2012 at 01:53:03AM -0500, wren ng thornton wrote:
[2] HaskellForMaths, gamma, statistics, erf, math-functions,
combinat,...
To this list I'd like to add 'species' and also the specialized
'multiset-comb'
ditto
On Thu, Feb 2, 2012 at 4:06 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 3 February 2012 07:11, Brent Yorgey byor...@seas.upenn.edu wrote:
On Wed, Feb 01, 2012 at 01:53:03AM -0500, wren ng thornton wrote:
[2] HaskellForMaths, gamma, statistics, erf, math-functions,
On 2/2/12 6:46 PM, Carter Schonwald wrote:
On Thu, Feb 2, 2012 at 4:06 PM, Ivan Lazar Miljenovic wrote:
On 3 February 2012 07:11, Brent Yorgey wrote:
On Wed, Feb 01, 2012 at 01:53:03AM -0500, wren ng thornton wrote:
[2] HaskellForMaths, gamma, statistics, erf, math-functions,
combinat,...
Hi,
On 29.01.2012, at 23:30, wren ng thornton wrote:
On 1/29/12 5:48 AM, Roman Cheplyaka wrote:
* wren ng thorntonw...@freegeek.org [2012-01-28 23:06:08-0500]
Why not to make it more pure? That is, return a lazy list of Ints (but
not a CAF), which user can throw away by the usual GC
On 1/30/12 12:55 PM, Balazs Komuves wrote:
-- combinatorics 0.1.0
The combinatorics package offers efficient *exact* computation of common
combinatorial functions like the binomial coefficients and
On 1/30/12 3:54 PM, Roman Cheplyaka wrote:
Makes sense; but doesn't making the monad abstract and putting all
functions in the monad address the fragility issue?
The primary issue with monads is that the syntax is extremely cumbersome
for the expected use case. It'd be like paranoid C where,
On 1/31/12 8:58 AM, Jean-Marie Gaillourdet wrote:
A slight variation on that approach is to use implicit parameters to
parameterize your functions by the primes. Something allong the following lines:
That is another option. However, implicit parameters are GHC-only and
seldom used even in
-- combinatorics 0.1.0
The combinatorics package offers efficient *exact* computation of common
combinatorial functions like the binomial coefficients and factorial.
(For fast *approximations*, see the
* wren ng thornton w...@freegeek.org [2012-01-29 17:30:34-0500]
On 1/29/12 5:48 AM, Roman Cheplyaka wrote:
* wren ng thorntonw...@freegeek.org [2012-01-28 23:06:08-0500]
* Math.Combinatorics.Primes: provides the prime numbers via
Runciman's lazy wheel sieve algorithm. Provided here since
* wren ng thornton w...@freegeek.org [2012-01-28 23:06:08-0500]
* Math.Combinatorics.Primes: provides the prime numbers via
Runciman's lazy wheel sieve algorithm. Provided here since efficient
algorithms for combinatorial functions often require prime numbers.
The current version memoizes the
On 1/29/12 5:48 AM, Roman Cheplyaka wrote:
* wren ng thorntonw...@freegeek.org [2012-01-28 23:06:08-0500]
* Math.Combinatorics.Primes: provides the prime numbers via
Runciman's lazy wheel sieve algorithm. Provided here since efficient
algorithms for combinatorial functions often require prime
-- combinatorics 0.1.0
The combinatorics package offers efficient *exact* computation of common
combinatorial functions like the binomial coefficients and factorial.
(For fast *approximations*, see the
18 matches
Mail list logo
