/**
* Returns the entries of an archive.
*
* @param ctx query context
* @return entries
* @throws QueryException query exception
*/
private Iter entries(final QueryContext ctx) throws QueryException {
final B64 archive = (B64) checkType(checkItem(expr[0], ctx), AtomType.B64);
final ValueBuilder vb = new ValueBuilder();
final ArchiveIn in = ArchiveIn.get(archive.input(info), info);
try {
while (in.more()) {
final ZipEntry ze = in.entry();
if (ze.isDirectory()) continue;
final FElem e = new FElem(Q_ENTRY, NS);
long s = ze.getSize();
if (s != -1) e.add(Q_SIZE, token(s));
s = ze.getTime();
if (s != -1) e.add(Q_LAST_MOD, new Dtm(s, info).string(info));
s = ze.getCompressedSize();
if (s != -1) e.add(Q_COMP_SIZE, token(s));
e.add(ze.getName());
vb.add(e);
}
return vb;
} catch (final IOException ex) {
Util.debug(ex);
throw ARCH_FAIL.thrw(info, ex);
} finally {
in.close();
}
}
/**
* Returns the options of an archive.
*
* @param ctx query context
* @return entries
* @throws QueryException query exception
*/
private FElem options(final QueryContext ctx) throws QueryException {
final B64 archive = (B64) checkType(checkItem(expr[0], ctx), AtomType.B64);
String format = null;
int level = -1;
final ArchiveIn arch = ArchiveIn.get(archive.input(info), info);
try {
format = arch.format();
while (arch.more()) {
final ZipEntry ze = arch.entry();
if (ze.isDirectory()) continue;
level = ze.getMethod();
break;
}
} catch (final IOException ex) {
Util.debug(ex);
ARCH_FAIL.thrw(info, ex);
} finally {
arch.close();
}
// create result element
final FElem e = new FElem(Q_OPTIONS, NS);
if (format != null) e.add(new FElem(Q_FORMAT).add(Q_VALUE, format));
if (level >= 0) {
final byte[] lvl = level == 8 ? DEFLATE : level == 0 ? STORED : UNKNOWN;
e.add(new FElem(Q_ALGORITHM).add(Q_VALUE, lvl));
}
return e;
}
/**
* Processes a match.
*
* @param m matcher
* @param str string
* @param par parent
* @param g group number
* @return next group number and position in string
*/
private static int[] match(final Matcher m, final String str, final FElem par, final int g) {
final FElem nd = new FElem(g == 0 ? Q_MATCH : Q_MGROUP, new Atts(FN, FNURI));
if (g > 0) nd.add(Q_NR, token(g));
final int start = m.start(g), end = m.end(g), gc = m.groupCount();
int[] pos = {g + 1, start}; // group and position in string
while (pos[0] <= gc && m.end(pos[0]) <= end) {
final int st = m.start(pos[0]);
if (st >= 0) { // group matched
if (pos[1] < st) nd.add(str.substring(pos[1], st));
pos = match(m, str, nd, pos[0]);
} else pos[0]++; // skip it
}
if (pos[1] < end) {
nd.add(str.substring(pos[1], end));
pos[1] = end;
}
par.add(nd);
return pos;
}
/**
* Processes a non-match.
*
* @param text text
* @param par root node
*/
private static void nonmatch(final String text, final FElem par) {
par.add(new FElem(Q_NONMATCH, new Atts(FN, FNURI)).add(text));
}