Implement separate set union and set intersection monoids (and semigroups) #363

Activity

1. jbgi commented on Oct 2, 2018

   

   jbgi

   on Oct 2, 2018

   Member

   More actions

   👍 for the intersection Semigroup.

   For the intersection Monoid<Set<A>>, the zero would need to be the set of all values for that type , which would requires instance of Enumerator<A> (we have) and Bounded<A> (we don't have yet).

   So this can be separated into two PRs if more manageable.
2. jbgi

   added

   good-first-issue

   on Oct 2, 2018
3. toxyduck commented on Oct 19, 2019

   

   toxyduck

   on Oct 19, 2019

   Contributor

   More actions

   Hello, I would like to contribute. Can you explain, Why do I need to use Bounded<A> for intersection monoid zero, if Enumerator<A> can provide max and min elements?
4. jbgi commented on Oct 19, 2019

   

   jbgi

   on Oct 19, 2019

   Member

   More actions

   max and min in Enumerator only return Option values and thus this is not very practical to instanciate the intersection Monoid. We could pass min and max explicitly though and not create Bounded for now.