package camllib

You can search for identifiers within the package.

in-package search v0.2.0

package camllib

camllib
- DHashhe
  - Make
    
    HashX
    
    Hash
    
    HashY
    
    Hash
    
    P
    
    HashX
    
    Hash
    
    HashY
    
    Hash
  - Param
    
    HashX
    
    Hash
    
    HashY
    
    Hash
  - S
    
    HashX
    
    Hash
    
    HashY
    
    Hash
- DMappe
  - Make
    
    MappeX
    
    Setkey
    
    Ord
    
    MappeY
    
    Setkey
    
    Ord
    
    P
    
    MappeX
    
    Setkey
    
    Ord
    
    MappeY
    
    Setkey
    
    Ord
  - Param
    
    MappeX
    
    Setkey
    
    Ord
    
    MappeY
    
    Setkey
    
    Ord
  - S
    
    MappeX
    
    Setkey
    
    Ord
    
    MappeY
    
    Setkey
    
    Ord
- FGraph
  - Make
    
    MapE
    
    Setkey
    
    Ord
    
    MapV
    
    Setkey
    
    Ord
    
    SetE
    
    Ord
    
    SetV
    
    Ord
    
    T
    
    MapE
    
    Setkey
    
    Ord
    
    MapV
    
    Setkey
    
    Ord
  - S
    
    MapE
    
    Setkey
    
    Ord
    
    MapV
    
    Setkey
    
    Ord
    
    SetE
    
    Ord
    
    SetV
    
    Ord
  - T
    
    MapE
    
    Setkey
    
    Ord
    
    MapV
    
    Setkey
    
    Ord
- FGraph1
  - Make
    
    MapE
    
    Setkey
    
    Ord
    
    MapV
    
    Setkey
    
    Ord
    
    SetE
    
    Ord
    
    SetV
    
    Ord
    
    T
    
    MapE
    
    Setkey
    
    Ord
    
    MapV
    
    Setkey
    
    Ord
  - S
    
    MapE
    
    Setkey
    
    Ord
    
    MapV
    
    Setkey
    
    Ord
    
    SetE
    
    Ord
    
    SetV
    
    Ord
  - T
    
    MapE
    
    Setkey
    
    Ord
    
    MapV
    
    Setkey
    
    Ord
- Hashhe
  - Compare
  - HashedType
  - Make
    
    H
    
    Hash
  - S
    
    Hash
- HashheI
  - Hash
- HashheIB
  - Hash
- HashheS
  - Hash
- Ilist
- Mappe
  - Compare
  - Make
    
    Setkey
    
    Ord
  - S
    
    Setkey
    
    Ord
- MappeI
  - Setkey
    
    Ord
- MappeS
  - Setkey
    
    Ord
- MultiSetList
  - Make
    
    Ord
  - S
- PDHashhe
- PDMappe
- PHashhe
- PMappe
- PSHGraph
- PSette
- Parse
- Print
- Rational
- SHGraph
  - Compare
  - Make
    
    HashH
    
    Hash
    
    HashV
    
    Hash
    
    SetH
    
    Ord
    
    SetV
    
    Ord
    
    T
    
    HashH
    
    Hash
    
    HashV
    
    Hash
    
    SetH
    
    Ord
    
    SetV
    
    Ord
  - S
    
    HashH
    
    Hash
    
    HashV
    
    Hash
    
    SetH
    
    Ord
    
    SetV
    
    Ord
  - T
    
    HashH
    
    Hash
    
    HashV
    
    Hash
    
    SetH
    
    Ord
    
    SetV
    
    Ord
- SetList
  - Make
    
    Ord
  - S
- Sette
  - Compare
  - Make
    
    Ord
  - S
    
    Ord
- SetteI
  - Ord
- SetteS
  - Ord
- Statistic
- Symbol
  - Hash
  - HashedType
  - Map
    
    Setkey
    
    Ord
  - OrderedType
  - Set
    
    Ord
- Time
- Union

Legend:
Library
Module
Module type
Parameter
Class
Class type

type (!'a, !'b) node = {

succ : 'a Sette.t;
pred : 'a Sette.t;
attrvertex : 'b;

}

type (!'a, !'b, !'c, !'d) graph = {

nodes : ('a, ('a, 'b) node) Mappe.t;
arcs : ('a * 'a, 'c) Mappe.t;
info : 'd;

}

type ('a, 'b, 'c, 'd) t

val info : ('a, 'b, 'c, 'd) t -> 'd

val set_info : ('a, 'b, 'c, 'd) t -> 'd -> ('a, 'b, 'c, 'd) t

val succ : ('a, 'b, 'c, 'd) t -> 'a -> 'a Sette.t

val pred : ('a, 'b, 'c, 'd) t -> 'a -> 'a Sette.t

val attrvertex : ('a, 'b, 'c, 'd) t -> 'a -> 'b

val attredge : ('a, 'b, 'c, 'd) t -> ('a * 'a) -> 'c

val empty : 'd -> ('a, 'b, 'c, 'd) t

val size_vertex : ('a, 'b, 'c, 'd) t -> int

val size_edge : ('a, 'b, 'c, 'd) t -> int

val size : ('a, 'b, 'c, 'd) t -> int * int

val is_empty : ('a, 'b, 'c, 'd) t -> bool

val is_vertex : ('a, 'b, 'c, 'd) t -> 'a -> bool

val is_edge : ('a, 'b, 'c, 'd) t -> ('a * 'a) -> bool

val vertices : ('a, 'b, 'c, 'd) t -> 'a Sette.t

val edges : ('a, 'b, 'c, 'd) t -> ('a * 'a) Sette.t

val map_vertex : 
  ('a, 'b, 'c, 'd) t ->
  ('a -> 'b -> pred:'a Sette.t -> succ:'a Sette.t -> 'e) ->
  ('a, 'e, 'c, 'd) t

val map_edge : 
  ('a, 'b, 'c, 'd) t ->
  (('a * 'a) -> 'c -> 'e) ->
  ('a, 'b, 'e, 'd) t

val map_info : ('a, 'b, 'c, 'd) t -> ('d -> 'e) -> ('a, 'b, 'c, 'e) t

val map : 
  ('a, 'b, 'c, 'd) t ->
  ('a -> 'b -> pred:'a Sette.t -> succ:'a Sette.t -> 'bb) ->
  (('a * 'a) -> 'c -> 'cc) ->
  ('d -> 'dd) ->
  ('a, 'bb, 'cc, 'dd) t

val transpose : 
  ('a, 'b, 'c, 'd) t ->
  ('a -> 'b -> pred:'a Sette.t -> succ:'a Sette.t -> 'bb) ->
  (('a * 'a) -> 'c -> 'cc) ->
  ('d -> 'dd) ->
  ('a, 'bb, 'cc, 'dd) t

val iter_vertex : 
  ('a, 'b, 'c, 'd) t ->
  ('a -> 'b -> pred:'a Sette.t -> succ:'a Sette.t -> unit) ->
  unit

val iter_edge : ('a, 'b, 'c, 'd) t -> (('a * 'a) -> 'c -> unit) -> unit

val fold_vertex : 
  ('a, 'b, 'c, 'd) t ->
  'e ->
  ('a -> 'b -> pred:'a Sette.t -> succ:'a Sette.t -> 'e -> 'e) ->
  'e

val fold_edge : ('a, 'b, 'c, 'd) t -> 'e -> (('a * 'a) -> 'c -> 'e -> 'e) -> 'e

val add_edge : ('a, 'b, 'c, 'd) t -> ('a * 'a) -> 'c -> ('a, 'b, 'c, 'd) t

val remove_edge : ('a, 'b, 'c, 'd) t -> ('a * 'a) -> ('a, 'b, 'c, 'd) t

val add_vertex : ('a, 'b, 'c, 'd) t -> 'a -> 'b -> ('a, 'b, 'c, 'd) t

val remove_vertex : ('a, 'b, 'c, 'd) t -> 'a -> ('a, 'b, 'c, 'd) t

val topological_sort : ('a, 'b, 'c, 'd) t -> 'a -> 'a list

val topological_sort_multi : 'a -> ('a, 'b, 'c, 'd) t -> 'a Sette.t -> 'a list

val reachable : ('a, 'b, 'c, 'd) t -> 'a -> 'a Sette.t

val reachable_multi : 'a -> ('a, 'b, 'c, 'd) t -> 'a Sette.t -> 'a Sette.t

val coreachable : ('a, 'b, 'c, 'd) t -> 'a -> 'a Sette.t

val coreachable_multi : 'a -> ('a, 'b, 'c, 'd) t -> 'a Sette.t -> 'a Sette.t

val cfc : ('a, 'b, 'c, 'd) t -> 'a -> 'a list list

val cfc_multi : 'a -> ('a, 'b, 'c, 'd) t -> 'a Sette.t -> 'a list list

val scfc : ('a, 'b, 'c, 'd) t -> 'a -> (unit, 'a) Ilist.t

val scfc_multi : 'a -> ('a, 'b, 'c, 'd) t -> 'a Sette.t -> (unit, 'a) Ilist.t

val min : ('a, 'b, 'c, 'd) t -> 'a Sette.t

val max : ('a, 'b, 'c, 'd) t -> 'a Sette.t

val print : 
  (Format.formatter -> 'a -> unit) ->
  (Format.formatter -> 'b -> unit) ->
  (Format.formatter -> 'c -> unit) ->
  (Format.formatter -> 'd -> unit) ->
  Format.formatter ->
  ('a, 'b, 'c, 'd) t ->
  unit

val print_dot : 
  ?titlestyle:string ->
  ?vertexstyle:string ->
  ?edgestyle:string ->
  ?title:string ->
  (Format.formatter -> 'a -> unit) ->
  (Format.formatter -> 'a -> 'b -> unit) ->
  (Format.formatter -> ('a * 'a) -> 'c -> unit) ->
  Format.formatter ->
  ('a, 'b, 'c, 'd) t ->
  unit

val repr : ('a, 'b, 'c, 'd) t -> ('a, 'b, 'c, 'd) graph

val obj : ('a, 'b, 'c, 'd) graph -> ('a, 'b, 'c, 'd) t

module type T = sig ... end

module type S = sig ... end

module Make (T : T) : sig ... end