package rocq-runtime

You can search for identifiers within the package.

in-package search v0.2.0

The Rocq Prover -- Core Binaries and Tools

Install

md5=8d522602d23e7a665631826dab9aa92b

sha512=f4f76a6a178e421c99ee7a331a2fd97a06e9c5d0168d7e60c44e3820d8e1a124370ea104ad90c7f87a9a1e9d87b2d0d7d2d387c998feeaed4a75ed04e176a4be

A trie is a generalization of the map data structure where the keys are themselves lists.

Sourcetype label

Keys of the trie structure are label list.

Sourcetype data

Data on nodes of tries are finite sets of data.

Sourcetype t

The trie data structure. Essentially a finite map with keys label list and content data Set.t.

Sourceval empty : t

The empty trie.

Sourceval get : t -> data

Get the data at the current node.

Sourceval next : t -> label -> t

next t lbl returns the subtrie of t pointed by lbl.

Sourceval labels : t -> label list

Get the list of defined labels at the current node.

Sourceval add : label list -> data -> t -> t

add t path v adds v at path path in t.

Sourceval remove : label list -> data -> t -> t

remove t path v removes v from path path in t.

Sourceval iter : (label list -> data -> unit) -> t -> unit

Apply a function to all contents.