package containers-data

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

package containers-data

containers-data
- CCBV
- CCBijection
  - Make
    
    L
    
    R
  - OrderedType
  - S
- CCBitField
  - Make
    
    _
  - S
- CCCache
- CCDeque
- CCFQueue
- CCFun_vec
- CCGraph
  - Dot
  - Iter
  - Lazy_tree
  - MAP
  - Map
  - Traverse
    
    Event
- CCHashSet
  - ELEMENT
  - Make
    
    E
  - S
- CCHashTrie
  - KEY
  - Make
    
    K
  - S
  - Transient
- CCHet
  - Key
  - Map
  - Tbl
- CCImmutArray
- CCIntMap
- CCKTree
  - Dot
  - pset
- CCLazy_list
  - Infix
- CCMixmap
  - Make
    
    X
  - ORD
  - S
- CCMixset
- CCMixtbl
- CCMultiMap
  - BIDIR
  - Make
    
    K
    
    V
  - MakeBidir
    
    L
    
    R
  - OrderedType
  - S
- CCMultiSet
  - Make
  - S
- CCMutHeap
  - Make
    
    X
- CCMutHeap_intf
  - RANKED
  - S
- CCPersistentArray
- CCPersistentHashtbl
  - HashedType
  - Make
    
    H
  - S
- CCRAL
  - Infix
- CCRingBuffer
  - Array
    
    Byte
    
    Make
    
    Elt
    
    S
  - Byte
  - Make
    
    Array
    
    X
  - MakeFromArray
    
    A
  - S
    
    Array
- CCSimple_queue
  - Infix
- CCTrie
  - Make
    
    W
  - MakeArray
    
    X
  - MakeList
    
    X
  - ORDERED
  - S
  - String
  - WORD
- CCWBTree
  - KEY
  - Make
    
    X
  - MakeFull
    
    X
  - ORD
  - S
- CCZipper
containers-data.top
- Containers_data_top

Legend:
Library
Module
Module type
Parameter
Class
Class type

Parameters

module O : Stdlib.Map.OrderedType

Signature

type vertex = O.t

type 'a t

val as_graph : 'a t -> (vertex, 'a) graph

Graph view of the map.

val empty : 'a t

val add_edge : vertex -> 'a -> vertex -> 'a t -> 'a t

val remove_edge : vertex -> vertex -> 'a t -> 'a t

val add : vertex -> 'a t -> 'a t

Add a vertex, possibly with no outgoing edge.

val remove : vertex -> 'a t -> 'a t

Remove the vertex and all its outgoing edges. Edges that point to the vertex are NOT removed, they must be manually removed with remove_edge.

val union : 'a t -> 'a t -> 'a t

val vertices : _ t -> vertex iter

val vertices_l : _ t -> vertex list

val of_list : (vertex * 'a * vertex) list -> 'a t

val add_list : (vertex * 'a * vertex) list -> 'a t -> 'a t

val to_list : 'a t -> (vertex * 'a * vertex) list

val of_iter : (vertex * 'a * vertex) iter -> 'a t

since 2.8

val add_iter : (vertex * 'a * vertex) iter -> 'a t -> 'a t

since 2.8

val to_iter : 'a t -> (vertex * 'a * vertex) iter

since 2.8