com.ximpleware.intHash Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
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

The newest version!

/* 
 * Copyright (C) 2002-2017 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*/
/*All licenses to any parties in litigation with XimpleWare have been expressly terminated. No new license, and no renewal of any revoked license, 
 * is granted to those parties as a result of re-downloading software from this or any other website*/
package com.ximpleware;

/**
 *
 * This is the implementation of a hash table for integers
 * It is used by various XPath expressions to check for uniqueness
 * of a node. It has been modified to improve memory usage for large XML files.
 */
class intHash {
	private int mask1 = 0x7ff;
    //2048
	private int mask2 = 0xfffff800;
	private int pageSizeE = 3; // 32 * 4 bytes
	protected Object[] storage;
	private int hashWidth = 1<<11;
	private int maxDepth;
	protected int e;
	/**
     * Constructor
     *
     */
    public intHash(){
        hashWidth = 1<<0;
        mask1 = (hashWidth) -1;
        mask2 = (~mask1) & 0xffffffff;    
        storage = new Object[hashWidth];
        e=0;
    }
	 public intHash(int hashWidthExpo){
	        e=hashWidthExpo;
	        hashWidth = 1<maxDepth){
	            maxDepth = temp;
	        }
	        if (storage[temp]==null) {
	            int[] ia= new int[1<maxDepth){
	            maxDepth = temp;
	        }
	        if (storage[temp]==null) {
	            //storage[temp]= new FastIntBuffer(pageSizeE);
	            //storage[temp].append(i);
	            return true;
	        }        
	        else{
	            int size = ((int [])storage[temp])[0];
	            for (int j=1;j<=size;j++){
	                if (i == ((int []) storage[temp])[j]){
	                    return false;
	                }
	            }
	            //storage[temp].append(i);
	            return true;            
	        }
	    }

	    
	    final public int totalSize(){
	    	int total = 0;
	    	for (int i=0;i