static <A> int countIntersection(Set<A> a, Set<A> b) {
  if (a == null || b == null) ret 0;
  int n = 0;
  for (A x : a) if (b.contains(x)) ++n;
  ret n;
}