Wolfgang Jeltsch wrote:
Am Sonntag, 6. Januar 2008 13:37 schrieb Adrian Hey:
It's the GT class here..
Short remark: Wouldn’t a longer, more descriptive identifier be better?
Like GeeTee maybe? or even GeneralisedTrie?
I like short names myself. But as I have stopped work on this particular
- Write a comprehensive test/benchmarking suite for GT instances.
3 - Provide some way to automatically generate the instances for
arbitrary user defined types.
Which is all rather a lot of work that nobody seems very interested
in :-(
Regards
--
Adrian Hey
Hello,
Why is it that the haddock docs supplied with GHC omit this module and
its exports? Is it because we're not supposed to use them? I'm thinking
of the compareInt# function in particular, which I use quite a lot.
Thanks
--
Adrian Hey
Hello again,
Adrian Hey wrote:
Hello Folks,
One thing different from 6.6 and 6.8 is I find that with -Wall
I get a lot more warnings about orphan instances, even if the
code has not changed.
Has the definition of what an Orphan instance is changed?
Or is this a bug? If so, is the bug in 6.6
Ian Lynagh wrote:
Hi Adrian,
On Fri, Sep 14, 2007 at 07:50:47AM +0100, Adrian Hey wrote:
[29 of 53] Compiling Data.Tree.AVL.Join (
Data.Tree.AVL/Data/Tree/AVL/Join.hs, dist\build/Data/Tree/AVL/Join.o )
ghc.exe: panic! (the 'impossible' happened)
(GHC version 6.8.20070912 for i386-unknown
Adrian Hey wrote:
I get this error..
[29 of 53] Compiling Data.Tree.AVL.Join (
Data.Tree.AVL/Data/Tree/AVL/Join.hs, dist\build/Data/Tree/AVL/Join.o )
ghc.exe: panic! (the 'impossible' happened)
(GHC version 6.8.20070912 for i386-unknown-mingw32):
cgPanic
a{v sMX} [lid]
static
-0.3:Data.Tree.AVL.Join.$LrMelvl{v rMe}_srt
Please report this as a GHC bug: http://www.haskell.org/ghc/reportabug
BTW, if you want to reproduce this the cabal files needs this line..
build-depends: base = 2.0, QuickCheck, bytestring = 0.9, containers
= 0.1, array = 0.1
Regards
--
Adrian Hey
Adrian Hey wrote:
OK. Meanwhile I've tried compiling setup.hs and building the
6.6 version of the collections package..
Also, there still seems to be a problem with building Haddock
docs in windows. Although Haddock now seems to find the
relevant base package haddock, it still doesn't link
it. I believe it works fine, but I've decided it would be
best to obsolete this and subsume it within Data.Trie.General
as Data.Trie.General.IntGT
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
to go. But I have no idea how much work that would be.
But to give programs best possible chance of running successfully then I
think an (optional) overall limit on total memory use would be
preferable (better than trying to guess how much stack space will be
needed in advance).
Regards
--
Adrian Hey
OK so I guess it's working.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
the final program is run.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
should
grow linearly, not exponentially. But I don't really know enough
about the innards of ghc rts to know what might or might not be
possible/easy/difficult.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users
:-)
I guess having done this there would be little to gain by using the
SPECIALIZE pragma though (unless ghc also specialises HOFs).
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org
to a 2-element class.
Why is that? Does ghc pass just the single method rather than a one
entry dictionary in such cases?
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman
.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Duncan Coutts wrote:
On Thu, 2007-05-03 at 16:24 +0100, Adrian Hey wrote:
Hello Folks,
Just wondering about this. Please understand I'm not asking why
programs use a lot of stack sometimes, but specifically why is
using a lot of stack (vs. using a lot of heap) generally regarded
as bad
flakey somehow (not sure how right now though :-).
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
..
let !a0_ = f a0 a in (# l,hl,a0_,r,hr #)
but I still get the same error.
Could someone who knows explain exactly what the problem
is and what the workaround is (if there is one)?
Thanks
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow
This is with ghc 6.6. The strange thing is this code used to compile
fine with earlier versions (but I don't know if it actually worked
because I never tested it).
Thanks
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users
with -fno-cse IMO.
I guess you still need the NOINLINE pragma too though.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
with Data.HashTable implementation and space behaviour.
Unfortunately I can't remember what the problem was and
don't know if it's been fixed :-(
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org
be for ghc :-) because this would force evaluation of the field
value. So it must construct some kind of thunk instead. But there's
no reason it should be so inhibited if the constructor was non-strict
(or if the compiler could figure out the field value was already
reduced).
Thanks
--
Adrian Hey
as such).
Second question is really the same question but for literals.
What search algorithm is employed and is it likely to be
worth hand coding something else? (a binary search maybe).
I'm thinking of code like this..
case n of
0 -
7 -
34622 -
.. lots more
_ -
Thanks
--
Adrian Hey
of Data.Set too AFAICS.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
to suspect there might be some unstated algorithmic insight behind
them (like a lazy implementation would not be so limited, or would
offer better performance or space behaviour perhaps). But maybe I
was wrong.
Regards
--
Adrian Hey
___
Glasgow-haskell-users
, at least for packages
the have just one root module.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
.)
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
using case expressions was
just too painful :-). I just wanted to check that this is a feature
I can rely on in future (and if so suggest the user guide should be
ammended to reflect this).
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
Glasgow
that occurred on the
Haskell mailing list over the weekend. So I'd like to ask what's
happening (or likely to happen) about this, if anything?
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo
strong views on this
either way. Just relying on programmers to use some common sense seems
fine to me also (this is what's currently done for finalisers for example).
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http
the same thing IIRC.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
= [],
framework_dirs = [],
extra_frameworks = []}
Is there something missing here?
Thanks
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Hello,
I thought we were going to get a new FFI function soon..
http://www.haskell.org/pipermail/ffi/2004-March/001740.html
AFAICS it isn't in the libs for this release :-(
Has this got lost or forgotten about?
Regards
--
Adrian Hey
___
Glasgow
and simple feature to me. I
implemented a toy FPL a few years ago and even my gc incorporated
this optimisation. It's a bit strange that this should have been
overlooked considering in all other respects ghc is far more
sophisticated than my efforts were :-)
Regards
--
Adrian Hey
On Wednesday 18 Aug 2004 4:56 pm, Simon Peyton-Jones wrote:
It does; see my reply below
Oops, sorry. It seems I missed that for some reason.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
interpretation of core was correct), so it seemed rather
strange that addHeight could be lazy (non-strict) in that argument.
So does L mean Lazy, or something else?
Thanks
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http
..which seems to fix this problem, but I'd rather not have to do this:-)
Is there a better work around for this?
Also, reading the release notes, there's mention of --gen-contents
and --use-contents flags, but these don't seem to be documented in
the user guide AFAICS.
Regards
--
Adrian Hey
being inlined takes
other functions with known strictness properties as arguments, but I may
well be wrong :-)
Thanks
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
On Monday 19 Apr 2004 11:27 am, Adrian Hey wrote:
Perhaps I was doing something stupid.
Yep, I must of been doing something stupid. I've just tried it again and I
do get different object files. In fact inlinining seems to give me smaller
object files (not that I'm complaining :-).
Sorry
On Tuesday 13 Apr 2004 10:10 am, Adrian Hey wrote:
Hello,
Does inlining work with any function definitions (including those
defined locally following a where.. say), or only with top level
function definitions?
Well, as far as I can tell from my experiments, it does only work
for for top
Hello,
Does inlining work with any function definitions (including those
defined locally following a where.. say), or only with top level
function definitions?
Thanks
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http
like it anyway:-).
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
, so I guess I have to use
a makefile.
Are there any other gotchas waiting for me?
Anything else I need to know?
Thanks
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
..
toVertex :: (a,a,a) - Vertex3 a
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
On Wednesday 07 Jan 2004 8:01 pm, John Meacham wrote:
On Wed, Jan 07, 2004 at 12:38:11PM -, Simon Marlow wrote:
The idea is to stop a Haskell prog with no runable threads or events
to process hogging CPU time. I was a bit dissapointed to find
that despite
this on my (otherwise
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
the same potential problem with weak pointer finalisers? Can they
be supported in Haskell without pre-emptive concurrency?
Regards
--
Adrian Hey
On Monday 05 Jan 2004 4:39 pm, Alastair Reid wrote:
I'm afraid I still don't fully understand why Haskell
finalisers are unsafe or why (if) calling
On Wednesday 31 Dec 2003 10:05 am, Adrian Hey wrote:
On Wednesday 31 Dec 2003 8:56 am, Adrian Hey wrote:
Intended use is something like this...
{-# notInline libXYZRef #-}
libXYZRef :: LibRef
libXYZRef = unsafePerformIO newLibRef
main :: IO ()
main = finally (initLibXYZ userMain
killitRef killit -- Save for later
putMVar countMVar count -- Unlock
putStrLn Killed later
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman
performGC or some other
similar function can't simply guarantee that all (garbage) ForeignPtr
finalisers have been run before calling shutdownLibXYZ :-(
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org
terminates.
So I'm still confused :-)
Actually, though I think it would work for me, it's probably
not as general as some folk might want (they might want to
shutdown the library and free up whatever resources it claimed
earlier in program execution, not just at exit).
Regards
--
Adrian Hey
encounter.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
to have a
DiffArray as a top level CAF, cyclic or otherwise?
Hmm.. I think that must be it.
On Monday 27 Oct 2003 6:21 pm, Adrian Hey wrote:
-- Search Tree data type
newtype STree = STree (Array Int (STree,[Match]))
-- Initial value for Search Tree
sTree0 :: STree
sTree0 = STree (array (0,9
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
(neglecting any constant factors).
I'm just wondering if there's a bug in their implementation?
or am I using them incorrectly? and generally seeking advice
about any faster arrays I could try.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
the Gentle Introduction to complement
the Report.
Thank's for the advice from everybody. Actually, on the whole I think
the FFI spec is pretty easy to understand, but tutorial would be nice
too :-) There are obviously subtleties about it which I had not
understood properly.
Regards
--
Adrian Hey
On Thursday 06 March 2003 10:55, Adrian Hey wrote:
On Tuesday 04 March 2003 12:36, Simon Peyton-Jones wrote:
GHC does not copy big objects, so don't worry about the copying cost.
(Instead of copying, it allocates big objects to (a contiguous series
of) heap blocks, with no other objects
allowed you to do this with a mutable byte array.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
the
result to be portable across OS's.
Might be a complete waste of time if my worries
about ghc heap management are groundless :-)
Any advice?
Thanks
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http
, I found the solution. It doesn't like
upper case object file names. Not sure if that's by design or an
oversight. I've changed them to lower case and it works fine now.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http
.
The files have a .o suffix in both cases.
FWIW, I'm using ghc 5.04.2 on Win32 with the nasm assembler.
Thanks
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
or most feasible).
I would also like to be able to use field names properly with
extistentials. (Hmm, I suspect having existentials and extentsibility
is difficult?)
Also, is there some good technical reason why we can't allow punning?
My wish list anyway.
Thanks
--
Adrian Hey
that when making a foreign binding you have
to make what seems (to me) an arbitrary choice between Ptr and
ForeignPtr arguments. I don't really understand the reason for
this extra complexity.
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
anybody agrees with me though :-)
Regards
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
Adrian Hey
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
68 matches
Mail list logo