[add 'containers' package to distributed packages
John Meacham <john@repetae.net>**20090304111831
 Ignore-this: ce1e351b093742282378ba91888e4313
] addfile ./lib/containers.cabal
hunk ./Makefile.am 51
-JHC_LIBS =  base-1.0.hl haskell98-1.0.hl applicative-1.0.hl
+JHC_LIBS =  base-1.0.hl haskell98-1.0.hl applicative-1.0.hl containers-0.2.0.hl
hunk ./Makefile.am 222
+containers-0.2.0.hl: lib/containers.cabal base-1.0.hl applicative-1.0.hl
+	mkdir -p tmp/libho
+	./jhc -v $(RTSOPTS) $(JHC_TEST)  --ho-dir tmp/libho -ilib/containers  --noauto -L- -L. -p base -p applicative --build-hl lib/containers.cabal -fcpp -o $@
+
hunk ./docs/development.mkd 38
+    darcs get http://darcs.haskell.org/packages/containers
hunk ./lib/containers.cabal 1
+name:       containers
+version:    0.2.0.1
+license:    BSD3
+license-file:    LICENSE
+maintainer:    libraries@haskell.org
+bug-reports: http://hackage.haskell.org/trac/ghc/newticket?component=libraries%20%28other%29
+synopsis:   Assorted concrete container types
+category:   Data Structures
+description:
+        This package contains efficient general-purpose implementations
+        of various basic immutable container types.  The declared cost of
+        each operation is either worst-case or amortized, but remains
+        valid even if structures are shared.
+build-type: Simple
+extra-source-files: include/Typeable.h
+extensions: CPP
+
+exposed-modules:
+        Data.Graph
+        Data.IntMap
+        Data.IntSet
+        Data.Map
+        Data.Sequence
+        Data.Set
+        Data.Tree
+