Java 實現多位元組移位操作

////演算法很簡單，就是每移一個位元組，保留移位溢出的BIT 位，儲存為一個位元組以備和下一個位元組進行組合。public static void main(String[] args) {byte [] data = Hex.fromString("00E8080000000065289BBAEF2EC78CCD0F13571AD01BAE68000001BBB00818");byte [] out = rightShift(data,(byte) 3);System.out.println(Hex.toString(out));}public static byte[] rightShift(byte [] data , byte shiftVal){//     // 00E80800 - > 0000 0000 1110 1000 0000 1000|||| left shift - 5 ----->  0001 1101 00byte [] out = new byte[data.length +1];int offset = 0;byte first = (byte) ( ((data[0]&0xff )>> shiftVal) );out[offset++] = first;for (int i = 0 ; i < data.length-1 ; i++){// right shift 3 // get last 3bits of this byte .combine these 3 bit as a byte.//  that byte OR the next shifted[3] byte  //---------------//overflowed 3 bitbyte overflowed = (byte) ((data[i]&0xff) << (8-shiftVal));byte next = (byte) (overflowed | ((data[i+1]&0xff)>>shiftVal));out[offset++] = next;}return out;}