Re: [Caml-list] Fwd: interval trees

[Francois Berenger <berenger@riken.jp>]

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 leftmost_bound_first mid in
         let right_list = L.sort rightmost_bound_first mid in
         Node (x_mid,
               left_list, right_list,
               interval_tree left, interval_tree right)

I'm afraid my program could crash on a very long list of intervals.

Thanks a lot,
F.