Module Sexp_grammar_completion_protocol.Candidates

A Completion is the set of suggestions known at a point in a sexp.

type t = {
  1. candidates : Candidate.t list;
  2. exhaustive : bool;
}
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t -> t -> int
val exhaustive : t -> bool @@ portable
val candidates : t -> Candidate.t list @@ portable
val sexp_of_t : t -> Sexplib0.Sexp.t
include Core.Comparator.S with type t := t
type comparator_witness
module Unstable : sig ... end
module Stable : sig ... end