package earley

  1. Overview
  2. Docs

Second kind of table: unordered, but imperative and more efficient

type 'a t
val create : unit -> 'a t
val add : 'a t -> buffer -> int -> 'a -> unit
val find : 'a t -> buffer -> int -> 'a
val clear : 'a t -> unit
val iter : 'a t -> ('a -> unit) -> unit