| 1 | // Copyright (c) 2018, Yubico AB | |
| 2 | // All rights reserved. | |
| 3 | // | |
| 4 | // Redistribution and use in source and binary forms, with or without | |
| 5 | // modification, are permitted provided that the following conditions are met: | |
| 6 | // | |
| 7 | // 1. Redistributions of source code must retain the above copyright notice, this | |
| 8 | // list of conditions and the following disclaimer. | |
| 9 | // | |
| 10 | // 2. Redistributions in binary form must reproduce the above copyright notice, | |
| 11 | // this list of conditions and the following disclaimer in the documentation | |
| 12 | // and/or other materials provided with the distribution. | |
| 13 | // | |
| 14 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
| 15 | // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 16 | // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | |
| 17 | // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE | |
| 18 | // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
| 19 | // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR | |
| 20 | // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER | |
| 21 | // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, | |
| 22 | // OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 23 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 24 | ||
| 25 | package com.yubico.internal.util; | |
| 26 | ||
| 27 | import java.util.Iterator; | |
| 28 | import java.util.SortedSet; | |
| 29 | ||
| 30 | public class ComparableUtil { | |
| 31 | ||
| 32 | public static <T extends Comparable<T>> int compareComparableSets( | |
| 33 | SortedSet<T> a, SortedSet<T> b) { | |
| 34 |
1
1. compareComparableSets : negated conditional → KILLED |
if (a.size() == b.size()) { |
| 35 | final Iterator<T> as = a.iterator(); | |
| 36 | final Iterator<T> bs = b.iterator(); | |
| 37 | ||
| 38 |
2
1. compareComparableSets : negated conditional → SURVIVED 2. compareComparableSets : negated conditional → KILLED |
while (as.hasNext() && bs.hasNext()) { |
| 39 | final int comp = as.next().compareTo(bs.next()); | |
| 40 |
1
1. compareComparableSets : negated conditional → KILLED |
if (comp != 0) { |
| 41 |
1
1. compareComparableSets : replaced int return with 0 for com/yubico/internal/util/ComparableUtil::compareComparableSets → KILLED |
return comp; |
| 42 | } | |
| 43 | } | |
| 44 | ||
| 45 |
1
1. compareComparableSets : negated conditional → KILLED |
if (as.hasNext()) { |
| 46 |
1
1. compareComparableSets : replaced int return with 0 for com/yubico/internal/util/ComparableUtil::compareComparableSets → NO_COVERAGE |
return 1; |
| 47 |
1
1. compareComparableSets : negated conditional → KILLED |
} else if (bs.hasNext()) { |
| 48 |
1
1. compareComparableSets : replaced int return with 0 for com/yubico/internal/util/ComparableUtil::compareComparableSets → NO_COVERAGE |
return -1; |
| 49 | } else { | |
| 50 | return 0; | |
| 51 | } | |
| 52 | } else { | |
| 53 |
2
1. compareComparableSets : replaced int return with 0 for com/yubico/internal/util/ComparableUtil::compareComparableSets → KILLED 2. compareComparableSets : Replaced integer subtraction with addition → KILLED |
return a.size() - b.size(); |
| 54 | } | |
| 55 | } | |
| 56 | } | |
Mutations | ||
| 34 |
1.1 |
|
| 38 |
1.1 2.2 |
|
| 40 |
1.1 |
|
| 41 |
1.1 |
|
| 45 |
1.1 |
|
| 46 |
1.1 |
|
| 47 |
1.1 |
|
| 48 |
1.1 |
|
| 53 |
1.1 2.2 |