A distinguished instance of tables of int type elements.
type t = Create(Int_basis).tAbstract type containing internal structure of table.
val nil : tA distinguished empty table.
val empty : t -> boolUse empty t to test if t is an empty table.
val of_seq : Int_basis.Vector.element Seq.t -> tUse of_seq s to construct a table from the sequence of vector elements s.
val find :
(Int_basis.Vector.index, 'r) Cf_bsearch.ret ->
Int_basis.Search.t ->
t ->
'rUse find ret key tab to search for key in tab and use the binary search return adapter ret to construct the result.
val member : Int_basis.Search.t -> t -> boolUse member key tab to check if key is to be found in tab.
val search : Int_basis.Search.t -> t -> Int_basis.Vector.index optionUse search key tab to return Some index for key if it can be found in tab and None otherwise.
val require : Int_basis.Search.t -> t -> Int_basis.Vector.indexUse require key tab to return index for key if it can be found in tab. Raises Not_found if key is not in tab.
val to_seq : t -> Int_basis.Vector.element Seq.tUse to_seq tab to make a sequence of the elements in the underlying vector. These are presented in binary search order, not monotonically increasing order.
module Unsafe : sig ... endUnsafe interfaces depend on the internal structure of tables.