David Feuer david.fe...@gmail.com writes:
So I was thinking about a mutable array of tuples, but to avoid allocating
tuples to modify their fields, I guess I really want an immutable array of
tuples of STRefs. Just how much less efficient is this than a plain mutable
array? might it even make
AntC anthony_clay...@clear.net.nz writes:
I agree. I don't declare operators very often, and when I do I always
struggle
to remember which way round the precedence numbers go.
[...]
(Anything else we can bikeshed about while we're at it?)
infixl * before +
Perhaps before and after
Bryan O'Sullivan b...@serpentine.com writes:
I propose that the sense of the recommendation around upper bounds in the
PVP be reversed: upper bounds should be specified *only when there is a
known problem with a new version* of a depended-upon package.
Another advantage to this is that it's
timothyho...@seznam.cz writes:
case largeMultiConstructorTypedValue of
Foo{blah=blah,brg=brg} - Some large block...
Bar{lolz=lolz,foofoo=foofoo} - ...Another large block...
Frog{legs=legs,heads=heads} - Yet another large block...
Where the obvious re-factor is:
case
Myles C. Maxfield myles.maxfi...@gmail.com writes:
Does anyone know where he is?
On GitHub? https://github.com/Porges One of the repos was apparently
updated less than a week ago.
If not, is there an accepted practice to
resolve this situation? Should I upload my own 'idna2' package?
You
timothyho...@seznam.cz writes:
import Control.Monad
foo = do
forever $ writeFile filename.foo Hello world!
I could be wrong, but I suspect this is unlikely to result in (hardly)
any disk operations at all, as long as there is _any_ write caching in
the system.
will that destroy those
Aleksey Khudyakov alexey.sklad...@gmail.com writes:
Adding more restrictive constraints does not work, the broken package will
be on hackage forever, while adding a new version with relaxed constraints
works well.
That illustrate real problem It's not possible to specify correct
version
Clark Gaebel cgae...@uwaterloo.ca writes:
I just did a quick derivation from
http://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2
A copyrighted work, you say?
to get the highest bit mask, and did not reference FXT nor the containers
implementation. Here is my code:
If
Ketil Malde ke...@malde.org writes:
I just did a quick derivation from
http://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2
A copyrighted work, you say?
Whoops, public domain, according to itself. Of course, there's no way
to tell if the author read similar copyrighted
Mike Meyer m...@mired.org writes:
Niklas Larsson metanik...@gmail.com wrote:
2012/12/15 Mike Meyer m...@mired.org:
Only if Tanenbaum documented the internal behavior of Linux before
it was written.
Tannenbaum wrote Minix, the operating system that Linus used (and
hacked on) before he did
Mike Meyer m...@mired.org writes:
As it's commonly understood, reverse engineering doesn't involve
looking at the code.
I guess I should make it clear that I don't use it in the strict sense -
I would call that clean-room reverse engineering. (I'm not sure which
is the most commonly
Ertugrul Söylemez e...@ertes.de writes:
People are using Hackage!
+1. And I keep telling people to use it. Sure, it'd be better if they
used .debs, .rpms, or whatever goes on Mac and Windows. But that would
mean I would need to build those packages, including maintaining systems
with the
Vincent Hanquez t...@snarc.org writes:
On 01/31/2013 08:16 AM, Ketil Malde wrote:
At least that way, I would be notified if it happened to my packages,
and I would be able to check up on the situation, and rectify it.
you wouldn't in real cases,
I wouldn't what? Be notified? Rectify
Ertugrul Söylemez e...@ertes.de writes:
And that may even be more harmful, because an insecure system with a
false sense of security is worse than an insecure system alone.
Yes. As is clear to all, the current low level of security means that
nobody are _actually_ downloading stuff of
Scott Lawrence byt...@gmail.com writes:
All the object serialization/deserialization libraries I could find (pretty
much just binary and cereal) seem to be strict with respect to the actual
data
being serialized.
Binary became strict between 0.4.4 and 0.5, I think doing so improved
the
Hi,
I proposed a bioinformatics GSoC project involving Haskell using OSC as
the mentoring organization. Typically, haskell.org projects concern
infrastructure rather than applications, and I don't know if I'm allowed
to submit both places :-)
Anyway, as this is a likely place to find
Mateusz Kowalczyk fuuze...@fuuzetsu.co.uk wrote:
What would you say is the level of bioinformatics understanding that
one would have to have to even consider applying?
Not very much, some knowledge of string edit distance and dynamic programming
would be good, but if not, it's something I can
Francesco Mazzoli f...@mazzo.li writes:
import qualified Data.HashSet as S
nub :: Hashable a = [a] - [a]
nub = S.toList . S.fromList
Well, the above is not stable while Niklas’ is. But I guess that’s not
the point of your message :).
We could also implement Data.BloomFilter.nub, which
I recently encountered the following problem:
$ cabal install
Resolving dependencies...
Configuring array-0.4.0.1...
Building array-0.4.0.1...
Preprocessing library array-0.4.0.1...
Data/Array/IArray.hs:1:14:
Joe Q headprogrammingc...@gmail.com writes:
This is definitely an issue with the array package not setting the right
minimum versions. You should email the maintainer.
Yes, that would be the thing to do, except that the maintainer is
librar...@haskell.org, whom I believe does not accept
Richard A. O'Keefe o...@cs.otago.ac.nz writes:
I think a better argument for twos complement is that you're just
doing all of your computations modulo 2^n (where n is 32 or 64 or
whatever), and addition and multiplication work as expected modulo
anything.
To me, that's not a better
I took the liberty of implementing this fix and uploading
stringable-0.1.1.1 to HackageDB. I tested it on GHC 7.0.4 (you know,
shipped with the cutting-edge Fedora distribution one year ago, but
ancient and no longer to be bothered with by Haskell standards :-) and
on 7.6.2.
-k
Ketil Malde ke
fact 0 = 1
fact n = n * fact (n-1)
Now I ran it as fact 100 with signature Int - Int and with
Integer - Integer
In the first case I got 0 in about 3 seconds
[...]
And if that sounds like a unreal argument, consider representing and
storing Graham's number.
So, since computers are
901 - 923 of 923 matches
Mail list logo
