package opam-format

You can search for identifiers within the package.

in-package search v0.2.0

package opam-format

opam-format
- OpamFile
  - Aliases
  - Changes
  - Comp
  - Config
  - Descr
  - Dot_config
  - Dot_install
  - Environment
  - File_attributes
  - IO_FILE
  - InitConfig
  - LegacyState
  - Lines
  - OPAM
  - Package_index
  - Pinned_legacy
  - PkgList
  - Repo
  - Repo_config_legacy
  - Repos_config
  - Stats
  - SwitchExport
  - SwitchSelections
  - Switch_config
  - Syntax
  - URL
  - Wrappers
- OpamFilter
- OpamFormat
  - I
  - V
- OpamFormatConfig
- OpamFormula
- OpamLineLexer
- OpamPackage
  - Graph
    
    Dot
    
    E
    
    Parallel
    
    G
    
    E
    
    Topological
    
    Vertex
    
    Topological
  - Map
  - Name
    
    Map
    
    Set
    
    Op
  - Set
    
    Op
  - Version
    
    Map
    
    Set
    
    Op
- OpamPath
  - Builddir
  - Switch
    
    Default
    
    Overlay
- OpamPp
  - Op
  - STR
- OpamRepositoryName
  - Map
  - Set
    
    Op
- OpamSwitch
  - Map
  - Set
    
    Op
- OpamTypesBase
- OpamVariable
  - Full
    
    Map
    
    Set
    
    Op
  - Map
  - Set
    
    Op

Legend:
Library
Module
Module type
Parameter
Class
Class type

Parallel executions.

include Graph.Sig.I with type V.t = t

type t

module V : sig ... end

type vertex = V.t

module E : sig ... end

type edge = E.t

val is_directed : bool

val is_empty : t -> bool

val nb_vertex : t -> int

val nb_edges : t -> int

val out_degree : t -> vertex -> int

val in_degree : t -> vertex -> int

val mem_vertex : t -> vertex -> bool

val mem_edge : t -> vertex -> vertex -> bool

val mem_edge_e : t -> edge -> bool

val find_edge : t -> vertex -> vertex -> edge

val find_all_edges : t -> vertex -> vertex -> edge list

val succ : t -> vertex -> vertex list

val pred : t -> vertex -> vertex list

val succ_e : t -> vertex -> edge list

val pred_e : t -> vertex -> edge list

val iter_vertex : (vertex -> unit) -> t -> unit

val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a

val iter_edges : (vertex -> vertex -> unit) -> t -> unit

val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a

val iter_edges_e : (edge -> unit) -> t -> unit

val fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a

val map_vertex : (vertex -> vertex) -> t -> t

val iter_succ : (vertex -> unit) -> t -> vertex -> unit

val iter_pred : (vertex -> unit) -> t -> vertex -> unit

val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

val fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

val iter_succ_e : (edge -> unit) -> t -> vertex -> unit

val fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

val iter_pred_e : (edge -> unit) -> t -> vertex -> unit

val fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

val create : ?size:int -> unit -> t

val clear : t -> unit

val copy : t -> t

val add_vertex : t -> vertex -> unit

val remove_vertex : t -> vertex -> unit

val add_edge : t -> vertex -> vertex -> unit

val add_edge_e : t -> edge -> unit

val remove_edge : t -> vertex -> vertex -> unit

val remove_edge_e : t -> edge -> unit

include Graph.Oper.S with type g = t

type g = t

val add_transitive_closure : ?reflexive:bool -> g -> g

val transitive_reduction : ?reflexive:bool -> g -> g

val replace_by_transitive_reduction : ?reflexive:bool -> g -> g

val mirror : g -> g

val complement : g -> g

val intersect : g -> g -> g

val union : g -> g -> g

module Topological : sig ... end

module Parallel : OpamParallel.SIG with type G.t = t and type G.V.t = vertex

module Dot : sig ... end

val transitive_closure : ?reflexive:bool -> t -> unit