1 package net.mograsim.logic.core.types;
3 import java.util.Arrays;
5 import java.util.Objects;
8 * stdlogic according to IEEE 1164
10 public enum Bit implements StrictLogicType<Bit>
12 U("U"), X("X"), ZERO("0"), ONE("1"), Z("Z");
14 private final String symbol;
16 private Bit(String symbol)
22 public Bit and(Bit other)
24 return fromTable(AND_TABLE, this, other);
28 public Bit or(Bit other)
30 return fromTable(OR_TABLE, this, other);
34 public Bit xor(Bit other)
36 return fromTable(XOR_TABLE, this, other);
55 public Bit[] makeArray(int length)
57 Bit[] bits = new Bit[length];
58 Arrays.fill(bits, this);
62 public BitVector toVector(int length)
64 return BitVector.of(this, length);
68 public Bit join(Bit other)
70 return fromTable(JOIN_TABLE, this, other);
74 public String toString()
79 public String getSymbol()
84 public static Bit lastBitOf(int value)
86 return values()[2 + (value & 1)];
89 public static Bit parse(String s)
91 Bit bit = SYMBOL_MAP.get(s);
92 Objects.requireNonNull(bit, "No Bit found for symbol " + s);
96 public static Bit parse(String s, int symbolPosition)
98 return parse(s.substring(symbolPosition, symbolPosition + 1));
101 private static Bit fromTable(Bit[][] table, Bit a, Bit b)
103 return table[a.ordinal()][b.ordinal()];
106 static final Map<String, Bit> SYMBOL_MAP = Map.of(U.symbol, U, X.symbol, X, ZERO.symbol, ZERO, ONE.symbol, ONE, Z.symbol, Z);
109 private static final Bit[][] JOIN_TABLE =
112 { U, X, ZERO, X, ZERO },
113 { U, X, X, ONE, ONE },
114 { U, X, ZERO, ONE, Z } };
116 private static final Bit[][] AND_TABLE =
117 { { U, U, ZERO, U, U },
118 { U, X, ZERO, X, X },
119 { ZERO, ZERO, ZERO, ZERO, ZERO },
120 { U, X, ZERO, ONE, X },
121 { U, X, ZERO, X, X } };
123 private static final Bit[][] OR_TABLE =
124 { { U, U, U, ONE, U },
126 { U, X, ZERO, ONE, X },
127 { ONE, ONE, ONE, ONE, ONE },
128 { U, X, X, ONE, X } };
130 private static final Bit[][] XOR_TABLE =
133 { U, X, ZERO, ONE, X },
134 { U, X, ONE, ZERO, X },