本文整理汇总了Java中jdk.nashorn.internal.runtime.regexp.joni.constants.AnchorType.END_BUF_MASK属性的典型用法代码示例。如果您正苦于以下问题：Java AnchorType.END_BUF_MASK属性的具体用法？Java AnchorType.END_BUF_MASK怎么用？Java AnchorType.END_BUF_MASK使用的例子？那么恭喜您, 这里精选的属性代码示例或许可以为您提供帮助。您也可以进一步了解该属性所在类jdk.nashorn.internal.runtime.regexp.joni.constants.AnchorType的用法示例。
在下文中一共展示了AnchorType.END_BUF_MASK属性的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: optimizeInfoToString
public String optimizeInfoToString() {
final StringBuilder s = new StringBuilder();
s.append("optimize: ").append(searchAlgorithm.getName()).append("\n");
s.append(" anchor: ").append(OptAnchorInfo.anchorToString(anchor));
if ((anchor & AnchorType.END_BUF_MASK) != 0) {
s.append(MinMaxLen.distanceRangeToString(anchorDmin, anchorDmax));
}
s.append("\n");
if (searchAlgorithm != SearchAlgorithm.NONE) {
s.append(" sub anchor: ").append(OptAnchorInfo.anchorToString(subAnchor)).append("\n");
}
s.append("dmin: ").append(dMin).append(" dmax: ").append(dMax).append("\n");
s.append("threshold length: ").append(thresholdLength).append("\n");
if (exact != null) {
s.append("exact: [").append(exact, exactP, exactEnd - exactP).append("]: length: ").append(exactEnd - exactP).append("\n");
} else if (searchAlgorithm == SearchAlgorithm.MAP) {
int n=0;
for (int i=0; i<Config.CHAR_TABLE_SIZE; i++) {
if (map[i] != 0) {
n++;
}
}
s.append("map: n = ").append(n).append("\n");
if (n > 0) {
int c=0;
s.append("[");
for (int i=0; i<Config.CHAR_TABLE_SIZE; i++) {
if (map[i] != 0) {
if (c > 0) {
s.append(", ");
}
c++;
// TODO if (enc.isPrint(i)
s.append((char)i);
}
}
s.append("]\n");
}
}
return s.toString();
}
示例2: optimizeInfoToString
public String optimizeInfoToString() {
StringBuilder s = new StringBuilder();
s.append("optimize: ").append(searchAlgorithm.getName()).append("\n");
s.append(" anchor: ").append(OptAnchorInfo.anchorToString(anchor));
if ((anchor & AnchorType.END_BUF_MASK) != 0) {
s.append(MinMaxLen.distanceRangeToString(anchorDmin, anchorDmax));
}
s.append("\n");
if (searchAlgorithm != SearchAlgorithm.NONE) {
s.append(" sub anchor: ").append(OptAnchorInfo.anchorToString(subAnchor)).append("\n");
}
s.append("dmin: ").append(dMin).append(" dmax: ").append(dMax).append("\n");
s.append("threshold length: ").append(thresholdLength).append("\n");
if (exact != null) {
s.append("exact: [").append(exact, exactP, exactEnd - exactP).append("]: length: ").append(exactEnd - exactP).append("\n");
} else if (searchAlgorithm == SearchAlgorithm.MAP) {
int n=0;
for (int i=0; i<Config.CHAR_TABLE_SIZE; i++) if (map[i] != 0) n++;
s.append("map: n = ").append(n).append("\n");
if (n > 0) {
int c=0;
s.append("[");
for (int i=0; i<Config.CHAR_TABLE_SIZE; i++) {
if (map[i] != 0) {
if (c > 0) {
s.append(", ");
}
c++;
// TODO if (enc.isPrint(i)
s.append((char)i);
}
}
s.append("]\n");
}
}
return s.toString();
}