/**
* Algorithm of Tarjan for computing the strongly connected components of a graph.
*
* @param v current node
* @throws QueryException if a variable directly calls itself
*/
private void tarjan(final int v) throws QueryException {
final int ixv = 2 * v, llv = ixv + 1, idx = next++;
while (list.size() <= llv) list.add(-1);
list.set(ixv, idx);
list.set(llv, idx);
stack.push(v);
for (final int w : adjacentTo(v)) {
final int ixw = 2 * w, llw = ixw + 1;
if (list.size() <= ixw || list.get(ixw) < 0) {
// Successor w has not yet been visited; recurse on it
tarjan(w);
list.set(llv, Math.min(list.get(llv), list.get(llw)));
} else if (stack.contains(w)) {
// Successor w is in stack S and hence in the current SCC
list.set(llv, Math.min(list.get(llv), list.get(ixw)));
}
}
// If v is a root node, pop the stack and generate an SCC
if (list.get(llv) == list.get(ixv)) {
int w;
Scope[] out = null;
do {
w = stack.pop();
final Scope scp = scopes.get(w);
out = out == null ? new Scope[] {scp} : Array.add(out, scp);
} while (w != v);
result.add(out);
}
}
/**
* Evaluates the full-text match.
*
* @param qc query context
* @return number of tokens, used for scoring
* @throws QueryException query exception
*/
private int contains(final QueryContext qc) throws QueryException {
first = true;
final FTLexer lexer = ftt.lexer(qc.ftToken);
// use faster evaluation for default options
int num = 0;
if (fast) {
for (final byte[] t : tokens) {
final FTTokens qtok = ftt.cache(t);
num = Math.max(num, ftt.contains(qtok, lexer) * qtok.length());
}
return num;
}
// find and count all occurrences
final boolean all = mode == FTMode.ALL || mode == FTMode.ALL_WORDS;
int oc = 0;
for (final byte[] w : unique(tokens(qc))) {
final FTTokens qtok = ftt.cache(w);
final int o = ftt.contains(qtok, lexer);
if (all && o == 0) return 0;
num = Math.max(num, o * qtok.length());
oc += o;
}
// check if occurrences are in valid range. if yes, return number of tokens
final long mn = occ != null ? toLong(occ[0], qc) : 1;
final long mx = occ != null ? toLong(occ[1], qc) : Long.MAX_VALUE;
if (mn == 0 && oc == 0) matches = FTNot.not(matches);
return oc >= mn && oc <= mx ? Math.max(1, num) : 0;
}
@Override
public void keyTyped(final KeyEvent e) {
if (undo == null || control(e) || DELNEXT.is(e) || DELPREV.is(e) || ESCAPE.is(e)) return;
text.pos(text.cursor());
// string to be added
String ch = String.valueOf(e.getKeyChar());
// remember if marked text is to be deleted
boolean del = true;
final byte[] txt = text.text();
if (TAB.is(e)) {
if (text.marked()) {
// check if lines are to be indented
final int s = Math.min(text.pos(), text.start());
final int l = Math.max(text.pos(), text.start()) - 1;
for (int p = s; p <= l && p < txt.length; p++) del &= txt[p] != '\n';
if (!del) {
text.indent(s, l, e.isShiftDown());
ch = null;
}
} else {
boolean c = true;
for (int p = text.pos() - 1; p >= 0 && c; p--) {
final byte b = txt[p];
c = ws(b);
if (b == '\n') break;
}
if (c) ch = " ";
}
}
// delete marked text
if (text.marked() && del) text.delete();
if (ENTER.is(e)) {
// adopt indentation from previous line
final StringBuilder sb = new StringBuilder(1).append(e.getKeyChar());
int s = 0;
for (int p = text.pos() - 1; p >= 0; p--) {
final byte b = txt[p];
if (b == '\n') break;
if (b == '\t') {
s += 2;
} else if (b == ' ') {
s++;
} else {
s = 0;
}
}
for (int p = 0; p < s; p++) sb.append(' ');
ch = sb.toString();
}
if (ch != null) text.add(ch);
text.setCaret();
rend.calc();
showCursor(2);
e.consume();
}
@Override
public final void mouseDragged(final MouseEvent e) {
if (!SwingUtilities.isLeftMouseButton(e)) return;
// selection mode
select(e.getPoint(), false);
final int y = Math.max(20, Math.min(e.getY(), getHeight() - 20));
if (y != e.getY()) scroll.pos(scroll.pos() + e.getY() - y);
}
/**
* Returns a pre value.
*
* @param id unique node id
* @return pre value or -1 if id was not found
*/
final int preold(final int id) {
// find pre value in table
for (int p = Math.max(0, id); p < meta.size; ++p) if (id == id(p)) return p;
final int ps = Math.min(meta.size, id);
for (int p = 0; p < ps; ++p) if (id == id(p)) return p;
// id not found
return -1;
}
/**
* Returns the date in seconds.
*
* @return seconds
*/
final BigDecimal seconds() {
int z = tz;
if (z == Short.MAX_VALUE) {
// [CG] XQuery, DateTime: may be removed
final long n = System.currentTimeMillis();
z = Calendar.getInstance().getTimeZone().getOffset(n) / 60000;
}
return (sec == null ? BigDecimal.ZERO : sec)
.add(BigDecimal.valueOf(Math.max(0, hou) * 3600 + Math.max(0, min) * 60 - z * 60));
}
@Override
public boolean indexAccessible(final IndexInfo ii) {
/* If the following conditions yield true, the index is accessed:
* - all query terms are statically available
* - no FTTimes option is specified
* - explicitly set case, diacritics and stemming match options do not
* conflict with index options. */
data = ii.ic.data;
final MetaData md = data.meta;
final FTOpt fto = ftt.opt;
/* Index will be applied if no explicit match options have been set
* that conflict with the index options. As a consequence, though, index-
* based querying might yield other results than sequential scanning. */
if (occ != null
|| fto.cs != null && md.casesens == (fto.cs == FTCase.INSENSITIVE)
|| fto.isSet(DC) && md.diacritics != fto.is(DC)
|| fto.isSet(ST) && md.stemming != fto.is(ST)
|| fto.ln != null && !fto.ln.equals(md.language)) return false;
// adopt database options to tokenizer
fto.copy(md);
// estimate costs if text is not known at compile time
if (tokens == null) {
ii.costs = Math.max(2, data.meta.size / 30);
return true;
}
// summarize number of hits; break loop if no hits are expected
final FTLexer ft = new FTLexer(fto);
ii.costs = 0;
for (byte[] t : tokens) {
ft.init(t);
while (ft.hasNext()) {
final byte[] tok = ft.nextToken();
if (fto.sw != null && fto.sw.contains(tok)) continue;
if (fto.is(WC)) {
// don't use index if one of the terms starts with a wildcard
t = ft.get();
if (t[0] == '.') return false;
// don't use index if certain characters or more than 1 dot are found
int d = 0;
for (final byte w : t) {
if (w == '{' || w == '\\' || w == '.' && ++d > 1) return false;
}
}
// favor full-text index requests over exact queries
final int costs = data.costs(ft);
if (costs != 0) ii.costs += Math.max(2, costs / 100);
}
}
return true;
}
/**
* Adds the time zone to the specified token builder.
*
* @param tb token builder
*/
void zone(final TokenBuilder tb) {
if (tz == Short.MAX_VALUE) return;
if (tz == 0) {
tb.add('Z');
} else {
tb.add(tz > 0 ? '+' : '-');
prefix(tb, Math.abs(tz) / 60, 2);
tb.add(':');
prefix(tb, Math.abs(tz) % 60, 2);
}
}
@Override
public Dimension getPreferredSize() {
final Graphics g = getGraphics();
w = Integer.MAX_VALUE;
h = Integer.MAX_VALUE;
init(g, 0);
int max = 0;
while (more(g)) {
if (text.curr() == 0x0A) max = Math.max(x, max);
next();
}
return new Dimension(Math.max(x, max) + fwidth[' '], y + fontH);
}
@Override
public DiskData build() throws IOException {
meta.assign(parser);
meta.dirty = true;
// calculate optimized output buffer sizes to reduce disk fragmentation
final Runtime rt = Runtime.getRuntime();
final long max = Math.min(1 << 22, rt.maxMemory() - rt.freeMemory() >> 2);
int bs = (int) Math.min(meta.filesize, max);
bs = Math.max(IO.BLOCKSIZE, bs - bs % IO.BLOCKSIZE);
// drop old database (if available) and create new one
DropDB.drop(dbname, sopts);
sopts.dbpath(dbname).md();
elemNames = new Names(meta);
attrNames = new Names(meta);
try {
tout = new DataOutput(new TableOutput(meta, DATATBL));
xout = new DataOutput(meta.dbfile(DATATXT), bs);
vout = new DataOutput(meta.dbfile(DATAATV), bs);
sout = new DataOutput(meta.dbfile(DATATMP), bs);
final Performance perf = Prop.debug ? new Performance() : null;
Util.debug(tit() + DOTS);
parse();
if (Prop.debug) Util.errln(" " + perf + " (" + Performance.getMemory() + ')');
} catch (final IOException ex) {
try {
close();
} catch (final IOException ignored) {
}
throw ex;
}
close();
// copy temporary values into database table
try (final DataInput in = new DataInput(meta.dbfile(DATATMP))) {
final TableAccess ta = new TableDiskAccess(meta, true);
for (; spos < ssize; ++spos) ta.write4(in.readNum(), 8, in.readNum());
ta.close();
}
meta.dbfile(DATATMP).delete();
// return database instance
return new DiskData(meta, elemNames, attrNames, path, ns);
}
/**
* Fill the current buffer with bytes from the specified array from the specified offset.
*
* @param s source array
* @param o offset from the beginning of the array
* @return number of written bytes
*/
private int write(final byte[] s, final int o) {
final Buffer bf = bm.current();
final int len = Math.min(IO.BLOCKSIZE, s.length - o);
System.arraycopy(s, o, bf.data, 0, len);
bf.dirty = true;
return len;
}
/**
* Finds line and column for the specified query parser.
*
* @param parser parser
*/
void pos(final InputParser parser) {
markedCol = parser.mark;
if (info != null) return;
// check if line/column information has already been added
parser.pos = Math.min(parser.mark, parser.length);
info = new InputInfo(parser);
}
/**
* Performs a wildcard search for the specified token.
*
* @param token token to look for
* @return iterator
*/
private synchronized IndexIterator wc(final byte[] token) {
final FTIndexIterator it = FTIndexIterator.FTEMPTY;
final FTWildcard wc = new FTWildcard(token);
if (!wc.parse()) return it;
final IntList pr = new IntList();
final IntList ps = new IntList();
final byte[] pref = wc.prefix();
final int pl = pref.length, tl = tp.length;
final int l = Math.min(tl - 1, wc.max());
for (int ti = pl; ti <= l; ti++) {
int i = tp[ti];
if (i == -1) continue;
int c = ti + 1;
int e = -1;
while (c < tl && e == -1) e = tp[c++];
i = find(pref, i, e, ti);
while (i < e) {
final byte[] t = inY.readBytes(i, ti);
if (!startsWith(t, pref)) break;
if (wc.match(t)) {
inZ.cursor(pointer(i, ti));
final int s = size(i, ti);
for (int d = 0; d < s; d++) {
pr.add(inZ.readNum());
ps.add(inZ.readNum());
}
}
i += ti + ENTRY;
}
}
return iter(new FTCache(pr, ps), token);
}
/**
* Draws the specified string.
*
* @param g graphics reference
* @param s text
* @param x x coordinate
* @param y y coordinate
* @param w width
* @param fs font size
*/
public static void chopString(
final Graphics g, final byte[] s, final int x, final int y, final int w, final int fs) {
if (w < 12) return;
final int[] cw = fontWidths(g.getFont());
int j = s.length;
try {
int l = 0;
int fw = 0;
for (int k = 0; k < j; k += l) {
final int ww = width(g, cw, cp(s, k));
if (fw + ww >= w - 4) {
j = Math.max(1, k - l);
if (k > 1) fw -= width(g, cw, cp(s, k - 1));
g.drawString("..", x + fw, y + fs);
break;
}
fw += ww;
l = cl(s, k);
}
} catch (final Exception ex) {
Util.debug(ex);
}
g.drawString(string(s, 0, j), x, y + fs);
}
@Override
public Value value(final QueryContext qc) throws QueryException {
final FItem getKey = checkArity(exprs[1], 1, qc);
final long k = Math.min(toLong(exprs[2], qc), Integer.MAX_VALUE);
if (k < 1) return Empty.SEQ;
final Iter iter = exprs[0].iter(qc);
final MinHeap<Item, Item> heap =
new MinHeap<>(
new Comparator<Item>() {
@Override
public int compare(final Item it1, final Item it2) {
try {
return OpV.LT.eval(it1, it2, sc.collation, sc, info) ? -1 : 1;
} catch (final QueryException qe) {
throw new QueryRTException(qe);
}
}
});
try {
for (Item it; (it = iter.next()) != null; ) {
heap.insert(checkNoEmpty(getKey.invokeItem(qc, info, it)), it);
if (heap.size() > k) heap.removeMin();
}
} catch (final QueryRTException ex) {
throw ex.getCause();
}
final ValueBuilder vb = new ValueBuilder();
while (!heap.isEmpty()) vb.addFront(heap.removeMin());
return vb.value();
}
@Override
public void keyTyped(final KeyEvent e) {
if (!hist.active()
|| control(e)
|| DELNEXT.is(e)
|| DELPREV.is(e)
|| ESCAPE.is(e)
|| CUT2.is(e)) return;
final int caret = editor.pos();
// remember if marked text is to be deleted
final StringBuilder sb = new StringBuilder(1).append(e.getKeyChar());
final boolean indent = TAB.is(e) && editor.indent(sb, e.isShiftDown());
// delete marked text
final boolean selected = editor.selected() && !indent;
if (selected) editor.delete();
final int move = ENTER.is(e) ? editor.enter(sb) : editor.add(sb, selected);
// refresh history and adjust cursor position
hist.store(editor.text(), caret, editor.pos());
if (move != 0) editor.pos(Math.min(editor.size(), caret + move));
// adjust text height
scrollCode.invokeLater(true);
e.consume();
}
@Override
public byte[] month(final int n, final int min, final int max) {
final TokenBuilder tb = new TokenBuilder();
tb.add(substring(MONTHS[n], 0, Math.max(3, max)));
while (tb.size() < min) tb.add(' ');
return tb.finish();
}
/**
* Adds an element entry to the internal update buffer.
*
* @param dist parent distance
* @param name tag name index
* @param asize number of attributes
* @param size node size
* @param uri namespace uri reference
* @param ne namespace flag
*/
public final void elem(
final int dist,
final int name,
final int asize,
final int size,
final int uri,
final boolean ne) {
// build and insert new entry
final int i = newID();
final int n = ne ? 1 << 7 : 0;
s(Math.min(IO.MAXATTS, asize) << 3 | ELEM);
s(n | (byte) (name >> 8));
s(name);
s(uri);
s(dist >> 24);
s(dist >> 16);
s(dist >> 8);
s(dist);
s(size >> 24);
s(size >> 16);
s(size >> 8);
s(size);
s(i >> 24);
s(i >> 16);
s(i >> 8);
s(i);
}
/**
* Adds an attribute entry to the internal update buffer.
*
* @param pre pre value
* @param dist parent distance
* @param name attribute name
* @param value attribute value
* @param uri namespace uri reference
* @param ne namespace flag
*/
public final void attr(
final int pre,
final int dist,
final int name,
final byte[] value,
final int uri,
final boolean ne) {
// add attribute to text storage
final int i = newID();
final long v = index(pre, i, value, ATTR);
final int n = ne ? 1 << 7 : 0;
s(Math.min(IO.MAXATTS, dist) << 3 | ATTR);
s(n | (byte) (name >> 8));
s(name);
s(v >> 32);
s(v >> 24);
s(v >> 16);
s(v >> 8);
s(v);
s(0);
s(0);
s(0);
s(uri);
s(i >> 24);
s(i >> 16);
s(i >> 8);
s(i);
}
/**
* Adds the time to the specified token builder.
*
* @param tb token builder
*/
final void time(final TokenBuilder tb) {
if (sec.remainder(DAYSECONDS).signum() == 0) return;
tb.add('T');
final long h = hou();
if (h != 0) {
tb.addLong(Math.abs(h));
tb.add('H');
}
final long m = min();
if (m != 0) {
tb.addLong(Math.abs(m));
tb.add('M');
}
final BigDecimal sc = sec();
if (sc.signum() == 0) return;
tb.add(Token.chopNumber(Token.token(sc.abs().toPlainString()))).add('S');
}
/**
* Adds/subtracts the specified yearMonth duration.
*
* @param dur duration
* @param plus plus/minus flag
* @param ii input info
* @throws QueryException query exception
*/
final void calc(final YMDur dur, final boolean plus, final InputInfo ii) throws QueryException {
final long m = plus ? dur.mon : -dur.mon;
final long mn = mon + m;
mon = (byte) mod(mn, 12);
yea += div(mn, 12);
day = (byte) Math.min(dpm(yea, mon) - 1, day);
if (yea <= MIN_YEAR || yea > MAX_YEAR) throw YEARRANGE_X.get(ii, yea);
}
/**
* Adds the date to the specified token builder.
*
* @param tb token builder
*/
final void date(final TokenBuilder tb) {
tb.add('P');
final long y = yea();
if (y != 0) {
tb.addLong(Math.abs(y));
tb.add('Y');
}
final long m = mon();
if (m != 0) {
tb.addLong(Math.abs(m));
tb.add('M');
}
final long d = day();
if (d != 0) {
tb.addLong(Math.abs(d));
tb.add('D');
}
}
/**
* Paints the error marker.
*
* @param g graphics reference
*/
private void drawError(final Graphics g) {
final int ww = wordW != 0 ? wordW : charW(g, ' ');
final int s = Math.max(1, fontH / 8);
g.setColor(GUIConstants.LRED);
g.fillRect(x, y + 2, ww, s);
g.setColor(GUIConstants.RED);
for (int xp = x; xp < x + ww; xp++) {
if ((xp & 1) == 0) g.drawLine(xp, y + 2, xp, y + s + 1);
}
}
/**
* Merges two matches.
*
* @param i1 first item
* @param i2 second item
*/
private static void and(final FTNode i1, final FTNode i2) {
final FTMatches all = new FTMatches((byte) Math.max(i1.matches().pos, i2.matches().pos));
for (final FTMatch s1 : i1.matches()) {
for (final FTMatch s2 : i2.matches()) {
all.add(new FTMatch(s1.size() + s2.size()).add(s1).add(s2));
}
}
i1.score(Scoring.avg(i1.score() + i2.score(), 2));
i1.matches(all);
}
/**
* Draws a visualization tooltip.
*
* @param g graphics reference
* @param tt tooltip label
* @param x horizontal position
* @param y vertical position
* @param w width
* @param c color color depth
*/
public static void drawTooltip(
final Graphics g, final String tt, final int x, final int y, final int w, final int c) {
final int tw = width(g, tt);
final int th = g.getFontMetrics().getHeight();
final int xx = Math.min(w - tw - 8, x);
g.setColor(color(c));
g.fillRect(xx - 1, y - th, tw + 4, th);
g.setColor(BACK);
g.drawString(tt, xx, y - 4);
}
/**
* Adds the specified dayTime duration.
*
* @param add value to be added
*/
private void add(final BigDecimal add) {
// normalized modulo: sc % 60 vs. (-sc + sc % 60 + 60 + sc) % 60
final BigDecimal sc = sec().add(add);
sec =
sc.signum() >= 0
? sc.remainder(BD60)
: sc.negate().add(sc.remainder(BD60)).add(BD60).add(sc).remainder(BD60);
final long mn = Math.max(min(), 0) + div(sc.longValue(), 60);
min = (byte) mod(mn, 60);
final long ho = Math.max(hou, 0) + div(mn, 60);
hou = (byte) mod(ho, 24);
final long da = div(ho, 24);
final long[] ymd = ymd(days().add(BigDecimal.valueOf(da)));
yea = ymd[0];
mon = (byte) ymd[1];
day = (byte) ymd[2];
}
/**
* Compiles the filter expression, excluding the root node.
*
* @param ctx query context
* @return compiled expression
*/
private Expr opt(final QueryContext ctx) {
// evaluate return type
final SeqType t = root.type();
// determine number of results and type
final long s = root.size();
if (s != -1) {
if (pos != null) {
size = Math.max(0, s + 1 - pos.min) - Math.max(0, s - pos.max);
} else if (last) {
size = s > 0 ? 1 : 0;
}
// no results will remain: return empty sequence
if (size == 0) return optPre(null, ctx);
type = SeqType.get(t.type, size);
} else {
type = SeqType.get(t.type, t.zeroOrOne() ? Occ.ZERO_ONE : Occ.ZERO_MORE);
}
// no numeric predicates.. use simple iterator
if (!super.has(Flag.FCS)) return new IterFilter(this);
// one single position() or last() function specified: return single value
if (preds.length == 1
&& (last || pos != null)
&& root.isValue()
&& t.one()
&& (last || pos.min == 1 && pos.max == 1)) return optPre(root, ctx);
// only choose deterministic and context-independent offsets; e.g., skip:
// (1 to 10)[random:integer(10)] or (1 to 10)[.]
boolean off = false;
if (preds.length == 1) {
final Expr p = preds[0];
final SeqType st = p.type();
off = st.type.isNumber() && st.zeroOrOne() && !p.has(Flag.CTX) && !p.has(Flag.NDT);
if (off) type = SeqType.get(type.type, Occ.ZERO_ONE);
}
// iterator for simple numeric predicate
return off || useIterator() ? new IterPosFilter(this, off) : this;
}
@Override
public synchronized int costs(final IndexToken it) {
final byte[] tok = it.get();
if (tok.length > data.meta.maxlen) return Integer.MAX_VALUE;
// estimate costs for queries which stretch over multiple index entries
final FTOpt opt = ((FTLexer) it).ftOpt();
if (opt.is(FZ) || opt.is(WC)) return Math.max(1, data.meta.size >> 4);
return entry(tok).size;
}
/**
* Performs a fuzzy search for the specified token with a maximum number of errors.
*
* @param token token to look for
* @param k number of errors allowed
* @return iterator
*/
private synchronized IndexIterator fuzzy(final byte[] token, final int k) {
FTIndexIterator it = FTIndexIterator.FTEMPTY;
final int tokl = token.length, tl = tp.length;
final int e = Math.min(tl - 1, tokl + k);
int s = Math.max(1, tokl - k) - 1;
while (++s <= e) {
int p = tp[s];
if (p == -1) continue;
int t = s + 1, r = -1;
while (t < tl && r == -1) r = tp[t++];
while (p < r) {
if (ls.similar(inY.readBytes(p, s), token, k)) {
it = FTIndexIterator.union(iter(pointer(p, s), size(p, s), inZ, token), it);
}
p += s + ENTRY;
}
}
return it;
}
@Override
public void paintComponent(final Graphics g) {
super.paintComponent(g);
final Runtime rt = Runtime.getRuntime();
final long max = rt.maxMemory();
final long total = rt.totalMemory();
final long used = total - rt.freeMemory();
final int ww = getWidth();
final int hh = getHeight();
// draw memory box
g.setColor(Color.white);
g.fillRect(0, 0, ww - 3, hh - 3);
g.setColor(GRAY);
g.drawLine(0, 0, ww - 4, 0);
g.drawLine(0, 0, 0, hh - 4);
g.drawLine(ww - 3, 0, ww - 3, hh - 3);
g.drawLine(0, hh - 3, ww - 3, hh - 3);
// show total memory usage
g.setColor(color1);
g.fillRect(2, 2, Math.max(1, (int) (total * (ww - 6) / max)), hh - 6);
// show current memory usage
final boolean full = used * 6 / 5 > max;
g.setColor(full ? colormark4 : color3);
g.fillRect(2, 2, Math.max(1, (int) (used * (ww - 6) / max)), hh - 6);
// print current memory usage
final FontMetrics fm = g.getFontMetrics();
final String mem = Performance.format(used, true);
final int fw = (ww - fm.stringWidth(mem)) / 2;
final int h = fm.getHeight() - 3;
g.setColor(full ? colormark3 : DGRAY);
g.drawString(mem, fw, h);
}
