#676: Write a performance checker for collections.
-+--
Reporter: jpbernardy | Owner:
Type: task| Status: new
Priority: normal | Milestone:
#666: Collection hierarchy proposal
---+
Reporter: jpbernardy| Owner: jpbernardy
Type: feature request | Status: new
Priority: normal| Milestone:
Hello Simon,
Friday, January 27, 2006, 7:25:44 PM, you wrote:
i'm now write some sort of new i/o library. one area where i currently
lacks in comparision to the existing Handles implementation in GHC, is
the asynchronous i/o operations. can you please briefly describe how
this is done in GHC
Hello Duncan,
Saturday, January 28, 2006, 3:08:04 PM, you wrote:
yes, i want to save exactly this bit of performance - after i
optimized all other expenses on the path of text i/o
DC There is a trade off, using mmap gives you zero-copy access to the page
DC cache however there is a
Am Samstag, 28. Januar 2006 00:29 schrieb Einar Karttunen:
On 27.01 21:13, Wolfgang Jeltsch wrote:
I don't mind people creating hierarchies such as Simon M's performance
resource. It may not be appropriate for a pure encyclopedia like
Wikipedia, but HaskellWiki will be replacing the
Am Freitag, 27. Januar 2006 21:58 schrieb Sam Goldman:
Wolfgang Jeltsch wrote:
I just started moving pages. But know I wonder which case I should use
for inner-title words. Should the page title be Books and tutorials or
Books and Tutorials, for example? Since pages are only small
NEWS:
- Extended deadlines:
* Submission of abstracts: 3 February 2006
* Submission of full papers: 10 February 2006
FINAL CALL FOR PAPERS
8th International Conference on
Mathematics of Program Construction
Wolfgang Jeltsch wrote:
LaTeX – A Document Preparation System says in subsection B.1.2:
The bibliography style determines whether or not a title is
capitalized; the
titles of books usually are, the titles of articles usually are not.
Best wishes,
Wolfgang
Sounds reasonable
NEWS:
- Extended deadlines:
* Submission of abstracts:3 February 2006
* Submission of full papers: 10 February 2006
FINAL CALL FOR PAPERS
11th International Conference on
Algebraic Methodology and Software Technology, AMAST '06
On Fri, Jan 27, 2006 at 06:05:56PM -0500, Robert Dockins wrote:
One aspect of this discussion I've yet to see that I think is
important is, how do the various proposals for removal/modifications
of M-R impact implicit parameters? Are implicit parameters likely to
be in Haskell'? It
On 28/01/06, Taral [EMAIL PROTECTED] wrote:
On 1/28/06, Cale Gibbard [EMAIL PROTECTED] wrote:
Do you have an example of such a program handy?
b = (x, x) where { x :: Num a = a; x = fromInteger 1 }
fromInteger is called twice.
--- mr.hs ---
{-# OPTIONS_GHC -fno-monomorphism-restriction #-}
On 28/01/06, Lennart Augustsson [EMAIL PROTECTED] wrote:
Remove the type signature for b and you will see the
loss of sharing.
Nope, still not seeing it with either profiling or Debug.Trace. Also
-- the type signature I gave was polymorphic, so what's the deal? If
adding a polymorphic type
Oh, I guess I did one more change. I put b in a separate module.
Your type signature isn't the most general, the most general is
b :: (Num a, Num b) = (a, b)
And that is the source of the problem. You need to pass two
dictionaries. To keep sharing you'd need some very clever
runtime machinery
Aha, okay. Yeah, I can reproduce that now, and it makes good sense
what's going on. It is in fact quite sensible that x be evaluated
twice with that sort of polymorphism.
Hmm... however, could we not assign to each instance a unique
identifier which could be compared? Say a cryptographic hash of
--- Cale Gibbard wrote:
Apart from moving to a lookup Map or something, a simple reordering
of the arguments allows you to shorten things up a bit:
myeval :: String - Int - Int - Int
myeval + = (+)
myeval - = (-)
myeval * = (*)
etc.
Thanks to all for the excellent suggestions. I'm liking
Andrew Savige wrote:
--- Cale Gibbard wrote:
Apart from moving to a lookup Map or something, a simple reordering
of the arguments allows you to shorten things up a bit:
myeval :: String - Int - Int - Int
myeval + = (+)
myeval - = (-)
myeval * = (*)
etc.
Thanks to all for the excellent
Brian Hulley wrote:
eg myeval (+) 1 2
myeval 1 2 (+)-- I *always* seem to make at least one mistake
per post ;-)
(I originally wrote the code to take the op first, which is the usual
Haskell convention so that you can do useful things with (myeval someop)
but then I noticed
--- Brian Hulley wrote:
def myeval(x, y, op)
x.send op, y
end
This could be done in Haskell by
myeval :: a-b-(a - b - c) - c
myeval x y op = op x y
eg myeval (+) 1 2
Though the following program does indeed work:
myeval :: (Int - Int - Int) - Int - Int - Int
myeval op x y = op x y
On 1/28/06, Andrew Savige [EMAIL PROTECTED] wrote:
--- Brian Hulley wrote:
def myeval(x, y, op)
x.send op, y
end
This could be done in Haskell by
myeval :: a-b-(a - b - c) - c
myeval x y op = op x y
eg myeval (+) 1 2
Though the following program does indeed work:
myeval
Hello Henrik Ross,
Man thanks for your input. I have realised that I should have explained
my problem better.
So, I try...
I want to create a datatype like this:
data D a b = DepVoid (a-b) | -- a = ()
DepSingle (a-b) | -- a = a simple ones
Hello Andrew,
Saturday, January 28, 2006, 1:38:08 PM, you wrote:
AS def myeval(x, y, op)
AS x.send op, y
AS end
AS I had a feeling this sort of dynamic sending of messages
AS to objects at run time was impossible in Haskell, hence
AS my question. What I'm still unsure about is why this sort
Sven Biedermann wrote:
Hello Henrik Ross,
Man thanks for your input. I have realised that I should have explained
my problem better.
So, I try...
I want to create a datatype like this:
data D a b = DepVoid (a-b) | -- a = ()
DepSingle (a-b) | -- a = a
Thanks Chris. I was actually asking about analyzing Core output in general. I'm well aware of the problems we're having with the nbody entry.I'm convinced my list based version can go faster than it is now. That's why I was asking if Don could put together a few notes on how to optimize inner
23 matches
Mail list logo
