Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Sorted list
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2007-08-04 (13:49)
From: skaller <skaller@u...>
Subject: Re: [Caml-list] Sorted list
On Sat, 2007-08-04 at 08:36 -0400, Brian Hurt wrote:
> I forgot a bit of analysis as to why I recommend that data structure, and 
> not others.  

The priority queue here is a good data structure for 
amortising performance. A plain list is better if the interrupt
handling is time critical (whilst the inserts and deletes are not).

However, your threading model matters a lot here.

John Skaller <skaller at users dot sf dot net>
Felix, successor to C++: