FileDocCategorySizeDatePackage
ExpandedNameTable.javaAPI DocJava SE 6 API12074Tue Jun 10 00:22:58 BST 2008com.sun.org.apache.xml.internal.dtm.ref

ExpandedNameTable

public class ExpandedNameTable extends Object
This is a default implementation of a table that manages mappings from expanded names to expandedNameIDs. %OPT% The performance of the getExpandedTypeID() method is very important to DTM building. To get the best performance out of this class, we implement a simple hash algorithm directly into this class, instead of using the inefficient java.util.Hashtable. The code for the get and put operations are combined in getExpandedTypeID() method to share the same hash calculation code. We only need to implement the rehash() interface which is used to expand the hash table.

Fields Summary
private ExtendedType[]
m_extendedTypes
Array of extended types for this document
private static int
m_initialSize
The initial size of the m_extendedTypes array
private int
m_nextType
Next available extended type
public static final int
ELEMENT
public static final int
ATTRIBUTE
public static final int
TEXT
public static final int
CDATA_SECTION
public static final int
ENTITY_REFERENCE
public static final int
ENTITY
public static final int
PROCESSING_INSTRUCTION
public static final int
COMMENT
public static final int
DOCUMENT
public static final int
DOCUMENT_TYPE
public static final int
DOCUMENT_FRAGMENT
public static final int
NOTATION
public static final int
NAMESPACE
ExtendedType
hashET
Workspace for lookup. NOT THREAD SAFE!
private static ExtendedType[]
m_defaultExtendedTypes
The array to store the default extended types.
private static float
m_loadFactor
The default load factor of the Hashtable. This is used to calcualte the threshold.
private static int
m_initialCapacity
The initial capacity of the hash table. Use a bigger number to avoid the cost of expanding the table.
private int
m_capacity
The capacity of the hash table, i.e. the size of the internal HashEntry array.
private int
m_threshold
The threshold of the hash table, which is equal to capacity * loadFactor. If the number of entries in the hash table is bigger than the threshold, the hash table needs to be expanded.
private HashEntry[]
m_table
The internal array to store the hash entries. Each array member is a slot for a hash bucket.
Constructors Summary
public ExpandedNameTable()
Create an expanded name table.


        
   
    m_defaultExtendedTypes = new ExtendedType[DTM.NTYPES];

    for (int i = 0; i < DTM.NTYPES; i++)
    {
      m_defaultExtendedTypes[i] = new ExtendedType(i, "", "");
    }
  
    m_capacity = m_initialCapacity;
    m_threshold = (int)(m_capacity * m_loadFactor);
    m_table = new HashEntry[m_capacity];
    
    initExtendedTypes();
Methods Summary
public intgetExpandedTypeID(java.lang.String namespace, java.lang.String localName, int type)
Given an expanded name represented by namespace, local name and node type, return an ID. If the expanded-name does not exist in the internal tables, the entry will be created, and the ID will be returned. Any additional nodes that are created that have this expanded name will use this ID.

param
namespace The namespace
param
localName The local name
param
type The node type
return
the expanded-name id of the node.

    return getExpandedTypeID(namespace, localName, type, false);
public intgetExpandedTypeID(java.lang.String namespace, java.lang.String localName, int type, boolean searchOnly)
Given an expanded name represented by namespace, local name and node type, return an ID. If the expanded-name does not exist in the internal tables, the entry will be created, and the ID will be returned. Any additional nodes that are created that have this expanded name will use this ID.

If searchOnly is true, we will return -1 if the name is not found in the table, otherwise the name is added to the table and the expanded name id of the new entry is returned.

param
namespace The namespace
param
localName The local name
param
type The node type
param
searchOnly If it is true, we will only search for the expanded name. -1 is return is the name is not found.
return
the expanded-name id of the node.

    if (null == namespace)
      namespace = "";
    if (null == localName)
      localName = "";
    
    // Calculate the hash code
    int hash = type + namespace.hashCode() + localName.hashCode();
    
    // Redefine the hashET object to represent the new expanded name.
    hashET.redefine(type, namespace, localName, hash);
    
    // Calculate the index into the HashEntry table.
    int index = hash % m_capacity;
    if (index < 0)
      index = -index;

    // Look up the expanded name in the hash table. Return the id if
    // the expanded name is already in the hash table.
    for (HashEntry e = m_table[index]; e != null; e = e.next)
    {
      if (e.hash == hash && e.key.equals(hashET))
        return e.value;
    }
    
    if (searchOnly)
    {
      return DTM.NULL;
    }

    // Expand the internal HashEntry array if necessary.
    if (m_nextType > m_threshold) {
      rehash();
      index = hash % m_capacity;
      if (index < 0)
        index = -index;
    }
    
    // Create a new ExtendedType object
    ExtendedType newET = new ExtendedType(type, namespace, localName, hash);
    
    // Expand the m_extendedTypes array if necessary.
    if (m_extendedTypes.length == m_nextType) {
        ExtendedType[] newArray = new ExtendedType[m_extendedTypes.length * 2];
        System.arraycopy(m_extendedTypes, 0, newArray, 0,
                         m_extendedTypes.length);
        m_extendedTypes = newArray;
    }
    
    m_extendedTypes[m_nextType] = newET;
    
    // Create a new hash entry for the new ExtendedType and put it into 
    // the table.
    HashEntry entry = new HashEntry(newET, m_nextType, hash, m_table[index]);
    m_table[index] = entry;

    return m_nextType++;
public intgetExpandedTypeID(int type)
Given a type, return an expanded name ID.Any additional nodes that are created that have this expanded name will use this ID.

return
the expanded-name id of the node.

    return type;
public com.sun.org.apache.xml.internal.dtm.ref.ExtendedType[]getExtendedTypes()
Return the array of extended types

return
The array of extended types

    return m_extendedTypes;
public java.lang.StringgetLocalName(int ExpandedNameID)
Given an expanded-name ID, return the local name part.

param
ExpandedNameID an ID that represents an expanded-name.
return
String Local name of this node, or null if the node has no name.

    return m_extendedTypes[ExpandedNameID].getLocalName();
public final intgetLocalNameID(int ExpandedNameID)
Given an expanded-name ID, return the local name ID.

param
ExpandedNameID an ID that represents an expanded-name.
return
The id of this local name.

    // ExtendedType etype = m_extendedTypes[ExpandedNameID];
    if (m_extendedTypes[ExpandedNameID].getLocalName().equals(""))
      return 0;
    else
    return ExpandedNameID;
public java.lang.StringgetNamespace(int ExpandedNameID)
Given an expanded-name ID, return the namespace URI part.

param
ExpandedNameID an ID that represents an expanded-name.
return
String URI value of this node's namespace, or null if no namespace was resolved.

    String namespace = m_extendedTypes[ExpandedNameID].getNamespace();
    return (namespace.equals("") ? null : namespace);
public final intgetNamespaceID(int ExpandedNameID)
Given an expanded-name ID, return the namespace URI ID.

param
ExpandedNameID an ID that represents an expanded-name.
return
The id of this namespace.

    //ExtendedType etype = m_extendedTypes[ExpandedNameID];
    if (m_extendedTypes[ExpandedNameID].getNamespace().equals(""))
      return 0;
    else
    return ExpandedNameID;
public intgetSize()
Return the size of the ExpandedNameTable

return
The size of the ExpandedNameTable

    return m_nextType;
public final shortgetType(int ExpandedNameID)
Given an expanded-name ID, return the local name ID.

param
ExpandedNameID an ID that represents an expanded-name.
return
The id of this local name.

    //ExtendedType etype = m_extendedTypes[ExpandedNameID];
    return (short)m_extendedTypes[ExpandedNameID].getNodeType();
private voidinitExtendedTypes()
Initialize the vector of extended types with the basic DOM node types.

    
    m_extendedTypes = new ExtendedType[m_initialSize];
    for (int i = 0; i < DTM.NTYPES; i++) {
        m_extendedTypes[i] = m_defaultExtendedTypes[i];
        m_table[i] = new HashEntry(m_defaultExtendedTypes[i], i, i, null);
    }
    
    m_nextType = DTM.NTYPES;
private voidrehash()
Increases the capacity of and internally reorganizes the hashtable, in order to accommodate and access its entries more efficiently. This method is called when the number of keys in the hashtable exceeds this hashtable's capacity and load factor.

    int oldCapacity = m_capacity;
    HashEntry[] oldTable = m_table;
      
    int newCapacity = 2 * oldCapacity + 1;
    m_capacity = newCapacity;
    m_threshold = (int)(newCapacity * m_loadFactor);
      
    m_table = new HashEntry[newCapacity];
    for (int i = oldCapacity-1; i >=0 ; i--)
    {
      for (HashEntry old = oldTable[i]; old != null; )
      {
        HashEntry e = old;
        old = old.next;
          
        int newIndex = e.hash % newCapacity;
        if (newIndex < 0)
          newIndex = -newIndex;
          
        e.next = m_table[newIndex];
        m_table[newIndex] = e;
      }
    }