Name:                ixset
Version:             1.0.0
x-revision: 1
Synopsis:            Efficient relational queries on Haskell sets. 
Description:         
    Just pick which parts of your data structures you want indexed
    using an easy to use template-haskell function. Spare yourself the
    need to write, run, and maintain code that marshalls your data
    to/from an external relational database just for efficient
    queries. happstack-ixset relies on generics and TH to spare you
    the boilerplate normally required for such tasks.
License:             BSD3
License-file:        COPYING
Author:              Happstack team, HAppS LLC
Maintainer:          Happstack team <happs@googlegroups.com>
homepage:            http://happstack.com
Category:            Web, Distributed Computing
Build-Type:          Simple
Cabal-Version:       >= 1.6

source-repository head
    type:     darcs
    subdir:   ixset
    location: http://patch-tag.com/r/mae/happstack

flag base4

Library
  -- GHC is pickier about impredicative polymorphism
  -- Also there aren't Typeable1
  build-depends: base <4.9

  if flag(base4)
    Build-Depends:     base >=4 && < 5, syb
  else
    Build-Depends:     base < 4

  if impl(ghc >= 6.12.1)
    Build-Depends:    syb-with-class >= 0.6.1
  else
    Build-Depends:    syb-with-class < 0.6.1


  Build-Depends:       containers,
                       safecopy,
                       template-haskell

  hs-source-dirs:      src
  Exposed-modules:     
                       Data.IxSet
                       Data.IxSet.Ix

  extensions:          DeriveDataTypeable, FlexibleInstances, OverlappingInstances, 
                       TemplateHaskell, UndecidableInstances

  if impl(ghc >= 6.12)
     ghc-options:      -Wall -fno-warn-unused-do-bind
  else
     ghc-options:      -Wall
  GHC-Prof-Options:    -auto-all