文章详情

短信预约-IT技能 免费直播动态提醒

请输入下面的图形验证码

提交验证

短信预约提醒成功

android byte[] 和short[]转换的方法代码

2022-06-06 10:31

关注

1,工具代码
代码如下:
public class BytesTransUtil {

 private String TAG = "BytesTransUtil";
 private static BytesTransUtil instance = null;

 private BytesTransUtil() {
  // Log.i(TAG, "instance BytesTransUtil");
 }

 public static BytesTransUtil getInstance() {
  if (instance == null) {
   instance = new BytesTransUtil();
  }
  return instance;
 }

 public boolean testCPU() {
  if (ByteOrder.nativeOrder() == ByteOrder.BIG_ENDIAN) {
   // System.out.println("is big ending");
   return true;
  } else {
   // System.out.println("is little ending");
   return false;
  }
 }

 public byte[] getBytes(short s, boolean bBigEnding) {
  byte[] buf = new byte[2];
  if (bBigEnding)
   for (int i = buf.length - 1; i >= 0; i--) {
    buf[i] = (byte) (s & 0x00ff);
    s >>= 8;
   }
  else
   for (int i = 0; i < buf.length; i++) {
    buf[i] = (byte) (s & 0x00ff);
    s >>= 8;
   }
  return buf;
 }

 public byte[] getBytes(int s, boolean bBigEnding) {
  byte[] buf = new byte[4];
  if (bBigEnding) {
   for (int i = buf.length - 1; i >= 0; i--) {
    buf[i] = (byte) (s & 0x000000ff);
    s >>= 8;
   }
  } else {
   System.out.println("1");
   for (int i = 0; i < buf.length; i++) {
    buf[i] = (byte) (s & 0x000000ff);
    s >>= 8;
   }
  }
  return buf;
 }

 public byte[] getBytes(long s, boolean bBigEnding) {
  byte[] buf = new byte[8];
  if (bBigEnding)
   for (int i = buf.length - 1; i >= 0; i--) {
    buf[i] = (byte) (s & 0x00000000000000ff);
    s >>= 8;
   }
  else
   for (int i = 0; i < buf.length; i++) {
    buf[i] = (byte) (s & 0x00000000000000ff);
    s >>= 8;
   }
  return buf;
 }

 public short getShort(byte[] buf, boolean bBigEnding) {
  if (buf == null) {
   throw new IllegalArgumentException("byte array is null!");
  }
  if (buf.length > 2) {
   throw new IllegalArgumentException("byte array size > 2 !");
  }
  short r = 0;
  if (bBigEnding) {
   for (int i = 0; i < buf.length; i++) {
    r <<= 8;
    r |= (buf[i] & 0x00ff);
   }
  } else {
   for (int i = buf.length - 1; i >= 0; i--) {
    r <<= 8;
    r |= (buf[i] & 0x00ff);
   }
  }

  return r;
 }

 public int getInt(byte[] buf, boolean bBigEnding) {
  if (buf == null) {
   throw new IllegalArgumentException("byte array is null!");
  }
  if (buf.length > 4) {
   throw new IllegalArgumentException("byte array size > 4 !");
  }
  int r = 0;
  if (bBigEnding) {
   for (int i = 0; i < buf.length; i++) {
    r <<= 8;
    r |= (buf[i] & 0x000000ff);
   }
  } else {
   for (int i = buf.length - 1; i >= 0; i--) {
    r <<= 8;
    r |= (buf[i] & 0x000000ff);
   }
  }
  return r;
 }

 public long getLong(byte[] buf, boolean bBigEnding) {
  if (buf == null) {
   throw new IllegalArgumentException("byte array is null!");
  }
  if (buf.length > 8) {
   throw new IllegalArgumentException("byte array size > 8 !");
  }
  long r = 0;
  if (bBigEnding) {
   for (int i = 0; i < buf.length; i++) {
    r <<= 8;
    r |= (buf[i] & 0x00000000000000ff);
   }
  } else {
   for (int i = buf.length - 1; i >= 0; i--) {
    r <<= 8;
    r |= (buf[i] & 0x00000000000000ff);
   }
  }
  return r;
 }

 
 
 
 public byte[] getBytes(int i) {
  return getBytes(i, this.testCPU());
 }

 public byte[] getBytes(short s) {
  return getBytes(s, this.testCPU());
 }

 public byte[] getBytes(long l) {
  return getBytes(l, this.testCPU());
 }

 public int getInt(byte[] buf) {
  return getInt(buf, this.testCPU());
 }

 public short getShort(byte[] buf) {
  return getShort(buf, this.testCPU());
 }

 public long getLong(byte[] buf) {
  return getLong(buf, this.testCPU());
 }

 
 public short[] Bytes2Shorts(byte[] buf) {
  byte bLength = 2;
  short[] s = new short[buf.length / bLength];
  for (int iLoop = 0; iLoop < s.length; iLoop++) {
   byte[] temp = new byte[bLength];
   for (int jLoop = 0; jLoop < bLength; jLoop++) {
    temp[jLoop] = buf[iLoop * bLength + jLoop];
   }
   s[iLoop] = getShort(temp);
  }
  return s;
 }

 public byte[] Shorts2Bytes(short[] s) {
  byte bLength = 2;
  byte[] buf = new byte[s.length * bLength];
  for (int iLoop = 0; iLoop < s.length; iLoop++) {
   byte[] temp = getBytes(s[iLoop]);
   for (int jLoop = 0; jLoop < bLength; jLoop++) {
    buf[iLoop * bLength + jLoop] = temp[jLoop];
   }
  }
  return buf;
 }

 
 public int[] Bytes2Ints(byte[] buf) {
  byte bLength = 4;
  int[] s = new int[buf.length / bLength];
  for (int iLoop = 0; iLoop < s.length; iLoop++) {
   byte[] temp = new byte[bLength];
   for (int jLoop = 0; jLoop < bLength; jLoop++) {
    temp[jLoop] = buf[iLoop * bLength + jLoop];
   }
   s[iLoop] = getInt(temp);
   System.out.println("2out->"+s[iLoop]);
  }
  return s;
 }

 public byte[] Ints2Bytes(int[] s) {
  byte bLength = 4;
  byte[] buf = new byte[s.length * bLength];
  for (int iLoop = 0; iLoop < s.length; iLoop++) {
   byte[] temp = getBytes(s[iLoop]);
   System.out.println("1out->"+s[iLoop]);
   for (int jLoop = 0; jLoop < bLength; jLoop++) {
    buf[iLoop * bLength + jLoop] = temp[jLoop];
   }
  }
  return buf;
 }

 
 public long[] Bytes2Longs(byte[] buf) {
  byte bLength = 8;
  long[] s = new long[buf.length / bLength];
  for (int iLoop = 0; iLoop < s.length; iLoop++) {
   byte[] temp = new byte[bLength];
   for (int jLoop = 0; jLoop < bLength; jLoop++) {
    temp[jLoop] = buf[iLoop * bLength + jLoop];
   }
   s[iLoop] = getLong(temp);
  }
  return s;
 }

 public byte[] Longs2Bytes(long[] s) {
  byte bLength = 8;
  byte[] buf = new byte[s.length * bLength];
  for (int iLoop = 0; iLoop < s.length; iLoop++) {
   byte[] temp = getBytes(s[iLoop]);
   for (int jLoop = 0; jLoop < bLength; jLoop++) {
    buf[iLoop * bLength + jLoop] = temp[jLoop];
   }
  }
  return buf;
 }

}

2,测试代码
代码如下:
public class main {

 public static void main(String[] args) {
  // TODO Auto-generated method stub
  //简单测试了short[] 转byte[],其他类似;
  BytesTransUtil bytesTransUtil = BytesTransUtil.getInstance();
  int[] sTest = { 12345678, 87654321 };
  byte[] byteShort = bytesTransUtil.Ints2Bytes(sTest);
  int[] sTemp = bytesTransUtil.Bytes2Ints(byteShort);
  System.out.println("short[0] = " + sTemp[0] + "   short[1] = " + sTemp[1]);
 }
}


阅读原文内容投诉

免责声明:

① 本站未注明“稿件来源”的信息均来自网络整理。其文字、图片和音视频稿件的所属权归原作者所有。本站收集整理出于非商业性的教育和科研之目的,并不意味着本站赞同其观点或证实其内容的真实性。仅作为临时的测试数据,供内部测试之用。本站并未授权任何人以任何方式主动获取本站任何信息。

② 本站未注明“稿件来源”的临时测试数据将在测试完成后最终做删除处理。有问题或投稿请发送至: 邮箱/279061341@qq.com QQ/279061341

软考中级精品资料免费领

  • 历年真题答案解析
  • 备考技巧名师总结
  • 高频考点精准押题
  • 2024年上半年信息系统项目管理师第二批次真题及答案解析(完整版)

    难度     813人已做
    查看
  • 【考后总结】2024年5月26日信息系统项目管理师第2批次考情分析

    难度     354人已做
    查看
  • 【考后总结】2024年5月25日信息系统项目管理师第1批次考情分析

    难度     318人已做
    查看
  • 2024年上半年软考高项第一、二批次真题考点汇总(完整版)

    难度     435人已做
    查看
  • 2024年上半年系统架构设计师考试综合知识真题

    难度     224人已做
    查看

相关文章

发现更多好内容

猜你喜欢

AI推送时光机
位置:首页-资讯-移动开发
咦!没有更多了?去看看其它编程学习网 内容吧
首页课程
资料下载
问答资讯