Javac语法糖之EnumSwitch
在Switch中可以使用的类型有枚举、字符串类型与整形int类型,下面来具体看这几个类型。
1、switch为枚举类型
枚举类:
enum Fruit {
APPLE,ORINGE
}
调用javac生成的代码如下:
enum Fruit{
private <init>(/*synthetic*/ String $enum$name,
/*synthetic*/ int $enum$ordinal) {
super($enum$name, $enum$ordinal);
}
/*public static final*/ APPLE /* = new Fruit("APPLE", 0) */
/*public static final*/ ORINGE /* = new Fruit("ORINGE", 1) */
/*synthetic*/ private static final Fruit[] $VALUES =
new Fruit[]{Fruit.APPLE, Fruit.ORINGE}
public static Fruit[] values() {
return (Fruit[])$VALUES.clone();
}
public static Fruit valueOf(String name) {
return (Fruit)Enum.valueOf(Fruit.class, name);
}
}
Enum在Java中也被当作一个类来处理,并且Enum也算是Java中的语法糖,主要通过Javac中的Lower类来处理枚举这个语法糖的。
查看javac的英文说明,如下:
This map gives a translation table to be used for enum switches.
For each enum that appears as the type of a switch expression, we maintain an EnumMapping(举例) to assist in the translation, as exemplified by the following example:
we translate
Fruit fruit = Fruit.APPLE;
switch (fruit) {
case APPLE:
System.out.println("apple");
break;
case ORANGE:
System.out.println("orange");
break;
default:
System.out.println("unknow");
}
into
switch (com.test19.TestEnumClass$1.$SwitchMap$com$test19$Fruit[(fruit).ordinal()]) {
case 1:
System.out.println("apple");
break;
case 2:
System.out.println("orange");
break;
default:
System.out.println("unknow");
}
with the auxiliary table initialized as follows:
/*synthetic*/ class TestEnumClass$1 {
/*synthetic*/ static final int[] $SwitchMap$com$test19$Fruit = new int[Fruit.values().length];
static {
try {
com.test19.TestEnumClass$1.$SwitchMap$com$test19$Fruit[Fruit.APPLE.ordinal()] = 1;
} catch (NoSuchFieldError ex) {
}
try {
com.test19.TestEnumClass$1.$SwitchMap$com$test19$Fruit[Fruit.ORANGE.ordinal()] = 2;
} catch (NoSuchFieldError ex) {
}
}
}
class EnumMapping provides mapping data and support methods for this translation.
2、switch为字符串类型
下面继续来看switch对于字符串的处理。
The general approach used is to translate a single string switch statement into a series of two chained switch statements:
使用的一般方法是将一个字符串类型的switch语句翻译为两个switch语句:
the first a synthesized statement switching on the argument string's hash value and
computing a string's position in the list of original case labels, if any, followed by a second switch on the
computed integer value.
The second switch has the same code structure as the original string switch statement
except that the string case labels are replaced with positional integer constants starting at 0.
The first switch statement can be thought of as an inlined map from strings to their position in the case
label list. An alternate implementation would use an actual Map for this purpose, as done for enum switches.
With some additional effort, it would be possible to use a single switch statement on the hash code of the
argument, but care would need to be taken to preserve the proper control flow in the presence of hash
collisions and other complications, such as fallthroughs. Switch statements with one or two
alternatives could also be specially translated into if-then statements to omit the computation of the hash
code.
The generated code assumes that the hashing algorithm of String is the same in the compilation environment as
in the environment the code will run in. The string hashing algorithm in the SE JDK has been unchanged
since at least JDK 1.2. Since the algorithm has been specified since that release as well, it is very
unlikely to be changed in the future.
Different hashing algorithms, such as the length of the strings or a perfect hashing algorithm over the
particular set of case labels, could potentially be used instead of String.hashCode.
举一个具体的例子,如下:
class TestStringSwitch {
public void test() {
String fruit = "";
switch (fruit) {
case "banana":
case "apple":
System.out.println("banana or orange");
break;
case "orange":
System.out.println("orange");
break;
default:
System.out.println("default");
break;
}
}
}
翻译后的最终结果为:
/*synthetic*/ final String s99$ = (fruit);
/*synthetic*/ int tmp99$ = -1;
switch (s99$.hashCode()) {
case -1396355227:
if (s99$.equals("banana")) tmp99$ = 0;
break;
case 93029210:
if (s99$.equals("apple")) tmp99$ = 1;
break;
case -1008851410:
if (s99$.equals("orange")) tmp99$ = 2;
break;
}
switch (tmp99$) {
case 0:
case 1:
System.out.println("banana or orange");
break;
case 2:
System.out.println("orange");
break;
default:
System.out.println("default");
break;
}
哈希函数在映射的时候可能存在冲突,多个字符串的哈希值可能是一样的,所以还要通过字符串比较来保证。
Javac语法糖之EnumSwitch的更多相关文章
- Javac语法糖之内部类
在Javac中解语法糖主要是Lower类来完成,调用这个类的入口函数translateTopLevelClass即可.这个方法只是JavacCompiler类的desugar方法中进行了调用. 首先来 ...
- Javac语法糖之增强for循环
加强的for循环有两种,遍历数组和实现了Iterable接口的容器.javac通过visitForeachLoop()方法来实现解语法糖,代码如下: /** Translate away the fo ...
- Javac语法糖之其它
1.变长参数 class VarialbeArgumentsDemo { public static void doWork(int... a) {//可变参数 } public static voi ...
- Javac语法糖之TryCatchFinally
https://docs.oracle.com/javase/specs/jls/se7/html/jls-14.html#jls-14.20.3 Optionally replace a try s ...
- Javac语法糖之Enum类
枚举类在Javac中是被当作类来看待的. An enum type is implicitly final unless it contains at least one enum constant ...
- Java中的10颗语法糖
语法糖(Syntactic Sugar):也称糖衣语法,指在计算机语言中添加的某种语法,这种语法对语言的功能没有影响,但是更方便程序员使用.通常来说,使用语法糖能够增加程序的可读性,减少程序代码出错的 ...
- 转:【深入Java虚拟机】之六:Java语法糖
转载请注明出处:http://blog.csdn.net/ns_code/article/details/18011009 语法糖(Syntactic Sugar),也称糖衣语法,是由英国计算机学家P ...
- 【转】剖析异步编程语法糖: async和await
一.难以被接受的async 自从C#5.0,语法糖大家庭又加入了两位新成员: async和await. 然而从我知道这两个家伙之后的很长一段时间,我甚至都没搞明白应该怎么使用它们,这种全新的异步编程模 ...
- Java的语法糖
1.前言 本文记录内容来自<深入理解Java虚拟机>的第十章早期(编译期)优化其中一节内容,其他的内容个人觉得暂时不需要过多关注,比如语法.词法分析,语义分析和字节码生成的过程等.主要关注 ...
随机推荐
- jaxws.xsd
示例: <?xml version="1.0" encoding="UTF-8"?> <beans xmlns="http://ww ...
- 201709021工作日记--CAS解读
CAS主要参考博文:classtag http://www.jianshu.com/p/473e14d5ab2d CAS(Compare and swap)比较和替换是设计并发算法时用到的一种技术 ...
- MessageBox的常见用法
一 函数原型及参数 function MessageBox(hWnd: HWND; Text, Caption: PChar; Type: Word): Integer; hWnd:对话框父窗口句柄, ...
- ggdl
\documentclass{article} \usepackage{geometry} \geometry{hmargin=1cm,vmargin=1cm} \usepackage{tikz} % ...
- delphi API: SetWindowPos改变窗口的位置与状态
SetWindowPos 函数功能:该函数改变一个子窗口,弹出式窗口式顶层窗口的尺寸,位置和Z序.子窗口,弹出式窗口,及顶层窗口根据它们在屏幕上出现的顺序排序.顶层窗口设置的级别最高,并且被设置为Z序 ...
- 【算法33】LRU算法
题目来源 LeetCode: https://leetcode.com/problems/lru-cache/ LRU简介 LRU (Least Recently Used,最近最少使用)算法是操作系 ...
- Alwayson--辅助副本状态
1. 同步中(SYNCHRONIZING),主副本和辅助副本之间存在数据差异,并正在进行同步: 2. 已同步(SYNCHRONIZED),主副本和辅助副本之间不存在数据差异,无需要同步的日志: 3. ...
- 二叉树(Binary Tree)相关算法的实现
写在前面: 二叉树是比较简单的一种数据结构,理解并熟练掌握其相关算法对于复杂数据结构的学习大有裨益 一.二叉树的创建 [不喜欢理论的点我跳过>>] 所谓的创建二叉树,其实就是让计算机去存储 ...
- 构建NetCore应用框架之实战篇(四):BitAdminCore框架1.0登录功能细化及技术选型
本篇承接上篇内容,如果你不小心点击进来,建议从第一篇开始完整阅读,文章内容继承性连贯性. 构建NetCore应用框架之实战篇系列 一.BitAdminCore框架1.0版本 1.1.0版本是指最小版本 ...
- sqlserver学习
清空数据表: delete from TableName 清除表中的所有的数据,保留表的结构 truncate table TableName 清除表中所有行,保留表结构 (重置ID) 删除表 Dr ...