dongxian6653 2015-05-12 05:43
浏览 22
已采纳

快速切换位顺序的方法? [关闭]

I have a binary like this

10011011

My data store like this 10,01,10,11, but I want to reorder like this

11100110

The data look like 11,10,01,10.This operation same as ByteOrder convert but in bits level.

Any fast bitop way to do this ?

Currently, I have to decode this to four int then merge to one.

  • 写回答

2条回答 默认 最新

  • dpus81500574 2015-05-12 06:02
    关注

    The fastest way might be to precompute a table of all the values:

    final int[] values = new int[256];
    for (int i = 0; i < 256; ++i) {
        values[i] = (i & 0b1100_0000) >> 6
                    | (i & 0b0011_0000) >> 2
                    | (i & 0b0000_1100) << 2
                    | (i & 0b0000_0011) << 6;
    }
    

    and then use array lookups rather than bit manipulation.

    Naturally, you'll want to profile.

    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

悬赏问题

  • ¥15 微信小程序协议怎么写
  • ¥15 c语言怎么用printf(“\b \b”)与getch()实现黑框里写入与删除?
  • ¥20 怎么用dlib库的算法识别小麦病虫害
  • ¥15 华为ensp模拟器中S5700交换机在配置过程中老是反复重启
  • ¥15 java写代码遇到问题,求帮助
  • ¥15 uniapp uview http 如何实现统一的请求异常信息提示?
  • ¥15 有了解d3和topogram.js库的吗?有偿请教
  • ¥100 任意维数的K均值聚类
  • ¥15 stamps做sbas-insar,时序沉降图怎么画
  • ¥15 买了个传感器,根据商家发的代码和步骤使用但是代码报错了不会改,有没有人可以看看