Updates for 0.7

Author: garyb

bower.json

@@ -3,22 +3,29 @@
   "homepage": "https://github.com/purescript/purescript-foldable-traversable",
   "description": "Classes for foldable and traversable data structures",
   "keywords": [
-    "purescript"
+    "purescript",
+    "foldable",
+    "traversable"
   ],
   "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/purescript/purescript-foldable-traversable.git"
+  },
   "ignore": [
     "**/.*",
     "bower_components",
     "examples",
     "node_modules",
     "output",
+    "test",
     "bower.json",
     "gulpfile.js",
     "package.json"
   ],
   "dependencies": {
-    "purescript-either": "~0.2.0",
-    "purescript-tuples": "~0.4.0"
+    "purescript-bifunctors": "~0.4.0",
+    "purescript-maybe": "~0.3.0"
   },
   "devDependencies": {
     "purescript-console": "~0.1.0"

docs/Data.Bifoldable.md

@@ -1,5 +1,3 @@
-# Module Documentation
-
 ## Module Data.Bifoldable
 
 #### `Bifoldable`
@@ -19,20 +17,6 @@ argument. Type class instances should choose the appropriate step function based
 on the type of the element encountered at each point of the fold.
 
 
-#### `bifoldableTuple`
-
-``` purescript
-instance bifoldableTuple :: Bifoldable Tuple
-```
-
-
-#### `bifoldableEither`
-
-``` purescript
-instance bifoldableEither :: Bifoldable Either
-```
-
-
 #### `bifold`
 
 ``` purescript
@@ -82,4 +66,3 @@ biall :: forall t a b c. (Bifoldable t, BoundedLattice c) => (a -> c) -> (b -> c
 ```
 
 
-

docs/Data.Bitraversable.md

@@ -1,5 +1,3 @@
-# Module Documentation
-
 ## Module Data.Bitraversable
 
 #### `Bitraversable`
@@ -18,20 +16,6 @@ argument. Type class instances should choose the appropriate function based
 on the type of the element encountered at each point of the traversal.
 
 
-#### `bitraversableTuple`
-
-``` purescript
-instance bitraversableTuple :: Bitraversable Tuple
-```
-
-
-#### `bitraversableEither`
-
-``` purescript
-instance bitraversableEither :: Bitraversable Either
-```
-
-
 #### `bifor`
 
 ``` purescript
@@ -41,4 +25,3 @@ bifor :: forall t f a b c d. (Bitraversable t, Applicative f) => t a b -> (a ->
 Traverse a data structure, accumulating effects and results using an `Applicative` functor.
 
 
-

docs/Data.Foldable.md

@@ -1,5 +1,3 @@
-# Module Documentation
-
 ## Module Data.Foldable
 
 #### `Foldable`
@@ -11,88 +9,23 @@ class Foldable f where
   foldMap :: forall a m. (Monoid m) => (a -> m) -> f a -> m
 ```
 
-`Foldable` represents data structures which can be _folded_.
-
-- `foldr` folds a structure from the right
-- `foldl` folds a structure from the left
-- `foldMap` folds a structure by accumulating values in a `Monoid`
-
-#### `foldableArray`
-
-``` purescript
-instance foldableArray :: Foldable Prim.Array
-```
-
-
-#### `foldableEither`
-
-``` purescript
-instance foldableEither :: Foldable (Either a)
-```
-
-
-#### `foldableMaybe`
-
+##### Instances
 ``` purescript
 instance foldableMaybe :: Foldable Maybe
-```
-
-
-#### `foldableFirst`
-
-``` purescript
 instance foldableFirst :: Foldable First
-```
-
-
-#### `foldableLast`
-
-``` purescript
 instance foldableLast :: Foldable Last
-```
-
-
-#### `foldableAdditive`
-
-``` purescript
 instance foldableAdditive :: Foldable Additive
-```
-
-
-#### `foldableDual`
-
-``` purescript
 instance foldableDual :: Foldable Dual
-```
-
-
-#### `foldableInf`
-
-``` purescript
 instance foldableInf :: Foldable Inf
-```
-
-
-#### `foldableMultiplicative`
-
-``` purescript
 instance foldableMultiplicative :: Foldable Multiplicative
-```
-
-
-#### `foldableTuple`
-
-``` purescript
-instance foldableTuple :: Foldable (Tuple a)
-```
-
-
-#### `foldableSup`
-
-``` purescript
 instance foldableSup :: Foldable Sup
 ```
 
+`Foldable` represents data structures which can be _folded_.
+
+- `foldr` folds a structure from the right
+- `foldl` folds a structure from the left
+- `foldMap` folds a structure by accumulating values in a `Monoid`
 
 #### `fold`
 
@@ -241,13 +174,4 @@ find :: forall a f. (Foldable f) => (a -> Boolean) -> f a -> Maybe a
 
 Try to find an element in a data structure which satisfies a predicate.
 
-#### `lookup`
-
-``` purescript
-lookup :: forall a b f. (Foldable f, Eq a) => a -> f (Tuple a b) -> Maybe b
-```
-
-Lookup a value in a data structure of `Tuple`s, generalizing association lists.
-
-