-
Notifications
You must be signed in to change notification settings - Fork 22
/
Body.java
218 lines (193 loc) · 6.19 KB
/
Body.java
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
/*
* See LICENSE file in distribution for copyright and licensing information.
*/
package ioke.lang;
import java.util.Arrays;
import java.util.LinkedHashMap;
import java.util.Collection;
import java.util.Map;
import java.util.List;
import java.util.ArrayList;
import java.util.regex.Pattern;
import ioke.lang.exceptions.ControlFlow;
/**
* @author <a href="mailto:ola.bini@gmail.com">Ola Bini</a>
*/
public final class Body {
String documentation;
IokeObject mimic = null;
IokeObject[] mimics = null;
int mimicCount = 0;
Collection<IokeObject> hooks = null;
// zeroed by jvm
int flags;
public final void put(String name, Object value) {
Cell cell = getCell(name, false);
cell.value = value;
}
public final boolean has(String name) {
return null != getCell(name, true);
}
public final Object get(String name) {
Cell cell = getCell(name, true);
if(cell == null) {
return cell;
}
return cell.value;
}
public Object remove(String name) {
int hash = name.hashCode();
Cell[] cellsLocalRef = cells;
if(count != 0) {
int tableSize = cells.length;
int cellIndex = getCellIndex(tableSize, hash);
Cell prev = cellsLocalRef[cellIndex];
Cell cell = prev;
while(cell != null) {
if(cell.name == name || name.equals(cell.name)) {
break;
}
prev = cell;
cell = cell.next;
}
if(cell != null) {
count--;
// remove slot from hash table
if(prev == cell) {
cellsLocalRef[cellIndex] = cell.next;
} else {
prev.next = cell.next;
}
if(firstAdded == cell) {
firstAdded = cell.orderedNext;
if(lastAdded == cell) {
lastAdded = null;
}
} else {
Cell p2 = firstAdded;
while(p2.orderedNext != cell) {
p2 = p2.orderedNext;
}
if(p2 != null) {
p2.orderedNext = cell.orderedNext;
}
if(lastAdded == cell) {
lastAdded = p2;
}
}
return cell.value;
}
}
return null;
}
private Cell[] cells;
private int count;
Cell firstAdded;
Cell lastAdded;
private static final int INITIAL_CELL_SIZE = 4;
public static class Cell {
String name;
int hash;
public Object value;
Cell next; // next in hash table bucket
Cell orderedNext; // next in linked list
Cell(String name, int hash) {
this.name = name;
this.hash = hash;
}
}
private Cell getCell(String name, boolean query) {
Cell[] cellsLocalRef = cells;
if(cellsLocalRef == null && query) {
return null;
}
int hash = name.hashCode();
if(cellsLocalRef != null) {
Cell cell;
int cellIndex = getCellIndex(cellsLocalRef.length, hash);
for(cell = cellsLocalRef[cellIndex];
cell != null;
cell = cell.next) {
Object sname = cell.name;
if(sname == name || name.equals(sname)) {
break;
}
}
if(query || (!query && cell != null)) {
return cell;
}
}
return createCell(name, hash, query);
}
private static int getCellIndex(int tableSize, int hash) {
return hash & (tableSize - 1);
}
private Cell createCell(String name, int hash, boolean query) {
Cell[] cellsLocalRef = cells;
int insertPos;
if(count == 0) {
cellsLocalRef = new Cell[INITIAL_CELL_SIZE];
cells = cellsLocalRef;
insertPos = getCellIndex(cellsLocalRef.length, hash);
} else {
int tableSize = cellsLocalRef.length;
insertPos = getCellIndex(tableSize, hash);
Cell prev = cellsLocalRef[insertPos];
Cell cell = prev;
while(cell != null) {
if(cell.name == name || name.equals(cell.name)) {
break;
}
prev = cell;
cell = cell.next;
}
if(cell != null) {
return cell;
} else {
if(4 * (count + 1) > 3 * cellsLocalRef.length) {
cellsLocalRef = new Cell[cellsLocalRef.length * 2];
copyTable(cells, cellsLocalRef, count);
cells = cellsLocalRef;
insertPos = getCellIndex(cellsLocalRef.length, hash);
}
}
}
Cell newCell = new Cell(name, hash);
++count;
if(lastAdded != null)
lastAdded.orderedNext = newCell;
if(firstAdded == null)
firstAdded = newCell;
lastAdded = newCell;
addKnownAbsentCell(cellsLocalRef, newCell, insertPos);
return newCell;
}
private static void copyTable(Cell[] cells, Cell[] newCells, int count) {
int tableSize = newCells.length;
int i = cells.length;
for (;;) {
--i;
Cell cell = cells[i];
while(cell != null) {
int insertPos = getCellIndex(tableSize, cell.hash);
Cell next = cell.next;
addKnownAbsentCell(newCells, cell, insertPos);
cell.next = null;
cell = next;
if(--count == 0)
return;
}
}
}
private static void addKnownAbsentCell(Cell[] cells, Cell cell, int insertPos) {
if(cells[insertPos] == null) {
cells[insertPos] = cell;
} else {
Cell prev = cells[insertPos];
while(prev.next != null) {
prev = prev.next;
}
prev.next = cell;
}
}
}