# The LinearSplit package

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.

- No changelog available

## Properties

Versions | 0.1, 0.2, 0.2.1 |
---|---|

Dependencies | array, base (>=3.0.3.2 && <5), cmdargs (>=0.3), haskell98, QuickCheck (>=1.2.0.1) |

License | BSD3 |

Author | Vitaliy Rukavishnikov |

Maintainer | virukav@gmail.com |

Category | Algorithms |

Home page | http://github.com/rukav/LinearSplit |

Bug tracker | mailto:virukav@gmail.com |

Upload date | Sat Mar 5 16:34:41 UTC 2011 |

Uploaded by | VitaliyRukavishnikov |

Downloads | 315 total (32 in last 30 days) |

## Modules

*Data*

[Index]

## Downloads

- LinearSplit-0.2.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees