Java Code Examples for jdk.nashorn.internal.runtime.regexp.joni.ast.CClassNode#isCodeInCC()
The following examples show how to use
jdk.nashorn.internal.runtime.regexp.joni.ast.CClassNode#isCodeInCC() .
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
| Source File: ApplyCaseFold.java From TencentKona-8 with GNU General Public License v2.0 | 5 votes |
|
public static void apply(final int from, final int to, final Object o) {
final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;
final ScanEnvironment env = arg.env;
final CClassNode cc = arg.cc;
final BitSet bs = cc.bs;
final boolean inCC = cc.isCodeInCC(from);
if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
cc.addCodeRange(env, to, to);
} else {
/* /(?i:[^A-C])/.match("a") ==> fail. */
bs.set(to);
}
}
} else {
if (inCC) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
if (cc.isNot()) {
cc.clearNotFlag();
}
cc.addCodeRange(env, to, to);
} else {
if (cc.isNot()) {
bs.clear(to);
} else {
bs.set(to);
}
}
}
} // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
}
Example 2
| Source File: ApplyCaseFold.java From jdk8u60 with GNU General Public License v2.0 | 5 votes |
|
public static void apply(final int from, final int to, final Object o) {
final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;
final ScanEnvironment env = arg.env;
final CClassNode cc = arg.cc;
final BitSet bs = cc.bs;
final boolean inCC = cc.isCodeInCC(from);
if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
cc.addCodeRange(env, to, to);
} else {
/* /(?i:[^A-C])/.match("a") ==> fail. */
bs.set(to);
}
}
} else {
if (inCC) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
if (cc.isNot()) {
cc.clearNotFlag();
}
cc.addCodeRange(env, to, to);
} else {
if (cc.isNot()) {
bs.clear(to);
} else {
bs.set(to);
}
}
}
} // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
}
Example 3
| Source File: ApplyCaseFold.java From openjdk-jdk8u with GNU General Public License v2.0 | 5 votes |
|
public static void apply(final int from, final int to, final Object o) {
final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;
final ScanEnvironment env = arg.env;
final CClassNode cc = arg.cc;
final BitSet bs = cc.bs;
final boolean inCC = cc.isCodeInCC(from);
if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
cc.addCodeRange(env, to, to);
} else {
/* /(?i:[^A-C])/.match("a") ==> fail. */
bs.set(to);
}
}
} else {
if (inCC) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
if (cc.isNot()) {
cc.clearNotFlag();
}
cc.addCodeRange(env, to, to);
} else {
if (cc.isNot()) {
bs.clear(to);
} else {
bs.set(to);
}
}
}
} // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
}
Example 4
| Source File: ApplyCaseFold.java From openjdk-jdk8u-backup with GNU General Public License v2.0 | 5 votes |
|
public static void apply(final int from, final int to, final Object o) {
final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;
final ScanEnvironment env = arg.env;
final CClassNode cc = arg.cc;
final BitSet bs = cc.bs;
final boolean inCC = cc.isCodeInCC(from);
if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
cc.addCodeRange(env, to, to);
} else {
/* /(?i:[^A-C])/.match("a") ==> fail. */
bs.set(to);
}
}
} else {
if (inCC) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
if (cc.isNot()) {
cc.clearNotFlag();
}
cc.addCodeRange(env, to, to);
} else {
if (cc.isNot()) {
bs.clear(to);
} else {
bs.set(to);
}
}
}
} // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
}
Example 5
| Source File: ApplyCaseFold.java From openjdk-jdk9 with GNU General Public License v2.0 | 5 votes |
|
public static void apply(final int from, final int to, final Object o) {
final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;
final ScanEnvironment env = arg.env;
final CClassNode cc = arg.cc;
final BitSet bs = cc.bs;
final boolean inCC = cc.isCodeInCC(from);
if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
cc.addCodeRange(env, to, to);
} else {
/* /(?i:[^A-C])/.match("a") ==> fail. */
bs.set(to);
}
}
} else {
if (inCC) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
if (cc.isNot()) {
cc.clearNotFlag();
}
cc.addCodeRange(env, to, to);
} else {
if (cc.isNot()) {
bs.clear(to);
} else {
bs.set(to);
}
}
}
} // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
}
Example 6
| Source File: ApplyCaseFold.java From hottub with GNU General Public License v2.0 | 5 votes |
|
public static void apply(final int from, final int to, final Object o) {
final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;
final ScanEnvironment env = arg.env;
final CClassNode cc = arg.cc;
final BitSet bs = cc.bs;
final boolean inCC = cc.isCodeInCC(from);
if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
cc.addCodeRange(env, to, to);
} else {
/* /(?i:[^A-C])/.match("a") ==> fail. */
bs.set(to);
}
}
} else {
if (inCC) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
if (cc.isNot()) {
cc.clearNotFlag();
}
cc.addCodeRange(env, to, to);
} else {
if (cc.isNot()) {
bs.clear(to);
} else {
bs.set(to);
}
}
}
} // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
}
Example 7
| Source File: ApplyCaseFold.java From jdk8u_nashorn with GNU General Public License v2.0 | 5 votes |
|
public static void apply(final int from, final int to, final Object o) {
final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;
final ScanEnvironment env = arg.env;
final CClassNode cc = arg.cc;
final BitSet bs = cc.bs;
final boolean inCC = cc.isCodeInCC(from);
if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
cc.addCodeRange(env, to, to);
} else {
/* /(?i:[^A-C])/.match("a") ==> fail. */
bs.set(to);
}
}
} else {
if (inCC) {
if (to >= BitSet.SINGLE_BYTE_SIZE) {
if (cc.isNot()) {
cc.clearNotFlag();
}
cc.addCodeRange(env, to, to);
} else {
if (cc.isNot()) {
bs.clear(to);
} else {
bs.set(to);
}
}
}
} // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
}
Example 8
| Source File: Analyser.java From openjdk-8-source with GNU General Public License v2.0 | 4 votes |
|
private boolean isNotIncluded(Node x, Node y) {
Node tmp;
// !retry:!
retry: while(true) {
int yType = y.getType();
switch(x.getType()) {
case NodeType.CTYPE:
switch(yType) {
case NodeType.CCLASS:
// !swap:!
tmp = x;
x = y;
y = tmp;
// !goto retry;!
continue retry;
case NodeType.STR:
// !goto swap;!
tmp = x;
x = y;
y = tmp;
continue retry;
default:
break;
} // inner switch
break;
case NodeType.CCLASS:
CClassNode xc = (CClassNode)x;
switch(yType) {
case NodeType.CCLASS:
CClassNode yc = (CClassNode)y;
for (int i=0; i<BitSet.SINGLE_BYTE_SIZE; i++) {
boolean v = xc.bs.at(i);
if ((v && !xc.isNot()) || (!v && xc.isNot())) {
v = yc.bs.at(i);
if ((v && !yc.isNot()) || (!v && yc.isNot())) return false;
}
}
if ((xc.mbuf == null && !xc.isNot()) || yc.mbuf == null && !yc.isNot()) return true;
return false;
// break; not reached
case NodeType.STR:
// !goto swap;!
tmp = x;
x = y;
y = tmp;
continue retry;
default:
break;
} // inner switch
break; // case NodeType.CCLASS
case NodeType.STR:
StringNode xs = (StringNode)x;
if (xs.length() == 0) break;
switch (yType) {
case NodeType.CCLASS:
CClassNode cc = (CClassNode)y;
int code = xs.chars[xs.p];
return !cc.isCodeInCC(code);
case NodeType.STR:
StringNode ys = (StringNode)y;
int len = xs.length();
if (len > ys.length()) len = ys.length();
if (xs.isAmbig() || ys.isAmbig()) {
/* tiny version */
return false;
} else {
for (int i=0, p=ys.p, q=xs.p; i<len; i++, p++, q++) {
if (ys.chars[p] != xs.chars[q]) return true;
}
}
break;
default:
break;
} // inner switch
break; // case NodeType.STR
} // switch
break;
} // retry: while
return false;
}
Example 9
| Source File: Analyser.java From openjdk-8 with GNU General Public License v2.0 | 4 votes |
|
private boolean isNotIncluded(Node x, Node y) {
Node tmp;
// !retry:!
retry: while(true) {
int yType = y.getType();
switch(x.getType()) {
case NodeType.CTYPE:
switch(yType) {
case NodeType.CCLASS:
// !swap:!
tmp = x;
x = y;
y = tmp;
// !goto retry;!
continue retry;
case NodeType.STR:
// !goto swap;!
tmp = x;
x = y;
y = tmp;
continue retry;
default:
break;
} // inner switch
break;
case NodeType.CCLASS:
CClassNode xc = (CClassNode)x;
switch(yType) {
case NodeType.CCLASS:
CClassNode yc = (CClassNode)y;
for (int i=0; i<BitSet.SINGLE_BYTE_SIZE; i++) {
boolean v = xc.bs.at(i);
if ((v && !xc.isNot()) || (!v && xc.isNot())) {
v = yc.bs.at(i);
if ((v && !yc.isNot()) || (!v && yc.isNot())) return false;
}
}
if ((xc.mbuf == null && !xc.isNot()) || yc.mbuf == null && !yc.isNot()) return true;
return false;
// break; not reached
case NodeType.STR:
// !goto swap;!
tmp = x;
x = y;
y = tmp;
continue retry;
default:
break;
} // inner switch
break; // case NodeType.CCLASS
case NodeType.STR:
StringNode xs = (StringNode)x;
if (xs.length() == 0) break;
switch (yType) {
case NodeType.CCLASS:
CClassNode cc = (CClassNode)y;
int code = xs.chars[xs.p];
return !cc.isCodeInCC(code);
case NodeType.STR:
StringNode ys = (StringNode)y;
int len = xs.length();
if (len > ys.length()) len = ys.length();
if (xs.isAmbig() || ys.isAmbig()) {
/* tiny version */
return false;
} else {
for (int i=0, p=ys.p, q=xs.p; i<len; i++, p++, q++) {
if (ys.chars[p] != xs.chars[q]) return true;
}
}
break;
default:
break;
} // inner switch
break; // case NodeType.STR
} // switch
break;
} // retry: while
return false;
}
Example 10
| Source File: Analyser.java From nashorn with GNU General Public License v2.0 | 4 votes |
|
private boolean isNotIncluded(Node x, Node y) {
Node tmp;
// !retry:!
retry: while(true) {
int yType = y.getType();
switch(x.getType()) {
case NodeType.CTYPE:
switch(yType) {
case NodeType.CCLASS:
// !swap:!
tmp = x;
x = y;
y = tmp;
// !goto retry;!
continue retry;
case NodeType.STR:
// !goto swap;!
tmp = x;
x = y;
y = tmp;
continue retry;
default:
break;
} // inner switch
break;
case NodeType.CCLASS:
CClassNode xc = (CClassNode)x;
switch(yType) {
case NodeType.CCLASS:
CClassNode yc = (CClassNode)y;
for (int i=0; i<BitSet.SINGLE_BYTE_SIZE; i++) {
boolean v = xc.bs.at(i);
if ((v && !xc.isNot()) || (!v && xc.isNot())) {
v = yc.bs.at(i);
if ((v && !yc.isNot()) || (!v && yc.isNot())) return false;
}
}
if ((xc.mbuf == null && !xc.isNot()) || yc.mbuf == null && !yc.isNot()) return true;
return false;
// break; not reached
case NodeType.STR:
// !goto swap;!
tmp = x;
x = y;
y = tmp;
continue retry;
default:
break;
} // inner switch
break; // case NodeType.CCLASS
case NodeType.STR:
StringNode xs = (StringNode)x;
if (xs.length() == 0) break;
switch (yType) {
case NodeType.CCLASS:
CClassNode cc = (CClassNode)y;
int code = xs.chars[xs.p];
return !cc.isCodeInCC(code);
case NodeType.STR:
StringNode ys = (StringNode)y;
int len = xs.length();
if (len > ys.length()) len = ys.length();
if (xs.isAmbig() || ys.isAmbig()) {
/* tiny version */
return false;
} else {
for (int i=0, p=ys.p, q=xs.p; i<len; i++, p++, q++) {
if (ys.chars[p] != xs.chars[q]) return true;
}
}
break;
default:
break;
} // inner switch
break; // case NodeType.STR
} // switch
break;
} // retry: while
return false;
}
