Home  >  Article  >  Java  >  Detailed introduction to Java's method examples of binary processing based on shift operations

Detailed introduction to Java's method examples of binary processing based on shift operations

黄舟
黄舟Original
2017-03-08 11:12:021262browse

This article mainly introduces Java's method of binary processing based on shift operations. It analyzes Java's binary shift operation processing techniques in the form of examples. Friends in need can refer to it

The examples in this article describe Java's shift operations based on Methods for implementing binary processing. Share it with everyone for your reference, the details are as follows:

/**
 * @author openks
 * @since 2013-9-21 移位操作实例
 */
public class TestDisplacement {
  /**
   * @param args
   */
  public static void main(String[] args) {
    // 十进制数字2向左移3位 即 二进制的10向左移3位即10000 转换为十进制为2的4次方 即16
    System.out.println("2向左移三位:" + (2 << 3));
    System.out.println("7向左移一位:" + (7 << 1));
    System.out.println("7向右移一位:" + (7 >> 1));
    int n = 3;
    System.out.println("2的" + n + "次方:" + (int) Math.pow(2, n));
    System.out.println("1向左移" + n + "位:" + (1 << n));
    System.out.println("可见2的N次方和1左移N位的值相等。。");
  }
}

/**
 * @author openks
 * @since 2013-9-21
 * 二进制十进制的处理 可用于权限控制 可最多管理32项权限
 */
public class TestBinary {
  /**
   * 获取十进制数字k转换为二进制后第index位的值
   * @param k 十进制数字
   * @param index 第index位 (从1开始)
   * @return 十进制数字转换为二进制后第index位的值
   */
  public static int getValue(Integer k,int index){
    String string = Integer.toBinaryString(k);
    int len = string.length();
    System.out.println("二进制串为:"+string+"\n共有"+len+"位");
    if(index>len){
      return 0;
    }else{
      return string.charAt(len-index)-&#39;0&#39;;
    }
  }
  /**
   * 设置十进制数字k转换为二进制后第index位的值并返回处理后的十进制数字
   * @param k 十进制数字k
   * @param index 第index位 (从1开始)
   * @param m 该index位上的值 只有0,1两种选择
   * @return 处理后的十进制数字
   */
  public static int setValue(Integer k,int index,Integer m){
    //相当于2的index-1次方
    Integer t = 1<<(index-1);
    if(t>k){
      if(m==1){
        return t+k;
      }else{
        return k;
      }
    }else{
      int m1 = getValue(k,index);
      if(m1==0){
        return k+t;
      }else{
        return k-t;
      }
    }
  }
  /**
   * @param args
   */
  public static void main(String[] args) {
    int a=25;//原来权限值
    int i=2;//要查看的位数
    int d = 2;//要修改的位数
    a= setValue(a, d, 1);//修改第d位的值为1
    System.out.println("第"+i+"位的值为:"+getValue(a,i));
  }
}


The above is the detailed content of Detailed introduction to Java's method examples of binary processing based on shift operations. For more information, please follow other related articles on the PHP Chinese website!

Statement:
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn