sig
type 'a t
type key
val empty : 'a Splay_tree.S.t
val is_empty : 'a Splay_tree.S.t -> bool
val concat : 'a Splay_tree.S.t -> 'a Splay_tree.S.t -> 'a Splay_tree.S.t
val sandwich :
'a Splay_tree.S.t ->
Splay_tree.S.key -> 'a -> 'a Splay_tree.S.t -> 'a Splay_tree.S.t
val splay :
'a Splay_tree.S.t ->
Splay_tree.S.key -> 'a Splay_tree.S.t * 'a option * 'a Splay_tree.S.t
val splay' :
'a Splay_tree.S.t ->
Splay_tree.S.key ->
'a Splay_tree.S.t * (Splay_tree.S.key * 'a) option * 'a Splay_tree.S.t
val delete_min :
'a Splay_tree.S.t -> (Splay_tree.S.key * 'a * 'a Splay_tree.S.t) option
val delete_max :
'a Splay_tree.S.t -> (Splay_tree.S.key * 'a * 'a Splay_tree.S.t) option
val mem : 'a Splay_tree.S.t -> Splay_tree.S.key -> 'a Splay_tree.S.t * bool
val find :
'a Splay_tree.S.t -> Splay_tree.S.key -> 'a Splay_tree.S.t * 'a option
val set : 'a Splay_tree.S.t -> Splay_tree.S.key -> 'a -> 'a Splay_tree.S.t
val delete : 'a Splay_tree.S.t -> Splay_tree.S.key -> 'a Splay_tree.S.t
end