[Haskell-cafe] hs-plugins/ haskelldb/ ELF zlib incompatibility.

I get this error: calhost db=store uid=marc pwd=" DB/Direct: Daan Leijen (c) 1999, HWT (c) 2003-2004, Bjorn Bringert (c) 2005 Connecting to database... DBDirect: user error (loadShared: couldn't load `/usr/lib/libz.so' because /usr/lib/libz.so: invalid

Re: [Haskell-cafe] Looking for an efficient tree in STM

G'day all. On Wed, Mar 08, 2006 at 01:50:06PM +0200, Einar Karttunen wrote: > Does anyone have an efficient tree implemented in STM that > supports concurrent updates in an efficient fashion? One could easily rewrite this question as: Does anyone have an efficient tree that supports concu

Re: Re[2]: [Haskell-cafe] STUArray

Bulat Ziganshin: > Hello Chris, > > Sunday, March 12, 2006, 2:05:09 PM, you wrote: > > CK> Is GHC.PArr documented? > > it's perfectly documented in module sources itself :) you can also > look at the ndpFlatten directory in ghc compiler's sources. i've > successfully used them in my program, of

Re: [Haskell-cafe] matrix computations based on the GSL

The Atlas library (Linux_P4SSE2) seems to be 9x faster (!) than gslcblas in matrix multiplication: ghc-6.4.1 --make examples/pca.hs GSL/debuggslaux.o \ -L$(LIBATLAS) -lcblas /usr/lib/libgsl.a -latlas $ time ./a.out GSL Wrapper gsl_matrix_fscanf: 2 s GSL Wrapper submatrix: 0 s GSL Wrapper cons

Re: [Haskell-cafe] Looking for an efficient tree in STM

Sorry for the slow reply,On 3/8/06, Einar Karttunen wrote: Does anyone have an efficient tree implemented in STM thatsupports concurrent updates in an efficient fashion? Thisseems suprisingly hard to implement - a normal binarytree with links as TVar is very slow and does