On 2013.07.17, at 08:03, Jan-Willem Maessen wrote:
> This has all the marks of a 64-bit-only code running on a 32 bit
> machine.
This discussion is interesting, but I'm not sure why so much of it is
taking place here instead of on the mwc-random issue tracker:
https://github.com/bos/mwc-random/iss
Hi, here are the results of the recent OpenGL extensions survey:
https://github.com/bsl/opengl-extensions-survey
If I did anything dumb, please send me mail or a pull request.
Thanks to everyone who contributed!
___
Haskell-Cafe mailing list
Haskell-Ca
On 2013.07.14, at 00:05, Roman Cheplyaka wrote:
> Ah, yes. This may be a bit more complicated than it seems, due to the
> way Cabal works.
I think you're right. This seems really unfortunate. :(
Thanks for the explanation.
___
Haskell-Cafe mailing list
On 2013.07.13, at 23:15, Roman Cheplyaka wrote:
> 1. Why exactly does haddock fail?
I think it never actually tries to build the Haddock docs for the actual
package of interest because its dependencies failed to build.
Here's the GLFW-b build log:
http://hackage.haskell.org/packages/archive/GLFW-
I maintain a library that, on Linux, needs libXxf86vm to build. The
server where Hackage runs doesn't have that library, so the build fails.
I think this is reasonable -- that box can't possibly have all the
libraries various packages might need. But the build failure seems to
cause the Haddock doc
Here's a problem variations of which have been plaguing the Haskell
community for as long as I can remember.
To see it for yourself:
1.) Be running OS X
2.) install GLFW-b-1.0.0 (you may need to cabal update) [1]
3.) ghci -package GLFW-b
4.) import Graphics.UI.GLFW as GLFW
5.) GLFW.init
Security
Hi, I'm doing a survey to find out how well various OpenGL extensions
are supported, to know where to focus efforts on Haskell game software.
If you run Linux on your desktop and want to help, here's how:
1.) Save the information like this:
$ glxinfo > SOMENAME.glxinfo
... where SOMENAME
Say you write
data Callback = Error ... | ...
because one of the kinds of callbacks you need to model is an error
callback.
Then, later, you write
data Error = ...
to model some error that can happen.
They're both good names, but there's a conflict. So I started thinking I
should prefix my constr
I want to use TH to generate functions like
foo :: c -> h
foo ... = ...
foo ... = ...
...
from lists of pairs :: [(c, h)]
For example, $(genFoo ''Int ''Bool [(0,False), (1,True)])
would generate
foo 0 = False
foo 1 = True
The problem is, I don't know how to generate the function's clauses.
"foo 0
. nub $ map
fst ps
+#else
ps' <- filterM loaded . map packageIdString . nub $ ps
+#endif
#if DEBUG
when (not (null ps')) $
On 12/30/11 4:32 PM, Brian Victor wrote:
Hi all,
As a getting-my-feet-wet project I was starting to look into using
plugins
short,
defaultCallbacks seems to be gone from 7.2.
It doesn't look like that function has simply been moved. So can someone
give me an idea about how to proceed?
Thanks!
[1]
http://hackage.haskell.org/packages/archive/plugins/1.5.1.4/logs/failure/ghc-7.2
less serious. (For the
> business. I'm sure it's still fairly serious for the person who just
> DIED...)
>
>
Again, it depends. If there was this large body of code that only one
developer ever worked on, then you have truck-factor problems.
&
I think the "truck-factor" implications of the programming language as
dwarfed by the implications of everything else in the project. Any project
of any significant size is going to have a huge amount of project-specific
information tucked up inside the programmers head. It doesn't matter if
ther
On Sat, Oct 29, 2011 at 12:18 PM, Brian Johnson <
brianjohnsonhaskellc...@gmail.com> wrote:
>From http://hackage.haskell.org/trac/ghc/wiki/Commentary/Rts/Signals:
>
> "When the interrupt signal is received, the default behaviour of the
> runtime is to attempt to shut d
mport Control.Exception as C
import Control.Concurrent
import System.Posix.Signals
main = do
tid <- myThreadId
installHandler keyboardSignal (Catch (throwTo tid UserInterrupt)) Nothing
... -- rest of program
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
The second time I press control-c, it isn't caught -- the program exits
instead. Why?
(The context is, I'm writing an interactive program where calculations may
take a long time. Control-c during a calculation should return the user to
a prompt. As things stand, this can only be done once
n disabling
inlining as Felipe suggested. I'd also suggest adding
yourself as a CC: on bug 917 so GHC HQ knows how many people
are being affected by this kind of behavior.
Hope this helps,
-Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm not sure what you're asking for; it looks like you have to
implement the functions from the specifications.
On Thu, Oct 21, 2010 at 6:11 PM, Yaadallah Khan wrote:
> I am Studying for an exam, and i have just come accross the following 3
> questions, i am not familiar with the functions, there
ore those specified with -I. I suspect if I had a way to change
that, it would work.
--
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ibute__’ before ‘StgWord’
cabal: Error: some packages failed to install:
PortMidi-0.1.3 failed during the building phase. The exception was:
exit: ExitFailure 1
--
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/l
Murray Gross wrote:
On Sat, 17 Apr 2010, Brian Hulley wrote:
see the patent 6,368,227. The search site is here:
http://patft.uspto.gov/netahtml/PTO/srchnum.htm
Best regards.
Jerzy Karczmarczuk
...
It's really almost not fair to cite that particular patent, since, if I
recall the
Ivan Lazar Miljenovic wrote:
Brian Hulley writes:
The main problem for me is just the fact that the legal system in
itself is, as Charles Dickens wrote in "The Old Curiosity Shop"
(Chapter 37):
... an edged tool of uncertain
application, very expensive in the working,
jerzy.karczmarc...@info.unicaen.fr wrote:
Brian Hulley reports a search similar to :
haskell unicode bidirectional
Comment irrelevant to Haskell, sorry.
Everybody does his/her various jobs. But I lost all respect due to people
who work in the US Patent Office, when I saw the patent
Daniel Fischer wrote:
Am Freitag 16 April 2010 20:50:25 schrieb Brian Hulley:
revealed a link to a US Patent (7120900) for the idea of implementing
the Unicode Bidirectional Algorithm (UAX #9
http://www.unicode.org/reports/tr9) in Haskell, making use, as far as I
can tell, of nothing more than
eal to everyone here to please help in the fight
against software patents, so that we can begin the huge task of
reclaiming our world for real people who understand that true meaning in
life comes from extending our feeling of self into the world beyond our
own body:
http://petition.stopsof
on of the data structure. I'd
be more than happy to give anybody who is interested in using it some
pointers though.
-Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
nks for the report. ghc-core 0.5.1 was released today, so cabal
> update; cabal install ghc-core and you should be fine.
>
All is well, thanks !
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ve
got the correct version of everything.
ghc is 6.10.4
Brian
Creating dist/build/ghc-core (and its parents)
Creating dist/build/ghc-core/ghc-core-tmp (and its parents)
/usr/bin/ghc -o dist/build/ghc-core/ghc-core --make -hide-all-packages
-i -idist/build/ghc-core/ghc-core-tmp -i. -idist/bui
On Tue, 26 Jan 2010 22:41:44 -0800
Thomas DuBuisson wrote:
> Brian Denheyer wrote:
>
> > On Tue, 26 Jan 2010 10:54:03 -0800
> > Thomas DuBuisson wrote:
> >
> > > > doEvent f usDelay = forkIO $
> > > > threadDelay usDelay
> > > >
"foo"
doEvent f usDelay = do forkIO f
threadDelay usDelay
doEvent f 100
main = doEvent f 100
which seems to work. That makes me suspicious :-|
Brian
___
Haskell-Cafe mailing list
Haskell-
sec later.
Otherwise nothing. The problem is that if I don't include awaitSignal,
then, of course, forever is called just as fast as the CPU will go :-)
Brian
import System.Posix.Signals
import System.IO
import Control.Concurrent
alarm =
do putStrLn "ALARM"
hFlush stdout
ose and they install locally. I thought it would be
better to keep it local to avoid conflicts, so much for that theory.
I basically use Debian for two reasons: to get ghc and to get cabal.
After that it seems to me a better idea to stick with cabal rather than
the
e version suffix still gives me the parse error.
??
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, 21 Jan 2010 11:36:42 +0100
Marc Weber wrote:
> Hi Brian
>
> hsql is compatibel with most recent ghc yet.
Well I am using 6.10.4, so should I use a patched version, or simply
apply the fixes which Malcolm provided ?
>
> You can get patches for the .cabal fil
o occur so frequently (at least for me).
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, 20 Jan 2010 07:15:07 -0800
Brian Denheyer wrote:
> My error:
>
> Couldn't match expected type `T.UTCTime'
>against inferred type `T.LocalTime'
> In the second argument of `formatTime', namely `date'
> In the expr
as one of the FormatTime instances:
Instances
FormatTime Day
FormatTime UTCTime
FormatTime TimeZone
FormatTime TimeOfDay
FormatTime ZonedTime
FormatTime LocalTime
?
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi All,
What's the best way to get the year/month/day/hour/min/sec of the
current time ? I've become mired in confusion with Time, Data.Time,
DateTime and I think there is even an old-time.
Might be a couple of calendar libraries in there, not quite sure...
Than
it
simply moved somewhere else ?
Thanks,
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
it still
stores some info, particularly about configuration state, in
/home/${USER}/.cabal.
How do I invoke cabal to make sure that the entire installation is
machine specific ?
Thanks,
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
really trying to compile for power pc.
I was hoping that this was a bit of cruft and someone could direct me
to a fix for the assembly portion so I can get a little farther along.
Thanks,
Brian
P.S. Or somebody could also tell me if trying to have the latest ghc
working on power pc
seems bad...
The Glorious Glasgow Haskell Compilation System, version 6.10.4
This is the deb ghc6 package for unstable.
Cabal was installed using ghc 6.8.x.
I tried re-installing a couple of other cabal packages, including hps
and bytestring, and they went through without a hitch.
On Nov 5, 2009, at 8:26 AM, Jason Dagit wrote:
Haskell knows when I have a list of Doubles, you know, because it's
strongly typed.
Then it proceeds to box them. Huh ?
Imagine a computation which will yield a Double if evaluated, but
has not yet been evaluated. How do you store that i
On Nov 5, 2009, at 8:26 AM, Jason Dagit wrote:
I can't really think of how laziness and polymorphism are related.
For me the big win with laziness is composability. Laziness allows
us to express things in ways that are more natural. The prelude
function 'take' is a perfect example. I
Don,
There is more than one indexU ?
In Data.Array.Vector there is only 1 indexU that I can find.
Brian
On Nov 3, 2009, at 9:15 PM, Don Stewart wrote:
Well, it depends on which indexU the OP means. The one linked in the
docs is
the O(1) UA type class version.
-- Don
gcross:
Actually
On Nov 3, 2009, at 7:38 PM, Philippos Apolinarius wrote:
Brian wrote:
> Really, arrays in Haskell are the most @#!$! confusing thing in
the world.
Hi, Brian.
I am having a great difficulty with arrays in Haskell. In the
university where I study, functional programming is taught in Cl
r reason for that, that I'm sure I don't care about ;-)
There's also ST. So why is there a uvector, when there's ST ??
etc, etc, etc...
and then there's monads...
other than that, having fun with haskell :-)
Brian
On Nov 3, 2009, at 3:42 PM, David Leimbach wrote:
That was indeed the problem.
I edited the pkg-config file by hand.
I followed your advice anyway and unregistered and re-installed.
Everythingworks now.
Thanks for your help.
Brian
On Oct 28, 2009, at 11:58 AM, Duncan Coutts wrote:
On Wed, 2009-10-28 at 07:07 -0700, brian wrote:
Just
Just found the following file:
.ghc/powerpc-darwin-6.10.1/pkg-config
and it is referring to 0.5.0.1.
Is there anyway to regenerate the file, or is it broken because of a
problem with the package ?
Thanks,
Brian
On Oct 28, 2009, at 4:00 AM, Duncan Coutts wrote:
On Tue, 2009-10-27 at 21
trying to use the binary package.
Is there something broken in the 0.5.0.2 release that causes ghc to
look for the old library ?
Brian
On Oct 28, 2009, at 4:00 AM, Duncan Coutts wrote:
On Tue, 2009-10-27 at 21:37 -0700, brian wrote:
It all started with this:
Loading package binary-0.5.0.1 ..
.2.0.1 failed during the building phase. The exception was:
exit: ExitFailure 1
help....
Thanks,
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sorry for the garbled post, this should hopefully be plain text:
> On Thu, 2009-10-01 at 03:29 +0000, Brian Bloniarz wrote:
>> I.e. why does an exception raised during exception handling get
>> propagated past the exception that triggered the handler?
>
> Because it'
<1254389201.7656.3.ca...@localhost>
Content-Type: text/plain; charset="Windows-1252"
Content-Transfer-Encoding: quoted-printable
MIME-Version: 1.0
> On Thu=2C 2009-10-01 at 03:29 +=2C Brian Bloniarz wrote:
>> I.e. why does an exception raised during exception h
Exception to rethrow an exception as a different type, though that's what
mapException is for, correct?
Thanks,
-Brian
_
Microsoft brings you a new way to sea
s all seemed to work. Let me know what happens.
The linux pc gave me even more problems which I eventually traced to
LD_LIBRARY_PATH needing to include the lib dirs.
HTH.
Brian
On Sep 9, 2009, at 11:57 PM, Martijn van Steenbergen wrote:
brian wrote:
yep I had some trouble too, although int
My problems were resolved by removing MacPorts from the system and
adding 32-bit flags to runhaskell---apparently its zlib was
interfering, as well as the runhaskell/runghc problems.
Thank you for the advice,
Brian
On Wed, Sep 9, 2009 at 3:49 AM, Christian Maeder
wrote:
> If compiling templ
have fink installed.
Brian
On Sep 7, 2009, at 7:06 PM, Ben wrote:
hello --
i've been having a heck of a time installing hmatrix on mac os x.
i've seen the help pages including
http://mit.edu/harold/Public/easyVisionNotes.html
but they haven't helped me. my setup is
haskell
rs to have been a typo---cabal and setup
never parsed it.
-Brian
On Fri, Sep 4, 2009 at 9:51 AM, Christian Maeder
wrote:
> Does adding -optc-m32 -opta-m32 -optl-m32 to /usr/bin/ghci
> as well not help? (as I've posted before)
>
> Cheers Christian
>
> Brian Sniffen wrote
er this message indicates
that TH code is searching a different library path than non-TH code or
what. Advice is most welcome. I'm particularly interested in finding
out which zlib versions are being found at the construction of
Codec.Compression.Zlib and at runtime (Pandoc compile time).
you be
so kind as to elaborate?
Thank you,
Brian
On Mon, Jul 27, 2009 at 2:37 AM, Wouter Swierstra wrote:
> Hi Brian,
>
> If I understand you correctly, you've run into the "Expression Problem".
> Phil Wadler posed the problem in a widely-cited e-mail, formulating it
I would further like to define
Triangular, which I will do incorrectly for consistency.
data Triangular = One | Three | Six
I could not accommodate this definition using your scheme, correct?
Thanks,
Brian
On Sun, Jul 26, 2009 at 9:14 PM, Felipe Lessa wrote:
> On Sun, Jul 26, 2009 at 09:01
should
possible to express entirely in the type system, but I cannot think of
how. Would someone be so kind as to explain how this sort of thing can
be accomplished?
Thanks,
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
s fast enough for me.
Is there an efficient way to output double -> binary ?
I typically write my data files as binary anyway, because it's faster
for graph and the like to handle them anyway.
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@
rily, the output of the .prof file.
total time =0.14 secs (7 ticks @ 20 ms)
total alloc = 65,562,824 bytes (excludes profiling overheads)
So I guess it's the show's, but I can't seem to find more efficient
float output.
FFI to sprintf ? yuch.
ful. I replaced the show's with "",
and compiled with -O2 and not much improvement.
I need to write _a lot_ of code in this style. A few words about how
best to do this would be helpful. Laziness, infinite lists, uvector ??
Help...
Thanks,
Brian
import Complex
import
d, on each
iteration, it's also applying the function it's built. Basically, it's
using the program stack as it's intermediate datastructure.
Ugly and inefficient yes, but recursion-free as far as I can see.
Thanks,
-Brian
P.S. The "walk the list at 2 speeds" trick i
sides the fold. Though using difference
lists might be cheating, depending on your definition of
cheating :)
-Brian
> Bonjour café,
>
> A small puzzle:
>
> Consider the function inTwain that splits a list of even length evenly
> into two sublists:
>
> > inTwain &
Prelude> :m + Data.Numbers.Primes
Prelude Data.Numbers.Primes> :browse
isPrime :: Integer -> Bool
isProbablyPrime ::
(System.Random.RandomGen g) => Integer -> g -> (Bool, g)
primes :: [Integer]
Prelude Data.Numbers.Primes> isPrime 3525266
Loading package syb ... linking ... done.
Loading package
On Saturday, 23.05.09 at 21:10, wren ng thornton wrote:
> I hear they're looking for someone to write a program to check for API
> changes in order to detect and enforce the policy :) Care to help?
Yeah, I'm looking into it.
___
Haskell-Cafe mailing lis
On Saturday, 23.05.09 at 17:26, Don Stewart wrote:
> http://haskell.org/haskellwiki/Package_versioning_policy ?
That helps a lot. I should have found that. But putting the policy on a
web page doesn't seem to be working; there are a lot of non-compliant
packages. I guess I'm surprised thah 'cabal
It's not good to specify open version ranges in cabal build-depends like
foo >= 1.1 because the foo maintainer will eventually release 2.0,
containing API-breaking changes, and the build will fail.
If you depend on foo 1.1, you can specify == 1.*, no problem. But if you
depend on a package that us
seeing
patch-tag for the first time I got excited and uploaded a whole new
repo, whoops.
Anyway, I had to do some minor surgery to update to the new
version -- everything compiles, but I haven't tested much beyond that
yet. Let me know if you have any questions.
Thanks,
-Brian
> I
_
Insert movie times and more without leaving Hotmail®.
http://windowslive.com/Tutorial/Hotmail/QuickAdd?ocid=TXT_TAGLM_WL_HM_Tutorial_QuickAdd1_052009___
Haskell-Cafe mailing list
Haskell-
uires minor changes to HList, available at:
http://mysite.verizon.net/vzewxzuh/sitebuildercontent/sitebuilderfiles/hlist-20090516.tar.gz
I'll talk to the HList people about getting those merged.
Thanks!
Brian Bloniarz
_
Hotma
On Wednesday, 06.05.09 at 16:25, Brandon S. Allbery KF8NH wrote:
> No. What it means is that, if the child will continue to run in the
> same Haskell program after forkProcess-ing, any open Handles won't
> work right. You could fix this with handleToFd and fdToHandle, I
> suspect, but it's irrele
On Tuesday, 05.05.09 at 22:48, Brandon S. Allbery KF8NH wrote:
> On May 5, 2009, at 04:52 , br...@lorf.org wrote:
>> I have a long-lived multithreaded server process that needs to execute
>> programs and interact with them via Handles. The programs could
>> misbehave, like loop or hang, so I need t
I have a long-lived multithreaded server process that needs to execute
programs and interact with them via Handles. The programs could
misbehave, like loop or hang, so I need to limit the real and CPU time
they can take.
I guess System.Posix.Resource.setResourceLimit sets limits on the
current pro
System.Timeout.timeout is OK for wall clock time, but can I limit the
amount of system time an IO action can take?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I wrote this to make it a little nicer to catch IO exceptions and
convert them to ErrorT failure:
onExceptionThrowError
:: (Error ce) =>
IO a
-> (String -> ce)
-> ErrorT ce IO a
onExceptionThrowError a ce =
liftIO (try a) >>=
either
(\(e :: IOException) -> throwError (
On Tuesday, 14.04.09 at 22:13, Lennart Augustsson wrote:
> So the right way to do this (like opening a file), is to try executing
> it and let the OS tell you if it failed.
I know, but the various functions that create processes don't help me
know whether the program actually ran or not. For examp
On Tuesday, 14.04.09 at 23:36, Miguel Mitrofanov wrote:
> What about ErrorT monad transformer?
I don't see how it helps in my situation. ErrorT doesn't catch
exceptions, for example. Suppose I did make something like ErrorT that
catches exceptions and turn them into Lefts. Where would (>>=) get my
I'm finding it hard to write robust code that isn't really ugly. Suppose
I want to write
> execute :: FilePath -> [String] -> IO (Either ExecuteError ExitCode)
where 'ExecuteError' is a data type representing all the ways 'execute'
could fail and that 'execute p args' is supposed to
* ensure p e
For future reference:
Solved, I just created a symlink to libgmp.dylib in /usr/local, and
the zlib package was able to build.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
s, so that's already a bad sign.
I can get to the build step with the additional -L option but then ./
Setup fails again because it can't find gmp.
Help ?
Thanks,
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://ww
It looks like this typechecks too -- the only thing overlap-free did
was to make the error message clearer.
-Brian
> Hi George,
>
> Since none of the type metaprogramming specialists have answered you on-list,
> I took a crack at this -- I think you can work around the issue by avoidi
ple n a b) x r where
> nth _ (Tuple _ b) = nth (undefined ∷ x') b
I'm not sure why this is needed.
Hope this helps,
-Brian
> Okay, so I've written a small library to generalize 'fst' and 'snd' to
> arbitrary tuples, but I'd like to extend it a bit
tuples.
Anybody know the rationale for this? I'm curious whether it could
be changed, or if any code depends on it.
-Brian
_
Access your email online and on th
this work for your purposes:
> class Chunkable3 c where
> cLength :: c el -> Int
> cHead :: c el -> Maybe el
> cMap :: (a -> b) -> c a -> c b
> instance Chunkable3 [] where
> cLength = length
On Sun, 18 Jan 2009, Ryan Ingram wrote:
2) A third choice is to do what Show does, which is kind of a hack but
solves this specific problem:
Thanks. I like this solution much better than the two I proposed.
Brian
___
Haskell-Cafe mailing list
ncoherent-instances, which I'm slightly afraid of
because I'm not sure what (if any) possible errors adding this option
might allow.
So my question is twofold: 1) what errors might be allowed if I add
-fallow-incoherent-instances, and 2) is there some third choice that
avoids both
Smart constructors sometimes need to generate errors like
"Foo.Bar.Baz.create: invalid value, etc". Can TH generate the module
and function names?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sat, Jan 3, 2009 at 4:25 AM, Austin Seipp wrote:
> NB: I have *just* (about 5 minutes ago) sent in a patch for takusen
> to get it to build on GHC 6.10.1 to Oleg. Hopefully an updated version
> will appear on hackage in the next few days.
Yay! Thanks. I've been waiting.
___
that we can talk about such and such a function being "in" the
IO monad or STM monad. The idea was that one could define a "strict" code
region you could put code in.
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sat, Dec 27, 2008 at 8:01 PM, Jeremy Shaw wrote:
> The problem with that function is that chroot affects the root of the
> whole process.
Yeah. Maybe you want privilege separation. Instead of starting a
thread to do the stuff that requires extra authority, make it a
separate program and commun
On Fri, Dec 26, 2008 at 1:55 PM, Jeff Heard wrote:
> Off the top of my head, I would say that the traditional meaning of
> Show could be changed to Serial, where serial encompasses both Read
> and Show -- possibly we could find a more efficient read function,
> several have been proposed. Then a
and then run the generic algorithm over the data structure. That
gives me the exact behavior I'm looking for, without either (explicitly)
passing a conversion function around or playing with fancy typeclasses.
Pardon me while I go beat my head against the wall.
Brian
___
This is making ghci with editline nicer for me. It says to use the vi
key mapping, tab for completion, C-l to clear the screen, and jj to go
into vi command mode.
$ cat ~/.editrc
bind -v
bind \\t rl_complete
bind ^L ed-clear-screen
bind jj vi-command-mode
__
was there some
discussion of this in the past on some (public) maillist, that my
admittedly shallow googling failed to uncover, that someone could point me
at?
Thanks.
Brian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.hask
Does the example code at
http://articles.bluishcoder.co.nz/Haskell/OpenAL work for anyone? I
added some putStrLns to see the device and context, and get
$ ./Main2
Device (ALCdevice 0x08a744c8)
Context (ALCcontext 0x08aabda0)
AL lib: alSource.c:2291: alcDestroyContext(): 1 Source(s) NOT deleted
AL
On Sun, Dec 21, 2008 at 12:12 PM, Laurent Giroud wrote:
> I have been doing a few experiments with cabal packages lately and I wish to
> uninstall these to return to a cleaner package base. However, there doesn't
> seem to be a "cabal uninstall" command and reading the documentation at
> http://ww
1 - 100 of 661 matches
Mail list logo
