package prbnmcn-stats

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

prbnmcn-stats
- Stats
  - Binning
  - Combi
  - Emp
    
    Empirical_statistics
    
    Float
    
    Rational
  - Fin
    
    Float
    
    Dist
    
    Rational
    
    Dist
  - Finbij
    
    Make
    
    Elt
    
    S
  - Gen
    
    Infix
    
    Rational
  - Graph
    
    Dist
    
    Graph_statistics
    
    Table
    
    Undirected_edge
    
    Vertex_bij
    
    Make
    
    Graph
    
    V
    
    Table
    
    Undirected_edge
    
    Vertex_bij
  - Log_space
  - Mh
    
    MH_parameters
    
    Make
    
    X
    
    Make_core_sampling_loop
    
    X
  - Pdfs
  - Stats_intf
    
    Fin_dist
    
    Fin_fun
    
    V
    
    Basis
    
    R
    
    Fin_kernel
    
    V
    
    Basis
    
    R
    
    Gen
    
    Infix
    
    Rational
    
    Graph
    
    V
    
    Sampling_monad
    
    Infix

Legend:
Library
Module
Module type
Parameter
Class
Class type

Map-based implementation.

Parameters

module Elt : Basic_structures.Basic_intf.Ordered

Signature

type t

The type of bijections.

type elt = Elt.t

The type of elements in bijection with {0; ..; n-1}.

val of_list : elt list -> t

of_list l Constructs a bijection between l and {0; ...; n-1}. The bijection is constructed by assigning to the elements l₀, l₁, ..., l_n-1 the indices {0; 1; ...; n-1}.

val nth_exn : t -> int -> elt

Get the nth element out of the bijection. This is O(1).

raises Invalid_argument
if the element is out of the range of the bijection.

val nth_opt : t -> int -> elt option

Same as nth_exn but returns None if out of range.

val idx_exn : t -> elt -> int

Returns the index of a given element. This is O(log2(n)) for a set with n elements when using the map-based implementation.

raises Not_found
if element is not in the domain of the bijection.

val idx_opt : t -> elt -> int option

See idx_opt

val support : t -> int

Returns the size of domain of the bijection.

val fold : (elt -> int -> 'a -> 'a) -> t -> 'a -> 'a

Folds over the graph of the bijection.