Îõ³h$Þe     (c) Marco Zocca 2020BSD3-style (see LICENSE)@ocramz experimentalportable Safe-InferredÙ=depqA double-ended priority queuedepqInsert an elementdepqThe empty DEPQdepqNumber of elements in the DEPQdepq Lookup a keydepqPopulate a DEPQ from a  container (e.g. a list)depqÍProduce a list of (key, priority, value) triples with the entries of the DEPQ0Note : the order of the output list is undefineddepqIs the DEPQ empty ?depqIs the DEPQ valid ? depq‚Delete a (key, priority, value) triple from the queue. When the key is not a member of the queue, the original queue is returned. depq/Delete the minimum-priority element in the DEPQ depq/Delete the maximum-priority element in the DEPQ depqO(1). Find the minimum-priority element in the DEPQ depqO(1). Find the maximum-priority element in the DEPQdepq=Return the minimum along with a new DEPQ without that elementdepq=Return the maximum along with a new DEPQ without that elementdepq%K highest-scoring entries in the DEPQÒNB : this returns an empty sequence if there are fewer than K elements in the DEPQdepq$K lowest-scoring entries in the DEPQÒNB : this returns an empty sequence if there are fewer than K elements in the DEPQdepqkeydepqprioritydepqvaluedepq lookup keydepq(key, priority, value) depqkey of the triple to be deleted        !depq-0.4.2-H6UkcdxGD7n5a63FSs0WaO Data.DEPQDEPQinsertemptysizelookupfromListtoListnullvaliddelete deleteMin deleteMaxfindMinfindMaxpopMinpopMaxtopKbottomK$fArbitraryDEPQ $fNFDataDEPQ$fFoldableDEPQ$fEqDEPQ $fShowDEPQbase Data.FoldableFoldable