static {
RSHIPS.put("NT", "BT");
RSHIPS.put("BT", "BT");
RSHIPS.put("BTG", "NTG");
RSHIPS.put("NTG", "BTG");
RSHIPS.put("BTP", "NTP");
RSHIPS.put("NTP", "BTP");
RSHIPS.put("USE", "UF");
RSHIPS.put("UF", "USE");
RSHIPS.put("RT", "RT");
}
/**
* Creates a new archive.
*
* @param ctx query context
* @return archive
* @throws QueryException query exception
*/
private B64 create(final QueryContext ctx) throws QueryException {
final Iter entr = ctx.iter(expr[0]);
final Iter cont = ctx.iter(expr[1]);
final Item opt = expr.length > 2 ? expr[2].item(ctx, info) : null;
final TokenMap map = new FuncParams(Q_OPTIONS, info).parse(opt);
final byte[] f = map.get(FORMAT);
final String format = f != null ? string(lc(f)) : "zip";
final ArchiveOut out = ArchiveOut.get(format, info);
// check algorithm
final byte[] alg = map.get(ALGORITHM);
int level = ZipEntry.DEFLATED;
if (alg != null) {
if (format.equals("zip") && !eq(alg, STORED, DEFLATE)
|| format.equals("gzip") && !eq(alg, DEFLATE)) {
ARCH_SUPP.thrw(info, ALGORITHM, alg);
}
if (eq(alg, STORED)) level = ZipEntry.STORED;
else if (eq(alg, DEFLATE)) level = ZipEntry.DEFLATED;
}
out.level(level);
try {
int e = 0;
int c = 0;
Item en, cn;
while (true) {
en = entr.next();
cn = cont.next();
if (en == null || cn == null) break;
if (out instanceof GZIPOut && c > 0)
ARCH_ONE.thrw(info, format.toUpperCase(Locale.ENGLISH));
add(checkElmStr(en), cn, out, level);
e++;
c++;
}
// count remaining entries
if (cn != null) do c++; while (cont.next() != null);
if (en != null) do e++; while (entr.next() != null);
if (e != c) throw ARCH_DIFF.thrw(info, e, c);
} catch (final IOException ex) {
Util.debug(ex);
throw ARCH_FAIL.thrw(info, ex);
} finally {
out.close();
}
return new B64(out.toArray());
}
/**
* 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);
}
/**
* Constructor.
*
* @param info input info
* @param map decimal format
* @throws QueryException query exception
*/
public DecFormatter(final InputInfo info, final TokenMap map) throws QueryException {
// assign map values
int z = '0';
if (map != null) {
for (final byte[] key : map) {
final String k = string(key);
final byte[] v = map.get(key);
if (k.equals(DF_INF)) {
inf = v;
} else if (k.equals(DF_NAN)) {
nan = v;
} else if (v.length != 0 && cl(v, 0) == v.length) {
final int cp = cp(v, 0);
switch (k) {
case DF_DEC:
decimal = cp;
break;
case DF_GRP:
grouping = cp;
break;
case DF_EXP:
exponent = cp;
break;
case DF_PAT:
pattern = cp;
break;
case DF_MIN:
minus = cp;
break;
case DF_DIG:
optional = cp;
break;
case DF_PC:
percent = cp;
break;
case DF_PM:
permille = cp;
break;
case DF_ZD:
z = zeroes(cp);
if (z == -1) throw INVDECFORM_X_X.get(info, k, v);
if (z != cp) throw INVDECZERO_X.get(info, (char) cp);
break;
}
} else {
// signs must have single character
throw INVDECSINGLE_X_X.get(info, k, v);
}
}
}
// check for duplicate characters
zero = z;
final IntSet is = new IntSet();
for (int i = 0; i < 10; i++) is.add(zero + i);
final int[] ss = {decimal, grouping, exponent, percent, permille, optional, pattern};
for (final int s : ss) if (!is.add(s)) throw DUPLDECFORM_X.get(info, (char) s);
// create auxiliary strings
final TokenBuilder tb = new TokenBuilder();
for (int i = 0; i < 10; i++) tb.add(zero + i);
digits = tb.toArray();
// "decimal-separator-sign, exponent-separator-sign, grouping-sign, decimal-digit-family,
// optional-digit-sign and pattern-separator-sign are classified as active characters"
// -> decimal-digit-family: added above. pattern-separator-sign: will never occur at this stage
actives = tb.add(decimal).add(exponent).add(grouping).add(optional).finish();
// "all other characters (including the percent-sign and per-mille-sign) are classified
// as passive characters."
}