package orsetto

  1. Overview
  2. Docs
A library of assorted structured data interchange languages

Install 

dune-project
 Dependency

bitbucket.org Edit opam file Versions (8)

Authors

  1. J
    james woodyatt <jhw@conjury.org>

Maintainers

  1. J
    james woodyatt <jhw@conjury.org>

Sources

r1.0.tar.gz
sha256=585297372d7f6cfb830214e9ef22d6d072a39b2a1591ef90f1ee2bcfe144cad3
md5=6bb6a7ba88bf2c7595a0b332921e60b4

doc/orsetto.cf/Cf_bsearch_data/Table/Create/index.html

Module Table.Create

Use Create(B) to create an instance of a table module.

Parameters

module B : Basis

Signature

type t

Abstract type containing internal structure of table.

val nil : t

A distinguished empty table.

val empty : t -> bool

Use empty t to test if t is an empty table.

val of_seq : B.Vector.element Seq.t -> t

Use of_seq s to construct a table from the sequence of vector elements s.

val find : (B.Vector.index, 'r) Cf_bsearch.ret -> B.Search.t -> t -> 'r

Use find ret key tab to search for key in tab and use the binary search return adapter ret to construct the result.

val member : B.Search.t -> t -> bool

Use member key tab to check if key is to be found in tab.

Use search key tab to return Some index for key if it can be found in tab and None otherwise.

val require : B.Search.t -> t -> B.Vector.index

Use 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 -> B.Vector.element Seq.t

Use 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 ... end

Unsafe interfaces depend on the internal structure of tables.