Module Mlpost__Tree_adv.Overlays

type interval =
| Bet of int * int

[|a,b|]

| Bef of int

]|-oo,a|]

| Aft of int

[|a,+oo|[

| Nev

emptyset

| Alw

N

val in_interval : int -> interval -> bool
val min_interval : int -> interval -> int
val max_interval : int -> interval -> int
val min_tree : ('a -> interval) -> 'a t -> int
val max_tree : ('a -> interval) -> 'a t -> int
type 'a spec = (interval * 'a) list
val assoq : int -> (interval * 'a) list -> 'a
val max : ('a -> 'b) -> ('c * 'a) list -> 'b
val set_pos : ('a -> 'b -> 'c) -> 'a -> ('d * 'b) list -> ('d * 'c) list