repr 0.5.0 · OCaml Package

Type Combinators

type 'a t

The type for runtime representation of values of type 'a.

type len = [

| `Int
| `Int8
| `Int16
| `Int32
| `Int64
| `Fixed of int

]

The type of integer used to store buffers, list or array lengths.

Int use a (compressed) variable encoding to encode integers in a binary format, while IntX always use X bytes. Overflows are not detected.

Primitives

val unit : unit t

unit is a representation of the unit type.

val bool : bool t

bool is a representation of the boolean type.

val char : char t

char is a representation of the character type.

val int : int t

int is a representation of integers. Binary serialization uses a varying-width representation.

val int32 : int32 t

int32 is a representation of the 32-bit integer type.

val int63 : Optint.Int63.t t

int63 is a representation of the 63-bit integer type supplied by the Optint library.

val int64 : int64 t

int64 is a representation of the 64-bit integer type.

val float : float t

float is a representation of the float type.

val string : string t

string is a representation of the string type.

val bytes : bytes t

bytes is a representation of the bytes type.

val string_of : len -> string t

Like string but with a given kind of size.

val bytes_of : len -> bytes t

Like bytes but with a given kind of size.

val boxed : 'a t -> 'a t

boxed t is the same as t but with a binary representation which is always boxed (e.g. top-level values won't be unboxed). This forces Unboxed functions to be exactly the same as boxed ones.

val list : ?len:len -> 'a t -> 'a list t

list t is a representation of lists of values of type t.

val array : ?len:len -> 'a t -> 'a array t

array t is a representation of arrays of values of type t.

val option : 'a t -> 'a option t

option t is a representation of values of type t option.

val pair : 'a t -> 'b t -> ('a * 'b) t

pair x y is a representation of values of type x * y.

val triple : 'a t -> 'b t -> 'c t -> ('a * 'b * 'c) t

triple x y z is a representation of values of type x * y * z.

val result : 'a t -> 'b t -> ('a, 'b) Stdlib.result t

result a b is a representation of values of type (a, b) result.

val either : 'a t -> 'b t -> ('a, 'b) Either.t t

either a b is a representation of values of type (a, b) Either.t.

val seq : 'a t -> 'a Stdlib.Seq.t t

seq t is a representation of sequences of values of type t.

val ref : 'a t -> 'a Stdlib.ref t

ref t is a representation of references to values of type t.

Note: derived deserialisation functions will not preserve reference sharing.

val lazy_t : 'a t -> 'a Stdlib.Lazy.t t

lazy_t t is a representation of lazy values of type t.

Note: derived deserialisation functions on the resulting type will not be lazy.

val queue : 'a t -> 'a Stdlib.Queue.t t

queue t is a representation of queues of values of type t.

val stack : 'a t -> 'a Stdlib.Stack.t t

stack t is a representation of stacks of values of type t.

val hashtbl : 'k t -> 'v t -> ('k, 'v) Stdlib.Hashtbl.t t

hashtbl k v is a representation of hashtables with keys of type k and values of type v.

val set : 
  (module Stdlib.Set.S with type elt = 'elt and type t = 'set) ->
  'elt t ->
  'set t

set (module Set) elt is a representation of sets with elements of type elt. See Of_set for a functorised equivalent of this function.

module Of_set (Set : sig ... end) : sig ... end

Functor for building representatives of sets from the standard library.

module Of_map (Map : sig ... end) : sig ... end

Functor for building representatives of maps from the standard library.

type empty = |

An uninhabited type, defined as a variant with no constructors.

val empty : empty t

empty is a representation of the empty type.

Records

type ('a, 'b, 'c) open_record

The type for representing open records of type 'a with a constructor of type 'b. 'c represents the remaining fields to be described using the (|+) operator. An open record initially satisfies 'c = 'b and can be sealed once 'c = 'a.

val record : string -> 'b -> ('a, 'b, 'b) open_record

record n f is an incomplete representation of the record called n of type 'a with constructor f. To complete the representation, add fields with (|+) and then seal the record with sealr.

The name n is used for non-binary encoding/decoding and for pretty printing.

type ('a, 'b) field

The type for fields holding values of type 'b and belonging to a record of type 'a.

val field : string -> 'a t -> ('b -> 'a) -> ('b, 'a) field

field n t g is the representation of the field called n of type t with getter g. Raises. Invalid_argument if n is not valid UTF-8.

The name n is used for non-binary encoding/decoding and for pretty printing. It must not be used by any other field in the record.

For instance:

type manuscript = { title : string option }

let manuscript = field "title" (option string) (fun t -> t.title)

val (|+) : 
  ('a, 'b, 'c -> 'd) open_record ->
  ('a, 'c) field ->
  ('a, 'b, 'd) open_record

r |+ f is the open record r augmented with the field f.

val sealr : ('a, 'b, 'a) open_record -> 'a t

sealr r seals the open record r. Raises. Invalid_argument if two or more fields share the same name.

Putting all together:

type menu = { restaurant : string; items : (string * int32) list }

let t =
  record "t" (fun restaurant items -> { restaurant; items })
  |+ field "restaurant" string (fun t -> t.restaurant)
  |+ field "items" (list (pair string int32)) (fun t -> t.items)
  |> sealr

Variants

type ('a, 'b, 'c) open_variant

The type for representing open variants of type 'a with pattern matching of type 'b. 'c represents the remaining constructors to be described using the (|~) operator. An open variant initially satisfies c' = 'b and can be sealed once 'c = 'a.

val variant : string -> 'b -> ('a, 'b, 'b) open_variant

variant n p is an incomplete representation of the variant type called n of type 'a using p to deconstruct values. To complete the representation, add cases with (|~) and then seal the variant with sealv.

The name n is used for non-binary encoding/decoding and for pretty printing.

type ('a, 'b) case

The type for representing variant cases of type 'a with patterns of type 'b.

type 'a case_p

The type for representing patterns for a variant of type 'a.

val case0 : string -> 'a -> ('a, 'a case_p) case

case0 n v is a representation of a variant constructor v with no arguments and name n. Raises. Invalid_argument if n is not valid UTF-8.

The name n is used for non-binary encoding/decoding and for pretty printing. It must not by used by any other case0 in the record.

For instance:

type t = Foo

let foo = case0 "Foo" Foo

val case1 : string -> 'b t -> ('b -> 'a) -> ('a, 'b -> 'a case_p) case

case1 n t c is a representation of a variant constructor c with an argument of type t and name n. Raises. Invalid_argument if n is not valid UTF-8.

The name n is used for non-binary encoding/decoding and for pretty printing. It must not by used by any other case1 in the record.

For instance:

type t = Foo of string

let foo = case1 "Foo" string (fun s -> Foo s)

val (|~) : 
  ('a, 'b, 'c -> 'd) open_variant ->
  ('a, 'c) case ->
  ('a, 'b, 'd) open_variant

v |~ c is the open variant v augmented with the case c.

val sealv : ('a, 'b, 'a -> 'a case_p) open_variant -> 'a t

sealv v seals the open variant v. Raises. Invalid_argument if two or more cases of same arity share the same name.

Putting all together:

type t = Foo | Bar of string

let t =
  variant "t" (fun foo bar -> function Foo -> foo | Bar s -> bar s)
  |~ case0 "Foo" Foo
  |~ case1 "Bar" string (fun x -> Bar x)
  |> sealv

val enum : string -> (string * 'a) list -> 'a t

enum n cs is a representation of the variant type called n with singleton cases cs. e.g.

type t = Foo | Bar | Toto

let t = enum "t" [ ("Foo", Foo); ("Bar", Bar); ("Toto", Toto) ]

The name n and the case names are used for non-binary encoding/decoding and for pretty printing. Raises. Invalid_argument if two or more cases share the same name.

Recursive definitions

Repr allows a limited description of recursive records and variants.

TODO: describe the limitations, e.g. only regular recursion and no use of the generics inside the mu* functions and the usual caveats with recursive values (such as infinite loops on most of the generics which don't check sharing).

val mu : ('a t -> 'a t) -> 'a t

mu f is the representation r such that r = mu r.

For instance:

type x = { x : x option }

let x =
  mu (fun x ->
      record "x" (fun x -> { x })
      |+ field "x" (option x) (fun x -> x.x)
      |> sealr)

val mu2 : ('a t -> 'b t -> 'a t * 'b t) -> 'a t * 'b t

mu2 f is the representations r and s such that r, s = mu2 r s.

For instance:

type r = { foo : int; bar : string list; z : z option }

and z = { x : int; r : r list }

(* Build the representation of [r] knowing [z]'s. *)
let mkr z =
  record "r" (fun foo bar z -> { foo; bar; z })
  |+ field "foo" int (fun t -> t.foo)
  |+ field "bar" (list string) (fun t -> t.bar)
  |+ field "z" (option z) (fun t -> t.z)
  |> sealr

(* And the representation of [z] knowing [r]'s. *)
let mkz r =
  record "z" (fun x r -> { x; r })
  |+ field "x" int (fun t -> t.x)
  |+ field "r" (list r) (fun t -> t.r)
  |> sealr

(* Tie the loop. *)
let r, z = mu2 (fun r z -> (mkr z, mkz y))

Staging

type +'a staged

The type for staged operations.

val stage : 'a -> 'a staged

stage x stages x, where x would typically be a function that is expensive to construct.

val unstage : 'a staged -> 'a

unstage x unstages x.

Both stage and unstage are implemented with the identity function.

As the generic operations tend to be used repeatedly with the same left-most parameters, this type trick encourages the user to specialise them only once for performance reasons.

For instance:

let t = Repr.(pair int bool)
let compare = Repr.(unstage (compare t))

let sorted_list =
  List.init 42_000 (fun _ -> (Random.int 100_000, Random.bool ()))
  |> List.sort compare

Generic Operations

Given a value 'a t, it is possible to define generic operations on value of type 'a such as pretty-printing, parsing and unparsing.

type 'a equal = 'a -> 'a -> bool

val equal : 'a t -> 'a equal staged

equal t is the equality function between values of type t.

type 'a compare = 'a -> 'a -> int

val compare : 'a t -> 'a compare staged

compare t compares values of type t.

type 'a pp = Stdlib.Format.formatter -> 'a -> unit

The type for pretty-printers.

type 'a of_string = string -> ('a, [ `Msg of string ]) Stdlib.result

The type for parsers.

val pp : 'a t -> 'a pp

pp t is the pretty-printer for values of type t.

val pp_dump : 'a t -> 'a pp

pp_dump t is the dump pretty-printer for values of type t.

This pretty-printer outputs an encoding which is as close as possible to native OCaml syntax, so that the result can easily be copy-pasted into an OCaml REPL to inspect the value further.

val pp_ty : 'a t pp

The pretty printer for generics of type t.

val to_string : 'a t -> 'a -> string

to_string t is Fmt.to_to_string (pp t).

val of_string : 'a t -> 'a of_string

of_string t parses values of type t.

val random : 'a t -> (unit -> 'a) staged

random t is a random value generator for values of type t. For bounded types, values are sampled uniformly; for unbounded ones (lists, strings etc.), the length is first chosen according to a geometric distribution.

Derived generators use the global PRNG state provided by Stdlib.Random.get_state.

NOTE: this generator may fail to terminate when sampling a recursive type.

val random_state : 'a t -> (Stdlib.Random.State.t -> 'a) staged

random_state is a variant of random that takes an explicit PRNG state to use for random generation.

type 'a ty = 'a t

module Attribute : sig ... end

Attributes provide a mechanism for attaching metadata to type representations.

JSON converters

module Json : sig ... end

Overlay on top of Jsonm to work with rewindable streams.

type 'a encode_json = Jsonm.encoder -> 'a -> unit

The type for JSON encoders.

type 'a decode_json = Json.decoder -> ('a, [ `Msg of string ]) Stdlib.result

The type for JSON decoders.

val pp_json : ?minify:bool -> 'a t -> 'a Fmt.t

Similar to dump but pretty-prints the JSON representation instead of the OCaml one. See encode_json for details about the encoding.

For instance:

type t = { foo : int option; bar : string list }

let t =
  record "r" (fun foo bar -> { foo; bar })
  |+ field "foo" (option int) (fun t -> t.foo)
  |+ field "bar" (list string) (fun t -> t.bar)
  |> sealr

let s = Fmt.str "%a\n" (pp t) { foo = None; bar = [ "foo" ] }

(* s is "{ foo = None; bar = [\"foo\"]; }" *)

let j = Fmt.str "%a\n" (pp_json t) { foo = None; bar = [ "foo" ] }

(* j is "{ \"bar\":[\"foo\"] }" *)

NOTE: this will automatically convert JSON fragments to valid JSON objects by adding an enclosing array if necessary.

val encode_json : 'a t -> Jsonm.encoder -> 'a -> unit

encode_json t e encodes t into the jsonm encoder e. The encoding is a relatively straightforward translation of the OCaml structure into JSON. The main highlights are:

The unit value () is translated into the empty object {}.
OCaml ints are translated into JSON floats.
OCaml strings are translated into JSON strings. You must then ensure that the OCaml strings contains only valid UTF-8 characters.
OCaml options are translated differently depending on context: record fields with a value of None are removed from the JSON object; record fields with a value of Some x are automatically unboxed into x; and outside of records, None is translated into null and Some x into {"some": x'} with x' the JSON encoding of x.
Variant cases built using case0 are represented as strings.
Variant cases built using case1 are represented as a record with one field; the field name is the name of the variant.

NOTE: this can be used to encode JSON fragments. It's the responsibility of the caller to ensure that the encoded JSON fragment fits properly into a well-formed JSON object.

val decode_json : 
  'a t ->
  Jsonm.decoder ->
  ('a, [ `Msg of string ]) Stdlib.result

decode_json t e decodes values of type t from the jsonm decoder e.

val decode_json_lexemes : 
  'a t ->
  Jsonm.lexeme list ->
  ('a, [ `Msg of string ]) Stdlib.result

decode_json_lexemes is similar to decode_json but uses an already decoded list of JSON lexemes instead of a decoder.

val to_json_string : ?minify:bool -> 'a t -> 'a -> string

to_json_string is encode_json with a string encoder.

val of_json_string : 'a t -> string -> ('a, [ `Msg of string ]) Stdlib.result

of_json_string is decode_json with a string decoder .

Binary Converters

type 'a encode_bin = 'a -> (string -> unit) -> unit

The type for binary encoders.

type 'a decode_bin = string -> int -> int * 'a

The type for binary decoders.

type -'a size_of

The type for size function related to binary encoder/decoders.

type 'a short_hash := ?seed:int -> 'a -> int

val short_hash : 'a t -> 'a short_hash staged

hash t x is a short hash of x of type t.

val pre_hash : 'a t -> 'a encode_bin staged

pre_hash t x is the string representation of x, of type t, which will be used to compute the digest of the value. By default it's to_bin_string t x but it can be overriden by v, like and map operators.

val encode_bin : 'a t -> 'a encode_bin staged

encode_bin t is the binary encoder for values of type t.

val decode_bin : 'a t -> 'a decode_bin staged

decode_bin t is the binary decoder for values of type t.

val to_bin_string : 'a t -> ('a -> string) staged

to_bin_string t x use encode_bin to convert x, of type t, to a string.

NOTE: When t is Type.string or Type.bytes, the original buffer x is not prefixed by its size as encode_bin would do. If t is Type.string, the result is x (without copy).

val of_bin_string : 
  'a t ->
  (string -> ('a, [ `Msg of string ]) Stdlib.result) staged

of_bin_string t s is v such that s = to_bin_string t v.

NOTE: When t is Type.string, the result is s (without copy).

val size_of : 'a t -> ('a -> int option) staged

size_of t x is either the size of encode_bin t x or the binary encoding of x, if the backend is not able to pre-compute serialisation lengths.

module Size : sig ... end

module Unboxed : sig ... end

Unboxed operations assumes that value being serialized is fully filling the underlying buffer. When that's the case, it is not necessary to prefix the value's binary representation by its size, as it is exactly the buffer's size.

Abstract types

val abstract : 
  pp:'a pp ->
  of_string:'a of_string ->
  json:('a encode_json * 'a decode_json) ->
  bin:('a encode_bin * 'a decode_bin * 'a size_of) ->
  ?unboxed_bin:('a encode_bin * 'a decode_bin * 'a size_of) ->
  equal:'a equal ->
  compare:'a compare ->
  short_hash:'a short_hash ->
  pre_hash:'a encode_bin ->
  unit ->
  'a t

The representation of an abstract type, with an internal structure that is opaque to Repr, that supports the generic operations above.

Overriding specific operations

For a given type representation, each generic operation can be implemented in one of the following ways:

type 'a impl =

| Structural
(*
The automatic implementation derived from the type structure.
*)
| Custom of 'a
(*
A hand-written implementation.
*)
| Undefined
(*
An unimplemented operation that raises Unsupported_operation when invoked.
*)

exception Unsupported_operation of string

val partially_abstract : 
  pp:'a pp impl ->
  of_string:'a of_string impl ->
  json:('a encode_json * 'a decode_json) impl ->
  bin:('a encode_bin * 'a decode_bin * 'a size_of) impl ->
  unboxed_bin:('a encode_bin * 'a decode_bin * 'a size_of) impl ->
  equal:'a equal impl ->
  compare:'a compare impl ->
  short_hash:'a short_hash impl ->
  pre_hash:'a encode_bin impl ->
  'a t ->
  'a t

partially_abstract t is a partially-abstract type with internal representation t. The named arguments specify the implementation of each of the generic operations on this type.

val like : 
  ?pp:'a pp ->
  ?of_string:'a of_string ->
  ?json:('a encode_json * 'a decode_json) ->
  ?bin:('a encode_bin * 'a decode_bin * 'a size_of) ->
  ?unboxed_bin:('a encode_bin * 'a decode_bin * 'a size_of) ->
  ?equal:'a equal ->
  ?compare:'a compare ->
  ?short_hash:'a short_hash ->
  ?pre_hash:'a encode_bin ->
  'a t ->
  'a t

A wrapper around partially_abstract with each operation defaulting to `Structural and admitting a `Custom override.

Note: if ~compare is passed and ~equal is not then the default equality function (fun x y -> compare x y = 0) will be used.

val map : 
  ?pp:'a pp ->
  ?of_string:'a of_string ->
  ?json:('a encode_json * 'a decode_json) ->
  ?bin:('a encode_bin * 'a decode_bin * 'a size_of) ->
  ?unboxed_bin:('a encode_bin * 'a decode_bin * 'a size_of) ->
  ?equal:'a equal ->
  ?compare:'a compare ->
  ?short_hash:'a short_hash ->
  ?pre_hash:'a encode_bin ->
  'b t ->
  ('b -> 'a) ->
  ('a -> 'b) ->
  'a t

This combinator allows defining a representative of one type in terms of another by supplying coercions between them. For a representative of Stdlib.Map, see Of_map.

module type S = sig ... end

package repr

Type Combinators

Primitives

Records

Variants

Recursive definitions

Staging

Generic Operations

JSON converters

Binary Converters

Abstract types

Overriding specific operations