TestConverter.java

public class TestConverter {
    // fromInt converts a integer number to a binary number.
    public static void fromInt(int value, Word32 result) {
        // isNegative checks to see if the val is less than 0, if so prepare to negate it by adding 1 and conditionally manipulating the bits
        // (depending on whether its a negative or not)
        boolean isNegative = (value < 0);
        int index = 31;
        if(isNegative)
            value++;
        // while the value isn't 0, divide it by 2, if the remainder after being divided isn't true, then set it to 1 (or 0). If it's negative and odd, then
        // also set the bit to true.
        while(value != 0){
            if(!isNegative && ((value % 2) == 0))
                result.setBitN(index, new Bit(false));
            else if(!isNegative && ((value % 2) != 0))
                result.setBitN(index, new Bit(true));
            else if(isNegative && ((value % 2) == 0))
                result.setBitN(index, new Bit(true));
            else
                result.setBitN(index, new Bit(false));
            index--;
            value /=2;
        }
        // If after the value is 0 and there's still remaining indexes, will it with true
        if(isNegative){
            for(int i = index; i > -1; i--)
                result.setBitN(i, new Bit(true));
        }
        // Else fill it with 0's (as typical for positive integers)
        else{
            for(int i = index; i > -1; i--)
                result.setBitN(i, new Bit(false));
        }
    }
    // toInt returns a Word32's value as a positive number. It uses twoPower to determine which powers of two are being used to create the
    // final result. It gets the bit, and after getting its position within the binary number it adds by powers of 2 to the result.
    public static int toInt(Word32 value) {
        int fin = 0;
        int adder = 0;
        for(int i = 31; i > -1; i--){
            Bit res = new Bit(false);
            value.getBitN(i, res);
            if(res.getValue() == Bit.boolValues.TRUE)
                fin += twoPower(adder);
            adder++;
        }
        return fin;
    }
    // twoPower takes an integer input and returns 2^pow
    private static int twoPower(int pow){
        if(pow == 0)
            return 1;
        else if(pow == 1)
            return 2;
        int fin = 2;
        for(int i = 0; i < pow-1; i++)
            fin *= 2;
        return fin;
    }
}