Multiplier.java

public class Multiplier {
    // Multiply, like subtract, is built ontop of add's core functionality. In this  code, it's
    // repeatedly adding to a by b utilizing leftshift Every time b has a bit value set to true.
    public static void multiply(Word32 a, Word32 b, Word32 result) {
        clearWord(result);
        // Ignore any cases where a or b is negative, return result cleared as is.
        if (!a.equals(new Word32()) || !b.equals(new Word32())) {
            // temp is used to calculate the added result of a after each iteration.
            Word32 temp = new Word32();
            for (int i = 31; i >= 0; i--) {
                // bBit initialized and set to false, each iteration checks to see if its true.
                // If it's found to be true, then make a new shifted A, and then leftShift dpeneding on how far
                // the bit is from the right.
                Bit bBit = new Bit(false);
                b.getBitN(i, bBit);
                if (bBit.getValue() == Bit.boolValues.TRUE) {
                    Word32 shiftedA = new Word32();
                    Shifter.LeftShift(a, 31 - i, shiftedA);
                    // Add result by shiftedA and put it into temp, since a product of two binary numbers is the
                    // sum of all the leftshifted binaries at b bits set to 1.
                    Adder.add(result, shiftedA, temp);
                    temp.copy(result);
                }

            }
        }
    }
    public static void clearWord(Word32 input){
        for(int i = 0; i < 32; i++){
            input.setBitN(i, new Bit(false));
        }
    }

}