Chris Smith wrote:
I'm curious why you wanted a finger tree without the Monoid instance...
if you need a different Monoid instance, you can probably simplify your
code significantly by using a newtype wrapper around Seq rather than
re-implementing it.
Indeed, the whole point of the Monoid is
Xinyu LIU writes:
I was trying to implement MTF (move-to-front) algorithm, However, neither
Array nor List satisfied all aspects.
Array: Although the random access is O(1), However, move an element to front
takes O(N) in average;
List: Although move to front is O(1), However, random access
Hello Haskellers,
Version 2.1.0 of the EclipseFP project (Eclipse plugins for Haskell
development) has been released. Based mainly on the work Alejandro
Serrano did for his GSoC project, this release features a lot of
enhancements:
- A package/module browser
- Hoogle integration: select a
Hi,
In regex-pderiv, we gave a practical implementation of regex matching using
partial derivative.
But of course we could easy write one which using brzozoski's derivative,
but some simplification is required other wise
there are infinitely many states. Probably Martin has an implementation
For anybody interested in programming languages or markup languages,
there is an open job position for a junior developer at Stilo
(http://www.stilo.com/). Haskell is currently used only for prototyping,
but there are plans to begin some major development in Haskell within a
year.
The job
Cafe,
Using prog +RTS -M1G -hy for my program prog, I generate a heap profile as
documented in [1].
There is one big block in the output graph labelled with * though, which
is not very helpful. The star character isn't even mentioned in the
documentation, I wonder what it represents.
Thanks in
I've made a bugfix release of the hledger-web package, to fix build problems.
hledger-web 0.15.1:
* web: add missing Hledger.Web.Options to cabal file
* web: tighten up dependencies to reduce build problems
And here's another new dependency I forgot to mention: flot, the js
charting
I never liked Data.IArray. Recently I had to deal with it again and
it kind of touched off a bit of a rant:
Array bounds are an inclusive range, which runs counter to almost all
other uses of ranges, and for good reason. Length of an array is
(high - low + 1). If you want to convert a list to
On 3 September 2011 11:38, Evan Laforge qdun...@gmail.com wrote:
I never liked Data.IArray. Recently I had to deal with it again and
it kind of touched off a bit of a rant:
Array bounds are an inclusive range, which runs counter to almost all
other uses of ranges, and for good reason.
I've used this a fair amount: e.g. 2D grids going from (-n,-n) to
(n,n). This is one of the things I liked about Haskell arrays, in
that you _weren't_ limited to the [0,n-1] bounds found in C-based
languages (and that annoyed me to no end when I was using them). Even
And to be honest, it's
On 3 September 2011 12:53, Evan Laforge qdun...@gmail.com wrote:
To an extent, I wonder how much of this has been that arrays were
considered to be bad in Haskell, so no-one used them and no-one
bothered to try and improve the API much (and instead went and created
Vector, etc.).
Right, so
11 matches
Mail list logo
