2010/2/24 Brandon S. Allbery KF8NH allb...@ece.cmu.edu:
On Feb 22, 2010, at 03:36 , Roman Cheplyaka wrote:
* Anthony Cowley acow...@seas.upenn.edu [2010-02-21 14:15:00-0500]
#! /usr/bin/env bash
./prog --RTS $*
./prog --RTS $@
Otherwise it will work wrong if arguments contain quoted
On Wed, Feb 24, 2010 at 07:18, Roman Cheplyaka r...@ro-che.info wrote:
* Brandon S. Allbery KF8NH allb...@ece.cmu.edu [2010-02-24 00:02:12-0500]
On Feb 22, 2010, at 03:36 , Roman Cheplyaka wrote:
* Anthony Cowley acow...@seas.upenn.edu [2010-02-21 14:15:00-0500]
#! /usr/bin/env bash
./prog
How do people who like unit testing / property testing deal with export lists?
I often find that I do want an export list to reduce clutter in the
finished code, but for testing I'd like to expose everything in a
module. Is there a nice way to deal with this (using the C
pre-processor would not
Hello Brandon,
Wednesday, February 24, 2010, 8:08:41 AM, you wrote:
I feel that ghci code executing speed in guest os is 1.5~2x faster
than host os
My guess is that GHC (and the GHC RTS) on win32 is using a POSIX
emulation layer supplied by mingw32 for all system calls, introducing
extra
I have uploaded to hackage an interface to the simplex algorithm based
on GLPK. It is a very early version, it will probably have lots of
problems. In the future I would like to add support for integer
variables (MIP). Any suggestion is welcome.
This is an example taken from glpk-utils:
* Artyom Kazak artyom.ka...@gmail.com [2010-02-24 10:23:07+0200]
2010/2/24 Brandon S. Allbery KF8NH allb...@ece.cmu.edu:
On Feb 22, 2010, at 03:36 , Roman Cheplyaka wrote:
* Anthony Cowley acow...@seas.upenn.edu [2010-02-21 14:15:00-0500]
#! /usr/bin/env bash
./prog --RTS $*
* Magnus Therning mag...@therning.org [2010-02-24 09:11:54+]
On Wed, Feb 24, 2010 at 07:18, Roman Cheplyaka r...@ro-che.info wrote:
* Brandon S. Allbery KF8NH allb...@ece.cmu.edu [2010-02-24 00:02:12-0500]
On Feb 22, 2010, at 03:36 , Roman Cheplyaka wrote:
* Anthony Cowley
On Wed, Feb 24, 2010 at 10:41, Arnaud Bailly arnaud.oq...@gmail.com wrote:
Maybe you just want to test what's in your export list which
represents the public interface of your code. And if you cannot write
a test that exercise private implementation through the public
interface, then maybe
From: Magnus Therning mag...@therning.org
How do people who like unit testing / property testing deal with export lists?
I often find that I do want an export list to reduce clutter in the
finished code, but for testing I'd like to expose everything in a
module. Is there a nice way to deal
Hi all,
Last week I quietly released v0.1.0 of cabal-macosx, providing support
for building OSX application bundles (e.g. and in particular for GUIs
created using wxHaskell and gtk2hs - hence all the cross-posting):
http://hackage.haskell.org/package/cabal-macosx
I'm now soliciting input
Andy Gimblett schrieb:
For the record, here's the final improved version:
Hi Andy,
I hope you don't mind if I make some style comments to your final version.
1. break the line after do
(to avoid a layout change when change name or arguments of float' or
rename the variable e)
2. The t ::
Jonas Almström Duregård jonas.dureg...@gmail.com wrote:
noneRepeated xs = xs == nub xs
Not quite as bad, nub is O(n^2)
You are correct of course. Still, it will probably be a bit less
inefficient if the length of the lists are compared (as opposed to the
elements):
noneRepeated xs =
Hi all,
I am trying to read structured data from a socket and return a lazy list of
records. However, the socket reading operation seems to be strict and never
returns (until stack overflow). Here's some simplified code to reproduce the
problem:
import Control.Monad
main =
On Wed, Feb 24, 2010 at 1:24 PM, Christian Maeder
christian.mae...@dfki.de wrote:
1. break the line after do
(to avoid a layout change when change name or arguments of float' or
rename the variable e)
You can also break it immediately before do, which I think is
sometimes more clear.
On Feb 22, 2:57 am, Don Stewart d...@galois.com wrote:
TheLLVMbackend looks very promising -- considering we've not even
begun to explore the optimization pipeline at the level.
The mere numbers on this tiny snipets look definitely promising.
I also read through
On Wed, Feb 24, 2010 at 12:54:51 +, Andy Gimblett wrote:
That raises the question: what is the right place? It seems to me
that the defaults are not the right defaults for this case. --global
should probably go to /Applications, and --user should perhaps go to ~/
Applications
Hi,
no, it's absolutely not urgent. I'm just in early stage with building a
Happstack webpage and testing via GHCi works fine.
The problem occurs on a Windows XP machine with hsql-1.7.1,
hsql-mysql-1.7.1, GHC-6.10.4 and MySQL Server 5.1. Last year I posted an
instruction on how I got
Hi Fabian
You need to yield with unsafeInterleaveIO to allow some of the list to
be be consumed.
Something like this (which never terminates of course, but do produce output):
import System.IO.Unsafe
import Control.Monad
main = do messages - readLazy
mapM_ (\x - putStr $ show x ++
Am Mittwoch 24 Februar 2010 14:25:20 schrieb Ertugrul Soeylemez:
Jonas Almström Duregård jonas.dureg...@gmail.com wrote:
noneRepeated xs = xs == nub xs
Not quite as bad, nub is O(n^2)
You are correct of course. Still, it will probably be a bit less
inefficient if the length of the
Quoth Roman Cheplyaka r...@ro-che.info,
...
Well, this agrees with POSIX. So still I don't see the difference
between $@ and ${1+$@}.
Whatever the standards etc. may say, I believe $@ is reliably the
same as ${1+$@}, for old Bourne shells and new.
Donn
On 2010-02-24 05:10, Brandon S. Allbery KF8NH wrote:
On Feb 21, 2010, at 20:17 , Jeremy Shaw wrote:
The PS3 does do something though. If we were doing a write *and* read
select on the socket, the read select would wakeup. So, it is trying
to notify us that something has happened, but we are not
On Feb 24, 2010, at 02:18 , Roman Cheplyaka wrote:
#! /bin/sh
./prog --RTS ${1+$@}
The longer specification above should work with whatever /bin/sh is
around, whether it's Solaris /sbin/sh, FreeBSD's sh, general Linux
bash, Debian/Ubuntu dash, etc.
Are you referring to some Solaris shell
On Feb 24, 2010, at 05:19 , Roman Cheplyaka wrote:
Well, this agrees with POSIX. So still I don't see the difference
between $@ and ${1+$@}.
The difference is that Unix /bin/sh predates POSIX, and on systems
that usefully support a notion of backward compatibility (nostly
commercial,
Günther Schmidt wrote:
I've been thinking a lot lately about heterogeneous and extensible data
structures for which HList certainly offers a solution.
While HList is implemented through type-level programming I wonder if I
can achieve similar results through value-level programming alone.
On Wed, Feb 24, 2010 at 10:11 AM, Johann Höchtl johann.hoec...@gmail.comwrote:
Will this eg mean
* interoperability between LLVM assemblies for free
* plugable garbage collectors
Keep in mind the LLVM GHC backend still uses the separate Haskell stack and
uses a custom calling convention,
On 16 February 2010 17:57, Neil Mitchell ndmitch...@gmail.com wrote:
Hi Serguey,
A GHC 6.10.4 version of Gtk2hs:
http://www.mail-archive.com/gtk2hs-de...@lists.sourceforge.net/msg00340.html
I used to recommend Gtk2hs over wxHaskell for GUI development as there
was always a version that
On Feb 24, 2010, at 08:53 , Fabian Roth wrote:
main = do messages - readLazy
mapM_ (\x - putStr $ show x ++ \n) $ messages
Regardless of anything else going on, that second line will force
everything to be read immediately.
--
brandon s. allbery
Hello Edward,
Wednesday, February 24, 2010, 10:32:59 PM, you wrote:
I'd be really curious about techniques that permit mutation during
the construction of functional datastructures; this seems like a cool
way to get fast performance w/o giving up any of the benefits of
immutability.
=
Second Call for Papers
ICFP 2010: International Conference on Functional Programming
Baltimore, Maryland, 27 -- 29 September 2010
http://www.icfpconference.org/icfp2010
2010/2/23 Jonas Almström Duregård jonas.dureg...@gmail.com:
Hi Rafael,
I assume you will perform this operation on some very large lists, or
performance would not be an issue. Have you tested if your optimized
version is better than your initial one?
You should compare your implementation
Ben Millwood schrieb:
On Wed, Feb 24, 2010 at 1:24 PM, Christian Maeder
christian.mae...@dfki.de wrote:
1. break the line after do
(to avoid a layout change when change name or arguments of float' or
rename the variable e)
You can also break it immediately before do, which I think is
OK, I imagined to install OpenSUSE 11.2. However, I can't find a way to
make it install either GHC or the Haskell Platform. A quick Google
search turns up a folder on download.opensuse.org which is stuffed full
of Haskell stuff, yet no ammount of prodding YaST will convince it that
it's
On Wednesday 24. February 2010 21.47.56 Andrew Coppin wrote:
no ammount of prodding YaST will convince it that
it's possible to install anything remotely Haskell-related
if you open the software manager and go to configuration → repositories, you
should be able to add new software sources. i
Excerpts from Bulat Ziganshin's message of Wed Feb 24 14:48:53 -0500 2010:
I'd be really curious about techniques that permit mutation during
the construction of functional datastructures; this seems like a cool
way to get fast performance w/o giving up any of the benefits of
immutability.
ezyang:
Hey guys, an update!
It turns out, Clojure is using mutation under the hood during its
initial data structure generation to make populating the hash-map
blazingly fast. When I force it to use the purely functional
interface, the performance is much closer to Haskell's.
Am Mittwoch 24 Februar 2010 21:25:04 schrieb Gwern Branwen:
2010/2/23 Jonas Almström Duregård jonas.dureg...@gmail.com:
Hi Rafael,
I assume you will perform this operation on some very large lists, or
performance would not be an issue. Have you tested if your optimized
version is better
Excerpts from Don Stewart's message of Wed Feb 24 16:13:38 -0500 2010:
These are exported from vector, though.
Aha! I was looking in Data.Vector for them; they're actually in
Data.Vector.Generic. Awesome.
Cheers,
Edward
___
Haskell-Cafe mailing list
Hi Fabian
From the source viewable in the Haddock docs supplied with GHC
- hGetContents calls lazyRead:
hGetContents :: Handle - IO String
hGetContents handle =
wantReadableHandle hGetContents handle $ \handle_ - do
xs - lazyRead handle
return (handle_{ haType=SemiClosedHandle},
Hello,
I discovered a bug in our: Control.Concurrent.Thread
In the documentation of 'forkIO' we specify that the forked thread
inherits the blocked state of its parent. However our implementation
did not ensure this.
The newly released concurrent-extra-0.3.1 fixes this.
This release also adds
Erlend Hamberg wrote:
if you open the software manager and go to configuration → repositories, you
should be able to add new software sources. i use the following repository:
Server name: download.opensuse.org
Directory: /repositories/devel:/languages:/haskell/openSUSE_11.2/
This repository
On Tue, 23 Feb 2010 08:30:18 -0300, you wrote:
Hi folks,
While solving a puzzle, I was posed the problem of finding if there was no
duplicates on a list.
Must it be a list data structure(DS) or list ADT?
Mergesort can be parallelized.
Best regards,
Rafael
--
Regards,
Casey
Am Mittwoch 24 Februar 2010 23:17:46 schrieb Andrew Coppin:
Erlend Hamberg wrote:
if you open the software manager and go to configuration →
repositories, you should be able to add new software sources. i use
the following repository:
Server name: download.opensuse.org
Directory:
On Tue, 23 Feb 2010 08:30:18 -0300, you wrote:
Hi folks,
While solving a puzzle, I was posed the problem of finding if there was no
duplicates on a list.
Must it be a list data structure(DS) or list ADT?
Mergesort can be parallelized.
Best regards,
Rafael
If space is at a premium you
On Feb 24, 2010, at 16:17 , Fabian Roth wrote:
Using UnsafeIO, however, leaves a creepy unsafe feeling...
I don't fully understand though why it is unsafe. Doesn't
hGetContents do the exact same thing (i.e. reading from IO returning
a lazy string) but does not require UnsafeIO.
It does;
On 24 February 2010 20:17, Magnus Therning mag...@therning.org wrote:
I often find that I do want an export list to reduce clutter in the
finished code, but for testing I'd like to expose everything in a
module. Is there a nice way to deal with this (using the C
pre-processor would not
On 25 February 2010 10:21, Evan Laforge qdun...@gmail.com wrote:
On Wed, Feb 24, 2010 at 3:10 PM, Ivan Miljenovic
ivan.miljeno...@gmail.com wrote:
If you start a function name with an underscore, it is implicitly
exported by GHC (I can't find the actual documentation page at the
moment
ivan.miljenovic:
On 24 February 2010 20:17, Magnus Therning mag...@therning.org wrote:
I often find that I do want an export list to reduce clutter in the
finished code, but for testing I'd like to expose everything in a
module. Is there a nice way to deal with this (using the C
On Wed, Feb 24, 2010 at 01:28:56PM -0500, Edward Kmett wrote:
* GHC/LLVM bytecode with JIT-option?
There is little preventing this one.
Oh, what a great idea! C code being inlined into Haskell
functions! :D
If clang were used to compile the C code into LLVM IR, and
everything were linked by
For what it's worth, Erlang addresses this issue with an
-export_all directive, which can be passed as a compiler option.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello Alberto,
Thank you! I don't have a problem calling for LP at hand right now, but some
time ago I was looking for such a package. Now I know where to look next time
:)
Greetings,
Daniel
On Wednesday 24 February 2010 11:07:08 Alberto Ruiz wrote:
I have uploaded to hackage an interface
In correspondance with Alistair Bayley I learned that there is in fact a
gtk2hs installer for 6.10.4. One can find it by Googling gtk2hs 6.10.4
(which I did not think to do). The URL is in
http://www.mail-archive.com/gtk2hs-de...@lists.sourceforge.net/msg00340.html
The installer doesn't work if
51 matches
Mail list logo
