Denis Rosset

Some steps: - [ ] add a binary compatibility statement - [ ] use the MiMa plugin

For example in `RemoveableSearchableOps`: ``` scala final def --=(coll: Nextable with Countable with PointableKey[K]): lhs.type = { @tailrec def rec(p: Ptr[coll.Tag]): Unit = p.asInstanceOf[Ptr[coll.Tag]] match { case VPtr(vp) => lhs.remove(vp.key)...

See http://rklaehn.github.io/2016/01/05/binarymerge/ for improvements of FSortedSets

As the library promises `no-boxing` for all operations, this property should be check against regressions.

Due to the interaction between specialization and higher kinded types, we do not specialize the `SetCheck` , `MapCheck` and `Map2Check` property-based tests. Additional tests have to be written.

See https://github.com/non/algebra/pull/38

Incomplete list below: Map.getOrElseUpdate Map.isDefinedAt reduce reduceOpt copyToArray copyToBuffer / XXX Map.put Map.retain Set.retain Map.transform

For now, it is a method only for Buffer.

Implement a few benchmarks with comparisons to the standard Scala collections, Debox hash collections and Spire bitsets.