The LinearSplit package

[Tags: bsd3, library]

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.


Versions0.1, 0.2, 0.2.1
Dependenciesarray, base (>= && <5), cmdargs (>=0.3), haskell98, QuickCheck (>=
AuthorVitaliy Rukavishnikov
Home page
UploadedSat Mar 5 16:34:41 UTC 2011 by VitaliyRukavishnikov
Downloads400 total (28 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees