The grouped-list package

[Tags:benchmark, bsd3, library, test]

Grouped lists work like regular lists, except for two conditions:

This mean that grouped lists are ideal for cases where the list has many repetitions (like [1,1,1,1,7,7,7,7,7,7,7,7,2,2,2,2,2], although they might present some deficiencies in the absent of repetitions.

[Skip to Readme]


Change log
Dependencies base (>=4.8 && <4.10), containers, deepseq, pointed, transformers [details]
License BSD3
Author Daniel Díaz
Category Data
Home page
Bug tracker
Source repository head: git clone
Uploaded Tue May 24 13:22:49 UTC 2016 by DanielDiaz
Distributions LTSHaskell:, NixOS:, Stackage:, Tumbleweed:
Downloads 558 total (6 in the last 30 days)
0 []
Status Docs available [build log]
Last success reported on 2016-05-24 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees

Readme for grouped-list

Readme for grouped-list-


Welcome to the grouped-list repository.

We are at an early stage of development, but contributions are more than welcome. If you are interested, feel free to submit a pull request.

What is this about?

This library defines the type of grouped lists, Grouped. Values of this type are lists with a finite number of elements. The only special feature is that consecutive elements that are equal on the list are internally represented as a single element annotated with the number of repetitions. Therefore, operations on lists that have many consecutive repetitions perform much better, and memory usage is reduced. However, this type is suboptimal for lists that do not have many consecutive repetitions. We are trying to ameliorate this.

Automatic build

Build Status