Functional Priority Search Queues for OCaml
Browse cluster: OCaml Systems and Utilities →psq is a functional priority search queue library for OCaml that combines the functionality of a finite map and a priority queue, enabling efficient access to bindings by key and retrieval of minimum-priority elements. The structure is backed by priority search pennants and is suited for applications like searches, schedulers, and caches. The library is implemented in OCaml and distributed under the ISC license.