compactable: A typeclass for structures which can be catMaybed, filtered, and partitioned.
This provides polymorphic implimentations for filter, compact (catMaybes), and separate. It allows for higher performance implimentations to be used in place of defaults for all data structures, and endeavors to centerally document those implimentations. Compactable aims to be as general and unconstrained as possible, providing instances for non-Functors like Set, as well as some Contravariants (though not published here). Compactable fully subsumes Data.Witherable, offers more laws, and is more general.
|Versions [faq]||0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4, 0.1.1.0, 0.1.1.1, 0.1.2.0, 0.1.2.1, 0.1.2.2, 0.1.2.3|
|Dependencies||base (>=4.9 && <4.10.2), containers (>=0.5.7 && <0.6), transformers (>=0.5.2 && <0.6), vector (>=0.11 && <0.13) [details]|
|Source repo||head: git clone https://gitlab.com/fresheyeball/Compactable.git|
|Uploaded||by fresheyeball at Tue Jan 23 00:52:50 UTC 2018|
|Downloads||1859 total (108 in the last 30 days)|
|Rating||2.25 (votes: 2) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2018-01-23 [all 1 reports]
For package maintainers and hackage trustees