package orsetto

You can search for identifiers within the package.

in-package search v0.2.0

A library of assorted structured data interchange languages

Install

sha512=e260412b2dd0f98cfe3dc7ed5c31a694eb31c93cd207c51fa12675b790234ee0ad3bf07d9be17a4dc266fedfe55b14c967cad7bc0c9414063eef8afd59f3d0d1

Tree structures use Binary(K) to make an index node where K.t is the index value associated to its codomain value by the node.

module K : Cf_relations.Order

type index = K.t

The type of an index value.

type +'a t = K.t * 'a

The type of an index node.

val cons : index -> 'a -> 'a t

Tree structures use cons i v to construct an index node.

val index : 'a t -> index

Tree structures use index n to get the index of n.

val obj : 'a t -> 'a

Tree structure use obj n to get the codomain value of n.

val icompare : index -> 'a t -> int

Tree structures use icompare i n to compare i with the index value of n.

val compare : 'a t -> 'a t -> int

Tree structures use compare a b to compare the index values of nodes a and b (without regard to the codomain values).

On This Page