queuelike-1.0.0: A library of queuelike data structures, both functional and stateful.

Data.Queue.IntQueue

Description

A small collection of specialized Int-indexed priority queues dealing with both untagged Ints and association pairs with Int keys. The implementation is a simple bootstrap from IntMap. (Note: Duplicate keys will be counted separately. No guarantees are made on the order in which values associated with equal keys are returned.)

Synopsis

Documentation

data IntQueue Source

A Queuelike type with QueueKey IntQueue ~ Int.

Instances

data IntAssocQueue e Source

A Queuelike type with QueueKey (IntAssocQueue e) ~ e :-> Int.

Instances