Shift operator in Java

Lawrence 2020-11-11 17:30:32
shift operator java


1、 Shift left operator :<<

Let's define a random int Number of types int, Decimal value = 733183670, The conversion to binary is represented in the computer as follows :

value << 1, Move left 1 position

Move left 1 The value converted to decimal is :1466367340, just 733183670 Twice as many , Some people are riding 2 I like to use the left shift operator instead of .

value << 8, Move left 8 Let's have a look :

Move left 8 The value that becomes decimal after bit is :-1283541504, Move 8 Behind you , Because the first place became 1, That is to say, it becomes a negative number , In use, we should consider the case of negative numbers .

According to this rule , Move left 32 Behind you , On the right 32 individual 0 Does the value become decimal 0 了 ? The answer is NO, When int When type moves left , Left shift is greater than or equal to 32 Bit operation , I will ask for the surplus first (%) Then move left . That is to say, shift left 32 Bit is equivalent to no shift operation , Move left 40 Bit is equivalent to a left shift 8 position (40%32=8). When long When type moves left ,long The representation of type in binary is 64 Bit , So the cardinality of the remainder operation becomes 64, That is to say, shift left 64 Bit is equivalent to no shift , Move left 72 Bit is equivalent to a left shift 8 position (72%64=8), Write a piece of code to test

int intValue = 733183670;// Write a random number
System.out.println("intValue:" + (intValue));// Print intValue System.out.println("intValue Move left 1 position :" + (intValue << 1));// Move left 1 position System.out.println("intValue Move left 8 position :" + (intValue << 8));// Move left 8 position // When int Type shift left is greater than or equal to 32 Bit operation , Will be the remainder before the shift operation
System.out.println("intValue Move left 32 position :" + (intValue << 32));// The rest is 32%32=0, It's equivalent to moving left 0 position ( No displacement )
System.out.println("intValue Move left 40 position :" + (intValue << 40));// The rest is 40%32=8, It's equivalent to moving left 8 position
System.out.println("intValue Move left 64 position :" + (intValue << 64));// The rest is 64%32=0, It's equivalent to moving left 0 position ( No displacement )
long longValue = 733183670L;
System.out.println("longValue:" + (longValue));// Print longValue System.out.println("longValue Move left 1 position :" + (longValue << 1));// Move left 1 position System.out.println("longValue Move left 8 position :" + (longValue << 8));// Move left 8 position // When long Type shift left is greater than or equal to 64 Bit operation , Will be the remainder before the shift operation
System.out.println("longValue Move left 64 position :" + (longValue << 64));// The rest is 64%64=0, It's equivalent to moving left 0 position ( No displacement )
System.out.println("longValue Move left 72 position :" + (longValue << 72));// The rest is 72%64=8, It's equivalent to moving left 8 position
System.out.println("longValue Move left 128 position :" + (longValue << 128));// The rest is 128%64=0, It's equivalent to moving left 0 position ( No displacement )

Take a look at the results :

because double,float It's very special in binary , So we can't do the shift operation , Report errors , Compile but , Here's the picture :

Be careful : Other kinds of plastic surgery byte,short It will be converted to int type (32 position ) And then move it , There's no code testing here , If you are interested, you can test it yourself .

in summary : Move left << It's very simple , in other words Discard the specified number of digits on the left , The right to repair 0.

2、 Shift right operator :>>

It's still this number :733183670

value >> 1, Move right 1 position

Move right 1 The value converted to decimal is :366591835, just 733183670 Of 1 And a half , Some people are removing 2 You like to use the right shift operator instead of

value >> 8, Move right 8 Let's have a look

Write a code to test


java
int intValue = 733183670;// Write a random number System.out.println("intValue:" + (intValue));// Print intValue System.out.println("intValue Move right 1 position :" + (intValue >> 1));// Move right 1 position System.out.println("intValue Move right 8 position :" + (intValue >> 8));// Move right 8 position // When int Type shift right is greater than or equal to 32 Bit operation , Will be the remainder before the shift operation
System.out.println("intValue Move right 32 position :" + (intValue >> 32));// The rest is 32%32=0, It's equivalent to moving right 0 position ( No displacement )
System.out.println("intValue Move right 40 position :" + (intValue >> 40));// The rest is 40%32=8, It's equivalent to moving right 8 position
System.out.println("intValue Move right 64 position :" + (intValue >> 64));// The rest is 64%32=0, It's equivalent to moving right 0 position ( No displacement )
long longValue = 733183670L;
System.out.println("longValue:" + (longValue));// Print longValue System.out.println("longValue Move right 1 position :" + (longValue >> 1));// Move right 1 position System.out.println("longValue Move right 8 position :" + (longValue >> 8));// Move right 8 position // When long Type shift right is greater than or equal to 64 Bit operation , Will be the remainder before the shift operation
System.out.println("longValue Move right 64 position :" + (longValue >> 64));// The rest is 64%64=0, It's equivalent to moving right 0 position ( No displacement )
System.out.println("longValue Move right 72 position :" + (longValue >> 72));// The rest is 72%64=8, It's equivalent to moving right 8 position
System.out.println("longValue Move right 128 position :" + (longValue >> 128));// The rest is 128%64=0, It's equivalent to moving right 0 position ( No displacement )

result :

It's the same as moving left ,int Type shift is greater than or equal to 32 When a ,long Type is greater than or equal to 64 When a , Will do residual processing first, then displacement processing ,byte,short It will be converted to int type (32 position ) And then move it . That's a positive displacement , Let's look at the right shift of negative numbers , Pictured , negative intValue:-733183670 The binary representation of is shown in the figure below :

Move right 8 position ,intValue >> 8

in summary : Shift right operator >> The rules of operation are also very simple , Discard the specified number of digits on the right , Fill in the sign on the left .

3、 Unsigned shift right operator :>>>

Unsigned shift right operator >>> And the shift right operator >> It's the same , It's just that when you shift right, the left is filled with the sign bit , The unsigned right shift operator is a complement 0, in other words , For a positive shift, it is equivalent to :>>, Negative numbers can be shifted to positive numbers by this shift operator . With -733183670>>>8 For example, draw a picture

Unsigned shift right operator >> The rules of operation are also very simple , Discard the specified number of digits on the right , Make up on the left 0.

版权声明
本文为[Lawrence]所创,转载请带上原文链接,感谢

  1. 【计算机网络 12(1),尚学堂马士兵Java视频教程
  2. 【程序猿历程,史上最全的Java面试题集锦在这里
  3. 【程序猿历程(1),Javaweb视频教程百度云
  4. Notes on MySQL 45 lectures (1-7)
  5. [computer network 12 (1), Shang Xuetang Ma soldier java video tutorial
  6. The most complete collection of Java interview questions in history is here
  7. [process of program ape (1), JavaWeb video tutorial, baidu cloud
  8. Notes on MySQL 45 lectures (1-7)
  9. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  10. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  11. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  12. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  13. 【递归,Java传智播客笔记
  14. [recursion, Java intelligence podcast notes
  15. [adhere to painting for 386 days] the beginning of spring of 24 solar terms
  16. K8S系列第八篇(Service、EndPoints以及高可用kubeadm部署)
  17. K8s Series Part 8 (service, endpoints and high availability kubeadm deployment)
  18. 【重识 HTML (3),350道Java面试真题分享
  19. 【重识 HTML (2),Java并发编程必会的多线程你竟然还不会
  20. 【重识 HTML (1),二本Java小菜鸟4面字节跳动被秒成渣渣
  21. [re recognize HTML (3) and share 350 real Java interview questions
  22. [re recognize HTML (2). Multithreading is a must for Java Concurrent Programming. How dare you not
  23. [re recognize HTML (1), two Java rookies' 4-sided bytes beat and become slag in seconds
  24. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  25. RPC 1: how to develop RPC framework from scratch
  26. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  27. RPC 1: how to develop RPC framework from scratch
  28. 一次性捋清楚吧,对乱糟糟的,Spring事务扩展机制
  29. 一文彻底弄懂如何选择抽象类还是接口,连续四年百度Java岗必问面试题
  30. Redis常用命令
  31. 一双拖鞋引发的血案,狂神说Java系列笔记
  32. 一、mysql基础安装
  33. 一位程序员的独白:尽管我一生坎坷,Java框架面试基础
  34. Clear it all at once. For the messy, spring transaction extension mechanism
  35. A thorough understanding of how to choose abstract classes or interfaces, baidu Java post must ask interview questions for four consecutive years
  36. Redis common commands
  37. A pair of slippers triggered the murder, crazy God said java series notes
  38. 1、 MySQL basic installation
  39. Monologue of a programmer: despite my ups and downs in my life, Java framework is the foundation of interview
  40. 【大厂面试】三面三问Spring循环依赖,请一定要把这篇看完(建议收藏)
  41. 一线互联网企业中,springboot入门项目
  42. 一篇文带你入门SSM框架Spring开发,帮你快速拿Offer
  43. 【面试资料】Java全集、微服务、大数据、数据结构与算法、机器学习知识最全总结,283页pdf
  44. 【leetcode刷题】24.数组中重复的数字——Java版
  45. 【leetcode刷题】23.对称二叉树——Java版
  46. 【leetcode刷题】22.二叉树的中序遍历——Java版
  47. 【leetcode刷题】21.三数之和——Java版
  48. 【leetcode刷题】20.最长回文子串——Java版
  49. 【leetcode刷题】19.回文链表——Java版
  50. 【leetcode刷题】18.反转链表——Java版
  51. 【leetcode刷题】17.相交链表——Java&python版
  52. 【leetcode刷题】16.环形链表——Java版
  53. 【leetcode刷题】15.汉明距离——Java版
  54. 【leetcode刷题】14.找到所有数组中消失的数字——Java版
  55. 【leetcode刷题】13.比特位计数——Java版
  56. oracle控制用户权限命令
  57. 三年Java开发,继阿里,鲁班二期Java架构师
  58. Oracle必须要启动的服务
  59. 万字长文!深入剖析HashMap,Java基础笔试题大全带答案
  60. 一问Kafka就心慌?我却凭着这份,图灵学院vip课程百度云