blob: 96a126cdfa9180fccb7168fe2215ac4df08d962f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
/*
* Copyright (C) 2017 Google, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
* in compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License
* is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
* or implied. See the License for the specific language governing permissions and limitations under
* the License.
*/
package com.google.escapevelocity;
import java.util.AbstractSet;
import java.util.BitSet;
import java.util.Iterator;
import java.util.NoSuchElementException;
/**
* An immutable set of ASCII characters.
*
* @author emcmanus@google.com (Éamonn McManus)
*/
class ImmutableAsciiSet extends AbstractSet<Integer> {
private final BitSet bits;
ImmutableAsciiSet(BitSet bits) {
this.bits = bits;
}
static ImmutableAsciiSet of(char c) {
return ofRange(c, c);
}
static ImmutableAsciiSet ofRange(char from, char to) {
if (from > to) {
throw new IllegalArgumentException("from > to");
}
if (to >= 128) {
throw new IllegalArgumentException("Not ASCII");
}
BitSet bits = new BitSet();
bits.set(from, to + 1);
return new ImmutableAsciiSet(bits);
}
ImmutableAsciiSet union(ImmutableAsciiSet that) {
BitSet union = (BitSet) bits.clone();
union.or(that.bits);
return new ImmutableAsciiSet(union);
}
@Override
public boolean contains(Object o) {
int i = -1;
if (o instanceof Character) {
i = (Character) o;
} else if (o instanceof Integer) {
i = (Integer) o;
}
return contains(i);
}
boolean contains(int i) {
if (i < 0) {
return false;
} else {
return bits.get(i);
}
}
@Override
public Iterator<Integer> iterator() {
return new Iterator<Integer>() {
private int index;
@Override
public boolean hasNext() {
return bits.nextSetBit(index) >= 0;
}
@Override
public Integer next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
int next = bits.nextSetBit(index);
index = next + 1;
return next;
}
};
}
@Override
public int size() {
return bits.cardinality();
}
}
|
