Is there any special structure in your data that could be exploited?
On Sat, Sep 1, 2012 at 6:17 PM, Gershom Bazerman wrote:
> In my experience, doing much better than the naive algorithm for median is
> surprisingly hard, and involves a choice from a range of trade-offs. Did you
> have a parti
In my experience, doing much better than the naive algorithm for median
is surprisingly hard, and involves a choice from a range of trade-offs.
Did you have a particular better algorithm in mind?
If you did, you could write it, and contact the package author with a patch.
You also may be able
Hello,
I have a *.cabal file which contains a package description for several
executables (which share some of the source files). Is there a tool
which updates other-extensions section and other-modules section in
the .cabal file automatically to synchronize them to the source files?
If it matter
On 2 September 2012 05:26, David Feuer wrote:
> The median function in the hstats package uses a naive O(n log n)
> algorithm. Is there another package providing an O(n) option? If not,
> what would it take to get the package upgraded?
http://hackage.haskell.org/packages/archive/statistics/latest
The median function in the hstats package uses a naive O(n log n)
algorithm. Is there another package providing an O(n) option? If not,
what would it take to get the package upgraded?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.hask
On Sat, Sep 1, 2012 at 5:18 AM, wrote:
> So after having played with it a little, it looks like GADTs are the way to
> go. The method of manipulating the module system won't work because of two
> reasons:
>
> A) How can a user pattern match against data constructors that are hidden by
> the modu
So after having played with it a little, it looks like GADTs are the way to
go. The method of manipulating the module system won't work because of two
reasons:
A) How can a user pattern match against data constructors that are hidden by
the module system?
B) It's an awful hack.
Do I understan
