V2.Makemodule Trie : Bap.Std.Trie.V2.S with type key = Corpus.keyinclude V1.S with type key = Corpus.key with type corpus = Corpus.tinclude Bin_prot.Binable.S with type t := tval bin_size_t : t Bin_prot.Size.sizerval bin_write_t : t Bin_prot.Write.writerval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : (int -> t) Bin_prot.Read.readerval bin_writer_t : t Bin_prot.Type_class.writerval bin_reader_t : t Bin_prot.Type_class.readerval bin_t : t Bin_prot.Type_class.ttype key = Corpus.keytype corpus = Corpus.tval create : unit -> tcreate () creates an empty instance of the byteweigth decider.
train decider ~max_length test corpus train the decider on the specified corpus. The test function classifies extracted substrings. The max_length parameter binds the maximum length of substrings.
val length : t -> intlength decider total amount of different substrings known to a decider.
next t ~length ~threshold data begin the next positive chunk.
Returns an offset that is greater than begin of the next longest substring up to the given length, for which h1 / (h0 + h1) > threshold.
This is a specialization of the next_if function from the extended V1.V2.S interface.
val pp : Stdlib.Format.formatter -> t -> unitpp ppf decider prints all known to decider chunks.
type token = Trie.tokennext_if t ~length ~f data begin the next chunk that f.
Finds the next offset greater than begin of a string of the given length for which there was an observing of a substring s with length n and statistics stats, such that f s n stats is true.