verifyInclusionExclusion2<T> static method

bool verifyInclusionExclusion2<T>(CustomSet<T> a, CustomSet<T> b)

Verifies the Inclusion-Exclusion Principle for two sets.

Returns true if: |A ∪ B| = |A| + |B| - |A ∩ B|

This method can be used to verify the correctness of set operations.

Example:

final a = CustomSet<int>([1, 2, 3, 4]);
final b = CustomSet<int>([3, 4, 5, 6]);
print(CardinalityUtils.verifyInclusionExclusion2(a, b)); // Output: true

Implementation

static bool verifyInclusionExclusion2<T>(CustomSet<T> a, CustomSet<T> b) {
  final actualUnion = SetOperations.union(a, b).cardinality;
  final calculatedUnion = unionCardinality(a, b);
  return actualUnion == calculatedUnion;
}