Bare minimum XPath parser. @xerces.internal @author Andy Clark, IBM @version $Id: XPath.java,v 1.18 2005/03/07 23:28:41 mrglavas Exp $
@author <a HREF="mailto:email@example.com">Jonas Bonér </a> @author <a HREF="mailto:firstname.lastname@example.org">Alexandre Vasseur </a>
<h2>Ternary Search Tree</h2> <p>A ternary search tree is a hibrid between a binary tree and a digital search tree (trie). Keys are limited to strings. A data value of type char is stored in each leaf node. It can be used as an index (or pointer) to the data. Branches that only c ...
A very simple table that stores a list of objects. This version is based on a "realloc" strategy -- a simle array is used, and when more storage is needed, a larger array is obtained and all existing data is recopied into it. As a result, read/write access to existing nodes is O(1) fast but appen ...