Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Copyright (C) 2002-2012 XimpleWare, [email protected]
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
/*
*
* this class is created to update VTDNavHuge's implementation with
* a more thread safe version
*/
package com.ximpleware.extended;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStream;
//import com.ximpleware.extended.parser.UTF8Char;
import com.ximpleware.BookMark;
import com.ximpleware.NavException;
import com.ximpleware.VTDNav;
import com.ximpleware.extended.parser.*;
//import com.ximpleware.NavException;
/**
*
* VTDNavHuge is a cursor-based VTD record navigator supporting extended VTD (256 GB max file size).
* The core navigation routines are toElement() and toElementNS()
* push() and pop() allows one to save and restore the location of the cursor
* String comparsions and primitive data type conversions are done directly from VTD records
* without intermediatary string creation.
*/
public class VTDNavHuge {
// Navigation directions
public final static int ROOT = 0;
public final static int PARENT = 1;
public final static int FIRST_CHILD = 2;
public final static int LAST_CHILD = 3;
public final static int NEXT_SIBLING = 4;
public final static int PREV_SIBLING = 5;
// Navigation directions
public final static int R = 0;
public final static int P = 1;
public final static int FC = 2;
public final static int LC = 3;
public final static int NS = 4;
public final static int PS = 5;
// token type definitions
public final static int TOKEN_STARTING_TAG = 0;
public final static int TOKEN_ENDING_TAG = 1;
public final static int TOKEN_ATTR_NAME = 2;
public final static int TOKEN_ATTR_NS = 3;
public final static int TOKEN_ATTR_VAL = 4;
public final static int TOKEN_CHARACTER_DATA = 5;
public final static int TOKEN_COMMENT = 6;
public final static int TOKEN_PI_NAME = 7;
public final static int TOKEN_PI_VAL = 8;
public final static int TOKEN_DEC_ATTR_NAME = 9;
public final static int TOKEN_DEC_ATTR_VAL = 10;
public final static int TOKEN_CDATA_VAL = 11;
public final static int TOKEN_DTD_VAL = 12;
public final static int TOKEN_DOCUMENT =13;
// encoding format definition here
public final static int FORMAT_UTF8 = 2;
public final static int FORMAT_ASCII = 0;
public final static int FORMAT_ISO_8859_1 = 1;
public final static int FORMAT_ISO_8859_2 = 3;
public final static int FORMAT_ISO_8859_3 = 4;
public final static int FORMAT_ISO_8859_4 = 5;
public final static int FORMAT_ISO_8859_5 = 6;
public final static int FORMAT_ISO_8859_6 = 7;
public final static int FORMAT_ISO_8859_7 = 8;
public final static int FORMAT_ISO_8859_8 = 9;
public final static int FORMAT_ISO_8859_9 = 10;
public final static int FORMAT_ISO_8859_10 = 11;
public final static int FORMAT_ISO_8859_11 = 12;
public final static int FORMAT_ISO_8859_12 = 13;
public final static int FORMAT_ISO_8859_13 = 14;
public final static int FORMAT_ISO_8859_14 = 15;
public final static int FORMAT_ISO_8859_15 = 16;
public final static int FORMAT_ISO_8859_16 = 17;
public final static int FORMAT_WIN_1250 = 18;
public final static int FORMAT_WIN_1251 = 19;
public final static int FORMAT_WIN_1252 = 20;
public final static int FORMAT_WIN_1253 = 21;
public final static int FORMAT_WIN_1254 = 22;
public final static int FORMAT_WIN_1255 = 23;
public final static int FORMAT_WIN_1256 = 24;
public final static int FORMAT_WIN_1257 = 25;
public final static int FORMAT_WIN_1258 = 26;
public final static int FORMAT_UTF_16LE = 64;
public final static int FORMAT_UTF_16BE = 63;
// masks for obtaining various fields from a VTD token 16-bit long
protected final static long MASK_TOKEN_FULL_LEN = 0x007fffc000000000L;
private final static long MASK_TOKEN_PRE_LEN = 0x007f000000000000L;
private final static long MASK_TOKEN_QN_LEN = 0x0000ffc000000000L;
private final static long MASK_TOKEN_OFFSET = 0x0000003fffffffffL;
private final static long MASK_TOKEN_TYPE = 0xf000000000000000L;
private final static long MASK_TOKEN_DEPTH = 0x0f80000000000000L;
// tri-state variable for namespace lookup
//private final static long MASK_TOKEN_NS_MARK = 0x00000000c0000000L;
protected int rootIndex; // where the root element is at
protected int nestingLevel;
protected int[] context; // main navigation tracker aka context object
protected boolean atTerminal; // this variable is to make vn compatible with
// xpath's data model
// location cache part
protected int l2upper;
protected int l2lower;
protected int l3upper;
protected int l3lower;
protected int l2index;
protected int l3index;
protected int l1index;
// containers
protected ILongBuffer vtdBuffer;
protected ILongBuffer l1Buffer;
protected ILongBuffer l2Buffer;
protected IIntBuffer l3Buffer;
protected IByteBuffer XMLDoc;
//private int recentNS; // most recently visited NS node, experiment for now
// Hierarchical representation is an array of integers addressing elements tokens
private ContextBuffer contextStack;
protected ContextBuffer contextStack2;// this is reserved for XPath
protected int LN; // record txt and attrbute for XPath eval purposes
// the document encoding
protected int encoding;
//protected boolean writeOffsetAdjustment;
// for string to token comparison
//protected int currentOffset;
//protected int currentOffset2;
// whether the navigation is namespace enabled or not.
protected boolean ns;
// intermediate buffer for push and pop purposes
protected int[] stackTemp;
protected long docOffset;
// length of the document
protected long docLen;
protected int vtdSize; //vtd record count
/**
* Initialize the VTD navigation object.
* @param RootIndex int
* @param maxDepth int
* @param encoding int
* @param NS boolean
* @param x byte[]
* @param vtd com.ximpleware.extended.ILongBuffer
* @param l1 com.ximpleware.extended.ILongBuffer
* @param l2 com.ximpleware.extended.ILongBuffer
* @param l3 com.ximpleware.extended.IIntBuffer
* @param so int starting offset of the document(in byte)
* @param length int length of the document (in byte)
*/
protected VTDNavHuge(
int RootIndex,
int enc,
boolean NS,
int depth,
IByteBuffer x,
ILongBuffer vtd,
ILongBuffer l1,
ILongBuffer l2,
IIntBuffer l3,
long so, // start offset of the starting offset(in byte)
long length) // lengnth of the XML document (in byte))
{
// initialize all buffers
if (l1 == null
|| l2 == null
|| l3 == null
|| vtd == null
|| x == null
|| depth < 0
|| RootIndex < 0 //|| encoding <= FORMAT_UTF8
//|| encoding >= FORMAT_ISO_8859_1
|| so < 0
|| length < 0) {
throw new IllegalArgumentException();
}
l1Buffer = l1;
l2Buffer = l2;
l3Buffer = l3;
vtdBuffer = vtd;
XMLDoc = x;
encoding = enc;
//System.out.println("encoding " + encoding);
rootIndex = RootIndex;
nestingLevel = depth + 1;
ns = NS; // namespace aware or not
//if (ns == false)
// MASK_TOKEN_OFFSET = 0x000000007fffffffL; // this allows xml size to be 2GB
//else // if there is no namespace
// MASK_TOKEN_OFFSET = 0x000000003fffffffL;
atTerminal = false; //this variable will only change value during XPath eval
// initialize the context object
this.context = new int[nestingLevel];
//depth value is the first entry in the context because root is singular.
context[0] = 0;
//set the value to zero
for (int i = 1; i < nestingLevel; i++) {
context[i] = -1;
}
//currentOffset = 0;
//contextStack = new ContextBuffer(1024, nestingLevel + 7);
contextStack = new ContextBuffer(10, nestingLevel + 9);
contextStack2 = new ContextBuffer(10, nestingLevel+9);
stackTemp = new int[nestingLevel + 9];
// initial state of LC variables
l1index = l2index = l3index = -1;
l2lower = l3lower = -1;
l2upper = l3upper = -1;
docOffset = so;
docLen = length;
//System.out.println("offset " + offset + " length " + length);
//printL2Buffer();
vtdSize = vtd.size();
//writeOffsetAdjustment = false;
//recentNS = -1;
}
/**
* Return the attribute count of the element at the cursor position.
* when ns is false, ns tokens are considered attributes;
* otherwise, ns tokens are not considered attributes
* @return int
*/
public int getAttrCount() {
if (context[0]==-1)return 0;
int count = 0;
int index = getCurrentIndex() + 1;
while (index < vtdSize) {
int type = getTokenType(index);
if (type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_VAL
|| type == TOKEN_ATTR_NS) {
if (type == TOKEN_ATTR_NAME
|| (!ns && (type == TOKEN_ATTR_NS))) {
count++;
}
} else
break;
index++;
}
return count;
}
/**
* Get the token index of the attribute value given an attribute name.
* @return int (-1 if no such attribute name exists)
* @param an java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD etc can be generated by another
* machine from a load-balancer.
* @exception IllegalArguementException if an is null
*/
public int getAttrVal(String an) throws NavExceptionHuge {
//int size = vtdBuffer.size();
if (context[0]==-1)
return -1;
int index = (context[0] != 0) ? context[context[0]] + 1 : rootIndex + 1;
int type;
if (index= vtdSize)
break;
type = getTokenType(index);
}
} else {
while ((type == TOKEN_ATTR_NAME || type == TOKEN_ATTR_NS)) {
if (type == TOKEN_ATTR_NAME
&& matchRawTokenString(
index,
an)) { // ns node visible only ns is disabled
return index + 1;
}
index += 2;
if (index>=vtdSize)
break;
type = getTokenType(index);
}
}
return -1;
}
/**
* Get the token index of the attribute value of given URL and local name.
* If ns is not enabled, the lookup will return -1, indicating a no-found.
* Also namespace nodes are invisible using this method.
* One can't use * to indicate any name space because * is ambiguous!!
* @return int (-1 if no matching attribute found)
* @param URL java.lang.String (Name space URL)
* @param ln java.lang.String (local name)
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD etc can be generated by another
* machine from a load-balancer.
* @exception IllegalArguementException if s is null
*/
public int getAttrValNS(String URL, String ln) throws NavExceptionHuge {
if (ns == false)
return -1;
if (URL == null)
return getAttrVal(ln);
int size = vtdBuffer.size();
int index = (context[0] != 0) ? context[context[0]] + 1 : rootIndex + 1;
// point to the token next to the element tag
int type;
if (index> 16) & 0xffff;
int fullLen = i & 0xffff;
if (preLen != 0
// attribute name without a prefix is not bound to any namespaces
&& matchRawTokenString(
offset + preLen + 1,
fullLen - preLen - 1,
ln)
&& resolveNS(URL, offset, preLen)) {
return index + 1;
}
index += 2;
if (index>=vtdSize)
break;
type = getTokenType(index);
}
return -1;
}
private long handle_utf8(long temp, long offset) throws NavExceptionHuge {
int c, d, a;
long val;
switch (UTF8Char.byteCount((int)temp & 0xff)) {
case 2:
c = 0x1f;
d = 6;
a = 1;
break;
case 3:
c = 0x0f;
d = 12;
a = 2;
break;
case 4:
c = 0x07;
d = 18;
a = 3;
break;
case 5:
c = 0x03;
d = 24;
a = 4;
break;
case 6:
c = 0x01;
d = 30;
a = 5;
break;
default:
throw new NavExceptionHuge("UTF 8 encoding error: should never happen");
}
val = (temp & c) << d;
int i = a - 1;
while (i >= 0) {
temp = XMLDoc.byteAt(offset + a - i);
if ((temp & 0xc0) != 0x80)
throw new NavExceptionHuge(
"UTF 8 encoding error: should never happen");
val = val | ((temp & 0x3f) << ((i << 2) + (i << 1)));
i--;
}
//currentOffset += a + 1;
return val | (((long)(a+1))<<32);
}
private long handle_utf16le(long offset) throws NavExceptionHuge {
// implement UTF-16LE to UCS4 conversion
int val, temp =
(XMLDoc.byteAt((offset << 1) + 1 ) & 0xff)
<< 8 | (XMLDoc.byteAt(offset << 1) & 0xff);
if (temp < 0xdc00 || temp > 0xdfff) { // check for low surrogate
if (temp == '\r') {
if (XMLDoc.byteAt((offset << 1) + 2) == '\n'
&& XMLDoc.byteAt((offset << 1) + 3) == 0) {
return '\n' | (2L<<32) ;
} else {
return '\n' | (1L<<32);
}
}
return temp | (1L<<32);
} else {
if (temp<0xd800 || temp>0xdbff)
throw new NavExceptionHuge("UTF 16 LE encoding error: should never happen");
val = temp;
temp =
(XMLDoc.byteAt((offset << 1) + 3)&0xff)
<< 8 | (XMLDoc.byteAt((offset << 1) + 2) & 0xff);
if (temp < 0xdc00 || temp > 0xdfff) {
// has to be high surrogate
throw new NavExceptionHuge("UTF 16 LE encoding error: should never happen");
}
val = ((temp - 0xd800)<<10) + (val - 0xdc00) + 0x10000;
return val | (2L<<32);
}
//System.out.println("UTF 16 LE unimplemented for now");
}
private long handle_utf16be(long offset) throws NavExceptionHuge{
long val;
int temp =
((XMLDoc.byteAt(offset << 1) & 0xff) << 8)
|(XMLDoc.byteAt((offset << 1) + 1)& 0xff);
if ((temp < 0xd800)
|| (temp > 0xdfff)) { // not a high surrogate
if (temp == '\r') {
if (XMLDoc.byteAt((offset << 1) + 3) == '\n'
&& XMLDoc.byteAt((offset << 1) + 2) == 0) {
return '\n'|(2L<<32);
} else {
return '\n'|(1L<<32);
}
}
//currentOffset++;
return temp| (1L<<32);
} else {
if (temp<0xd800 || temp>0xdbff)
throw new NavExceptionHuge("UTF 16 BE encoding error: should never happen");
val = temp;
temp =
((XMLDoc.byteAt((offset << 1) + 2) & 0xff)
<< 8) | (XMLDoc.byteAt((offset << 1 )+ 3) & 0xff);
if (temp < 0xdc00 || temp > 0xdfff) {
// has to be a low surrogate here
throw new NavExceptionHuge("UTF 16 BE encoding error: should never happen");
}
val = ((temp - 0xd800) << 10) + (val - 0xdc00) + 0x10000;
//currentOffset += 2;
return val | (2L<<32);
}
}
private long getChar4OtherEncoding(long offset) throws NavExceptionHuge{
if (encoding <= FORMAT_WIN_1258){
int temp = decode(offset);
if (temp == '\r') {
if (XMLDoc.byteAt(offset + 1) == '\n') {
return '\n'|(2L<<32);
} else {
return '\n'|(1L<<32);
}
}
return temp|(1L<<32);
}
throw new NavExceptionHuge("Unknown Encoding");
}
/**
* This method decodes the underlying byte array into corresponding UCS2 char representation .
* It doesn't resolves built-in entity and character references.
* Length will never be zero
* Creation date: (11/21/03 6:26:17 PM)
* @return int
* @exception com.ximpleware.extended.NavExceptionHuge The exception is thrown if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine, e.g. from a load-balancer.
*/
private long getChar(long offset) throws NavExceptionHuge {
long temp = 0;
//int a, c, d;
//int val;
//int ch;
//int inc;
//a = c = d = val = 0;
switch (encoding) {
case FORMAT_ASCII : // ascii is compatible with UTF-8, the offset value is bytes
temp = XMLDoc.byteAt(offset);
if (temp == '\r') {
if (XMLDoc.byteAt(offset + 1) == '\n') {
return '\n'|(2L<<32);
} else {
return '\n'|(1L<<32);
}
}
return temp|(1L<<32);
case FORMAT_ISO_8859_1 :
temp = XMLDoc.byteAt(offset);
if (temp == '\r') {
if (XMLDoc.byteAt(offset + 1) == '\n') {
return '\n'|(2L<<32);
} else {
return '\n'|(1L<<32);
}
}
return (temp & 0xff)|(1L<<32);
case FORMAT_UTF8 :
temp = XMLDoc.byteAt(offset);
if (temp>=0){
if (temp == '\r') {
if (XMLDoc.byteAt(offset + 1) == '\n') {
return '\n'|(2L<<32);
} else {
return '\n'|(1L<<32);
}
}
//currentOffset++;
return temp|(1L<<32);
}
return handle_utf8(temp,offset);
case FORMAT_UTF_16BE :
return handle_utf16be(offset);
case FORMAT_UTF_16LE :
return handle_utf16le(offset);
default :
return getChar4OtherEncoding(offset);
//throw new NavExceptionHuge("Unknown Encoding");
}
}
/* the exact same copy of getChar except it operates on currentOffset2
* this is needed to compare VTD tokens directly
*/
/**
* This method decodes the underlying byte array into corresponding UCS2 char representation .
* Also it resolves built-in entity and character references.
* @return int
* @exception com.ximpleware.extended.NavExceptionHuge The exception is thrown if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine from a load-balancer.
*/
private long getCharResolved(long offset) throws NavExceptionHuge {
int ch = 0;
int val = 0;
long inc =2;
long l = getChar(offset);
ch = (int)l;
if (ch != '&')
return l;
// let us handle references here
//currentOffset++;
offset++;
ch = getCharUnit(offset);
offset++;
switch (ch) {
case '#' :
ch = getCharUnit(offset);
if (ch == 'x') {
while (true) {
offset++;
inc++;
ch = getCharUnit(offset);
if (ch >= '0' && ch <= '9') {
val = (val << 4) + (ch - '0');
} else if (ch >= 'a' && ch <= 'f') {
val = (val << 4) + (ch - 'a' + 10);
} else if (ch >= 'A' && ch <= 'F') {
val = (val << 4) + (ch - 'A' + 10);
} else if (ch == ';') {
inc++;
break;
} else
throw new NavExceptionHuge("Illegal char in a char reference");
}
} else {
while (true) {
ch = getCharUnit(offset);
offset++;
inc++;
if (ch >= '0' && ch <= '9') {
val = val * 10 + (ch - '0');
} else if (ch == ';') {
break;
} else
throw new NavExceptionHuge("Illegal char in char reference");
}
}
break;
case 'a' :
ch = getCharUnit(offset);
if (ch == 'm') {
if (getCharUnit(offset + 1) == 'p'
&& getCharUnit(offset + 2) == ';') {
inc = 5;
val = '&';
} else
throw new NavExceptionHuge("illegal builtin reference");
} else if (ch == 'p') {
if (getCharUnit(offset + 1) == 'o'
&& getCharUnit(offset + 2) == 's'
&& getCharUnit(offset + 3) == ';') {
inc = 6;
val = '\'';
} else
throw new NavExceptionHuge("illegal builtin reference");
} else
throw new NavExceptionHuge("illegal builtin reference");
break;
case 'q' :
if (getCharUnit(offset) == 'u'
&& getCharUnit(offset + 1) == 'o'
&& getCharUnit(offset + 2) == 't'
&& getCharUnit(offset + 3) ==';') {
inc = 6;
val = '\"';
} else
throw new NavExceptionHuge("illegal builtin reference");
break;
case 'l' :
if (getCharUnit(offset) == 't'
&& getCharUnit(offset + 1) == ';') {
//offset += 2;
inc = 4;
val = '<';
} else
throw new NavExceptionHuge("illegal builtin reference");
break;
case 'g' :
if (getCharUnit(offset) == 't'
&& getCharUnit(offset + 1) == ';') {
inc = 4;
val = '>';
} else
throw new NavExceptionHuge("illegal builtin reference");
break;
default :
throw new NavExceptionHuge("Invalid entity char");
}
//currentOffset++;
return val | (inc << 32);
}
/* the exact same copy of getCharResolved except it operates on currentOffset2
* this is needed to compare VTD tokens directly
*/
/* private int getCharResolved2() throws NavExceptionHuge {
int ch = 0;
int val = 0;
ch = getChar2();
if (ch != '&')
return ch;
// let us handle references here
//currentOffset++;
ch = getCharUnit(currentOffset2);
currentOffset2++;
switch (ch) {
case '#' :
ch = getCharUnit(currentOffset2);
if (ch == 'x') {
while (true) {
currentOffset2++;
ch = getCharUnit(currentOffset2);
if (ch >= '0' && ch <= '9') {
val = (val << 4) + (ch - '0');
} else if (ch >= 'a' && ch <= 'f') {
val = (val << 4) + (ch - 'a' + 10);
} else if (ch >= 'A' && ch <= 'F') {
val = (val << 4) + (ch - 'A' + 10);
} else if (ch == ';') {
currentOffset2++;
break;
} else
throw new NavExceptionHuge("Illegal char in a char reference");
}
} else {
while (true) {
ch = getCharUnit(currentOffset2);
if (ch >= '0' && ch <= '9') {
val = val * 10 + (ch - '0');
} else if (ch == ';') {
currentOffset2++;
break;
} else
throw new NavExceptionHuge("Illegal char in char reference");
currentOffset2++;
}
}
break;
case 'a' :
ch = getCharUnit(currentOffset2);
if (ch == 'm') {
if (getCharUnit(currentOffset2 + 1) == 'p'
&& getCharUnit(currentOffset2 + 2) == ';') {
currentOffset2 += 3;
val = '&';
} else
throw new NavExceptionHuge("illegal builtin reference");
} else if (ch == 'p') {
if (getCharUnit(currentOffset2 + 1) == 'o'
&& getCharUnit(currentOffset2 + 2) == 's'
&& getCharUnit(currentOffset2 + 3) == ';') {
currentOffset2 += 4;
val = '\'';
} else
throw new NavExceptionHuge("illegal builtin reference");
} else
throw new NavExceptionHuge("illegal builtin reference");
break;
case 'q' :
if (getCharUnit(currentOffset2) == 'u'
&& getCharUnit(currentOffset2 + 1) == 'o'
&& getCharUnit(currentOffset2 + 2) == 't'
&& getCharUnit(currentOffset2 + 3) == ';') {
currentOffset2 += 4;
val = '\"';
} else
throw new NavExceptionHuge("illegal builtin reference");
break;
case 'l' :
if (getCharUnit(currentOffset2) == 't'
&& getCharUnit(currentOffset2 + 1) == ';') {
currentOffset2 += 2;
val = '<';
} else
throw new NavExceptionHuge("illegal builtin reference");
break;
case 'g' :
if (getCharUnit(currentOffset2) == 't'
&& getCharUnit(currentOffset2 + 1) == ';') {
currentOffset2 += 2;
val = '>';
} else
throw new NavExceptionHuge("illegal builtin reference");
break;
default :
throw new NavExceptionHuge("Invalid entity char");
}
//currentOffset++;
return val;
}*/
private int decode(long offset){
byte ch = XMLDoc.byteAt(offset);
switch(encoding){
case FORMAT_ISO_8859_2:
return ISO8859_2.decode(ch);
case FORMAT_ISO_8859_3:
return ISO8859_3.decode(ch);
case FORMAT_ISO_8859_4:
return ISO8859_4.decode(ch);
case FORMAT_ISO_8859_5:
return ISO8859_5.decode(ch);
case FORMAT_ISO_8859_6:
return ISO8859_6.decode(ch);
case FORMAT_ISO_8859_7:
return ISO8859_7.decode(ch);
case FORMAT_ISO_8859_8:
return ISO8859_8.decode(ch);
case FORMAT_ISO_8859_9:
return ISO8859_9.decode(ch);
case FORMAT_ISO_8859_10:
return ISO8859_10.decode(ch);
case FORMAT_ISO_8859_11:
return ISO8859_11.decode(ch);
case FORMAT_ISO_8859_13:
return ISO8859_13.decode(ch);
case FORMAT_ISO_8859_14:
return ISO8859_14.decode(ch);
case FORMAT_ISO_8859_15:
return ISO8859_15.decode(ch);
case FORMAT_WIN_1250:
return WIN1250.decode(ch);
case FORMAT_WIN_1251:
return WIN1251.decode(ch);
case FORMAT_WIN_1252:
return WIN1252.decode(ch);
case FORMAT_WIN_1253:
return WIN1253.decode(ch);
case FORMAT_WIN_1254:
return WIN1254.decode(ch);
case FORMAT_WIN_1255:
return WIN1255.decode(ch);
case FORMAT_WIN_1256:
return WIN1256.decode(ch);
case FORMAT_WIN_1257:
return WIN1257.decode(ch);
default:
return WIN1258.decode(ch);
}
}
/**
* Get the next char unit which gets decoded automatically
* @return int
*/
private int getCharUnit(long offset) {
return (encoding <= 2)
? XMLDoc.byteAt(offset) & 0xff
: (encoding <= FORMAT_WIN_1258)
? decode(offset):(encoding == FORMAT_UTF_16BE)
? (XMLDoc.byteAt(offset << 1)
<< 8 | XMLDoc.byteAt((offset << 1) + 1))
: (XMLDoc.byteAt((offset << 1) + 1)
<< 8 | XMLDoc.byteAt(offset << 1));
}
/**
* Get the depth (>=0) of the current element.
* Creation date: (11/16/03 6:58:22 PM)
* @return int
*/
final public int getCurrentDepth() {
return context[0];
}
/**
* Get the index value of the current element.
* Creation date: (11/16/03 6:40:25 PM)
* @return int
*/
final public int getCurrentIndex() {
if (atTerminal)
return LN;
switch(context[0]){
case -1: return 0;
case 0: return rootIndex;
default: return context[context[0]];
}
//return (context[0] == 0) ? rootIndex : context[context[0]];
}
// this one is used in iterAttr() in autoPilot
final protected int getCurrentIndex2(){
switch(context[0]){
case -1: return 0;
case 0: return rootIndex;
default: return context[context[0]];
}
}
/**
* Get the encoding of the XML document.
* @return int
*/
final public int getEncoding() {
return encoding;
}
/**
* Get the maximum nesting depth of the XML document (>0).
* max depth is nestingLevel -1
* @return int
*/
final public int getNestingLevel() {
return nestingLevel;
}
/**
*
* @return
*/
final protected long getOffsetAfterHead(){
int i = getCurrentIndex();
if (getTokenType(i)!=VTDNavHuge.TOKEN_STARTING_TAG){
return -1;
}
int j=i+1;
while (j= vtdSize)
break;
type = getTokenType(index);
}
return -1;
}
/**
* Get total number of VTD tokens for the current XML document.
* @return int
*/
final public int getTokenCount() {
return vtdSize;
}
/**
* Get the depth value of a token (>=0).
* @return int
* @param index int
*/
final public int getTokenDepth(int index) {
int i = (int) ((vtdBuffer.longAt(index) & MASK_TOKEN_DEPTH) >> 55);
if (i != 31)
return i;
return -1;
}
/**
* Get the token length at the given index value
* please refer to VTD spec for more details
* Length is in terms of the UTF char unit
* For prefixed tokens, it is the qualified name length.
* When ns is not enabled, return the full name length for attribute name and element name
* When ns is enabled, return an int with upper 16 bit for prefix length, lower 16 bit for qname length
* @return int
* @param index int
*/
public int getTokenLength(int index) {
int type = getTokenType(index);
int depth;
//int val;
int len = 0;
long l;
long temp=0;
switch (type) {
case TOKEN_ATTR_NAME :
case TOKEN_ATTR_NS :
case TOKEN_STARTING_TAG :
l = vtdBuffer.longAt(index);
return (ns == false)
? (int) ((l & MASK_TOKEN_QN_LEN) >> 38)
: ((int) ((l & MASK_TOKEN_QN_LEN)
>> 38)
| ((int) ((l & MASK_TOKEN_PRE_LEN)
>> 32)));
case TOKEN_CHARACTER_DATA:
case TOKEN_CDATA_VAL:
case TOKEN_COMMENT: // make sure this is total length
depth = getTokenDepth(index);
do{
len = len + (int)
((vtdBuffer.longAt(index)& MASK_TOKEN_FULL_LEN) >> 38);
temp = getTokenOffset(index)+(int)
((vtdBuffer.longAt(index)& MASK_TOKEN_FULL_LEN) >> 38);
index++;
}
while(index < vtdSize && depth == getTokenDepth(index)
&& type == getTokenType(index)
&& temp == getTokenOffset(index));
//if (int k=0)
return len;
default :
return (int)
((vtdBuffer.longAt(index) & MASK_TOKEN_FULL_LEN) >> 38);
}
}
/**
* Get the starting offset of the token at the given index.
* @return int
* @param index int
*/
final public long getTokenOffset(int index) {
//return (context[0] != 0)
// ? (int) (vtdBuffer.longAt(context[context[0]]) & MASK_TOKEN_OFFSET)
// : (int) (vtdBuffer.longAt(rootIndex) & MASK_TOKEN_OFFSET);
return (vtdBuffer.longAt(index) & MASK_TOKEN_OFFSET);
}
/** Get the XML document
* @return IByteBuffer
*/
final public IByteBuffer getXML() {
return XMLDoc;
}
/**
* Get the token type of the token at the given index value.
* Creation date: (11/16/03 6:41:51 PM)
* @return int
* @param index int
*/
final public int getTokenType(int index) {
return (int) ((vtdBuffer.longAt(index) & MASK_TOKEN_TYPE) >> 60) & 0xf;
}
/**
* Test whether current element has an attribute with the matching name.
* "*" will match any attribute name, therefore is a test whether there is any attribute at all
* if namespace is disabled, this function will not distinguish between ns declaration and attribute
* otherwise, ns tokens are invisible
* Creation date: (11/16/03 5:50:26 PM)
* @return boolean (true if such an attribute exists)
* @param an java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD etc can be generated by another
* machine from a load-balancer.
* @exception IllegalArguementException if an is null
*/
final public boolean hasAttr(String an) throws NavExceptionHuge {
return getAttrVal(an)!=-1;
}
/**
* Test whether the current element has an attribute with
* matching namespace URL and localname.
* If ns is false, return false immediately
* @return boolean
* @param URL java.lang.String (namespace URL)
* @param ln java.lang.String (localname )
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
* @exception IllegalArguementException if ln is null
*/
final public boolean hasAttrNS(String URL, String ln) throws NavExceptionHuge {
return (getAttrValNS(URL, ln) != -1);
}
/**
* Test the token type, to see if it is a starting tag.
* @return boolean
* @param index int
*/
private final boolean isElement(int index) {
return (((vtdBuffer.longAt(index) & MASK_TOKEN_TYPE) >> 60) & 0xf)
== TOKEN_STARTING_TAG;
}
/**
* Test the token type, to see if it is a starting tag
* or document token (introduced in 1.0).
* @return boolean
* @param index int
*/
private final boolean isElementOrDocument(int index){
long i =(((vtdBuffer.longAt(index) & MASK_TOKEN_TYPE) >> 60) & 0xf);
return (i==TOKEN_STARTING_TAG||i==TOKEN_DOCUMENT);
}
/**
* Test whether ch is a white space character or not.
* @return boolean
* @param ch int
*/
final private boolean isWS(int ch) {
return (ch == ' ' || ch == '\n' || ch == '\t' || ch == '\r');
}
/**
* This function is called by selectElement_P in autoPilot
* @param en element Name
* @param a context of current position
* @param special whether the test type is node()
* @return boolean
* @throws NavExceptionHuge
*/
protected boolean iterate_preceding(String en, int[] a, boolean special)
throws NavExceptionHuge {
int index = getCurrentIndex() - 1;
int t,d;
//int depth = getTokenDepth(index);
//int size = vtdBuffer.size();
while (index > 0) {
if (isElementOrDocument(index)) {
int depth = getTokenDepth(index);
context[0] = depth;
//context[depth]=index;
if (depth>0){
context[depth] = index;
t = index -1;
for (int i=depth-1;i>0;i--){
if (context[i]>index || context[i] == -1){
while(t>0){
d = getTokenDepth(t);
if ( d == i && isElement(t)){
context[i] = t;
break;
}
t--;
}
}else
break;
}
}
//dumpContext();
if (index!= a[depth] && (special || matchElement(en))) {
resolveLC();
return true;
}
}
index--;
}
return false;
}
/**
* This function is called by selectElementNS_P in autoPilot
* @param URL
* @param ln
* @return boolean
* @throws NavExceptionHuge
*/
protected boolean iterate_precedingNS(String URL, String ln, int[] a )
throws NavExceptionHuge {
int index = getCurrentIndex() - 1;
int t,d;
//int depth = getTokenDepth(index);
//int size = vtdBuffer.size();
while (index > 0 ) {
if (isElementOrDocument(index)) {
int depth = getTokenDepth(index);
context[0] = depth;
//context[depth]=index;
if (depth>0){
context[depth] = index;
t = index -1;
for (int i=depth-1;i>0;i--){
if (context[i]>index || context[i]==-1){
while(t>0){
d = getTokenDepth(t);
if ( d == i && isElement(t)){
context[i] = t;
break;
}
t--;
}
}else
break;
}
}
//dumpContext();
if (index != a[depth] && matchElementNS(URL,ln)) {
resolveLC();
return true;
}
}
index--;
}
return false;
}
/**
* This function is called by selectElement_F in autoPilot
*
* @param en ElementName
* @param special whether it is a node()
* @return boolean
* @throws NavExceptionHuge
*/
protected boolean iterate_following(String en, boolean special)
throws NavExceptionHuge{
int index = getCurrentIndex() + 1;
//int size = vtdBuffer.size();
while (index < vtdSize) {
if (isElementOrDocument(index)) {
int depth = getTokenDepth(index);
context[0] = depth;
if (depth>0)
context[depth] = index;
if (special || matchElement(en)) {
resolveLC();
return true;
}
}
index++;
}
return false;
}
/**
* This function is called by selectElementNS_F in autoPilot
* @param URL
* @param ln
* @return boolean
* @throws NavExceptionHuge
*/
protected boolean iterate_followingNS(String URL, String ln)
throws NavExceptionHuge{
int index = getCurrentIndex() + 1;
//int size = vtdBuffer.size();
while (index < vtdSize) {
if (isElementOrDocument(index)) {
int depth = getTokenDepth(index);
context[0] = depth;
if (depth>0)
context[depth] = index;
if (matchElementNS(URL,ln)) {
resolveLC();
return true;
}
}
index++;
}
return false;
}
/**
* This method is similar to getElementByName in DOM except it doesn't
* return the nodeset, instead it iterates over those nodes. Notice that this method
* is called by the "iterate" method in the Autopilot class.
* "*" will match any element
* Creation date: (12/2/03 2:31:20 PM)
* @return boolean
* @param dp int (The depth of the starting position before iterating)
* @param en java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge The exception is signaled if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because VTD records can be generated by another
* machine from a load-balancer.
* null element name allowed represent node()in XPath;
*/
protected boolean iterate(int dp, String en, boolean special)
throws NavExceptionHuge { // the navigation doesn't rely on LC
// get the current depth
int index = getCurrentIndex() + 1;
int tokenType;
//int size = vtdBuffer.size();
while (index < vtdSize) {
tokenType = getTokenType(index);
if (tokenType==VTDNavHuge.TOKEN_ATTR_NAME
|| tokenType == VTDNavHuge.TOKEN_ATTR_NS){
index = index+2;
continue;
}
if (isElementOrDocument(index)) {
int depth = getTokenDepth(index);
if (depth > dp) {
context[0] = depth;
if (depth>0)
context[depth] = index;
if (special || matchElement(en)) {
if (dp< 4)
resolveLC();
return true;
}
} else {
return false;
}
}
index++;
}
return false;
}
/**
* This method is similar to getElementByName in DOM except it doesn't
* return the nodeset, instead it iterates over those nodes .
* When URL is "*" it will match any namespace
* if ns is false, return false immediately
* @return boolean
* @param dp int (The depth of the starting position before iterating)
* @param URL java.lang.String
* @param ln java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because VTD records can be generated by another
* machine from a load-balancer..
* @exception IllegalArguementException if ln is null
* example
*
* int depth = nv.getCurrentDepth()
* while(iterateNS(depth, "www.url.com","node_name")){
* push(); // store the current position
* //move position safely
* pop(); // load the position
* }
*/
final protected boolean iterateNS(int dp, String URL, String ln)
throws NavExceptionHuge {
if (ns == false)
return false;
int tokenType;
int index = getCurrentIndex() + 1;
while (index < vtdSize) {
tokenType = getTokenType(index);
if(tokenType==VTDNavHuge.TOKEN_ATTR_NAME
|| tokenType == VTDNavHuge.TOKEN_ATTR_NS){
index = index+2;
continue;
}
if (isElementOrDocument(index)) {
int depth = getTokenDepth(index);
if (depth > dp) {
context[0] = depth;
if (depth>0)
context[depth] = index;
if (matchElementNS(URL, ln)) {
if (dp < 4)
resolveLC();
return true;
}
} else {
return false;
}
}
index++;
}
return false;
}
/**
* Test if the current element matches the given name.
* Creation date: (11/26/03 2:09:43 PM)
* @return boolean
* @param en java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge If the underlying raw char representation has errors.
*/
final public boolean matchElement(String en) throws NavExceptionHuge {
if (en.equals("*") && context[0]!=-1)
return true;
if (context[0]==-1)
return false;
return matchRawTokenString(
(context[0] == 0) ? rootIndex : context[context[0]],
en);
}
/**
* Test whether the current element matches the given namespace URL and localname.
* URL, when set to "*", matches any namespace (including null), when set to null, defines a "always-no-match"
* ln is the localname that, when set to *, matches any localname
* @return boolean
* @param URL java.lang.String
* @param ln java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge When there is any encoding conversion error or unknown entity.
* @exception java.lang.IllegalArgumentException if ln == null
*/
public boolean matchElementNS(String URL, String ln) throws NavExceptionHuge {
if (context[0]==-1)
return false;
int i =
getTokenLength((context[0] != 0) ? context[context[0]] : rootIndex);
long offset =
getTokenOffset((context[0] != 0) ? context[context[0]] : rootIndex);
int preLen = (i >> 16) & 0xffff;
int fullLen = i & 0xffff;
if (ln.equals("*")
|| ((preLen != 0)
? matchRawTokenString(
offset + preLen + 1,
fullLen - preLen - 1,
ln)
: matchRawTokenString(
offset,
fullLen,
ln))) { // no prefix, search for xmlns
if (((URL != null) ? URL.equals("*") : false)
|| (resolveNS(URL, offset, preLen) == true))
return true;
}
return false;
}
final private boolean matchRawTokenString(long offset, int len, String s)
throws NavExceptionHuge{
return compareRawTokenString(offset, len, s)==0;
}
protected int compareTokenString(long offset, int len, String s)
throws NavExceptionHuge {
int i, l;
long l1;
//this.currentOffset = offset;
long endOffset = offset + len;
// System.out.print("currentOffset :" + currentOffset);
l = s.length();
//System.out.println(s);
for (i = 0; i < l && offset < endOffset; i++) {
l1 = getCharResolved(offset);
int i1 = s.charAt(i);
if (i1 < (int) l1)
return 1;
if (i1 > (int) l1)
return -1;
offset += (int) (l1 >> 32);
}
if (i == l && offset < endOffset)
return 1;
if (i < l && offset == endOffset)
return -1;
return 0;
}
/**
* Test whether a given token contains s. notie that this function
* directly operates on the byte content of the token to avoid string creation
* @param index
* @param s
* @return
* @throws NavExceptionHuge
*/
final public boolean contains(int index, String s) throws NavExceptionHuge{
int type = getTokenType(index);
int len =
(type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
? getTokenLength(index) & 0xffff
: getTokenLength(index);
long offset = getTokenOffset(index);
long l1;
int i,l;
long endOffset = offset + len;
boolean b = (type == TOKEN_ATTR_VAL
|| type == TOKEN_CHARACTER_DATA);
// System.out.print("currentOffset :" + currentOffset);
long gOffset = offset;
l = s.length();
if (l> len)
return false;
//System.out.println(s);
while( offset> 32);
if (i ==0)
offset = gOffset;
if (i1 != (int) l1)
break;
}
if (i==l)
return true;
}
return false;
}
/**
* Lexicographically compare a string against a token with given
* offset and len, entities doesn't get resolved.
* @return int (0 if they are equal, 1 if greater, else -1)
*
* @param offset int
* @param len int
* @param s java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
*/
protected int compareRawTokenString(long offset, int len, String s)
throws NavExceptionHuge {
int i, l;
long l1;
//this.currentOffset = offset;
long endOffset = offset + len;
// System.out.print("currentOffset :" + currentOffset);
l = s.length();
//System.out.println(s);
for (i = 0; i < l && offset < endOffset; i++) {
l1 = getChar(offset);
int i1 = s.charAt(i);
if (i1 < (int) l1 )
return 1;
if (i1 > (int) l1)
return -1;
offset += (int) (l1 >> 32);
}
if (i == l && offset < endOffset)
return 1;
if (iNew in 2.0
* Compare the string against the token at the given index value. When a token
* is an attribute name or starting tag, qualified name is what gets compared against
* This method has to take care of the underlying encoding conversion
* but it doesn't resolve entity reference in the underlying document
* The behavior is the same as calling toRawString on index, then compare to s
* @param index
* @param s
* @return the result of lexical comparison
* @exception NavExceptionHuge
*
*/
final public int compareRawTokenString(int index, String s)
throws NavExceptionHuge {
int type = getTokenType(index);
int len =
(type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
? getTokenLength(index) & 0xffff
: getTokenLength(index);
// upper 16 bit is zero or for prefix
//currentOffset = getTokenOffset(index);
// point currentOffset to the beginning of the token
// for UTF 8 and ISO, the performance is a little better by avoid calling getChar() everytime
return compareRawTokenString(getTokenOffset(index), len, s);
}
/**
* Match the string against the token at the given index value. When a token
* is an attribute name or starting tag, qualified name is what gets matched against
* This method has to take care of the underlying encoding conversion
* but it doesn't resolve entity reference in the underlying document
* @return boolean
* @param index int (index into the VTD token buffer)
* @param s java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge When if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
**/
final public boolean matchRawTokenString(int index, String s)
throws NavExceptionHuge {
int type = getTokenType(index);
int len =
(type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
? getTokenLength(index) & 0xffff
: getTokenLength(index);
// upper 16 bit is zero or for prefix
//currentOffset = getTokenOffset(index);
// point currentOffset to the beginning of the token
// for UTF 8 and ISO, the performance is a little better by avoid calling getChar() everytime
return compareRawTokenString(getTokenOffset(index), len, s)==0;
}
/**
* Match a string with a token represented by a long (upper 32 len, lower 32 offset).
* @return boolean
* @param l long
* @param s java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge When if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
*
*/
/*final private boolean matchRawTokenString(long l, String s) throws NavExceptionHuge {
int len = (int) ((l & MASK_TOKEN_FULL_LEN) >> 37);
// a little hardcode is always bad
//currentOffset = (int) l;
return compareRawTokenString((int)l, len, s)==0;
}*/
/**
* Match a string against a token with given offset and len, entities get resolved properly.
* Creation date: (11/24/03 1:37:42 PM)
* @return boolean
* @param offset int
* @param len int
* @param s java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
* @exception IllegalArguementException if s is null
*/
/*final private boolean matchTokenString(long offset, int len, String s)
throws NavExceptionHuge {
return compareTokenString(offset,len,s)==0;
}*/
/**
* New in 2.0
* Compare the string against the token at the given index value. When a token
* is an attribute name or starting tag, qualified name is what gets matched against
* This method has to take care of the underlying encoding conversion
* as well as entity reference comparison
* @param index
* @param s
* @return int
* @throws NavExceptionHuge
*
*/
public int compareTokenString(int index, String s)
throws NavExceptionHuge{
int type = getTokenType(index);
int len =
(type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
? getTokenLength(index) & 0xffff
: getTokenLength(index);
// upper 16 bit is zero or for prefix
//currentOffset = getTokenOffset(index);
// point currentOffset to the beginning of the token
// for UTF 8 and ISO, the performance is a little better by avoid calling getChar() everytime
return compareTokenString(getTokenOffset(index), len, s);
}
/**
* Match the string against the token at the given index value. When a token
* is an attribute name or starting tag, qualified name is what gets matched against
* This method has to take care of the underlying encoding conversion
* as well as entity reference comparison
* @return boolean
* @param index int
* @param s java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge When if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
**/
final public boolean matchTokenString(int index, String s) throws NavExceptionHuge {
int type = getTokenType(index);
int len =
(type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
? getTokenLength(index) & 0xffff
: getTokenLength(index);
// upper 16 bit is zero or for prefix
//currentOffset = getTokenOffset(index);
// point currentOffset to the beginning of the token
// for UTF 8 and ISO, the performance is a little better by avoid calling getChar() everytime
return compareTokenString(getTokenOffset(index), len, s)==0;
}
/**
* Match a string against a "non-extractive" token represented by a long (upper 32 len, lower 32 offset).
* @return boolean
* @param l long
* @param s java.lang.String
* @exception com.ximpleware.extended.NavExceptionHuge When the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
*
*/
/*final private boolean matchTokenString(long l, String s) throws NavExceptionHuge {
int len = (int) (l >> 37) & 0xffff;
//currentOffset = (int) l;
return compareTokenString((int) l, len, s)==0;
}*/
/**
* Convert a vtd token into a double.
* Creation date: (12/8/03 2:28:31 PM)
* @return double
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
*/
public double parseDouble(int index) throws NavExceptionHuge {
//if (matchTokenString()
long offset = getTokenOffset(index);
long l=0;
long end = offset + getTokenLength(index);
int t = getTokenType(index);
boolean b = (t==VTDNavHuge.TOKEN_CHARACTER_DATA )|| (t==VTDNavHuge.TOKEN_ATTR_VAL);
boolean expneg = false;
int ch;
//past the last one by one
{
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
while (offset < end) { // trim leading whitespaces
if (!isWS(ch))
break;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
if (offset > end) // all whitespace
return Double.NaN;
boolean neg = (ch == '-');
if (ch == '-' || ch == '+'){
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32); //get another one if it is sign.
}
//left part of decimal
double left = 0;
while (offset <= end) {
//must be <= since we get the next one at last.
int dig = Character.digit((char) ch, 10); //only consider decimal
if (dig < 0)
break;
left = left * 10 + dig;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);;
}
//right part of decimal
double right = 0;
double scale = 1;
if (ch == '.') {
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
while (offset <= end) {
//must be <= since we get the next one at last.
int dig = Character.digit((char) ch, 10);
//only consider decimal
if (dig < 0)
break;
right = right * 10 + dig;
scale *= 10;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
}
//exponent
long exp = 0;
if (ch == 'E' || ch == 'e') {
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
expneg = (ch == '-'); //sign for exp
if (ch == '+' || ch == '-'){
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32); //skip the +/- sign
}
long cur = offset;
//remember the indx, used to find a invalid number like 1.23E
while (offset <= end) {
//must be <= since we get the next one at last.
int dig = Character.digit((char) ch, 10);
//only consider decimal
if (dig < 0)
break;
exp = exp * 10 + dig;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
if (cur == offset)
return Double.NaN;
//found a invalid number like 1.23E
//if (expneg)
// exp = (-exp);
}
//anything left must be space
while (offset <= end) {
if (!isWS(ch))
return Double.NaN;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
double v = (double) left;
if (right != 0)
v += ((double) right) / (double) scale;
if (exp != 0)
v = (expneg)? v /(Math.pow(10,exp)): v*Math.pow(10,exp);
return ((neg) ? (-v) : v);
}
/**
* Convert a vtd token into a float.
* we assume token type to be attr val or character data
* Creation date: (12/8/03 2:28:18 PM)
* @return float
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
*/
public float parseFloat(int index) throws NavExceptionHuge {
long offset = getTokenOffset(index);
long end = offset + getTokenLength(index);
long l;
//past the last one by one
int t = getTokenType(index);
boolean b = (t==VTDNavHuge.TOKEN_CHARACTER_DATA )|| (t==VTDNavHuge.TOKEN_ATTR_VAL);
int ch ;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
while (offset <= end) { // trim leading whitespaces
if (!isWS(ch))
break;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
if (offset > end) // all whitespace
throw new NavExceptionHuge("Empty string");
boolean neg = (ch == '-');
if (ch == '-' || ch == '+'){
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32); //get another one if it is sign.
}
//left part of decimal
long left = 0;
while (offset <= end) {
//must be <= since we get the next one at last.
int dig = Character.digit((char) ch, 10); //only consider decimal
if (dig < 0)
break;
left = left * 10 + dig;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
//right part of decimal
long right = 0;
long scale = 1;
if (ch == '.') {
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
while (offset <= end) {
//must be <= since we get the next one at last.
int dig = Character.digit((char) ch, 10);
//only consider decimal
if (dig < 0)
break;
right = right * 10 + dig;
scale *= 10;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
}
//exponent
long exp = 0;
if (ch == 'E' || ch == 'e') {
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
boolean expneg = (ch == '-'); //sign for exp
if (ch == '+' || ch == '-'){
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32); //skip the +/- sign
}
long cur = offset;
//remember the indx, used to find a invalid number like 1.23E
while (offset <= end) {
//must be <= since we get the next one at last.
int dig = Character.digit((char) ch, 10);
//only consider decimal
if (dig < 0)
break;
exp = exp * 10 + dig;
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
if (cur == offset)
return Float.NaN;
//found a invalid number like 1.23E
if (expneg)
exp = (-exp);
}
//anything left must be space
while (offset <= end) {
if (!isWS(ch))
throw new NavExceptionHuge(toString(index));
l = b? getCharResolved(offset):getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
}
double v = (double) left;
if (right != 0)
v += ((double) right) / (double) scale;
if (exp != 0)
v = v * Math.pow(10, exp);
float f = (float) v;
//try to handle overflow/underflow
if (v >= (double)Float.MAX_VALUE)
f = Float.MAX_VALUE;
else if (v <= (double)Float.MIN_VALUE)
f = Float.MIN_VALUE;
if (neg)
f = -f;
return f;
}
/**
* Convert a vtd token into an int.
* This method will automatically strip off the leading and trailing
* we assume token type to be attr val or character data
* zero, unlike Integer.parseInt(int index)
*
* Creation date: (12/8/03 2:32:22 PM)
* @return int
* @param index int
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
*/
public int parseInt(int index) throws NavExceptionHuge {
return parseInt(index, 10);
}
/**
* Convert a vtd token into an int, with the given radix.
* we assume token type to be attr val or character data
* the first char can be either '+' or '-'
* Creation date: (12/16/03 1:21:20 PM)
* @return int
* @param index int
* @param radix int
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
*/
protected int parseInt(int index, int radix) throws NavExceptionHuge {
if (radix < 2 || radix > 36)
throw new NumberFormatException(
"radix " + radix + " out of valid range");
int t = getTokenType(index);
boolean b = (t==VTDNavHuge.TOKEN_CHARACTER_DATA )|| (t==VTDNavHuge.TOKEN_ATTR_VAL);
long offset = getTokenOffset(index);
long endOffset = offset + getTokenLength(index);
int c;
long l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32);
// trim leading whitespaces
while ((c == ' ' || c == '\n' || c == '\t' || c == '\r')
&& (offset <= endOffset)){
l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32);
}
if (offset > endOffset) // all whitespace
throw new NumberFormatException(" empty string");
boolean neg = (c == '-');
if (neg || c == '+') {
l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32); //skip sign
}
long result = 0;
//long pos = 1;
while (offset <= endOffset) {
int digit = Character.digit((char) c, radix);
if (digit < 0)
break;
//Note: for binary we can simply shift to left to improve performance
result = result * radix + digit;
//pos *= radix;
l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32);
}
if (result > Integer.MAX_VALUE)
throw new NumberFormatException("Overflow: " + toString(index));
// take care of the trailing
while (offset <= endOffset && isWS(c)) {
l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32);
}
if (offset == (endOffset + 1))
return (int) ((neg) ? (-result) : result);
else
throw new NumberFormatException(toString(index));
}
/**
* Convert a vtd token into a long.
* we assume token type to be attr val or character data
* Creation date: (12/8/03 2:32:59 PM)
* @return long
* @param index int
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
*/
public long parseLong(int index) throws NavExceptionHuge {
return parseLong(index, 10);
}
/**
* Convert a vtd token into a long, with the given radix.
* the first char can be either '+' or '-', leading and trailing will be stripped
* we assume token type to be attr val or character data
* Creation date: (12/17/03 1:51:06 PM)
* @return long
* @param index int
* @param radix int
* @exception com.ximpleware.extended.NavExceptionHuge The exception if the underlying byte
* content contains various errors. Notice that we are being conservative in making little assumption on
* the correctness of underlying byte content. This is because the VTD can be generated by another
* machine such as a load-balancer.
*/
protected long parseLong(int index, int radix) throws NavExceptionHuge {
if (radix < 2 || radix > 36)
throw new NumberFormatException(
"radix " + radix + " out of valid range");
int t = getTokenType(index);
boolean b = (t==VTDNavHuge.TOKEN_CHARACTER_DATA )|| (t==VTDNavHuge.TOKEN_ATTR_VAL);
long offset = getTokenOffset(index);
long endOffset = offset + getTokenLength(index);
int c;
long l;
l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32);
// trim leading whitespaces
while ((c == ' ' || c == '\n' || c == '\t' || c == '\r')
&& (offset <= endOffset)){
l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32);
}
if (offset > endOffset) // all whitespace
throw new NumberFormatException(" empty string");
boolean neg = (c == '-');
if (neg || c == '+'){
l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32);//skip sign
}
long result = 0;
//long pos = 1;
while (offset <= endOffset) {
int digit = Character.digit((char) c, radix);
if (digit < 0)
break;
//Note: for binary we can simply shift to left to improve performance
result = result * radix + digit;
//pos *= radix;
l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32);;
}
if (result > Long.MAX_VALUE)
throw new NumberFormatException("Overflow: " + toString(index));
// take care of the trailing
while (offset <= endOffset && isWS(c)) {
l = b? getCharResolved(offset):getChar(offset);
c = (int)l;
offset += (int)(l>>32);
}
if (offset == (endOffset + 1))
return (long) ((neg) ? (-result) : result);
else
throw new NumberFormatException(toString(index));
}
/**
* Load the context info from ContextBuffer.
* Info saved including LC and current state of the context
* @return boolean
*
*/
final public boolean pop() {
boolean b = contextStack.load(stackTemp);
if (b == false)
return false;
for (int i = 0; i < nestingLevel; i++) {
context[i] = stackTemp[i];
}
l1index = stackTemp[nestingLevel];
l2index = stackTemp[nestingLevel + 1];
l3index = stackTemp[nestingLevel + 2];
l2lower = stackTemp[nestingLevel + 3];
l2upper = stackTemp[nestingLevel + 4];
l3lower = stackTemp[nestingLevel + 5];
l3upper = stackTemp[nestingLevel + 6];
atTerminal = (stackTemp[nestingLevel + 7] == 1);
LN = stackTemp[nestingLevel+8];
return true;
}
/**
* Load the context info from contextStack2.
* This method is dedicated for XPath evaluation.
* @return status of pop2
*/
final protected boolean pop2(){
boolean b = contextStack2.load(stackTemp);
if (b == false)
return false;
for (int i = 0; i < nestingLevel; i++) {
context[i] = stackTemp[i];
}
l1index = stackTemp[nestingLevel];
l2index = stackTemp[nestingLevel + 1];
l3index = stackTemp[nestingLevel + 2];
l2lower = stackTemp[nestingLevel + 3];
l2upper = stackTemp[nestingLevel + 4];
l3lower = stackTemp[nestingLevel + 5];
l3upper = stackTemp[nestingLevel + 6];
atTerminal = (stackTemp[nestingLevel + 7] == 1);
LN = stackTemp[nestingLevel+8];
return true;
}
/**
* Store the context info into the ContextBuffer.
* Info saved including LC and current state of the context
* Creation date: (11/16/03 7:00:27 PM)
*/
final public void push() {
for (int i = 0; i < nestingLevel; i++) {
stackTemp[i] = context[i];
}
stackTemp[nestingLevel] = l1index;
stackTemp[nestingLevel + 1] = l2index;
stackTemp[nestingLevel + 2] = l3index;
stackTemp[nestingLevel + 3] = l2lower;
stackTemp[nestingLevel + 4] = l2upper;
stackTemp[nestingLevel + 5] = l3lower;
stackTemp[nestingLevel + 6] = l3upper;
if (atTerminal)
stackTemp[nestingLevel + 7] =1;
else
stackTemp[nestingLevel + 7] =0;
stackTemp[nestingLevel+8] = LN;
contextStack.store(stackTemp);
}
/**
* Store the context info into the contextStack2.
* This method is reserved for XPath Evaluation
*
*/
final protected void push2() {
for (int i = 0; i < nestingLevel; i++) {
stackTemp[i] = context[i];
}
stackTemp[nestingLevel] = l1index;
stackTemp[nestingLevel + 1] = l2index;
stackTemp[nestingLevel + 2] = l3index;
stackTemp[nestingLevel + 3] = l2lower;
stackTemp[nestingLevel + 4] = l2upper;
stackTemp[nestingLevel + 5] = l3lower;
stackTemp[nestingLevel + 6] = l3upper;
if (atTerminal)
stackTemp[nestingLevel + 7] =1;
else
stackTemp[nestingLevel + 7] =0;
stackTemp[nestingLevel+8] = LN;
contextStack2.store(stackTemp);
}
/**
* clear the contextStack2 after XPath evaluation
*
*
*/
final protected void clearStack2(){
contextStack2.clear();
}
/**
* Sync level 1 location cache
*/
private void resolveLC_l1(){
if (l1index < 0 || l1index >= l1Buffer.size()
|| context[1] != l1Buffer.upper32At(l1index)) {
if (l1index >= l1Buffer.size() || l1index < 0) {
l1index = 0;
}
if (l1index+1 context[1]) {
while (l1Buffer.upper32At(init_guess) != context[1]) {
init_guess--;
}
} else if (l1Buffer.upper32At(init_guess) < context[1]) {
while (l1Buffer.upper32At(init_guess) != context[1]) {
init_guess++;
}
}
l1index = init_guess;
} else{
if (context[1]>=l1Buffer.upper32At(l1index)){
while(context[1]!=l1Buffer.upper32At(l1index)
&& l1index < l1Buffer.size()){
l1index++;
}
}
else{
while(context[1]!=l1Buffer.upper32At(l1index)
&& l1index >=0){
l1index--;
}
}
}
}
}
/**
* Sync Level 2 location cache
*/
private void resolveLC_l2(){
int temp = l1Buffer.lower32At(l1index);
if (l2lower != temp) {
l2lower = temp;
// l2lower shouldn't be -1 !!!! l2lower and l2upper always get
// resolved simultaneously
l2index = l2lower;
l2upper = l2Buffer.size() - 1;
for (int i = l1index + 1; i < l1Buffer.size(); i++) {
temp = l1Buffer.lower32At(i);
if (temp != 0xffffffff) {
l2upper = temp - 1;
break;
}
}
} // intelligent guess again ??
if (l2index < 0 || l2index >= l2Buffer.size()
|| context[2] != l2Buffer.upper32At(l2index)) {
if (l2index >= l2Buffer.size() || l2index<0)
l2index = l2lower;
if (l2index+1< l2Buffer.size()&& context[2] == l2Buffer.upper32At(l2index + 1))
l2index = l2index + 1;
else if (l2upper - l2lower >= 16) {
int init_guess = l2lower
+ (int) ((l2upper - l2lower)
* ((float) context[2] - l2Buffer
.upper32At(l2lower)) / (l2Buffer
.upper32At(l2upper) - l2Buffer
.upper32At(l2lower)));
if (l2Buffer.upper32At(init_guess) > context[2]) {
while (context[2] != l2Buffer.upper32At(init_guess))
init_guess--;
} else if (l2Buffer.upper32At(init_guess) < context[2]) {
while (context[2] != l2Buffer.upper32At(init_guess))
init_guess++;
}
l2index = init_guess;
} else if (context[2]= l3Buffer.size()
|| context[3] != l3Buffer.intAt(l3index)) {
if (l3index >= l3Buffer.size() || l3index <0)
l3index = l3lower;
if (l3index+1 < l3Buffer.size() &&
context[3] == l3Buffer.intAt(l3index + 1))
l3index = l3index + 1;
else if (l3upper - l3lower >= 16) {
int init_guess = l3lower
+ (int) ((l3upper - l3lower) * ((float) (context[3] - l3Buffer
.intAt(l3lower)) / (l3Buffer.intAt(l3upper) - l3Buffer
.intAt(l3lower))));
if (l3Buffer.intAt(init_guess) > context[3]) {
while (context[3] != l3Buffer.intAt(init_guess))
init_guess--;
} else if (l3Buffer.intAt(init_guess) < context[3]) {
while (context[3] != l3Buffer.intAt(init_guess))
init_guess++;
}
l3index = init_guess;
} else if (context[3]> 16) & 0xffff;
return lookupNS(offset, preLen);
//return resolveNS(URL, offset, preLen);
}
/**
* This function returns the VTD record index of the namespace
* that matches the prefix of cursor element
* @param URL
* @return int
*
*/
protected int lookupNS(long offset, int len){
long l;
boolean hasNS = false;
int size = vtdBuffer.size();
int type;
// look for a match in the current hiearchy and return true
for (int i = context[0]; i >= 0; i--) {
int s = (i != 0) ? context[i] : rootIndex;
{
int k = s + 1;
if (k>=size)
break;
type = getTokenType(k);
while ( (type == TOKEN_ATTR_NAME || type == TOKEN_ATTR_NS)) {
if (type == TOKEN_ATTR_NS) {
// Get the token length
hasNS = true;
int temp = getTokenLength(k);
int preLen = ((temp >> 16) & 0xffff);
int fullLen = temp & 0xffff;
long os = getTokenOffset(k);
// xmlns found
if (temp == 5 && len == 0) {
l = vtdBuffer.longAt(s);
hasNS = false;
/*vtdBuffer.modifyEntry(
s,
l | 0x00000000c0000000L);*/
return k+1;
} else if ((fullLen - preLen - 1) == len) {
// prefix length identical to local part of ns declaration
boolean a = true;
for (int j = 0; j < len; j++) {
if (getCharUnit(os + preLen + 1 + j)
!= getCharUnit(offset + j)) {
a = false;
break;
}
}
if (a == true) {
//l = vtdBuffer.longAt(s);
//hasNS = false;
//vtdBuffer.modifyEntry(
// s,
// l | 0x00000000c0000000L);
return k+1;
}
}
}
//return (URL != null) ? true : false;
k += 2;
if (k>=size)
break;
type = getTokenType(k);
}
/*l = vtdBuffer.longAt(s);
if (hasNS) {
hasNS = false;
//vtdBuffer.modifyEntry(s, l | 0x00000000c0000000L);
} else {
//vtdBuffer.modifyEntry(s, l | 0x0000000080000000L);
}*/
//break;
}
}
return 0;
//return -1;
}
private boolean resolveNS(String URL, long offset, int len)
throws NavExceptionHuge {
int result = lookupNS(offset, len);
switch(result){
case 0:
if (URL == null){
return true;
} else {
return false;
}
default:
if (URL == null)
return false;
else {
return matchTokenString(result, URL);
}
}
}
/**
* A generic navigation method.
* Move the current to the element according to the direction constants
* If no such element, no position change and return false.
* Creation date: (12/2/03 1:43:50 PM)
* Legal direction constants are
*
ROOT 0
*
PARENT 1
*
FIRST_CHILD 2
*
LAST_CHILD 3
*
NEXT_SIBLING 4
*
PREV_SIBLING 5
* @return boolean
* @param direction int
* @exception com.ximpleware.extended.NavExceptionHuge When direction value is illegal.
*/
public boolean toElement(int direction) throws NavExceptionHuge {
int size;
switch (direction) {
case ROOT : // to document element!
if (context[0] != 0) {
/*for (int i = 1; i <= context[0]; i++) {
context[i] = 0xffffffff;
}*/
context[0] = 0;
}
atTerminal = false;
l1index = l2index = l3index = -1;
return true;
case PARENT :
if (atTerminal == true){
atTerminal = false;
return true;
}
if (context[0] > 0) {
//context[context[0]] = context[context[0] + 1] = 0xffffffff;
context[context[0]] = -1;
context[0]--;
return true;
}else if (context[0]==0){
context[0]=-1; //to be compatible with XPath Data model
return true;
}
else {
return false;
}
case FIRST_CHILD :
case LAST_CHILD :
if (atTerminal) return false;
switch (context[0]) {
case -1:
context[0] = 0;
return true;
case 0 :
if (l1Buffer.size() > 0) {
context[0] = 1;
l1index =
(direction == FIRST_CHILD)
? 0
: (l1Buffer.size() - 1);
context[1] = l1Buffer.upper32At(l1index);
//(int) (vtdToken >> 32);
return true;
} else
return false;
case 1 :
l2lower = l1Buffer.lower32At(l1index);
if (l2lower == -1) {
return false;
}
context[0] = 2;
l2upper = l2Buffer.size() - 1;
size = l1Buffer.size();
for (int i = l1index + 1; i < size; i++) {
int temp = l1Buffer.lower32At(i);
if (temp != 0xffffffff) {
l2upper = temp - 1;
break;
}
}
//System.out.println(" l2 upper: " + l2upper + " l2 lower : " + l2lower);
l2index =
(direction == FIRST_CHILD) ? l2lower : l2upper;
context[2] = l2Buffer.upper32At(l2index);
return true;
case 2 :
l3lower = l2Buffer.lower32At(l2index);
if (l3lower == -1) {
return false;
}
context[0] = 3;
l3upper = l3Buffer.size() - 1;
size = l2Buffer.size();
for (int i = l2index + 1; i < size; i++) {
int temp = l2Buffer.lower32At(i);
if (temp != 0xffffffff) {
l3upper = temp - 1;
break;
}
}
//System.out.println(" l3 upper : " + l3upper + " l3 lower : " + l3lower);
l3index =
(direction == FIRST_CHILD) ? l3lower : l3upper;
context[3] = l3Buffer.intAt(l3index);
return true;
default :
if (direction == FIRST_CHILD) {
size = vtdBuffer.size();
int index = context[context[0]] + 1;
while (index < size) {
long temp = vtdBuffer.longAt(index);
int token_type =
(int) ((MASK_TOKEN_TYPE & temp) >> 60)
& 0xf;
if (token_type == TOKEN_STARTING_TAG) {
int depth =
(int) ((MASK_TOKEN_DEPTH & temp) >> 55);
if (depth <= context[0]) {
return false;
} else if (depth == (context[0] + 1)) {
context[0] += 1;
context[context[0]] = index;
return true;
}
}
index++;
} // what condition
return false;
} else {
int index = context[context[0]] + 1;
int last_index = -1;
size = vtdBuffer.size();
while (index < size) {
long temp = vtdBuffer.longAt(index);
int depth =
(int) ((MASK_TOKEN_DEPTH & temp) >> 55);
int token_type =
(int) ((MASK_TOKEN_TYPE & temp) >> 60)
& 0xf;
if (token_type == TOKEN_STARTING_TAG) {
if (depth <= context[0]) {
break;
} else if (depth == (context[0] + 1)) {
last_index = index;
}
}
index++;
}
if (last_index == -1) {
return false;
} else {
context[0] += 1;
context[context[0]] = last_index;
return true;
}
}
}
case NEXT_SIBLING :
case PREV_SIBLING :
if(atTerminal)return false;
switch (context[0]) {
case -1:
case 0 :
return false;
case 1 :
if (direction == NEXT_SIBLING) {
if (l1index + 1 >= l1Buffer.size()) {
return false;
}
l1index++; // global incremental
} else {
if (l1index - 1 < 0) {
return false;
}
l1index--; // global incremental
}
context[1] = l1Buffer.upper32At(l1index);
return true;
case 2 :
if (direction == NEXT_SIBLING) {
if (l2index + 1 > l2upper) {
return false;
}
l2index++;
} else {
if (l2index - 1 < l2lower) {
return false;
}
l2index--;
}
context[2] = l2Buffer.upper32At(l2index);
return true;
case 3 :
if (direction == NEXT_SIBLING) {
if (l3index + 1 > l3upper) {
return false;
}
l3index++;
} else {
if (l3index - 1 < l3lower) {
return false;
}
l3index--;
}
context[3] = l3Buffer.intAt(l3index);
return true;
default :
//int index = context[context[0]] + 1;
if (direction == NEXT_SIBLING) {
int index = context[context[0]] + 1;
size = vtdBuffer.size();
while (index < size) {
long temp = vtdBuffer.longAt(index);
int token_type =
(int) ((MASK_TOKEN_TYPE & temp) >> 60)
& 0xf;
if (token_type == TOKEN_STARTING_TAG) {
int depth =
(int) ((MASK_TOKEN_DEPTH & temp) >> 55);
if (depth < context[0]) {
return false;
} else if (depth == (context[0])) {
context[context[0]] = index;
return true;
}
}
index++;
}
return false;
} else {
int index = context[context[0]] - 1;
while (index > context[context[0] - 1]) {
// scan backforward
long temp = vtdBuffer.longAt(index);
int token_type =
(int) ((MASK_TOKEN_TYPE & temp) >> 60)
& 0xf;
if (token_type == TOKEN_STARTING_TAG) {
int depth =
(int) ((MASK_TOKEN_DEPTH & temp) >> 55);
/*if (depth < context[0]) {
return false;
} else */
if (depth == (context[0])) {
context[context[0]] = index;
return true;
}
}
index--;
} // what condition
return false;
}
}
default :
throw new NavExceptionHuge("illegal navigation options");
}
}
/**
* A generic navigation method.
* Move the current to the element according to the direction constants and the element name
* If no such element, no position change and return false.
* "*" matches any element
* Creation date: (12/2/03 1:43:50 PM)
* Legal direction constants are
*
ROOT 0
*
PARENT 1
*
FIRST_CHILD 2
*
LAST_CHILD 3
*
NEXT_SIBLING 4
*
PREV_SIBLING 5
*
* for ROOT and PARENT, element name will be ignored.
* @return boolean
* @param direction int
* @param en String
* @exception com.ximpleware.extended.NavExceptionHuge When direction value is illegal. Or there are errors
* in underlying byte representation of the document
* @exception IllegalArguementException if en is null
*/
public boolean toElement(int direction, String en) throws NavExceptionHuge {
//int size;
int temp;
int d;
int val=0;
if (en == null)
throw new IllegalArgumentException(" Element name can't be null ");
if (en.equals("*"))
return toElement(direction);
switch (direction) {
case ROOT :
return toElement(ROOT);
case PARENT :
return toElement(PARENT);
case FIRST_CHILD :
if (atTerminal)return false;
if (toElement(FIRST_CHILD) == false)
return false;
// check current element name
if (matchElement(en) == false) {
if (toElement(NEXT_SIBLING, en) == true)
return true;
else {
//toParentElement();
//context[context[0]] = 0xffffffff;
context[0]--;
return false;
}
} else
return true;
case LAST_CHILD :
if (atTerminal)return false;
if (toElement(LAST_CHILD) == false)
return false;
if (matchElement(en) == false) {
if (toElement(PREV_SIBLING, en) == true)
return true;
else {
//context[context[0]] = 0xffffffff;
context[0]--;
//toParentElement();
return false;
}
} else
return true;
case NEXT_SIBLING :
if (atTerminal)return false;
d = context[0];
switch(d)
{
case -1:
case 0: return false;
case 1: val = l1index; break;
case 2: val = l2index; break;
case 3: val = l3index; break;
default:
}
temp = context[d]; // store the current position
while (toElement(NEXT_SIBLING)) {
if (matchElement(en)) {
return true;
}
}
switch(d)
{
case 1: l1index = val; break;
case 2: l2index = val; break;
case 3: l3index = val; break;
default:
}
context[d] = temp;
return false;
case PREV_SIBLING :
if (atTerminal) return false;
d = context[0];
switch(d)
{
case -1:
case 0: return false;
case 1: val = l1index; break;
case 2: val = l2index; break;
case 3: val = l3index; break;
default:
}
temp = context[d]; // store the current position
while (toElement(PREV_SIBLING)) {
if (matchElement(en)) {
return true;
}
}
switch(d)
{
case 1: l1index = val; break;
case 2: l2index = val; break;
case 3: l3index = val; break;
default:
}
context[d] = temp;
return false;
default :
throw new NavExceptionHuge("illegal navigation options");
}
}
/**
* A generic navigation method with namespace support.
* Move the current to the element according to the direction constants and the prefix and local names
* If no such element, no position change and return false.
* URL * matches any namespace, including undefined namespaces
* a null URL means hte namespace prefix is undefined for the element
* ln * matches any localname
* Creation date: (12/2/03 1:43:50 PM)
* Legal direction constants are
*
ROOT 0
*
PARENT 1
*
FIRST_CHILD 2
*
LAST_CHILD 3
*
NEXT_SIBLING 4
*
PREV_SIBLING 5
*
* for ROOT and PARENT, element name will be ignored.
* If not ns enabled, return false immediately with no position change.
* @return boolean
* @param direction int
* @param URL String
* @param ln String
* @exception com.ximpleware.extended.NavExceptionHuge When direction value is illegal. Or there are errors
* in underlying byte representation of the document
*/
public boolean toElementNS(int direction, String URL, String ln)
throws NavExceptionHuge {
//int size;
int temp;
int val=0;
int d; // temp location
if (ns == false)
return false;
switch (direction) {
case ROOT :
return toElement(ROOT);
case PARENT :
return toElement(PARENT);
case FIRST_CHILD :
if (atTerminal)return false;
if (toElement(FIRST_CHILD) == false)
return false;
// check current element name
if (matchElementNS(URL, ln) == false) {
if (toElementNS(NEXT_SIBLING, URL, ln) == true)
return true;
else {
//toParentElement();
//context[context[0]] = 0xffffffff;
context[0]--;
return false;
}
} else
return true;
case LAST_CHILD :
if (atTerminal)return false;
if (toElement(LAST_CHILD) == false)
return false;
if (matchElementNS(URL, ln) == false) {
if (toElementNS(PREV_SIBLING, URL, ln) == true)
return true;
else {
//context[context[0]] = 0xffffffff;
context[0]--;
//toParentElement();
return false;
}
} else
return true;
case NEXT_SIBLING :
if (atTerminal)return false;
d = context[0];
temp = context[d]; // store the current position
switch(d)
{
case -1:
case 0: return false;
case 1: val = l1index; break;
case 2: val = l2index; break;
case 3: val = l3index; break;
default:
}
//if (d == 0)
// return false;
while (toElement(NEXT_SIBLING)) {
if (matchElementNS(URL, ln)) {
return true;
}
}
switch(d)
{
case 1: l1index = val; break;
case 2: l2index = val; break;
case 3: l3index = val; break;
default:
}
context[d] = temp;
return false;
case PREV_SIBLING :
if (atTerminal)return false;
d = context[0];
temp = context[d]; // store the current position
switch(d)
{
case -1:
case 0: return false;
case 1: val = l1index; break;
case 2: val = l2index; break;
case 3: val = l3index; break;
default:
}
//if (d == 0)
// return false;
while (toElement(PREV_SIBLING)) {
if (matchElementNS(URL, ln)) {
return true;
}
}
switch(d)
{
case 1: l1index = val; break;
case 2: l2index = val; break;
case 3: l3index = val; break;
default:
}
context[d] = temp;
return false;
default :
throw new NavExceptionHuge("illegal navigation options");
}
}
/**
* This method normalizes a token into a string in a way that resembles DOM.
* The leading and trailing white space characters will be stripped.
* The entity and character references will be resolved
* Multiple whitespaces char will be collapsed into one.
* Whitespaces via entities will nonetheless be preserved.
* Creation date: (12/8/03 1:57:10 PM)
* @return java.lang.String
* @param index int
* @exception NavExceptionHuge When the encoding has errors
*/
public String toNormalizedString(int index) throws NavExceptionHuge {
int type = getTokenType(index);
if (type!=TOKEN_CHARACTER_DATA &&
type!= TOKEN_ATTR_VAL)
return toRawString(index);
long l;
int len;
if (type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
len = getTokenLength(index) & 0xffff;
else
len = getTokenLength(index);
if (len == 0)
return "";
long offset = getTokenOffset(index);
long endOffset = len + offset - 1; // point to the last character
StringBuffer sb = new StringBuffer(len);
int ch;
// trim off the leading whitespaces
while (true) {
long temp = offset;
l = getChar(offset);
ch = (int)l;
offset += (int)(l>>32);
if (!isWS(ch)) {
offset = temp;
break;
}
}
boolean d = false;
while (offset <= endOffset) {
l = getCharResolved(offset);
ch = (int)l;
offset += (int)(l>>32);
if (isWS(ch) && getCharUnit(offset - 1) != ';') {
d = true;
} else {
if (d == false)
sb.append((char) ch); // java only supports 16 bit unicode
else {
sb.append(' ');
sb.append((char) ch);
d = false;
}
}
}
return sb.toString();
}
/**
* Convert a token at the given index to a String, (built-in entity and char references not resolved)
* (entities and char references not expanded).
* Creation date: (11/16/03 7:28:49 PM)
* @return java.lang.String
* @param index int
* @exception NavExceptionHuge When the encoding has errors
*/
public String toRawString(int index) throws NavExceptionHuge {
int type = getTokenType(index);
int len;
if (type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
len = getTokenLength(index) & 0xffff;
else
len = getTokenLength(index);
long offset = getTokenOffset(index);
return toRawString(offset, len);
}
protected String toRawString(long os, int len) throws NavExceptionHuge{
StringBuffer sb = new StringBuffer(len);
long offset = os;
long endOffset = os + len;
long l;
while (offset < endOffset) {
l = getChar(offset);
offset += (int)(l>>32);
sb.append((char)l);
}
return sb.toString();
}
/* @param index
* @return
* @throws NavException
*/
final public String toRawStringLowerCase(int index) throws NavExceptionHuge {
int type = getTokenType(index);
int len;
if (type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
len = getTokenLength(index) & 0xffff;
else
len = getTokenLength(index);
long offset = getTokenOffset(index);
return toRawStringLowerCase(offset, len);
}
/**
*
* @param index
* @return
* @throws NavException
*/
final public String toRawStringUpperCase(int index) throws NavExceptionHuge {
int type = getTokenType(index);
int len;
if (type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
len = getTokenLength(index) & 0xffff;
else
len = getTokenLength(index);
long offset = getTokenOffset(index);
return toRawStringUpperCase(offset, len);
}
final protected String toRawStringLowerCase(long os, int len) throws NavExceptionHuge{
StringBuffer sb = new StringBuffer(len);
long offset = os;
long endOffset = os + len;
long l;
while (offset < endOffset) {
l = getChar(offset);
offset += (int)(l>>32);
if ((int)l>64 && (int)l<91)
sb.append((char)(l+32));
else
sb.append((char)l);
}
return sb.toString();
}
final protected String toRawStringUpperCase(long os, int len) throws NavExceptionHuge{
StringBuffer sb = new StringBuffer(len);
long offset = os;
long endOffset = os + len;
long l;
while (offset < endOffset) {
l = getChar(offset);
offset += (int)(l>>32);
if ((int)l>96 && (int)l<123)
sb.append((char)(l-32));
else
sb.append((char)l);
}
return sb.toString();
}
/**
* Convert a token at the given index to a String, (entities and char references resolved).
* An attribute name or an element name will get the UCS2 string of qualified name
* Creation date: (11/16/03 7:27:19 PM)
* @return java.lang.String
* @param index
* @exception NavExceptionHuge
*/
public String toString(int index) throws NavExceptionHuge {
int type = getTokenType(index);
if (type!=TOKEN_CHARACTER_DATA &&
type!= TOKEN_ATTR_VAL)
return toRawString(index);
int len;
//long l;
if (type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
len = getTokenLength(index) & 0xffff;
else
len = getTokenLength(index);
long offset = getTokenOffset(index);
return toString(offset, len);
}
protected String toString(long os, int len) throws NavExceptionHuge{
StringBuffer sb = new StringBuffer(len);
long offset = os;
long endOffset = os + len;
long l;
while (offset < endOffset) {
l = getCharResolved(offset);
offset += (int)(l>>32);
sb.append((char)l);
}
return sb.toString();
}
/**
* This method matches two VTD tokens of VTDNav objects
* @param i1
* @param vn2
* @param i2
* @return boolean true if two tokens are lexically identical
*
*/
final public boolean matchTokens(int i1, VTDNavHuge vn2, int i2)
throws NavExceptionHuge{
return compareTokens(i1,vn2,i2)==0;
}
/**
* Set the value of atTerminal
* This function only gets called in XPath eval
* when a step calls for @* or child::text()
* @param b
*/
final protected void setAtTerminal(boolean b){
atTerminal = b;
}
/**
* Get the value of atTerminal
* This function only gets called in XPath eval
* @return boolean
*/
final protected boolean getAtTerminal(){
return atTerminal;
}
/**
* This is for debugging purpose
* @param fib
*/
public void sampleState(FastIntBuffer fib){
// for(int i=0;i=1)
fib.append(l1index);
if (context[0]>=2){
fib.append(l2index);
fib.append(l2lower);
fib.append(l2upper);
}
if (context[0]>=3){
fib.append(l3index);
fib.append(l3lower);
fib.append(l3upper);
}
}
final public int getStringLength(int index) throws NavExceptionHuge {
int type = getTokenType(index);
if (type != TOKEN_CHARACTER_DATA && type != TOKEN_ATTR_VAL)
return getRawStringLength(index);
int len = 0, len1 = 0;
len = getTokenLength(index);
long offset = getTokenOffset(index);
long endOffset = offset + len;
long l;
while (offset < endOffset) {
l = getCharResolved(offset);
offset += (int) (l >> 32);
len1++;
}
return len1;
}
final public int getRawStringLength(int index) throws NavExceptionHuge {
int type = getTokenType(index);
int len = 0, len1 = 0;
if (type == TOKEN_STARTING_TAG || type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
len = getTokenLength(index) & 0xffff;
else
len = getTokenLength(index);
long offset = getTokenOffset(index);
long endOffset = offset + len;
long l;
while (offset < endOffset) {
l = getChar(offset);
offset += (int) (l >> 32);
len1++;
}
return len1;
}
/**
* This method compares two VTD tokens of VTDNav
* objects The behavior of this method is like compare the strings
* corresponds to i1 and i2, meaning for text or attribute val, entities
* will be converted into the corresponding char
*
* @param i1
* @param vn2
* @param i2
* @return -1,0, or 1
* @throws NavExceptionHuge
*
*/
public int compareTokens(int i1, VTDNavHuge vn2, int i2)
throws NavExceptionHuge{
int t1, t2;
int ch1, ch2;
long endOffset1, endOffset2;
long l;
if ( i1 ==i2 && this == vn2)
return 0;
t1 = this.getTokenType(i1);
t2 = vn2.getTokenType(i2);
long offset1 = this.getTokenOffset(i1);
long offset2 = vn2.getTokenOffset(i2);
int len1 =
(t1 == TOKEN_STARTING_TAG
|| t1 == TOKEN_ATTR_NAME
|| t1 == TOKEN_ATTR_NS)
? getTokenLength(i1) & 0xffff
: getTokenLength(i1);
int len2 =
(t2 == TOKEN_STARTING_TAG
|| t2 == TOKEN_ATTR_NAME
|| t2 == TOKEN_ATTR_NS)
? vn2.getTokenLength(i2) & 0xffff
: vn2.getTokenLength(i2);
endOffset1 = len1+offset1;
endOffset2 = len2+ offset2;
for(;offset1>32);
if(t2 == VTDNavHuge.TOKEN_CHARACTER_DATA
|| t2== VTDNavHuge.TOKEN_ATTR_VAL){
l = vn2.getCharResolved(offset2);
} else {
l = vn2.getChar(offset2);
}
ch2 = (int)l;
offset2 += (int)(l>>32);
if (ch1 > ch2)
return 1;
if (ch1 < ch2)
return -1;
}
if (offset1 == endOffset1
&& offset2 < endOffset2)
return -1;
else if (offset1 < endOffset1
&& offset2 == endOffset2)
return 1;
else
return 0;
}
/**
* Test the start of token content at index i matches the content
* of s, notice that this is to save the string allocation cost of
* using String's built-in startsWidth
* @param index
* @param s
* @return
* @throws NavExceptionHuge
*/
final public boolean startsWith(int index, String s) throws NavExceptionHuge{
int type = getTokenType(index);
int len =
(type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
? getTokenLength(index) & 0xffff
: getTokenLength(index);
long offset = getTokenOffset(index);
long l1;
int i,l;
long endOffset = offset + len;
boolean b = (type == TOKEN_CHARACTER_DATA
|| type == TOKEN_ATTR_VAL);
// System.out.print("currentOffset :" + currentOffset);
l = s.length();
if (l> len)
return false;
//System.out.println(s);
for (i = 0; i < l && offset < endOffset; i++) {
if (b)
l1 = getCharResolved(offset);
else
l1 = getChar(offset);
int i1 = s.charAt(i);
if (i1 != (int) l1)
return false;
offset += (int) (l1 >> 32);
}
return true;
}
/**
* Test the end of token content at index i matches the content
* of s, notice that this is to save the string allocation cost of
* using String's built-in endsWidth
* @param i
* @return
*/
final public boolean endsWith(int index, String s) throws NavExceptionHuge{
int type = getTokenType(index);
int len =
(type == TOKEN_STARTING_TAG
|| type == TOKEN_ATTR_NAME
|| type == TOKEN_ATTR_NS)
? getTokenLength(index) & 0xffff
: getTokenLength(index);
long offset = getTokenOffset(index);
long l1;
int i,l,i2;
boolean b = (type == TOKEN_CHARACTER_DATA
|| type == TOKEN_ATTR_VAL);
//int endOffset = offset + len;
// System.out.print("currentOffset :" + currentOffset);
l = s.length();
i2 = getStringLength(index);
if (l> len || l> i2)
return false;
i2 = i2 - l; // calculate the # of chars to be skipped
// eat away first several chars
for (i = 0; i < i2; i++) {
if (b)
l1 = getCharResolved(offset);
else
l1 = getChar(offset);
offset += (int) (l1 >> 32);
}
//System.out.println(s);
for (i = 0; i < l; i++) {
if (b)
l1 = getCharResolved(offset);
else
l1 = getChar(offset);
int i1 = s.charAt(i);
if (i1 != (int) l1)
return false;
offset += (int) (l1 >> 32);
}
return true;
}
/**
* Convert a token at the given index to a String and any upper case
* character will be converted to lower case, (entities and char
* references resolved). An attribute name or an element name will get the
* UCS2 string of qualified name
* @param index
* @return
* @throws NavExceptionHuge
*/
public String toStringLowerCase(int index) throws NavExceptionHuge {
int type = getTokenType(index);
if (type!=TOKEN_CHARACTER_DATA &&
type!= TOKEN_ATTR_VAL)
return toRawStringLowerCase(index);
int len;
len = getTokenLength(index);
long offset = getTokenOffset(index);
return toStringLowerCase(offset, len);
}
/**
* Convert the byte content segment (in terms of offset and length) to
* String, upper case characters are converted to lower case
*
* @param os
* the offset of the segment
* @param len
* the length of the segment
* @return the corresponding string value
* @throws NavExceptionHuge
*
*/
final protected String toStringLowerCase(long os, int len) throws NavExceptionHuge{
StringBuffer sb = new StringBuffer(len);
long offset = os;
long endOffset = os + len;
long l;
while (offset < endOffset) {
l = getCharResolved(offset);
offset += (int)(l>>32);
if ((int)l>64 && (int)l<91)
sb.append((char)(l+32));
else
sb.append((char)l);
}
return sb.toString();
}
/**
* Convert a token at the given index to a String and any lower case
* character will be converted to upper case, (entities and char
* references resolved). An attribute name or an element name will get the
* UCS2 string of qualified name
* @param index
* @return
* @throws NavExceptionHuge
*/
public String toStringUpperCase(int index) throws NavExceptionHuge {
int type = getTokenType(index);
if (type!=TOKEN_CHARACTER_DATA &&
type!= TOKEN_ATTR_VAL)
return toRawStringUpperCase(index);
int len;
len = getTokenLength(index);
long offset = getTokenOffset(index);
return toStringUpperCase(offset, len);
}
/**
* Convert the byte content segment (in terms of offset and length) to
* String, lower case characters are converted to upper case
*
* @param os
* the offset of the segment
* @param len
* the length of the segment
* @return the corresponding string value
* @throws NavExceptionHuge
*
*/
final protected String toStringUpperCase(long os, int len ) throws NavExceptionHuge{
StringBuffer sb = new StringBuffer(len);
long offset = os;
long endOffset = os + len;
long l;
while (offset < endOffset) {
l = getCharResolved(offset);
offset += (int)(l>>32);
if ((int)l>96 && (int)l<123)
sb.append((char)(l-32));
else
sb.append((char)l);
}
return sb.toString();
}
/**
* Return the offset (64-bit) and length (64-bit) of an element
* fragment
* @return a long[2], result[0]=offset, result[1]=length
* @throws NavExceptionHuge
*/
public long[] getElementFragment() throws NavExceptionHuge {
// a little scanning is needed
// has next sibling case
// if not
long[] result = new long[2];
int depth = getCurrentDepth();
// document length and offset returned if depth == -1
if (depth == -1){
int i=vtdBuffer.lower32At(0);
if (i==0){
result[0] = docOffset;
result[1] = docLen;
//return ((long)docLen)<<32| docOffset;
}
else {
result[0] = 32;
result[1] = docLen-32;
//return ((long)(docLen-32))| 32;
}
return result;
}
long so = getTokenOffset(getCurrentIndex2()) - 1;
long length = 0;
// for an element with next sibling
if (toElement(NEXT_SIBLING)) {
int temp = getCurrentIndex();
// rewind
while (getTokenDepth(temp) < depth) {
temp--;
}
//temp++;
long so2 = getTokenOffset(temp) - 1;
// look for the first '>'
while (getCharUnit(so2) != '>') {
so2--;
}
length = so2 - so + 1;
toElement(PREV_SIBLING);
if (encoding <= FORMAT_WIN_1258){
result[0]= so;
result[1]= length;
//return ((long) length) << 32 | so;
}
else {
result[0]=so<<1;
result[1]=length<<1;
//return ((long) length) << 33 | (so << 1);
}
return result;
}
// for root element
if (depth == 0) {
int temp = vtdBuffer.size() - 1;
boolean b = false;
long so2 = 0;
while (getTokenDepth(temp) == -1) {
temp--; // backward scan
b = true;
}
if (b == false)
so2 =
(encoding <= FORMAT_WIN_1258 )
? (docOffset + docLen - 1)
: ((docOffset + docLen) >> 1) - 1;
else
so2 = getTokenOffset(temp + 1);
while (getCharUnit(so2) != '>') {
so2--;
}
length = so2 - so + 1;
if (encoding <= FORMAT_WIN_1258){
result[0]= so;
result[1]= length;
//return ((long) length) << 32 | so;
}
else{
result[0]=so<<1;
result[1]=length<<1;
//return ((long) length) << 33 | (so << 1);
}
return result;
}
// for a non-root element with no next sibling
int temp = getCurrentIndex() + 1;
int size = vtdBuffer.size();
// temp is not the last entry in VTD buffer
if (temp < size) {
while (temp < size && getTokenDepth(temp) >= depth) {
temp++;
}
if (temp != size) {
int d =
depth
- getTokenDepth(temp)
+ ((getTokenType(temp) == TOKEN_STARTING_TAG) ? 1 : 0);
long so2 = getTokenOffset(temp) - 1;
int i = 0;
// scan backward
while (i < d) {
if (getCharUnit(so2) == '>')
i++;
so2--;
}
length = so2 - so + 2;
if (encoding <= FORMAT_WIN_1258){
result[0]=so;
result[1]=length;
//return ((long) length) << 32 | so;
}
else{
result[0]=so<<1;
result[1]=length<<1;
//return ((long) length) << 33 | (so << 1);
}
return result;
}
/*
* int so2 = getTokenOffset(temp - 1) - 1; int d = depth -
* getTokenDepth(temp - 1); int i = 0; while (i < d) { if
* (getCharUnit(so2) == '>') { i++; } so2--; } length = so2 - so +
* 2; if (encoding < 3) return ((long) length) < < 32 | so; else
* return ((long) length) < < 33 | (so < < 1);
*/
}
// temp is the last entry
// scan forward search for /> or
long so2 =
(encoding <= FORMAT_WIN_1258)
? (docOffset + docLen - 1)
: ((docOffset + docLen) >> 1) - 1;
int d;
d = depth + 1;
int i = 0;
while (i < d) {
if (getCharUnit(so2) == '>') {
i++;
}
so2--;
}
length = so2 - so + 2;
if (encoding <= FORMAT_WIN_1258){
result[0]=so;
result[1]=length;
//return ((long) length) << 32 | so;
}
else{
result[0]=so<<1;
result[1]=length<<1;
//return ((long) length) << 33 | (so << 1);
}
return result;
}
/**
* Get content fragment returns a long[2] encoding the offset and length of the byte segment of
* the content of current element, which is the byte segment between the starting tag and
* ending tag, null is returned if the current element is an empty element
*
* @return long[2] whose upper 64 bite is length, lower 64 bit is offset
*/
public long[] getContentFragment() throws NavExceptionHuge{
// a little scanning is needed
// has next sibling case
// if not
long[] result = new long[2];
int depth = getCurrentDepth();
// document length and offset returned if depth == -1
if (depth == -1){
int i=vtdBuffer.lower32At(0);
if (i==0){
result[0]= docOffset;
result[1]= docLen;
//return ((long)docLen)<<32| docOffset;
}
else{
result[0]= 32;
result[1]= docLen-32;
//return ((long)(docLen-32))| 32;
}
return result;
}
long so = getOffsetAfterHead();
if (so==-1)
return null;
long length = 0;
// for an element with next sibling
if (toElement(NEXT_SIBLING)) {
int temp = getCurrentIndex();
// rewind
while (getTokenDepth(temp) < depth) {
temp--;
}
//temp++;
long so2 = getTokenOffset(temp) - 1;
// look for the first '>'
while (getCharUnit(so2) != '>') {
so2--;
}
while (getCharUnit(so2) != '/') {
so2--;
}
while (getCharUnit(so2) != '<') {
so2--;
}
length = so2 - so;
toElement(PREV_SIBLING);
if (encoding <= FORMAT_WIN_1258){
result[0]= so;
result[1]= length;
//return ((long) length) << 32 | so;
}
else{
result[0]=so<<1;
result[1]=length<<1;
//return ((long) length) << 33 | (so << 1);
}
return result;
}
// for root element
if (depth == 0) {
int temp = vtdBuffer.size() - 1;
boolean b = false;
long so2 = 0;
while (getTokenDepth(temp) == -1) {
temp--; // backward scan
b = true;
}
if (b == false)
so2 =
(encoding <= FORMAT_WIN_1258 )
? (docOffset + docLen - 1)
: ((docOffset + docLen) >> 1) - 1;
else
so2 = getTokenOffset(temp + 1);
while (getCharUnit(so2) != '>') {
so2--;
}
while (getCharUnit(so2) != '/') {
so2--;
}
while (getCharUnit(so2) != '<') {
so2--;
}
length = so2 - so;
if (encoding <= FORMAT_WIN_1258){
result[0]= so;
result[1]= length;
//return ((long) length) << 32 | so;
}
else {
result[0]=so<<1;
result[1]=length<<1;
//return ((long) length) << 33 | (so << 1);
}
return result;
}
// for a non-root element with no next sibling
int temp = getCurrentIndex() + 1;
int size = vtdBuffer.size();
// temp is not the last entry in VTD buffer
if (temp < size) {
while (temp < size && getTokenDepth(temp) >= depth) {
temp++;
}
if (temp != size) {
int d =
depth
- getTokenDepth(temp)
+ ((getTokenType(temp) == TOKEN_STARTING_TAG) ? 1 : 0);
long so2 = getTokenOffset(temp) - 1;
int i = 0;
// scan backward
while (i < d) {
if (getCharUnit(so2) == '>')
i++;
so2--;
}
while (getCharUnit(so2) != '/') {
so2--;
}
while (getCharUnit(so2) != '<') {
so2--;
}
length = so2 - so;
if (encoding <= FORMAT_WIN_1258){
result[0]= so;
result[1]= length;
//return ((long) length) << 32 | so;
}
else{
result[0]=so<<1;
result[1]=length<<1;
//return ((long) length) << 33 | (so << 1);
}
return result;
}
/*
* int so2 = getTokenOffset(temp - 1) - 1; int d = depth -
* getTokenDepth(temp - 1); int i = 0; while (i < d) { if
* (getCharUnit(so2) == '>') { i++; } so2--; } length = so2 - so +
* 2; if (encoding < 3) return ((long) length) < < 32 | so; else
* return ((long) length) < < 33 | (so < < 1);
*/
}
// temp is the last entry
// scan forward search for /> or
long so2 =
(encoding <= FORMAT_WIN_1258)
? (docOffset + docLen - 1)
: ((docOffset + docLen) >> 1) - 1;
int d;
d = depth + 1;
int i = 0;
while (i < d) {
if (getCharUnit(so2) == '>') {
i++;
}
so2--;
}
while (getCharUnit(so2) != '/') {
so2--;
}
while (getCharUnit(so2) != '<') {
so2--;
}
length = so2 - so;
if (encoding <= FORMAT_WIN_1258){
result[0]= so;
result[1]= length;
//return ((long) length) << 32 | so;
}
else {
result[0]=so<<1;
result[1]=length<<1;
//return ((long) length) << 33 | (so << 1);
}
return result;
}
public ElementFragmentNsHuge getElementFragmentNs() throws NavExceptionHuge{
if (this.ns == false)
throw new NavExceptionHuge("getElementFragmentNS can only be called when parsing is ns enabled");
FastIntBuffer fib = new FastIntBuffer(3); // init size 8
//fill the fib with integer
// first get the list of name space nodes
int[] ia = context;
int d =ia[0]; // -1 for document node, 0 for root element;
int c = getCurrentIndex2();
int len = (c == 0 || c == rootIndex )? 0:
(getTokenLength(c) & 0xffff); // get the length of qualified node
// put the neighboring ATTR_NS nodes into the array
// and record the total # of them
int i = 0;
int count=0;
if (d > 0){ // depth > 0 every node except document and root element
int k=getCurrentIndex2()+1;
if (k" + toString(k));
}
k+=2;
//type = this.getTokenType(k);
}
}
count = fib.size();
d--;
while (d >= 0) {
// then search for ns node in the vinicity of the ancestor nodes
if (d > 0) {
// starting point
k = ia[d]+1;
} else {
// starting point
k = this.rootIndex+1;
}
if (k
// "+fib.size());
//if (fib.size()==4);
if (matchTokens(fib.intAt(z), this, k)) {
unique = false;
break;
}
}
if (unique)
fib.append(k);
}
}
k += 2;
// type = this.getTokenType(k);
}
}
d--;
}
// System.out.println("count ===> "+count);
// then restore the name space node by shifting the array
int newSz= fib.size()-count;
for (i= 0; i1){
vn.l2index = this.l2index;
vn.l2upper = l2upper;
vn.l2lower = l2lower;
}
if (getCurrentDepth() > 2) {
vn.l3lower = l3lower;
vn.l3index = l3index;
vn.l3upper = l3upper;
}
return vn;
}
/**
* Return the byte offset and length of up to i sibling fragments. If
* there is a i+1 sibling element, the cursor element would
* move to it; otherwise, there is no cursor movement. If the cursor isn't
* positioned at an element (due to XPath evaluation), then -1 will be
* returned
* @param i number of silbing elements including the cursor element
* @return a long[2] encoding byte offset (lower 64 bits), length (
* upper 64 bits) of those fragments
* @throws NavExceptionHuge
*/
public long[] getSiblingElementFragments(int i) throws NavExceptionHuge{
if (i<=0)
throw new IllegalArgumentException(" # of sibling can be less or equal to 0");
// get starting char offset
if(atTerminal==true)
return null;
// so is the char offset
long so = getTokenOffset(getCurrentIndex())-1;
// char offset to byte offset conversion
if (encoding>=FORMAT_UTF_16BE)
so = so<<1;
BookMarkHuge bmh = new BookMarkHuge(this);
bmh.recordCursorPosition();
while(i>1 && toElement(VTDNav.NEXT_SIBLING)){
i--;
}
long[] l= getElementFragment();
long len = l[0]+l[1]-so;
if (i==1 && toElement(VTDNav.NEXT_SIBLING)){
}else
bmh.setCursorPosition();
l[0] = so; l[1]=len;
return l;
}
}
