remove UndoT
Fixed strictness bug in DList. #234
Cleanup for #234
Remove Pointed, Copointed and ArrId. The existence of these three type-classes is a bug #235.

The operations of these former interfaces have been moved to a more appropriate place:
* Pointed operation has been moved to Applicative
* Copointed operation has been moved to Comonad
* ArrId operation has been moved to Category

A short discussion occurred on the mailing list on this issue:
https://groups.google.com/forum/?fromgroups=#!topic/scalaz/7OE_Nsreqq0

Pointed is a bogus type-class for a number of reasons. The first is that it provides no value.
It's only possible law is given by paramericity (c.f. Theorems for Free, Wadler):
    (x, g) => point(map(x)(g)) == pure(g(x))

Copointed and ArrId have similar reasoning applied.

The adversities of these interfaces have long been discussed; most notably between Ed Kmett, Runar Bjarnason and I.
There is consensus that their existence serves no purpose but to attract defective code. This is the primary compulsion for their removal (not so much their uselessness). This bug fix is similar in structure to the removal of the Zero interface (scalaz 6) with the zero operation moved to the Monoid interface. I cannot find the original discussion on this matter, but I do recall that there were more people involved and also unanimous consensus.

Since I was the original author of these unfortunate type-classes, I offer my apologies for their coming to exist. I co-invented these type-classes with Ed (After I had invented them, I looked around for names and found Ed doing the same thing and stole his names!). I hope my apology can be accepted and we can move on.
fix typo
InsertionMap equality should be order independent.

The underlying structure stores an index that _can_
be used to pull keys back out in the insertion order,
but this index is not part of data and should not be
taken into account for equal / hashCode and alike.

This fits with the rest of the data structure, for
example map/flatMap occur in an arbitrary order.

This reverts a behaviour change introduced in
commit ec854db7180dbba78d19f6df6a0c040034f3245b
currying EphemeralStream#unfold for type inference
consistent file and class names for syntax.*Ops

* `ToXOps` and `XV` → `XOps` with file name `XSyntax.scala` or `XOps.scala`
  (latter if they don't contain `Syntax`)
* update Developer Guide
update `GenTypeClass`

* `Comonad` doesn't extend `Functor` directly
* take control over `IsEmpty`
* remove `ArrId`
* whitespace fixes
* move auxiliary functions into `////` blocks
Merge pull request #236
Tap needs to take A => Any instead of A => Unit
Added error-appending Validation combinator for "search for success"
mechanics; an alternative to orElse-type behavior that appends errors.
Added tests for Validation#findSuccess
update package.scala scaladoc
add alias for comparing on Order
Merge branch 'scalaz-seven' of github.com:scalaz/scalaz into scalaz-seven
fix Heap#toUnsortedList.
Previous implementation is so slow. Because it returns sorted List in spite of toUnsortedList.
Merge pull request #238 from xuwei-k/package-scaladoc

update package.scala scaladoc
Merge pull request #239 from xuwei-k/Heap-toUnsortedList

fix Heap#toUnsortedList.
Add Foldable1 and Traverse1

This provides a better abstraction for when things are "non-empty" and
removes partial functions from Foldable and Traverse.

* Loosens Foldable1 to Semigroup (from Monoid)
* Loosens Traverse1 to Apply (from Applicative)
* Id has a Traverse1
* Product has a Traverse1
* NonEmptyList has a Traverse1
* Tree has a Traverse1

    Traversable <---- Foldable
         |               |
         v               v
    Traversable1 <--- Foldable1

See http://hackage.haskell.org/package/semigroupoids