compactable: A typeclass for structures which can be catMaybed, filtered, and partitioned.
This provides polymorphic implementations for filter, compact (catMaybes), and separate. It allows for higher performance implementations to be used in place of defaults for all data structures, and endeavors to centerally document those implementations. 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 [RSS]||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, 0.1.2.4, 0.2.0.0|
|Dependencies||aeson, base (>=4.9 && <4.16), base-compat, bifunctors, containers, contravariant, data-default-class, deepseq, hashable, keys, lens, QuickCheck, semigroupoids, these, transformers, transformers-compat, unordered-containers, vector, vector-instances [details]|
|Source repo||head: git clone https://gitlab.com/fresheyeball/Compactable.git|
|Uploaded||by fresheyeball at 2022-01-09T07:12:27Z|
|Downloads||6407 total (20 in the last 30 days)|
|Rating||2.25 (votes: 2) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]