package lambda-term

You can search for identifiers within the package.

in-package search v0.2.0

Terminal manipulation library for OCaml

Install

Dune Dependency

github.com Readme Changelog Edit opam file Versions (12)

Authors

J

Jérémie Dimino

Maintainers

J

jeremie@dimino.org

Sources

lambda-term-2.0.3.tbz

sha256=7b5c4b5046bd8fdc8c829dc9f4d07b0826e9c14110963044a54105229d1b2bd8

md5=903b6cc234598d67c7c905dfb5230209

doc/lambda-term/LTerm_dlist/index.html

Module `LTerm_dlist`

Mutable sequence of elements (deprecated)

A sequence is an object holding a list of elements which support the following operations:

adding an element to the left or the right in time and space O(1)
taking an element from the left or the right in time and space O(1)
removing a previously added element from a sequence in time and space O(1)
removing an element while the sequence is being transversed.

deprecated
This module should be an internal implementation detail of Lwt, and may be removed from the API at some point in the future. Use any other doubly-linked list library as an alternative.

type 'a t

Type of a sequence holding values of type 'a

type 'a node

Type of a node holding one value of type 'a in a sequence

Operation on nodes

val remove : 'a node -> unit

Removes a node from the sequence it is part of. It does nothing if the node has already been removed.

Operations on sequence

val create : unit -> 'a t

create () creates a new empty sequence

val add_l : 'a -> 'a t -> 'a node

add_l x s adds x to the left of the sequence s

Sequence iterators

Note: it is OK to remove a node while traversing a sequence

val iter_l : ('a -> unit) -> 'a t -> unit

iter_l f s applies f on all elements of s starting from the left

val fold_l : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b

fold_l f s is:

  fold_l f s x = f en (... (f e2 (f e1 x)))

where e1, e2, ..., en are the elements of s

On This Page

Operation on nodes
Operations on sequence
Sequence iterators