package ocaml-solo5

Build not yet checked
  1. Overview
  2. Docs
OCaml cross-compiler to the freestanding Solo5 backend

Install

dune-project
 Dependency

Authors

Maintainers

Sources

v1.3.5.tar.gz
md5=ea2abfe4436990ed71c823b212c78a0f
sha512=a0b048a9fb97e8fb0902ba9e9f76818dd9a250001b8f35d08eb5df52f4e978aa74ea3fc149ad5270a595431b68e574adf97762954f5e2a0b3661490357737774

doc/stdlib/Stdlib/MoreLabels/Set/index.html

Module MoreLabels.SetSource

Sets over ordered types.

This module implements the set data structure, given a total ordering function over the set elements. All operations over sets are purely applicative (no side-effects). The implementation uses balanced binary trees, and is therefore reasonably efficient: insertion and membership take time logarithmic in the size of the set, for instance.

The Make functor constructs implementations for any type, given a compare function. For instance:

  module IntPairs =
    struct
      type t = int * int
      let compare (x0,y0) (x1,y1) =
        match Stdlib.compare x0 x1 with
            0 -> Stdlib.compare y0 y1
          | c -> c
    end

  module PairsSet = Set.Make(IntPairs)

  let m = PairsSet.(empty |> add (2,3) |> add (5,7) |> add (11,13))

This creates a new module PairsSet, with a new type PairsSet.t of sets of int * int.

Sourcemodule type OrderedType = sig ... end

Input signature of the functor Make.

Sourcemodule type S = sig ... end

Output signature of the functor Make.

Sourcemodule Make (Ord : OrderedType) : S with type elt = Ord.t and type t = Set.Make(Ord).t

Functor building an implementation of the set structure given a totally ordered type.