InputStream slurping code.
Read type class.
Empty classloader.
Some package level tidbits.
Simplify regex.
Better default .toXXX methods.
Some RGB related code.
A better show.
Remaining pending ansi code.
Try this:

scala> colorMap >

It's purty.
Dreaming of a quieter travis log.
Wasn't quieter.
Oh right the metabuild.
Reverted previous 3 commits.
Strip ansi with a regex instead of a big filter.
Boolean Algebras.

[info] + OK, passed 100 tests.     a ∧ (b ∧ c) = (a ∧ b) ∧ c                 Boolean
[info] + OK, passed 100 tests.     a ∨ (b ∨ c) = (a ∨ b) ∨ c                 Boolean
[info] + OK, passed 100 tests.     a ∧ b = b ∧ a                             Boolean
[info] + OK, passed 100 tests.     a ∨ b = b ∨ a                             Boolean
[info] + OK, passed 100 tests.     a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c)           Boolean
[info] + OK, passed 100 tests.     a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c)           Boolean
[info] + OK, passed 100 tests.     a ∧ (a ∨ b) = a                           Boolean
[info] + OK, passed 100 tests.     a ∨ (a ∧ b) = a                           Boolean
[info] + OK, passed 100 tests.     a ∨ 0 = a                                 Boolean
[info] + OK, passed 100 tests.     a ∧ 1 = a                                 Boolean
[info] + OK, passed 100 tests.     a ∨ ¬a = 1                                Boolean
[info] + OK, passed 100 tests.     a ∧ ¬a = 0                                Boolean
[info] + OK, passed 100 tests.     a ∧ (b ∧ c) = (a ∧ b) ∧ c                 Predicate[Int]
[info] + OK, passed 100 tests.     a ∨ (b ∨ c) = (a ∨ b) ∨ c                 Predicate[Int]
[info] + OK, passed 100 tests.     a ∧ b = b ∧ a                             Predicate[Int]
[info] + OK, passed 100 tests.     a ∨ b = b ∨ a                             Predicate[Int]
[info] + OK, passed 100 tests.     a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c)           Predicate[Int]
[info] + OK, passed 100 tests.     a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c)           Predicate[Int]
[info] + OK, passed 100 tests.     a ∧ (a ∨ b) = a                           Predicate[Int]
[info] + OK, passed 100 tests.     a ∨ (a ∧ b) = a                           Predicate[Int]
[info] + OK, passed 100 tests.     a ∨ 0 = a                                 Predicate[Int]
[info] + OK, passed 100 tests.     a ∧ 1 = a                                 Predicate[Int]
[info] + OK, passed 100 tests.     a ∨ ¬a = 1                                Predicate[Int]
[info] + OK, passed 100 tests.     a ∧ ¬a = 0                                Predicate[Int]
[info] + OK, passed 100 tests.     a ∧ (b ∧ c) = (a ∧ b) ∧ c                 Set[Int]
[info] + OK, passed 100 tests.     a ∨ (b ∨ c) = (a ∨ b) ∨ c                 Set[Int]
[info] + OK, passed 100 tests.     a ∧ b = b ∧ a                             Set[Int]
[info] + OK, passed 100 tests.     a ∨ b = b ∨ a                             Set[Int]
[info] + OK, passed 100 tests.     a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c)           Set[Int]
[info] + OK, passed 100 tests.     a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c)           Set[Int]
[info] + OK, passed 100 tests.     a ∧ (a ∨ b) = a                           Set[Int]
[info] + OK, passed 100 tests.     a ∨ (a ∧ b) = a                           Set[Int]
[info] + OK, passed 100 tests.     a ∨ 0 = a                                 Set[Int]
[info] + OK, passed 100 tests.     a ∧ 1 = a                                 Set[Int]
[info] + OK, passed 100 tests.     a ∨ ¬a = 1                                Set[Int]
[info] + OK, passed 100 tests.     a ∧ ¬a = 0                                Set[Int]
The quest for a type-class collections basis.

Also misc attempt to workaround scalac bugs and get a NatList
which wouldn't finish last in a snail race.
Naming tweaks.
Dredged out utest.

Man these test frameworks are so much more trouble than
they could ever be worth.
Take a swing at silencing sbt the old fashioned way.

Apparently shutting up is too complicated for the simple
build tool - nobody can come up with any way to suppress
the fusillade of noise from sbt on travis.