Name:              local-search 
Version:           0.0.5
Synopsis:          A first attempt at generalised local search within Haskell, for applications in combinatorial optimisation. 
Description:       This library operates by representing metaheuristics as generators of solutions, or 
                   streams of solutions, which are themselves the result of resolving the interactions of 
                   other streams of values. The library contains combinators for constructing and 
                   managing these structures.   
Stability:         experimental
Category:          Control, Optimisation, Local Search
Author:            Richard Senington & David Duke
License:           GPL
license-file:      LICENSE
Copyright:         Copyright (c) 2012 Richard Senington
Homepage:          http://www.comp.leeds.ac.uk/sc06r2s/Projects/HaskellLocalSearch
Maintainer:        sc06r2s@leeds.ac.uk
Build-Type:        Simple
Cabal-Version:     >= 1.2
Data-files:        fl417.tsp,burma14.tsp

library
  Exposed-Modules: Control.Search.Local
                   Control.Search.Local.Example   
                   Control.Search.Local.Eager   
                   Control.Search.Local.Strategies  
  GHC-Options:     -O2 
  Build-Depends:   base >= 2.0 && <=5,
                   random >=1.0.0.3,
                   combinatorial-problems >=0.0.4,
                   containers >= 0.4.0.0
  Other-Modules:   Paths_local_search,Control.Search.Local.Queue
  extensions: MultiParamTypeClasses,
              FunctionalDependencies