On Tue, Nov 4, 2008 at 6:44 PM, i wrote:
i'm sorry if this is obviously wrong (i haven't used Text.Regex), but
can't you do this with submatches?
rights or wrongs of regexps aside, i just checked that the above
approach *is* feasible with Text.Regex
here's some code:
module
On Wed, Nov 5, 2008 at 1:56 PM, Martijn van Steenbergen
[EMAIL PROTECTED] wrote:
I think I'll try roger's (private)
eek, bitten by reply to sender only again!
i had intended to send to the list too.
___
Haskell-Cafe mailing list
if you're prepared to expend a few cpu cycles, you can always
use something like the following beating clocks algorithm, which
should generate
at least some genuine randomness, as long as you've got preemptive
scheduling, and a few hardware interrupts around the place.
module Clockbeat where
i'd be interested to know if you know of any studies on this.
i know of at least one system that uses it as the basis for
its crypto. superficially it's certainly an attractive method, with minimal
external dependencies, and, i'd have thought, at least a useful
addition to just using the system
hi,
i'm trying to get labelled records working with the current version of HList.
i've got code that looks like:
{-# language EmptyDataDecls #-}
module Tst where
import Data.HList
data Foo;foo = proxy::Proxy Foo
data Bar; bar= proxy::Proxy Bar
rec1 =
On Thu, Oct 9, 2008 at 9:15 AM, Ryan Ingram [EMAIL PROTECTED] wrote:
I don't think what you want is possible if both sides are in STM.
Other authors have posted solutions where one side or the other of the
transaction is in I/O, but wholly inside STM it's not possible.
Thanks, that's what I
On Thu, Oct 9, 2008 at 10:12 AM, Arnar Birgisson [EMAIL PROTECTED] wrote:
Sorry, I come into this discussion late. One-place buffers, or MVars,
are indeed implemented over STM in the orignal paper [1].
Yes, I should have remembered that. It's ok just as long as
there's a buffer there because
I was wondering if it was possible to implement synchronous channels
within STM. In particular, I'd like to have CSP-like send and recv primitives
on a channel that each block until the other side arrives to complete
the transaction.
I think I've convinced myself that it's not possible, but
