1 package net.mograsim.logic.model.am2900;
3 public final class TestUtil
11 * Transforms the last four bits of an int to a string that contains the binary ('1' and '0') representation of the 4 bits
13 * @author Christian Femers
15 public static String to4bitBin(int x)
17 StringBuilder sb = new StringBuilder(4);
18 sb.append((x & 0b1000) == 0 ? '0' : '1');
19 sb.append((x & 0b0100) == 0 ? '0' : '1');
20 sb.append((x & 0b0010) == 0 ? '0' : '1');
21 sb.append((x & 0b0001) == 0 ? '0' : '1');
26 * Transforms the given boolean to a string that contains the binary ('1' and '0') representation of the bit
28 * @author Christian Femers
30 public static String to1bitBin(boolean bitIsSet)
32 return bitIsSet ? "1" : "0";
36 * Transforms the given int to a string that contains the binary ('1' and '0') representation of the int. "0" is only returned when the
37 * int is equal to zero.
39 * @author Christian Femers
41 public static String to1bitBin(int someInt)
43 return someInt != 0 ? "1" : "0";
47 * Transforms a 4 bit signed integer (-8 to 7) to a int representing the same number. (Adding leading 1-bits if the 4 bit int is
50 * @author Christian Femers
52 public static int signed4ToSigned32(int signed4bit)
54 if ((signed4bit & 0b1000) > 0)
55 return signed4bit | 0xFF_FF_FF_F0;
56 return signed4bit & 0x00_00_00_0F;
60 * Transforms a 16 bit signed integer (-32768 to 32767 - a short) to a int representing the same number. (Adding leading 1-bits if the
61 * 16 bit int is negative)
63 * @author Christian Femers
65 public static int signed16ToSigned32(int signed16bit)
67 return (short) signed16bit;
71 * Transforms the last n bits of an int to a string that contains the binary ('1' and '0') representation of the n bits
73 * @author Christian Femers
75 public static String toNbitString(int x, int n)
77 StringBuilder sb = new StringBuilder(n);
78 for (int i = 0; i < n; i++)
80 sb.append((x >> i) & 1);
82 return sb.reverse().toString();