LinearSplit-0.2.1: LinearSplit.cabal

Name:                LinearSplit
Version:             0.2.1
Synopsis:            Partition the sequence of items to the subsequences in the order given
Description:         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. 
License:             BSD3
License-File:        LICENSE
Author:              Vitaliy Rukavishnikov
Maintainer:          virukav@gmail.com
Homepage:            http://github.com/rukav/LinearSplit
Bug-Reports:         mailto:virukav@gmail.com
Build-Type:          Simple
Tested-with:	     GHC==6.12.3
Category:            Algorithms
Data-Dir:            examples
Data-Files:	     test1.txt
Cabal-Version:       >=1.2
Extra-Source-Files:  README,
                     examples/Splitter.hs,
                     tests/Properties.hs
Library
    Exposed-Modules:     Data.LinearSplit
    Build-Depends:       base >= 3.0.3.2 && < 5, 
                         cmdargs >= 0.3, 
                         array, 
                         QuickCheck >= 1.2.0.1,
                         haskell98