Java BitSet isHammingDistanceOne(BitSet a, BitSet b)

Description

is Hamming Distance One

License

Open Source License

Declaration

public static boolean isHammingDistanceOne(BitSet a, BitSet b) 

Method Source Code

//package com.java2s;
/*//from   w  w  w . ja v  a 2  s.com
 * Copyright (C) 2014 - 2015 Norman Kluge
 * 
 * This file is part of ASGlogic.
 * 
 * ASGlogic is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * ASGlogic is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with ASGlogic.  If not, see <http://www.gnu.org/licenses/>.
 */

import java.util.BitSet;

public class Main {
    public static boolean isHammingDistanceOne(BitSet a, BitSet b) {
        int distance = 0;
        int i = 0;
        while (i < a.size()) {
            if (a.get(i) != b.get(i)) {
                distance++;
            }
            i++;
            if (distance > 1) {
                return false;
            }
        }
        if (distance == 1) {
            return true;
        }

        return false;
    }
}

Related

1. insertBits(BitSet fromSet, int insertBefore, int count)
2. intArrToBitSet(ArrayList integerArray)
3. intToBitSet(int value)
4. invertInPlace(BitSet bs, int n)
5. isEmptySet(BitSet setToTest)
6. isSet(int n, BitSet... sets)
7. isSubset(BitSet bits1, BitSet bits2)
8. isSubset(BitSet subsetToTest, BitSet supersetToTest)
9. isSubSet(BitSet x, BitSet y)