package repr
Install
dune-project
Dependency
Authors
Maintainers
Sources
sha256=d9bd2fe51c2eb6fca27731034c46f9a77dc8bc9fb7b76216f8a571603d6e7d74
sha512=7b4ad2cbcd92f6647a1abe1d82557f02e4955c5f37f02089388c752e23b865af0f55fdd6bc63a1d2a00962baf96ccd99ccd9b8ecd8898dcc2a0cd17302f067c3
doc/repr/Repr/module-type-DSL/index.html
Module type Repr.DSLSource
Type Combinators
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 tunit is a representation of the unit type.
val bool : bool tbool is a representation of the boolean type.
val char : char tchar is a representation of the character type.
val int : int tint is a representation of integers. Binary serialization uses a varying-width representation.
val int32 : int32 tint32 is a representation of the 32-bit integer type.
val int64 : int64 tint64 is a representation of the 64-bit integer type.
val float : float tfloat is a representation of the float type.
val string : string tstring is a representation of the string type.
val bytes : bytes tbytes is a representation of the bytes type.
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.
array t is a representation of arrays of values of type t.
triple x y z is a representation of values of type x * y * z.
result a b is a representation of values of type (a, b) result.
either a b is a representation of values of type (a, b) Either.t.
ref t is a representation of references to values of type t.
Note: derived deserialisation functions will not preserve reference sharing.
lazy_t t is a representation of lazy values of type t.
Note: derived deserialisation functions on the resulting type will not be lazy.
hashtbl k v is a representation of hashtables with keys of type k and values of type v.
set (module Set) elt is a representation of sets with elements of type elt. See Of_set for a functorised equivalent of this function.
Functor for building representatives of sets from the standard library.
Functor for building representatives of maps from the standard library.
Records
val record : string -> 'b -> ('a, 'b, 'b) open_recordThe type for fields holding values of type 'b and belonging to a record of type 'a.
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_recordr |+ f is the open record r augmented with the field f.
val sealr : ('a, 'b, 'a) open_record -> 'a tsealr 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)
|> sealrVariants
val variant : string -> 'b -> ('a, 'b, 'b) open_variantcase0 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" Foocase1 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_variantv |~ c is the open variant v augmented with the case c.
val sealv : ('a, 'b, 'a -> 'a case_p) open_variant -> 'a tsealv 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)
|> sealvval enum : string -> (string * 'a) list -> 'a tenum 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).
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)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
val stage : 'a -> 'a stagedstage x stages x, where x would typically be a function that is expensive to construct.
val unstage : 'a staged -> 'aunstage 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 compareGeneric 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) stagedtype 'a compare = ('a -> 'a -> int) stagedtype 'a pp = 'a Fmt.tThe type for pretty-printers.
type 'a of_string = string -> ('a, [ `Msg of string ]) resultThe type for parsers.
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 to_string : 'a t -> 'a -> stringto_string t is Fmt.to_to_string (pp t).
JSON converters
module Json : sig ... endOverlay on top of Jsonm to work with rewindable streams.
type 'a encode_json = Jsonm.encoder -> 'a -> unitThe type for JSON encoders.
type 'a decode_json = Json.decoder -> ('a, [ `Msg of string ]) resultThe type for JSON decoders.
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.strf "%a\n" (pp t) { foo = None; bar = [ "foo" ] }
(* s is "{ foo = None; bar = [\"foo\"]; }" *)
let j = Fmt.strf "%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 -> unitencode_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
Noneare removed from the JSON object; record fields with a value ofSome xare automatically unboxed into x; and outside of records,Noneis translated intonullandSome xinto{"some": x'}withx'the JSON encoding ofx. - Variant cases built using
case0are represented as strings. - Variant cases built using
case1are 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 ]) resultdecode_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 ]) resultdecode_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 -> stringto_json_string is encode_json with a string encoder.
of_json_string is decode_json with a string decoder .
Binary Converters
type 'a encode_bin = ('a -> (string -> unit) -> unit) stagedThe type for binary encoders.
type 'a decode_bin = (string -> int -> int * 'a) stagedThe type for binary decoders.
type 'a size_of = ('a -> int option) stagedThe type for size function related to binary encoder/decoders.
type 'a short_hash := (?seed:int -> 'a -> int) stagedval short_hash : 'a t -> 'a short_hashhash t x is a short hash of x of type t.
val pre_hash : 'a t -> 'a encode_binval encode_bin : 'a t -> 'a encode_binencode_bin t is the binary encoder for values of type t.
val decode_bin : 'a t -> 'a decode_bindecode_bin t is the binary decoder for values of type t.
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).
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).
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 Unboxed : sig ... endUnboxed 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 tThe 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:
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 tpartially_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 tA 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 tThis 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.
type 'a ty = 'a tmodule type S = sig ... end