🍃 🌳 🍂 Efficient implementation of the implicit treap data structure
-
Updated
Aug 2, 2021 - Haskell
🍃 🌳 🍂 Efficient implementation of the implicit treap data structure
Solutions to exercises from the book Haskell Programming
Multiple typeclass instances, selected by explicit application of a phantom type parameter
A Data.Map wrapper with a Monoid instance that delegates to the individual keys
Some extension to the Foldable and Monoid classes. Introduces a new class InsertLeft -- the class of types of values that can be inserted from the left to the Foldable structure that is a data that is also the Monoid instance. Also contains some functions to find out both minimum and maximum elements of the finite Foldable structures.
Add a description, image, and links to the monoid topic page so that developers can more easily learn about it.
To associate your repository with the monoid topic, visit your repo's landing page and select "manage topics."