My mistake, I wasn't aware or had forgotten this -- very useful indeed
-- feature.
Thanks, Vincent and Maxence, for the correction.
(Gabriel; sometimes bluestorm, for historical reasons, and often gasche.)
On Wed, Feb 15, 2012 at 9:44 AM, Maxence Guesdon
maxence.gues...@inria.fr wrote:
Hello,
Hello,
As I'm using more and more programs that use native dynlink, I'm trying
to understand what is the state of things on os x. According to this
message http://alan.petitepomme.net/cwn/2008.10.21.html natdynlink does
not work on 10.5 and above. However, if I read correctly this patch
Le mercredi, 15 février 2012 à 10:55, Gerd Stolpmann a écrit :
Before you start writing a total new custom formatter (which probably
breaks with every major OCaml version because of new syntactic elements),
consider to extend/override the standard formatter.
It seems then that the best
Can't precisely answer your questions but :
to understand what is the state of things on os x. According to this
message http://alan.petitepomme.net/cwn/2008.10.21.html natdynlink does
not work on 10.5 and above.
At least here it does work without problems on 10.6.8. with this [1]
Francois Berenger beren...@riken.jp writes:
Hello,
I did a naive implementation of interval trees for float intervals.
It is available here:
https://github.com/HappyCrow/interval-tree
I wonder if it is possible to construct the trees in a tail recursive
fashion. Maybe I knew how to do
I struggled with this too, but if you read the wikipedia page
http://en.wikipedia.org/wiki/Interval_tree, he's implemented a centered
interval tree. Yes, there's a lot of complications needed to insert and
remove, but what he's done works for static interval trees.
His lookup function is `int -
On 02/16/2012 12:21 AM, Goswin von Brederlow wrote:
Francois Berengerberen...@riken.jp writes:
Hello,
I did a naive implementation of interval trees for float intervals.
It is available here:
https://github.com/HappyCrow/interval-tree
I wonder if it is possible to construct the trees in a
Hello,
Anyone can translate this into being tail recursive
if it's possible:
let rec interval_tree intervals =
match intervals with
[] - Empty
| _ -
let x_mid = median intervals in
let left, mid, right = partition intervals x_mid in
let left_list = L.sort
On 02/16/2012 02:22 AM, Edgar Friendly wrote:
I struggled with this too, but if you read the wikipedia page
http://en.wikipedia.org/wiki/Interval_tree, he's implemented a centered
interval tree. Yes, there's a lot of complications needed to insert and
remove, but what he's done works for static
