Module Dunolinter.Ordered_setSource

Sourcetype 'a t =
  1. | Element of 'a
  2. | Standard
  3. | Union of 'a t Base.list
  4. | Diff of 'a t * 'a t
  5. | Include of Base.string
Sourceval sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.t
Sourceval read : read_element:(sexps_rewriter:Sexps_rewriter.t -> Base.Sexp.t -> 'a) -> sexps_rewriter:Sexps_rewriter.t -> Base.Sexp.t Base.list -> 'a t
Sourceval write : write_a:('a -> Base.Sexp.t) -> 'a t -> Base.Sexp.t Base.list
Sourcemodule Evaluation_result : sig ... end
Sourcemodule Evaluator : sig ... end
Sourceval of_set : ('a, _) Base.Set.t -> 'a t
Sourceval of_list : 'a Base.list -> 'a t
Sourceval as_set : ('a, 'cmp) Base.Comparator.Module.t -> 'a t -> evaluator:'a Evaluator.t -> ('a, 'cmp) Base.Set.t Evaluation_result.t

Return the elements of t as a set, using the specified static evaluator.

Sourceval mem : (module Base.Comparator.S with type t = 'a) -> 'a t -> 'a -> evaluator:'a Evaluator.t -> Base.bool Evaluation_result.t

Whether it is possible to determine statically if a value belongs to the set. This is meant to cover more cases in which, even though it is not possible to know the set completely statically, it is still possible to determine whether an element belongs to it.

Sourceval insert : (module Base.Comparator.S with type t = 'a) -> 'a t -> 'a -> 'a t
Sourceval remove : (module Base.Comparator.S with type t = 'a) -> 'a t -> 'a -> 'a t
Sourceval canonical_sort : (module Base.Comparator.S with type t = 'a) -> 'a t -> 'a t

A canonical sort defined by dunolint when the order has no particular meaning.