Enable Travis-CI
Mutable array based MonadCache

The fastest MonadCache based on MArray which can be hosted either in IO or ST and can cache any boxed value type or (the fastest) a range of unboxed values.
Update README.md with info re: ArrayCache
Clean up ArrayCache code

Make it more expandable (in regards to boxed part of it)
Mutable Vector based MonadCache

Even more limiting but even faster MonadCache implementation based on `vector` package
Refactor and streamline Vector and Array code

Also adjust examples and tests
Different flavours of Vectors and general refactoring

After trying different approaches to "eval*" and "run*" functions (including promising TypeFamilies-based approach which, unfortunately doesn't work in GHC 7.4.*) this is the final variant of the implementation. Based on good-old FunctionalDependencies
Refactor code reducing duplication.

Clean it up with hint and Wall
More strictness annotations for generic caches
Add simple benchmark. Reorganise tests and benchs

Benchmarks are supported by cabal 1.14 - other version will emit warning.
Move tests and benchmarks into separate directories to clean up the main code.
Make it compatible with 7.0.*

Again
Update/fix documentation

Including CHANGES
Use `maxBound` instead of `minBound` in MaybeLike instances

This is better for unsigned unboxed types like `Word` which have minBound == 0
Merge diverged master branch
Update README
Version 0.4.0

Array and Vector -based memoization caches.
Bug fixes and performance improvements.