LinearSplit: Partition the sequence of items to the subsequences in the order given
The LinearSplit module implements partitioning the sequence of items to the subsequences in the order given. The items can be splitted using greedy heuristic or using the linear partition algorithm to minimize the maximum cost over all ranges (see the 'The Algorithm Design Manual' by Steven S. Skiena..).
The library can be used to balance the work across processors to minimize the run time. For the library usage take a look in examples/Splitter.hs.
[Skip to Readme]
|Versions [RSS]||0.1, 0.2, 0.2.1|
|Dependencies||array, base (>=184.108.40.206 && <5), cmdargs (>=0.3), haskell98, QuickCheck (>=220.127.116.11) [details]|
|Uploaded||by VitaliyRukavishnikov at 2011-03-05T16:34:41Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||2954 total (13 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]