This package [1] provides an implementation of a skip list using STM.
A skip list
is a probabilistic data structure with Data.Map-like operations. In contrast
to a balanced tree, a skip list does not need any (expensive) rebalancing,
which makes it particularly suitable for concurrent programming.
Hi, Thomas.
> Thanks Jeremy, I just wrote up my own little analysis (below) while you
> were responding. I'll look for the kd-tree work; if I see discussion
> (and am stupid enough to heap more work onto my plate) then I might get
> involved.
You can find the repository for the dynamic kd-tree i
On 28 September 2010 15:35, Tom Hawkins wrote:
> Has anyone in the STM community considered the ability to read a TVar,
> such that it would allow the transaction to complete even if the TVar
> was modified by another transaction?
Maybe something like this:
(Pasted from
http://www.haskell.org/gh
On 13 June 2010 15:23, Andrew Coppin wrote:
> Felipe Lessa wrote:
>>
>> On Sun, Jun 13, 2010 at 01:09:24PM +0100, Andrew Coppin wrote:
>>
>>>
>>> Does anybody have a less-insane way of doing this?
>>>
>>
>> Did you take a look at happstack-ixset[1]?
>>
>
> No. I'll take a look at it.
>
> (From the
On 14 May 2010 00:10, Derek Elkins wrote:
> On Thu, May 13, 2010 at 10:49 AM, Edward Amsden wrote:
>> On Wed, May 12, 2010 at 3:29 PM, Peter Robinson wrote:
>>> As far as I know, TChan needs the 'retry' combinator which requires GHC's
>>> RTS.
>>
As far as I know, TChan needs the 'retry' combinator which requires GHC's RTS.
Same is true for TMVar, I think.
Peter
On 12 May 2010 21:15, Edward Amsden wrote:
> I'm currently just getting into playing around with concurrency in
> haskell, primarily because I find STM intriguing. In looking t
On 27 April 2010 16:22, John Creighton wrote:
>> Subject: Is XHT a good tool for parsing web pages?
>> I looked a little bit at XHT and it seems very elegant for writing
>> concise definitions of parsers by forms but I read that it fails if
>> the XML isn't strict and I know a lot of web pages don
This package [1] provides STM data structures with IO hooks. The basic
building blocks are instances of class TBox. Such an instance is an
STM variable that might contain a value of some type a. In contrast to
a plain 'TVar (Maybe a)', a TBox has IO hooks that are executed
transparently on writes a
Hi, Matthias.
> Interesting. Your skip lists do not need re-balancing, but they do
> destructive updates. I wonder which factor outweighs the other in
> practise.
Hmm, I guess destructive updates cannot really be avoided
no matter what data structure is used, since we're in the STM monad.
Or do
I've implemented a skip list that works in the STM monad. A skip list is a
probabilistic data structure similar to a balanced tree. The main advantage
of a skip list is that it doesn't require rebalancing, making it particularly
suitable for concurrent programming.
Here are the docs:
http://darcs.
On 8 March 2010 17:51, Andrew Coppin wrote:
> Anyway, can anybody tell me how I can change the default settings so that I
> get profiling libraries built by default, and Haddock documentation built by
> default?
>
> (I'm on Windows, in case that makes a difference...)
# cabal install --help
shows
On 6 February 2010 03:33, Ivan Miljenovic wrote:
> If you upgrade a library, it will break all other libraries that
> depend upon it. "ghc-pkg list" will tell you which libraries are
> broken and need to be rebuilt.
I think you mean "ghc-pkg check".
Peter
_
I use http://www.bytemark.co.uk/ and I'm quite satisfied. They offer
Ubuntu, Debian and CentOS.
Peter
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/10/6 Paul Moore :
> 2009/10/6 John Van Enk :
>> Are you actually trying to remove the bits from the hard drive, or is that
>> something to fix a different problem you're having. If it's a different
>> problem, perhaps you could ask that as well?
>
> Yes, I'm trying to remove the bits from the
The following toy program consumes either 25MB or 70MB, depending on
whether the line
print "done"
is a comment or code. (Using only 1 OS thread increases memory consumption
to 130MB when the print is active vs 25MB when inactive.)
What am I doing wrong?
-
module Main
where
i
As far as I know the current stable release of Cabal doesn't
keep track of installed packages, so you can only
# ghc-pkg unregister pkg-id
and then manually delete the files.
Peter
2009/8/28 Colin Paul Adams :
> What is the procedure to uninstall a cabal package?
> --
> Colin Adams
> Preston La
2009/8/6 Don Stewart :
> For pure Haskell persistance, there is
>
> TCache: A Transactional data cache with configurable persistence
> http://hackage.haskell.org/package/TCache
>
> io-storage: A key-value store in the IO monad.
> http://hackage.haskell.org/package/io-storage
>
>
> Has any one used a service similar to (or equivalent to) Slicehost or
> Linode to run Haskell network applications?
Since last year I've been using a VM at bytemark.co.uk as a
remote development/testing machine. Never had a problem deploying
Haskell webapps there, although compiling large packag
I couldn't find any information on whether catchSTM catches
asynchronous exceptions
so I tried to run the following:
import Control.Concurrent.STM
import Control.Concurrent
import Control.Exception
import Prelude hiding (catch)
test = do
tid <- myThreadId
forkIO (threadDelay 500 >>
2009/4/20 Alberto G. Corona :
> Interesting. It seems similar to TCache.
It is indeed. I particularly like the feature of TCache that
you can "fill" partially initialized values from the cache
so I've added a similar high-level interface for TMap
(module TStorage).
Cheers,
Peter
_
> "Compose two alternative STM actions (GHC only). If the first action
> completes without retrying then it forms the result of the orElse.
> Otherwise, if the first action retries, then the second action is
> tried in its place. If both actions retry then the orElse as a whole
> retries."
>
> What
2009/2/19 Eugene Kirpichov :
>
> Is there a typeclass for mappings with a Data.Map-like interface, with
> stuff like: empty, insert, insertWithKey, unionWith etc. ?
Maybe this is of interest:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/gmap
Peter
___
This library provides an STM monad with commit and retry IO hooks. A
retry-action is run (once) in a separate thread if the transaction retries,
while commit-actions are executed iff the transaction commits. The code is
based on the AdvSTM Monad [1] by Chris Kuklewicz, but in addition also
ensures
2009/1/18 Sebastian Sylvan :
> Is there some sort of bundle that you can use to install cabal-install
> easily?
Newer versions contain a bootstrap.sh script that works just fine for me.
Cheers,
Peter
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.or
> On Mon, Jan 5, 2009 at 2:13 PM, Luke Palmer wrote:
>>
>> On Mon, Jan 5, 2009 at 1:48 PM, Peter Robinson
>> wrote:
>>>
>>> Hello,
>>>
>>> One thing that's been bothering me about MonadError monads is
>>> the non-por
Hello,
One thing that's been bothering me about MonadError monads is
the non-portability of code that uses a custom Error type. Meaning, if I
have libraries A and B that use different error types, I won't be able to
write a function func:
func = (funcA >> funcB) `catchError` (\e -> ...)
funcA :
On Monday 05 December 2005 23:26, Jimmie Houchin wrote:
> I do not have a strong math background.
> Is lack of strong math background a major hindrance to learning Haskell?
While it's certainly helpful to have some basic knowledge of lambda calculus,
type theory, etc. most concepts in Haskell can
On Tuesday 02 August 2005 22:03, Paul Moore wrote:
> FWIW, I've read (among other papers) "Why Functional Programming
> Matters", "A Gentle Introduction to Haskell", Hal Daume's "Yet Another
> Haskell Tutorial", Simon Peyton Jones' "Tackling the Awkward Squad",
> and "Haskell: The Craft of Functio
Hello!
My question concerns a general term datatype:
data Term
= Not Term
| Term :&&: Term
| Term :||: Term
| Literal Char
Is it somehow possible to write a generic function that applies the
associativity rules on a "Term" (by using pattern matching) and works with
both data construc
I've been trying the JVM - Haskell bridge a few days ago and got the same
errors.
However this fixed it:
The "make install" procedure of the jvm-bridge package adds the package
information of "javavm" to /opt/ghc/lib/ghc-6.2/package.conf.
After removing those options (-rpath,...) from "extra_ld_
On Saturday 04 October 2003 20:20, Wolfgang Jeltsch wrote:
> Great! I will probably use it since I like Haskell and KDE very much.
>
> By the way, wasn't KDevelop only for developing in C and C++?
The current stable Release 2.1.* is a C/C++ only IDE but the upcoming 3.0 will
probably support: Ada
Hello,
I've begun to write a plugin that provides basic support for Haskell in
KDevelop 3.0 alpha. (http://www.kdevelop.org). It is already included in the
CVS and the latest alpha7 release.
Screenshots:
http://www.thaldyron.com/snap1.png
http://www.thaldyron.com/snap2.png
http://www.thaldyron.
d installing
> instructions. The parser etc can be found in the UHC section. It makes
> use of the parser combinators found elsewhere in the tree,
>
> Doaitse Swierstra
>
> On woensdag, september 10, 2003, at 12:33 PM, Peter Robinson wrote:
> > Hello!
> > Does anyone k
Hello!
Does anyone know a reasonable standalone Parser for the Haskell Grammar? The
only one i found was hsparser but it's still an alpha release and i get a few
errors during compiling. I know i could write one using Happy but i don't
want to reinvent the wheel...
regards
Peter
___
Definitely the most comprehensive monads tutorial on the net.
Great stuff!
Thanks,
Peter
On Tuesday 12 August 2003 11:40, Jeff Newbern wrote:
> Hello everyone,
>
> Due to the scarcity of monad tutorials available (:^), I have
> written one of my own. I hope that this one is both more gentle
> a
35 matches
Mail list logo
