optional

final class IterableGroupoid[A, SA <: IterableLike[A, SA]] extends Groupoid[SA]
final class IterableSemigroupoid[A, SA <: IterableLike[A, SA]] extends Semigroupoid[SA]
final class MapIntIntGroup extends Group[Map[Int, Int]]
final class MapIntIntIntAction extends Action[Int, Map[Int, Int]]
final class MapIntIntSeqPartialAction[A, SA <: SeqLike[A, SA]] extends PartialAction[SA, Map[Int, Int]]
trait PartialIterable0 extends AnyRef
trait PartialIterable1 extends PartialIterable0
trait VectorOrderLow extends AnyRef

object genericEq

This provides an implicit Eq[A] for any type A using Scala's (Java's) == (equals).
This provides an implicit Eq[A] for any type A using Scala's (Java's) == (equals). This is generally considered a bad idea, since it means you lose all type safety -- for instance, any 2 types can always be compared as Eq[Any].
object intervalGeometricPartialOrder
object intervalSubsetPartialOrder
object intervalValuePartialOrder
object mapIntIntPermutation
object partialIterable extends PartialIterable1
object powerSetPartialOrder
object rationalTrig
object totalfloat

This provides orderings (Order and Eq) for Float and Double that have a total order.
This provides orderings (Order and Eq) for Float and Double that have a total order. Specifically, this will order NaN's consistently, rather than having their order be undefined. However, this won't be as fast as the default ordering.
package unicode
object vectorOrder extends VectorOrderLow

This object provides implicit instances of Eq and Order for Seq-likes that will behave like infinite vectors.
This object provides implicit instances of Eq and Order for Seq-likes that will behave like infinite vectors. Essentially all this means is that Seq(0, 0, 0) === Seq(), since both are infinite vectors of zeros. Any element not explicitly set is implied to be 0.