/**
* Scans a PEReference. [69]
*
* @return entity
* @throws IOException I/O exception
*/
private byte[] peRef() throws IOException {
// scans predefined entities
final byte[] name = name(true);
consume(';');
final byte[] en = pents.get(name);
if (en != null) return en;
return name;
}
/**
* Scans a reference. [67]
*
* @param f dissolve entities
* @return entity
* @throws IOException I/O exception
*/
private byte[] ref(final boolean f) throws IOException {
// scans numeric entities
if (consume('#')) { // [66]
final TokenBuilder ent = new TokenBuilder();
int b = 10;
int ch = nextChar();
ent.add(ch);
if (ch == 'x') {
b = 16;
ent.add(ch = nextChar());
}
int n = 0;
do {
final boolean m = ch >= '0' && ch <= '9';
final boolean h = b == 16 && (ch >= 'a' && ch <= 'f' || ch >= 'A' && ch <= 'F');
if (!m && !h) {
completeRef(ent);
return QUESTION;
}
n *= b;
n += ch & 15;
if (!m) n += 9;
ent.add(ch = nextChar());
} while (ch != ';');
if (!valid(n)) return QUESTION;
ent.reset();
ent.add(n);
return ent.finish();
}
// scans predefined entities [68]
final byte[] name = name(false);
if (!consume(';')) return QUESTION;
if (!f) return concat(AMPER, name, SEMI);
byte[] en = ents.get(name);
if (en == null) {
// unknown entity: try HTML entities (lazy initialization)
if (HTMLENTS.size() == 0) {
for (int s = 0; s < HTMLENTITIES.length; s += 2) {
HTMLENTS.add(token(HTMLENTITIES[s]), token(HTMLENTITIES[s + 1]));
}
}
en = HTMLENTS.get(name);
}
return en == null ? QUESTION : en;
}
/**
* Reads next character or throws an exception if all bytes have been read.
*
* @return next character
* @throws IOException I/O exception
*/
private int consume() throws IOException {
while (true) {
final int ch = input.read();
if (ch == -1) return 0;
if (ch == '%' && pe) { // [69]
final byte[] key = name(true);
final byte[] val = pents.get(key);
if (val == null) error(UNKNOWNPE, key);
check(';');
input.add(val, true);
} else {
return ch;
}
}
}
/**
* Builds the thesaurus.
*
* @param value input nodes
* @throws QueryException query exception
*/
private void build(final Value value) throws QueryException {
final Value synonyms = nodes("*:synonym", value);
if (synonyms.isEmpty()) return;
final ThesNode term = node(text("*:term", value));
for (final Item synonym : synonyms) {
final ThesNode sterm = node(text("*:term", synonym));
final byte[] rs = text("*:relationship", synonym);
term.add(sterm, rs);
final byte[] srs = RSHIPS.get(rs);
if (srs != null) sterm.add(term, srs);
build(synonyms);
}
}
/**
* Inserts a data instance at the specified pre value. Note that the specified data instance must
* differ from this instance.
*
* @param ipre value at which to insert new data
* @param ipar parent pre value of node
* @param clip data clip
*/
public final void insert(final int ipre, final int ipar, final DataClip clip) {
meta.update();
// update value and document indexes
if (meta.updindex) indexBegin();
resources.insert(ipre, clip);
final int dsize = clip.size();
final int buf = Math.min(dsize, IO.BLOCKSIZE >> IO.NODEPOWER);
// resize buffer to cache more entries
buffer(buf);
// find all namespaces in scope to avoid duplicate declarations
final TokenMap nsScope = nspaces.scope(ipar, this);
// loop through all entries
final IntList preStack = new IntList();
final NSNode nsRoot = nspaces.current();
final HashSet<NSNode> newNodes = new HashSet<NSNode>();
final IntList flagPres = new IntList();
// indicates if database only contains a dummy node
final Data data = clip.data;
int c = 0;
for (int dpre = clip.start; dpre < clip.end; ++dpre, ++c) {
if (c != 0 && c % buf == 0) insert(ipre + c - buf);
final int pre = ipre + c;
final int dkind = data.kind(dpre);
final int dpar = data.parent(dpre, dkind);
// ipar < 0 if document nodes on top level are added
final int dis = dpar >= 0 ? dpre - dpar : ipar >= 0 ? pre - ipar : 0;
final int par = dis == 0 ? -1 : pre - dis;
if (c == 0) nspaces.root(par, this);
while (!preStack.isEmpty() && preStack.peek() > par) nspaces.close(preStack.pop());
switch (dkind) {
case DOC:
// add document
nspaces.prepare();
final int s = data.size(dpre, dkind);
doc(pre, s, data.text(dpre, true));
meta.ndocs++;
preStack.push(pre);
break;
case ELEM:
// add element
nspaces.prepare();
boolean ne = false;
if (data.nsFlag(dpre)) {
final Atts at = data.ns(dpre);
for (int a = 0; a < at.size(); ++a) {
// see if prefix has been declared/ is part of current ns scope
final byte[] old = nsScope.get(at.name(a));
if (old == null || !eq(old, at.value(a))) {
// we have to keep track of all new NSNodes that are added
// to the Namespace structure, as their pre values must not
// be updated. I.e. if an NSNode N with pre value 3 existed
// prior to inserting and two new nodes are inserted at
// location pre == 3 we have to make sure N and only N gets
// updated.
newNodes.add(nspaces.add(at.name(a), at.value(a), pre));
ne = true;
}
}
}
byte[] nm = data.name(dpre, dkind);
elem(
dis,
tagindex.index(nm, null, false),
data.attSize(dpre, dkind),
data.size(dpre, dkind),
nspaces.uri(nm, true),
ne);
preStack.push(pre);
break;
case TEXT:
case COMM:
case PI:
// add text
text(pre, dis, data.text(dpre, true), dkind);
break;
case ATTR:
// add attribute
nm = data.name(dpre, dkind);
// check if prefix already in nsScope or not
final byte[] attPref = prefix(nm);
// check if prefix of attribute has already been declared, otherwise
// add declaration to parent node
if (data.nsFlag(dpre) && nsScope.get(attPref) == null) {
nspaces.add(
par,
preStack.isEmpty() ? -1 : preStack.peek(),
attPref,
data.nspaces.uri(data.uri(dpre, dkind)),
this);
// save pre value to set ns flag later for this node. can't be done
// here as direct table access would interfere with the buffer
flagPres.add(par);
}
attr(
pre,
dis,
atnindex.index(nm, null, false),
data.text(dpre, false),
nspaces.uri(nm, false),
false);
break;
}
}
// finalize and update namespace structure
while (!preStack.isEmpty()) nspaces.close(preStack.pop());
nspaces.root(nsRoot);
if (bp != 0) insert(ipre + c - 1 - (c - 1) % buf);
// reset buffer to old size
buffer(1);
// set ns flags
for (int f = 0; f < flagPres.size(); f++) {
final int fl = flagPres.get(f);
table.write2(fl, 1, name(fl) | 1 << 15);
}
// increase size of ancestors
int p = ipar;
while (p >= 0) {
final int k = kind(p);
size(p, k, size(p, k) + dsize);
p = parent(p, k);
}
if (meta.updindex) {
// add the entries to the ID -> PRE mapping:
idmap.insert(ipre, id(ipre), dsize);
indexEnd();
}
if (!cache) updateDist(ipre + dsize, dsize);
// propagate PRE value shifts to namespaces
if (ipar != -1) nspaces.insert(ipre, dsize, newNodes);
}
