com.ximpleware.extended.NodeRecorderHuge Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of vtd-xml Show documentation
Show all versions of vtd-xml Show documentation
XimpleWare's VTD-XML is, far and away, the industry's most advanced and powerful XML processing model for SOA and Cloud Computing
/*
* Copyright (C) 2002-2015 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.
*/
/*VTD-XML is protected by US patent 7133857, 7260652, an 7761459*/
package com.ximpleware.extended;
/**
*
* NodeRecorderHuge allows one to record the node position of VTDNavHuge. However, the
* internal representation of node is variable in length and recording a large
* number of nodes could consume much memory. It is a bad idea to
* record every node of an document. So be careful when using it.
*/
public class NodeRecorderHuge {
protected VTDNavHuge vn;
protected FastIntBuffer fib;
public final static int BUF_SZ_EXPO = 7;// buffer page size is now 128
int size; // in # of nodes
int position; // in # of nodes
int count; // in # of ints
/**
* The parameter-less constructor
*
*/
public NodeRecorderHuge() {
vn = null;
size = position = 0;
fib = new FastIntBuffer(BUF_SZ_EXPO);
}
/**
*
* @param vn1
*/
public NodeRecorderHuge(VTDNavHuge vn1) {
bind(vn1);
size = position = count = 0;
fib = new FastIntBuffer(BUF_SZ_EXPO);
}
public void bind(VTDNavHuge vn1) {
if (vn1 == null)
throw new IllegalArgumentException(
"NodeRecorder can't take a null VTDNav instatnce");
vn = vn1;
}
/**
* This function records the position of VN into an internal buffer
*
*/
public void record() {
//add the context and
int i;
switch (vn.context[0]) {
case -1:
fib.append(0xff | 0x80000000);
size++;
position++;
count++;
break;
case 0:
if (vn.atTerminal == false) {
fib.append(0);
count++;
} else {
fib.append(0x80000000);
count += 2;
}
size++;
position++;
if (vn.atTerminal == true)
fib.append(vn.LN);
break;
case 1:
if (vn.atTerminal == false) {
fib.append(1);
fib.append(vn.context[1]);
fib.append(vn.l1index);
size++;
position++;
count += 3;
} else {
fib.append(0x80000001);
fib.append(vn.context[1]);
fib.append(vn.l1index);
fib.append(vn.LN);
size++;
position++;
count += 4;
}
break;
case 2:
if (vn.atTerminal == false) {
fib.append(2);
count += 7;
} else {
fib.append(0x80000002);
count += 8;
}
fib.append(vn.context[1]);
fib.append(vn.context[2]);
fib.append(vn.l1index);
fib.append(vn.l2lower);
fib.append(vn.l2upper);
fib.append(vn.l2index);
size++;
position++;
if (vn.atTerminal == true)
fib.append(vn.LN);
break;
case 3:
if (vn.atTerminal == false) {
fib.append(3);
count += 11;
} else {
fib.append(0x80000003);
count += 12;
}
fib.append(vn.context[1]);
fib.append(vn.context[2]);
fib.append(vn.context[3]);
fib.append(vn.l1index);
fib.append(vn.l2lower);
fib.append(vn.l2upper);
fib.append(vn.l2index);
fib.append(vn.l3lower);
fib.append(vn.l3upper);
fib.append(vn.l3index);
size++;
position++;
if (vn.atTerminal == true)
fib.append(vn.LN);
break;
default:
if (vn.atTerminal == false) {
i = vn.context[0];
fib.append(i);
count += i + 8;
} else {
i = vn.context[0];
fib.append(i | 0x80000000);
count += i + 9;
}
for (int k = 1; k <= i; k++) {
fib.append(vn.context[k]);
}
fib.append(vn.l1index);
fib.append(vn.l2lower);
fib.append(vn.l2upper);
fib.append(vn.l2index);
fib.append(vn.l3lower);
fib.append(vn.l3upper);
fib.append(vn.l3index);
size++;
position++;
if (vn.atTerminal)
fib.append(vn.LN);
}
}
/**
* resetPointer() will set the pointer to the first node in NodeRecorder
* This method is called when one wants to read the nodes in the nodeRecorder
*
*/
public void resetPointer() {
position = 0;
count=0;
}
/**
* Clear will erase all the nodes, internal buffers are reused
*
*/
public void clear() {
size = position = count = 0;
fib.clear();
}
/**
* This method set the cursor in VTDNav to the nodes as recorded
* in NodeRecorder, and return the output of "getCurrentIndex()"
* It is important to notice that you can only go forward, not
* backward
* @return int
*
*/
public int iterate() {
int j,i ;
if (count= 0);
if (b == false) {
i = i & 0x7fffffff;
}
switch (i) {
case 0xff:
vn.context[0]=-1;
vn.atTerminal=false;
count++;
break;
case 0:
vn.context[0]=0;
if (b==false){
vn.atTerminal = true;
vn.LN = fib.intAt(count+1);
count+=2;
}else{
vn.atTerminal = false;
count++;
}
break;
case 1:
vn.context[0]=1;
vn.context[1]=fib.intAt(count+1);
vn.l1index = fib.intAt(count+2);
if (b==false){
vn.atTerminal = true;
vn.LN = fib.intAt(count+3);
count+=4;
}else{
vn.atTerminal = false;
count+=3;
}
break;
case 2:
vn.context[0]=2;
vn.context[1]=fib.intAt(count+1);
vn.context[2]=fib.intAt(count+2);
vn.l1index = fib.intAt(count+3);
vn.l2lower = fib.intAt(count+4);
vn.l2upper = fib.intAt(count+5);
vn.l2index = fib.intAt(count+6);
if (b==false){
vn.atTerminal = true;
vn.LN = fib.intAt(count+7);
count+=8;
}else{
vn.atTerminal = false;
count+=7;
}
break;
case 3:
vn.context[0]=3;
vn.context[1]=fib.intAt(count+1);
vn.context[2]=fib.intAt(count+2);
vn.context[3]=fib.intAt(count+3);
vn.l1index = fib.intAt(count+4);
vn.l2lower = fib.intAt(count+5);
vn.l2upper = fib.intAt(count+6);
vn.l2index = fib.intAt(count+7);
vn.l3lower = fib.intAt(count+8);
vn.l3upper = fib.intAt(count+9);
vn.l3index = fib.intAt(count+10);
if (b==false){
vn.atTerminal = true;
vn.LN = fib.intAt(count+11);
count+=12;
}else{
vn.atTerminal = false;
count+=11;
}
break;
default:
vn.context[0]=i;
for(j=1;j © 2015 - 2025 Weber Informatics LLC | Privacy Policy