yrazes yra...@gmail.com writes:
I want to compare data structure between Haskell, Java, Lisp and C. I am
wondering if I could compare list comprehention in haskell with the vector
class in Java, macros in common lisp and dynamic arrays in C.
You /can/ compare them, of course, but they are
Hi,
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 takes O(N) in
sure!
types are something you can compare and the differences are so clear
but I will probe the code in some programs like bubble sort
(least efficient)
including DataBase (HDBC) and MySql...
This time, my mail is concerning about queuing theory, h... I tough
list are nice concept for this
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.
--
Chris Smith
On Tue, Aug 30, 2011 at 4:53 PM, Sebastian Fischer fisc...@nii.ac.jpwrote:
I think the idea of functional lists is that the monoids of 'lists'
and 'functions on lists' are isomorphic with isomorphisms toFList and
toList:
toFList [] = id
toFList (xs++ys) = toFList xs . toFList ys
Its a bug in haskell-src-meta. I just reported it:
https://github.com/benmachine/haskell-src-meta/issues/8
Regards,
Jonas
On 1 September 2011 03:19, bob zhang bobzhang1...@gmail.com wrote:
Hi, all
parseExp (,) 3 4 =
Right (AppE (AppE (ConE GHC.Unit.(,)) (LitE (IntegerL 3))) (LitE
I'm pleased to announce hledger 0.15! This release includes work by
Trygve Laugstøl, Dmitry Astapov, Clint Adams, Johann Klähn and
myself, and we have added cmdargs and warp to our list of awesome
dependencies. Summary of changes: a modal cli that detects add-ons,
more powerful CSV converting, a
