2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $$Year-Rel$$ The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
28 * Returns the count of things that are in one or other of two sets but not in
29 * both. The sets are not modified.
35 public static int countDisjunction(Set<? extends Object> set1,
36 Set<? extends Object> set2)
40 return set2 == null ? 0 : set2.size();
47 int size1 = set1.size();
48 int size2 = set2.size();
49 Set<? extends Object> smallerSet = size1 < size2 ? set1 : set2;
50 Set<? extends Object> largerSet = (smallerSet == set1 ? set2 : set1);
52 for (Object k : smallerSet)
54 if (largerSet.contains(k))
60 int notInCommon = (size1 - inCommon) + (size2 - inCommon);