ke

Fast implementation of queue in OCaml

Queue or FIFO is one of the most famous data-structure used in several algorithms. Ke provides some implementations of it in a functional or imperative way.

homepage ↗ github: mirage/ke

Available in

Overlay	Newest	Ebuilds	Last activity
nest GitHub ↗	0.6	2	14 d	details ›

Versions & arches

Version	Overlay	amd64	Committed
9999 LIVE ^≈	nest	follows upstream — no keywords	2 mo	view · download · history ↗
0.6 ^≈	nest	amd64 testing	2 mo	view · download · history ↗

Use flags of 0.6

+ocamlopt Enable ocamlopt support (ocaml native code compiler) -- Produces faster programs (Warning: you have to disable/enable it at a global scale)
test Enable dependencies and/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)