Thanks.
On Sat, Jun 2, 2012 at 12:57 PM, Michal Terepeta
michal.terep...@gmail.comwrote:
On 01.06 11:06, John Van Enk wrote:
Hi Cafe,
Is there a reason that the GHCi interpreter doesn't detect and report
infinite loops in statements like this (like compiled programs do) even
though
Hi Cafe,
Is there a reason that the GHCi interpreter doesn't detect and report
infinite loops in statements like this (like compiled programs do) even
though no CPU time appears to be used? My (admittedly weak) searching for
an answer didn't turn much up.
let s | not $ null s = [] in s
GHCi
I second the request to publish this to hackage.
On Tue, Feb 15, 2011 at 1:02 PM, Simon Michael si...@joyful.com wrote:
On 2/11/11 8:42 PM, trysta...@comcast.net wrote:
Any advice, comments, or questions are welcome.
Hi Trystan.. it looks great. I like the rubyish brevity and readability.
Hooray for collaboration! I think this emphasizes the need for some sort of
social aspect on Hackage...
On Mon, Oct 11, 2010 at 10:58 AM, Justin Bailey jgbai...@gmail.com wrote:
On Mon, Oct 11, 2010 at 7:56 AM, Christopher Done
chrisd...@googlemail.com wrote:
Hey that's cool, I hadn't seen
Can UHC self-host yet? How does the runtime compare to GHC's? I suppose I
could just go look... :)
On Wed, Sep 22, 2010 at 10:30 AM, Atze Dijkstra a...@cs.uu.nl wrote:
Utrecht Haskell Compiler -- second release 1.1.0
The
On the bottom of this page, enter your e-mail address:
http://www.haskell.org/mailman/listinfo/haskell-cafe
http://www.haskell.org/mailman/listinfo/haskell-cafeThis is also provided
in the footer of these list e-mails.
On Mon, Aug 23, 2010 at 1:35 PM, David Webster dwwebste...@gmail.comwrote:
I happened to download them all (i think all) a while ago to torment my
coworkers:
http://sw17ch.com/dump/lambdacats.zip
Enjoy.
On Fri, Aug 6, 2010 at 12:12 AM, Tony Morris tonymor...@gmail.com wrote:
Hello, does anyone happen to have the lambdacats page cached? The domain (
arcanux.org) and
?
On Thu, Aug 5, 2010 at 8:11 PM, Job Vranish job.vran...@gmail.com wrote:
Yeah Atom is pretty slick, though unfortunately it's not quite powerful
enough for much of the stuff that we do.
John Van Enk and I are actually working on a language that's similar to C
(and compiles to C), but has
If you're on Windows, I believe you can find the gcc.exe at the following
location:
C:\Program Files\Haskell Platform\2009.2.0.2\gcc.exe
See this link for how to pick which C compiler to use:
http://www.haskell.org/ghc/docs/6.12.2/html/users_guide/options-phases.html#replacing-phases
2010/8/6
?
The domain (arcanux.org http://arcanux.org) and server have
disappeared and the wayback machine doesn't have the images.
On Fri, Aug 6, 2010 at 18:43, John Van Enk wrote:
I happened to download them all (i think all) a while ago to torment
my coworkers:
http
Is there a Git/Darcs dev repo hiding anywhere we could submit patches to?
On Tue, Aug 3, 2010 at 4:35 AM, Frank Kupke f...@informatik.uni-kiel.dewrote:
Hi,
DSTM is an implementation of a robust distributed Software Transactional
Memory (STM) library for Haskell. Many real-life applications
Would it be possible to use an IntMap instead of your OrdMap? Perhaps zip
your users with [0..] and key off the integer?
As a side note, I threw this package onto Hackage a while ago and may suit
your needs if you decide to move to something like IntMap:
http://hackage.haskell.org/package/EnumMap
Hot.
On Wed, Apr 7, 2010 at 2:35 PM, Thomas Schilling nomin...@googlemail.comwrote:
http://i.imgur.com/kFqP3.png Didn't know about CSS's rgba to
describe transparency. Very useful.
On 7 April 2010 18:19, Gregory Crosswhite gcr...@phys.washington.edu
wrote:
Ooo, I really like this
I don't believe that the monomorphism restriction has anything to do with
this. Removing it does not generalize the type.
On Tue, Apr 6, 2010 at 4:46 PM, Brandon S. Allbery KF8NH
allb...@ece.cmu.edu wrote:
On Apr 6, 2010, at 15:56 , Job Vranish wrote:
Is haskell supposed to always infer the
http://en.wikipedia.org/wiki/Grace_Hopper
http://en.wikipedia.org/wiki/Grace_HopperA heck of a lady.
On Sat, Mar 27, 2010 at 12:51 PM, Andrew Coppin andrewcop...@btinternet.com
wrote:
Ozgur Akgun wrote:
Nevertheless, I guess you're right. There are very few females in most of
the CS
Serguey,
I'm working on a similar project. What's the chance you have your source
code in the open?
/jve
On Thu, Mar 11, 2010 at 7:30 AM, Serguey Zefirov sergu...@gmail.com wrote:
2010/3/10 Tom Hawkins tomahawk...@gmail.com:
On Wed, Mar 10, 2010 at 8:07 AM, Warren Henning
sergu...@gmail.comwrote:
2010/3/11 John Van Enk vane...@gmail.com:
Serguey,
I'm working on a similar project. What's the chance you have your source
code in the open?
/jve
I'll ask.
But chances are pretty small.
I'll think about reimplementing command description from scratch
These are beginning to look like homework questions...
On Thu, Mar 4, 2010 at 11:38 AM, Pradeep Wickramanayake prad...@talk.lkwrote:
Hi,
sortList2 :: String - String
sortList2 (x:xs)
| x == ',' =
| otherwise = [x] ++ sortList2 xs
im breaking a one
What's the chance you have generational graphs for the rest of your examples
like you do with the first? I'd be interested to see those.
On Mon, Mar 1, 2010 at 3:02 AM, Don Stewart d...@galois.com wrote:
http://donsbot.wordpress.com/2010/03/01/evolving-faster-haskell-programs-now-with-llvm/
The whole concept of lazy evaluation seems to run counter to the idea of
real-time systems.
Hi Thomas,
Lazy evaluation is okay since it has deterministic characteristics. We can
predict what will happen quite accurately (heck, we can model it in simpler
cases). It might take a while to get
Simon,
Would a more predictable GC or a faster GC be better in your case? (Of
course, both would be nice.)
/jve
On Mon, Mar 1, 2010 at 9:33 PM, Simon Cranshaw simon.crans...@gmail.comwrote:
On Sun, Feb 28, 2010 at 6:06 PM, Pavel Perikov peri...@gmail.com wrote:
Did you really seen 100ms
Hmm... that's my outdated blog post. I've been meaning to add an updated
version. I'll try and get to that soon.
On Sat, Feb 13, 2010 at 7:30 PM, Yves Parès limestr...@gmail.com wrote:
I've been interested in using Atom since I saw this:
http://blog.sw17ch.com/wordpress/?p=84
However those
, and multi-threading) would have to be made.
If the GC becomes deterministic, then a much better case can be made for
using the language on a plane or in medical devices.
/jve
On Fri, Feb 12, 2010 at 10:29 AM, Simon Marlow marlo...@gmail.com wrote:
On 11/02/2010 17:01, John Van Enk wrote
I need to be able to swap out the RTS. The place I want to stick Haskell
absolutely needs its own custom RTS, and currently, I don't think it's all
that easy or clean to do that.
Am I wrong? Are there resources describing how to do this already?
/jve
On Thu, Feb 11, 2010 at 10:12 AM, Michael
Panachev ivan.panac...@gmail.comwrote:
On Thu, Feb 11, 2010 at 6:30 PM, John Van Enk vane...@gmail.com wrote:
I need to be able to swap out the RTS. The place I want to stick Haskell
absolutely needs its own custom RTS, and currently, I don't think it's all
that easy or clean to do that.
Am I
Here's the paper:
http://comjnl.oxfordjournals.org/cgi/content/abstract/33/5/466
On Thu, Feb 11, 2010 at 11:45 AM, John Van Enk vane...@gmail.com wrote:
I'm not specifically interested in raw hardware, but I am interested in,
say, making the garbage collection deterministic and altering
Well, my point here is that if we want to see GHC branch into other fields
(mine being safety critical), and actually see the code generated by GHC be
what's really running (rather than once-removed in the form of an EDSL),
some changes will have to be made.
Being able to experiment with GHC's
I'd suggested this in an earlier SoC thread.
2010/2/11 Matthias Görgens matthias.goerg...@googlemail.com
Implementing an alternative RTS for GHC seems like a viable Google
Summer of Code project to me. What do you think?
___
Haskell-Cafe mailing
I'll definitely take a closer look.
On Thu, Feb 11, 2010 at 1:09 PM, John Meacham j...@repetae.net wrote:
On Thu, Feb 11, 2010 at 06:57:48PM +0100, Henning Thielemann wrote:
John Van Enk schrieb:
I need to be able to swap out the RTS. The place I want to stick
Haskell
absolutely needs
Perhaps just defining the interface and demonstrating that different RTS's
are swappable would be enough?
2010/2/11 Alp Mestanogullari a...@mestan.fr
It seems quite big for a 3 months project made by a student, though.
2010/2/11 Matthias Görgens matthias.goerg...@googlemail.com
Implementing
Not using it yet, but there's been a large amount of interest and
willingness to work with it from management. We're contractors, so it
depends on us finding some one who will allow us to use the language or asks
for it explicitly.
On Wed, Feb 10, 2010 at 10:59 AM, Jason Dusek
consider presenting at CUFP this year
Any word on when this will be?
On Wed, Feb 10, 2010 at 3:50 PM, Don Stewart d...@galois.com wrote:
v.dijk.bas:
On Wed, Feb 10, 2010 at 4:59 PM, Jason Dusek jason.du...@gmail.com
wrote:
I wonder how many people actually write Haskell,
I'll just toss this idea out there:
I want to be able to pick a runtime to compile against. Some Ada compilers
allow me to specify a runtime to use with a --RTS flag. This, of course,
also means we'd need to write more runtime variants.
I dropped this on the haskell_proposals reddit for safe
Seems a little dangerous:
http://ideone.com/XL6uLnLo
On Thu, Jan 21, 2010 at 8:25 PM, Gwern Branwen gwe...@gmail.com wrote:
On Thu, Jan 21, 2010 at 8:02 PM, Sphere Research Labs
cont...@sphere-research.com wrote:
Hi,
test Haskell on ideone.com,
see the example:
Hi List,
Is it possible to prevent a library from being used unless -threaded is
enabled? I have a specific case where lots-of-nasty shows up if the library
is linked against an executable built without -threaded.
I suppose this is GHC specific.
/jve
http://hackage.haskell.org/package/hack
2010/1/13 Günther Schmidt gue.schm...@web.de
Hi,
References to a Hack. module came in the responses to my posts on
HTML-GUIs.
What is Hack then?
Günther
___
Haskell-Cafe mailing list
have mentioned that I had found it on hackage, I just
don't understand what it *is* or what it's supposed to be for.
Günther
Am 13.01.10 14:46, schrieb John Van Enk:
http://hackage.haskell.org/package/hack
2010/1/13 Günther Schmidt gue.schm...@web.de
Hi,
References to a Hack. module
.
Hackage: http://hackage.haskell.org/package/tuntap
GitHub: http://github.com/sw17ch/tuntap
John Van Enk
PS: Thanks to Matthew Isleb and Job Vranish for their help on the C code
used.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
For those interested, the version of data-clist without Empty is here:
http://github.com/sw17ch/data-clist/tree/noEmpty
http://github.com/sw17ch/data-clist/tree/noEmpty
On Tue, Jan 5, 2010 at 2:53 AM, Luke Palmer lrpal...@gmail.com wrote:
On Mon, Jan 4, 2010 at 1:13 PM, Maciej Piechotka
I've heard this a few times and am slowly becoming convinced of it. I'll try
my current use without the Empty and see how it goes.
Given that I've heard this from several places, I'll probably drop Empty.
On Mon, Jan 4, 2010 at 9:17 AM, Luke Palmer lrpal...@gmail.com wrote:
On Mon, Jan 4, 2010
To start with, can you clarify that you are looking for an Embedded DSL
(sometimes called Light Weight DSL)?
A _proper_ DSL has its own interpreter/compiler where an EDSL/LwDSL
leverages the compiler of a host language (in this case, Haskell).
Assuming you're referring to an EDSL, I'll respond.
as the
timer allows enough time between expirations for any of the task groups to
finish, it will run in hard real time.
Hope this helps.
John Van Enk
On Thu, Dec 31, 2009 at 10:43 PM, Jason Dusek jason.du...@gmail.com wrote:
I'm working with Atom to program an ATtiny25. I am curious
about how
is called out of the ISR (Interrupt Service Routine).
On Fri, Jan 1, 2010 at 10:48 AM, John Van Enk vane...@gmail.com wrote:
Hi Jason,
Regarding timing, the version of blink_atom.c below does not contain this,
but my later versions used the hardware timers to control the blink rate.
One can setup
Yes, exactly.
On Fri, Jan 1, 2010 at 3:02 PM, Jason Dusek jason.du...@gmail.com wrote:
Wait, no -- I missed something. As long as the outermost Atom
routine is run every `n' µs by a hardware clock, the counter
(`__global_clock') will contain an accurate count of how many
`n' µs intervals
Root: http://github.com/sw17ch/data-ring
Thanks ahead of time,
John Van Enk
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Luke,
Thanks for the feedback. I had some follow up comments.
On Thu, Dec 31, 2009 at 5:50 AM, Luke Palmer lrpal...@gmail.com wrote:
Code looks okay. It suffers from the same persistence/amortization
problem as the classical functional queue; if you happen to shift from
one of the edge
Hi Daniel,
Some follow up on your comments:
On Thu, Dec 31, 2009 at 5:54 AM, Daniel Fischer daniel.is.fisc...@web.dewrote:
Am Donnerstag 31 Dezember 2009 10:59:54 schrieb John Van Enk:
Hi List,
I recently needed a ring structure (circular list with bi-directional
access
Hi Heinrich,
Some comments:
On Thu, Dec 31, 2009 at 6:27 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Since the name Ring is already taken by an ubiquitous mathematical
structure, and thus already in hackage for example as Algebra.Ring in
the numeric-prelude , I suggest to
I've decided to settle on Data.CircularList. The renamed git repository is
here:
http://github.com/sw17ch/data-clist
On Thu, Dec 31, 2009 at 3:29 PM, Twan van Laarhoven twa...@gmail.comwrote:
John Van Enk wrote:
Hi Heinrich,
I think I like Ring more than Necklace or Tom's suggestion
Hi all,
data-clist-0.0.3 is up on hackage:
http://hackage.haskell.org/package/data-clist-0.0.3
Any feedback is appreciated. The docs are getting there, but not quite
complete.
Enjoy!
/jve
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
This is a problem with partitioned operating systems used in avionics. The
airplane computers require certain partitions to exist between programs in
both time and space. The space guarantees are most easily enforced by
eliminating any dynamic memory allocation once the operating system enters a
It's been well over a year. I'll see what I can do when I get some free(er)
time.
2009/12/14 Patai Gergely patai_gerg...@fastmail.fm
The more of these I see, the more guilt I feel over the condition of the
portaudio module. There's a good chance that the performance issue you're
seeing is
If anything, I'd flip those two...
On the backend, things are anything but pure but it helps us reason about
the program on the front end.
Laziness also isn't nearly as prevalent on the backend as it is on the front
end.
Even though we can reason about things using purity and laziness on the
Hi List,
I've recently had a situation where I used the same pattern quite a bit
while reducing and evaluating an AST. I quickly wrapped the operation in a
package and stuck it on github.
http://github.com/sw17ch/rebox/blob/master/src/Data/Rebox.hs
I'm wondering two things:
1) Does any one
Very cool.
On Sun, Dec 6, 2009 at 7:29 PM, M Xyz functionallyharmoni...@yahoo.comwrote:
I got a lot of great help this weekend from Haskell-Cafe, thanks.
Now that I have portaudio up and running I put up a tutorial and a 103 kb
download
of all the windows binaries and files. I hope this
Hi,
portaudio is my embarrassing fault, but it does work most of the time.
(Community, some one remind me to revisit this package after Christmas.)
Are you running in Windows? Linux? If Linux, which flavor?
/jve
On Fri, Dec 4, 2009 at 1:51 PM, M Xyz functionallyharmoni...@yahoo.comwrote:
You'll have to install the portaudio C libraries and header files before
continuing. I never actually tested the package on XP, if you get it to
work, I'd love to hear your experience.
/jve
On Fri, Dec 4, 2009 at 2:20 PM, M Xyz functionallyharmoni...@yahoo.comwrote:
Hi,
portaudio is my
I'm all for making HP the default as long as we find a way to make some of
the larger packages (I'm thinking gtk2hs) either ship with HP in Windows or
install correctly with HP.
On Thu, Dec 3, 2009 at 11:46 AM, Joe Fredette jfred...@gmail.com wrote:
I think it makes sense, the HP is supposed to
The burden of proof is on you to demonstrate that it _is_.
On Thu, Dec 3, 2009 at 12:09 PM, John D. Earle johndea...@cox.net wrote:
See [Haskell-cafe] Optimization with Strings ? for background.
Don Stewart wrote, the guarantees of purity the type system provides are
extremely
useful for
*flawed, that is
On Thu, Dec 3, 2009 at 12:13 PM, John Van Enk vane...@gmail.com wrote:
The burden of proof is on you to demonstrate that it _is_.
On Thu, Dec 3, 2009 at 12:09 PM, John D. Earle johndea...@cox.net wrote:
See [Haskell-cafe] Optimization with Strings ? for background.
Don
Is the IORef or the value in the IORef your key?
2009/11/2 Patai Gergely patai_gerg...@fastmail.fm
Hello all,
I wanted to create a weak pointer with an IORef as the key and something
else as the value, but I saw no way to do it through the API provided.
After some experimentation I came up
Is this on hackage yet, or should we just consult the mecha link on your
home page?
On Wed, Oct 21, 2009 at 11:42 PM, Tom Hawkins tomahawk...@gmail.com wrote:
A few months ago, I started toying with a few alternative pump designs
to power our hydraulic hybrids. After not being able to secure
Are you using GTK? OpenGL? Haskell? There's absolutely no context here...
On Tue, Oct 20, 2009 at 11:02 AM, xu zhang douy...@gmail.com wrote:
Hi there,
I am trying to make a sub-window of one window and make them work
together. I mean, if I zoom or transform some content in one of the
I've run Haskell stuff on VPS hosts like Linode or SliceHost. $20/month is a
lot better than $60.
On Thu, Oct 15, 2009 at 12:32 PM, Austin King sh...@ozten.com wrote:
For now, I've given up on cheap hosting (via statically compiled CGI).
I've created a GHC 6.10.4, cabal-install, Ubuntu 9.04
To me, the D and S come in when I'm deciding what to support. The
domain represents the set of primitive operations I want to support. The
specific says that I don't support anything other than those operations.
Consider a language for laying out boolean logic circuits: we want to
implement only
On Wed, Oct 7, 2009 at 2:52 PM, Ben Franksen
But isn't one of the advantages of an _E_DSL that we can use the host
language (Haskell) as a meta or macro language for the DSL?
Substantially so. I've used brief examples where the EDSL syntax is
basically the data declaration (perhaps with some
you want:
ghc-pkg unregister [package name]
and
ghc-pkg list
/jve
On Tue, Oct 6, 2009 at 3:52 PM, Paul Moore p.f.mo...@gmail.com wrote:
As it says in the subject, how do I remove a package that I installed
(with the --user flag) via cabal?
Come to that, how do I list the packages I've
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?
On Tue, Oct 6, 2009 at 4:04 PM, Paul Moore p.f.mo...@gmail.com wrote:
2009/10/6 John Van Enk vane
Sorry boss, but we're just not going to be able to meet that deadline,
because, well, a language extension we were using was dropped from the
language, and the syntax for some core operators was changed. Not only is
our code broken, but many of the libraries we were using are broken. Don't
Hello List,
I'm running into a problem with c2hs and how it parses the C typedef
'size_t'. On 32bit systems, this ends up being parsed as a CUInt. On 64bit
systems, this ends up as a CULong. This gets especially sticky with function
pointers.
In order to make bindings with c2hs that work across
.
Is it really such a problem to make the conversion? My assumption is that
CSize would match 'size_t' for the specific architecture.
Thanks for your comment.
/jve
On Thu, Oct 1, 2009 at 12:37 PM, Duncan Coutts duncan.cou...@googlemail.com
wrote:
On Thu, 2009-10-01 at 10:20 -0400, John Van
Ohhh, if you're dealing with pointers to CSize then it's easy, c2hs
supports that directly. See the c2hs user guide section on the pointer
hook.
{# pointer *size_t as CSizePtr - CSize #}
I seriously should have thought of that. I have #pointer's everywhere, but I
didn't think to do it with
Thanks. I'd heard rumors about a year ago that 6.12 might have a cross
compiler. I just wanted to check. :)
On Wed, Sep 23, 2009 at 4:41 PM, Duncan Coutts
duncan.cou...@worc.ox.ac.ukwrote:
On Wed, 2009-09-23 at 14:50 -0400, John Van Enk wrote:
Hi,
This may be more appropriate
Hi,
This may be more appropriate for a different list, but I'm having a hard
time figuring out whether or not we're getting a cross compiler in 6.12 or
not. Can some one point me to the correct place in Traq to find this
information?
/jve
___
Second the hackage suggestion.
`cabal unpack [package name]` is a really nice way to grab sources.
On Mon, Sep 14, 2009 at 1:59 PM, Don Stewart d...@galois.com wrote:
jakewheatmail:
Hello all,
I've started on a SQL parser and type checker, which I'm currently
planning on evolving into
I'll hunt down those changes and push something new to hackage. :)
On Mon, Sep 14, 2009 at 12:27 PM, Felipe Lessa felipe.le...@gmail.comwrote:
On Wed, Aug 12, 2009 at 01:03:55PM -0400, John Van Enk wrote:
EnumMap silently passes this responsibility to the user, without even a
note
...@gmail.comwrote:
On Wed, Aug 12, 2009 at 01:03:55PM -0400, John Van Enk wrote:
EnumMap silently passes this responsibility to the user, without even a
note in the documentation.
Like I've said, I made no modifications to the documentation other
than replacing IntMap with EnumMap. Should
Might it make sense to try and get the concept of global and user
working in Windows? (It may already, but I noticed that the default seems to
be global.)
I don't know what technical challenges there are, but the ApplicationData
directory (or AppData, or whatever) seems like a good place to stick
Neat!
On Thu, Aug 27, 2009 at 10:09 AM, Sebastiaan Visser sfvis...@cs.uu.nlwrote:
Hi all,
I am very pleased to announce the first release of the jail[1,2] package. A
jailed IO monad that can restrict filesystem access for your code. This
package will soon be an integral part of the Salvia
Hi List,
I'm trying to kill a thread (during program cleanup) that is almost always
going to be perma-blocking on a foreign call (read).
It seems that there's no facility to do this built into Haskell at this
point, or is there?
/jve
___
Haskell-Cafe
On Wed, Aug 12, 2009 at 2:09 AM, Ketil Maldeke...@malde.org wrote:
Felipe Lessa felipe.le...@gmail.com writes:
There are some funky Enum instances around:
IMO it's implicit that keys overwrite eachother whenever their
'fromEnum' is equal, however that may be spoken in the docs.
I couldn't
On Wed, Aug 12, 2009 at 11:34 AM, David Menendezd...@zednenem.com wrote:
On Wed, Aug 12, 2009 at 9:16 AM, John Van Enkvane...@gmail.com wrote:
On Wed, Aug 12, 2009 at 2:09 AM, Ketil Maldeke...@malde.org wrote:
And perhaps also note that you will get exceptions for values outside
the Enum
EnumMap silently passes this responsibility to the user, without even a note
in the documentation.
Like I've said, I made no modifications to the documentation other
than replacing IntMap with EnumMap. Should the community show more
interest in the EnumMap, such a change will show up in the
It strikes me that using Bits instead of Enum might be more likely to be what
people want in many cases
It wouldn't hurt for you (or someone) to implement this. I'm sure it
would be useful.
On Wed, Aug 12, 2009 at 2:09 AM, Ketil Maldeke...@malde.org wrote:
Felipe Lessa felipe.le...@gmail.com
unsafeHorribleThings
I think we have a name for this new feature.
I can see how something like this would be useful to some areas. There
are many cases (graphs!) where it's just easier to build up structures
destructively, seal them, and return them to happyPureFunTimesLand.
Even if GHC does
For the sake of testing both options, here's a branch with the wrapper
code instead of the replacement/integrated code:
http://github.com/sw17ch/EnumMap/tree/wrapper
On Sat, Aug 8, 2009 at 4:41 PM, Henning
Thielemannlemm...@henning-thielemann.de wrote:
On Sat, 8 Aug 2009, John Van Enk wrote
:
On Sat, 8 Aug 2009, John Van Enk wrote:
Hi List,
I've uploaded a first version of EnumMap to hackage.
EnumMap is a generalization of IntMap that constrains the key to Enum
rather than forcing it to be Int. I have no idea what impact this has
on performance, but it still passes all
the logic of insertWithKey to allow us to use the proper (Key
k) type.
I don't see an obvious way around this--am I missing something?
On Sat, Aug 8, 2009 at 4:41 PM, Henning
Thielemannlemm...@henning-thielemann.de wrote:
On Sat, 8 Aug 2009, John Van Enk wrote:
Hi List,
I've uploaded a first
http://github.com/sw17ch/EnumMap/tree/master
Perhaps you could patch what I have? :)
On Sun, Aug 9, 2009 at 12:08 AM, Thomas
DuBuissonthomas.dubuis...@gmail.com wrote:
Inflating the number of elements in the test, I see:
IntMap
inserts: 5.3 seconds
lookups: 2.0 seconds
EnumMap
inserts:
this
is a derivative work of the original IntMap package.
http://hackage.haskell.org/package/EnumMap
Comments/benchmarks/criticism is appreciated. Merging this in with
containers eventually would be more appreciated. :)
John Van Enk
___
Haskell-Cafe mailing
is substantially cleaner than from
IntMap to EnumMap:
type IntMap v = EnumMap Int v
/jve
On Sat, Aug 8, 2009 at 4:41 PM, Henning
Thielemannlemm...@henning-thielemann.de wrote:
On Sat, 8 Aug 2009, John Van Enk wrote:
Hi List,
I've uploaded a first version of EnumMap to hackage.
EnumMap
IntMap for speed).
Thoughts?
On Sat, Aug 8, 2009 at 6:11 PM, Henning
Thielemannlemm...@henning-thielemann.de wrote:
On Sat, 8 Aug 2009, John Van Enk wrote:
That's originally how I was thinking about doing it, but I think that
requires one to re-implement all the functions available
How bad is the lookup compared to normal?
On Sat, Aug 8, 2009 at 9:02 PM, Thomas
DuBuissonthomas.dubuis...@gmail.com wrote:
On Sat, Aug 8, 2009 at 5:30 PM, Felipe Lessafelipe.le...@gmail.com wrote:
On Sat, Aug 08, 2009 at 04:14:15PM -0700, Thomas DuBuisson wrote:
There exists a small but
Has any one used a service similar to (or equivelant to) Slicehost or
Linode to run Haskell network applications?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
:53:40 -0400,
John Van Enk wrote:
Has any one used a service similar to (or equivelant to) Slicehost or
Linode to run Haskell network applications?
I have run happstack applications on vpslink and rimuhosting VPSes. (I
build everything as .debs and then just install the .debs on the
server
Yeah, it crossed my mind, but since my application only uses 3MB of
memory in Linux, I think I'll be ok. :)
On Thu, Jul 23, 2009 at 11:38 AM, Anton van
Straatenan...@appsolutions.com wrote:
John Van Enk wrote:
No, I just want to know if there are any gotchas in the typical VPS
setups
wrote:
3MB? You're going to host Hello World on a VPS? ;)
John Van Enk wrote:
Yeah, it crossed my mind, but since my application only uses 3MB of
memory in Linux, I think I'll be ok. :)
On Thu, Jul 23, 2009 at 11:38 AM, Anton van
Straatenan...@appsolutions.com wrote:
John Van Enk wrote
You probably want something like printf(%.10Lg,d);. Here's a shot C
example and its output:
#include stdio.h
int main(int argc, char * argv[])
{
long double d = 0.123456789;
printf(%.30Lf\n, d);
printf(%.20Lg\n, d);
printf(%.20Le\n, d);
}
/*
0.1234567887336054491370
Are you starting a new Wiki? I'd absolutely love to have that resource.
On Thu, Jul 16, 2009 at 8:14 PM, Thomas
DuBuissonthomas.dubuis...@gmail.com wrote:
The wiki [1] where Atom [2] once lived has been gone for some time
now. The only resources I know for Atom are a couple blog posts, the
List,
Has any one managed to install gtk2hs on a Windows box running the
Haskell Platform? I've had no luck; it seems the gtk2hs installer is
unable to find the GHC installation.
/jve
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
1 - 100 of 212 matches
Mail list logo
