Tim Pigden
Tim Pigden
@adamgfraser ok, a bit of help required. I downloaded master I've written all the code, I've absolutely no idea what I'm doing with respect to cross-compiles and so on (we...
__so what I've done atm is have an object NonEmptySet.NonEmptySortedSet that has a similar set of constructors to NonEmptySet, though each with an implicit scala.math.ordering. As it constructs the NonEmptySortedSet...
wrt to the NonEmptyMap - I can't replicate (or don't know how to) the set of methods like ``` implicit val NonEmptySetCommutativeEither: CommutativeEither[NonEmptySet] ``` because Map as a pair of...
Actually on second thoughts I ought do the range stuff, so I'll need a parallel full implementation
oops - ignore the pull request. I forgot the additional tree methods!
ok, just to note what's been done: 3 new things added NonEmptySortedSet, NonEmptyMap and NonEmptySortedMap NonEmptySortedSet is almost exactly the same as NonEmptySet - I tried to factor out the...
OK, I get it - because remove returns a Set not a NonEmptySet So looking at the API, I'd personally like a removeNonEmpty(elem: A): Option[NonEmptySet[A]] which is a set-based equivalent...
PS happy to do a PR or whatever, but this seems way too intrusive a change to not have the author's say-so or input