X-Git-Url: https://mograsim.net/gitweb/?a=blobdiff_plain;ds=sidebyside;f=era.mi%2Fsrc%2Fera%2Fmi%2Flogic%2FUtil.java;h=05671387e79a111d978d5db843d71bbe1dee550d;hb=2427bceeaf96fefbd92ea04d7ebbb52606a7b2ff;hp=88b2393f9b95a092920653d7bdea8ebcfa0270fb;hpb=655a318fe9402e6c54e4ba70eb5f75a70b1f435a;p=Mograsim.git

diff --git a/era.mi/src/era/mi/logic/Util.java b/era.mi/src/era/mi/logic/Util.java
index 88b2393f..05671387 100644
--- a/era.mi/src/era/mi/logic/Util.java
+++ b/era.mi/src/era/mi/logic/Util.java
@@ -2,6 +2,8 @@ package era.mi.logic;
 
 import java.util.Arrays;
 
+import era.mi.logic.types.Bit;
+
 public final class Util
 {
 
@@ -50,17 +52,17 @@ public final class Util
 
 	public static Bit[] and(Bit[] a, Bit[] b)
 	{
-		return binBitOp(a, b, (bA, bB) -> Bit.and(bA, bB));
+		return binBitOp(a, b, Bit::and);
 	}
 
 	public static Bit[] or(Bit[] a, Bit[] b)
 	{
-		return binBitOp(a, b, (bA, bB) -> Bit.or(bA, bB));
+		return binBitOp(a, b, Bit::or);
 	}
 
 	public static Bit[] xor(Bit[] a, Bit[] b)
 	{
-		return binBitOp(a, b, (bA, bB) -> Bit.xor(bA, bB));
+		return binBitOp(a, b, Bit::xor);
 	}
 
 	private static Bit[] binBitOp(Bit[] a, Bit[] b, BitOp op)
@@ -96,7 +98,7 @@ public final class Util
 			throw new IllegalArgumentException("Bit Arrays were not of equal length.");
 		for (int i = 0; i < addition.length; i++)
 		{
-			dest[i] = dest[i].combineWith(addition[i]);
+			dest[i] = dest[i].join(addition[i]);
 		}
 		return dest;
 	}