collections - Fastest way to implement subset in Scala -
so according wikipedia (proposition 8) following statements equivalent:
- a
is subset ofb - a
intersectionb equals a - a
unionb equals b - a
differenceb equals empty set
scala gives union, intersection , difference operators, set equality.
given that, efficient (runtime) way implement subset function in scala?
Comments
Post a Comment