package com.oracle.truffle.regex.charset;
import java.util.Arrays;
import com.oracle.truffle.api.CompilerDirectives.TruffleBoundary;
import com.oracle.truffle.regex.tregex.buffer.IntRangesBuffer;
import com.oracle.truffle.regex.tregex.string.Encodings.Encoding;
import com.oracle.truffle.regex.tregex.util.json.Json;
import com.oracle.truffle.regex.tregex.util.json.JsonConvertible;
import com.oracle.truffle.regex.tregex.util.json.JsonValue;
public final class CodePointSet extends ImmutableSortedListOfIntRanges implements Comparable<CodePointSet>, JsonConvertible {
private static final CodePointSet CONSTANT_EMPTY = new CodePointSet(new int[0]);
private static final CodePointSet[] CONSTANT_ASCII = new CodePointSet[128];
private static final CodePointSet[] CONSTANT_CASE_FOLD_ASCII = new CodePointSet[26];
static {
CONSTANT_ASCII[0] = new CodePointSet(new int[]{0, 0});
for (int i = 1; i < 128; i++) {
CONSTANT_ASCII[i] = new CodePointSet(new int[]{i, i});
}
for (int i = 'A'; i <= 'Z'; i++) {
CONSTANT_CASE_FOLD_ASCII[i - 'A'] = new CodePointSet(new int[]{i, i, Character.toLowerCase(i), Character.toLowerCase(i)});
}
}
private CodePointSet(int[] ranges) {
super(ranges);
assert ranges.length == 0 || ranges[0] >= 0 && ranges[ranges.length - 1] >= 0;
}
public int[] getRanges() {
return ranges;
}
public static CodePointSet getEmpty() {
return CONSTANT_EMPTY;
}
public static CodePointSet createNoDedup(int... ranges) {
return new CodePointSet(ranges);
}
public static CodePointSet create(int single) {
if (single < 128) {
return CONSTANT_ASCII[single];
}
return new CodePointSet(new int[]{single, single});
}
public static CodePointSet create(int... ranges) {
CodePointSet constant = checkConstants(ranges, ranges.length);
if (constant == null) {
return new CodePointSet(ranges);
}
return constant;
}
public static CodePointSet create(IntRangesBuffer buf) {
CodePointSet constant = checkConstants(buf.getBuffer(), buf.length());
if (constant == null) {
return new CodePointSet(buf.toArray());
}
return constant;
}
private static CodePointSet checkConstants(int[] ranges, int length) {
if (length == 0) {
return CONSTANT_EMPTY;
}
if (length == 2) {
if (ranges[0] == ranges[1] && ranges[0] < 128) {
return CONSTANT_ASCII[ranges[0]];
}
}
if (length == 4) {
if (ranges[0] == ranges[1] && ranges[0] >= 'A' && ranges[0] <= 'Z' && ranges[2] == ranges[3] && ranges[2] == (ranges[0] | 0x20)) {
return CONSTANT_CASE_FOLD_ASCII[ranges[0] - 'A'];
}
}
for (CodePointSet predefCC : Constants.CONSTANT_CODE_POINT_SETS) {
if (predefCC.ranges.length == length && rangesEqual(predefCC.ranges, ranges, length)) {
return predefCC;
}
}
return null;
}
@SuppressWarnings("unchecked")
@Override
public CodePointSet createEmpty() {
return getEmpty();
}
@SuppressWarnings("unchecked")
@Override
public CodePointSet create(RangesBuffer buffer) {
assert buffer instanceof IntRangesBuffer;
return create((IntRangesBuffer) buffer);
}
@Override
public boolean equalsBuffer(RangesBuffer buffer) {
assert buffer instanceof IntRangesBuffer;
IntRangesBuffer buf = (IntRangesBuffer) buffer;
return ranges.length == buf.length() && rangesEqual(ranges, buf.getBuffer(), ranges.length);
}
@SuppressWarnings("unchecked")
@Override
public CodePointSet createInverse(Encoding encoding) {
return createInverse(this, encoding);
}
public static CodePointSet createInverse(SortedListOfRanges src, Encoding encoding) {
if (src.matchesNothing()) {
return encoding.getFullSet();
}
return new CodePointSet(createInverseArray(src, encoding));
}
@SuppressWarnings("unchecked")
@Override
public <T extends ImmutableSortedListOfRanges> T createIntersectionSingleRange(T o) {
assert size() == 1 && !o.isEmpty();
if (getMin() <= o.getMin() && getMax() >= o.getMax()) {
return o;
}
int iLo = 0;
int iHi = o.size() - 1;
while (iLo < o.size() && o.getHi(iLo) < getMin()) {
iLo++;
}
while (iHi >= 0 && o.getLo(iHi) > getMax()) {
iHi--;
}
if (iHi < iLo) {
return (T) createEmpty();
}
int[] intersection = Arrays.copyOfRange(((CodePointSet) o).ranges, iLo * 2, (iHi + 1) * 2);
intersection[0] = Math.max(intersection[0], getMin());
intersection[intersection.length - 1] = Math.min(intersection[intersection.length - 1], getMax());
return (T) create(intersection);
}
@Override
public int compareTo(CodePointSet o) {
if (this == o) {
return 0;
}
int cmp = size() - o.size();
if (cmp != 0) {
return cmp;
}
for (int i = 0; i < size(); i++) {
cmp = getLo(i) - o.getLo(i);
if (cmp != 0) {
return cmp;
}
}
return cmp;
}
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj instanceof CodePointSet) {
return Arrays.equals(ranges, ((CodePointSet) obj).ranges);
}
if (obj instanceof SortedListOfRanges) {
return equalsListOfRanges((SortedListOfRanges) obj);
}
return false;
}
@Override
public int hashCode() {
return Arrays.hashCode(ranges);
}
@TruffleBoundary
@Override
public JsonValue toJson() {
return Json.array(ranges);
}
@TruffleBoundary
@Override
public String toString() {
return defaultToString();
}
@TruffleBoundary
public String dumpRaw() {
StringBuilder sb = new StringBuilder(size() * 20);
for (int i = 0; i < size(); i++) {
if (i > 0) {
sb.append(",");
}
sb.append(String.format("0x%06x, 0x%06x", getLo(i), getHi(i)));
}
return sb.toString();
}
@Override
public int[] toArray() {
return getRanges();
}
public byte[] inverseToByteArray(Encoding encoding) {
byte[] array = new byte[inverseValueCount(encoding)];
int index = 0;
int lastHi = -1;
for (int i = 0; i < size(); i++) {
for (int j = lastHi + 1; j < getLo(i); j++) {
assert j <= 0xff;
array[index++] = (byte) j;
}
lastHi = getHi(i);
}
for (int j = lastHi + 1; j <= encoding.getMaxValue(); j++) {
assert j <= 0xff;
array[index++] = (byte) j;
}
return array;
}
public char[] inverseToCharArray(Encoding encoding) {
char[] array = new char[inverseValueCount(encoding)];
int index = 0;
int lastHi = -1;
for (int i = 0; i < size(); i++) {
for (int j = lastHi + 1; j < getLo(i); j++) {
assert j <= Character.MAX_VALUE;
array[index++] = (char) j;
}
lastHi = getHi(i);
}
for (int j = lastHi + 1; j <= encoding.getMaxValue(); j++) {
assert j <= Character.MAX_VALUE;
array[index++] = (char) j;
}
return array;
}
}