|
|
|
Array builds upon the Segment classes to add
more complex, multi-operand operations and expressions.
|
|
|
|
The List class framework provides a simple dynamic data
storage methodology using a simple data-independent double-linked list
structure. List provides a templated class for simple
types as well as the ability to build derived list classes for a more
simplified use for complex classes.
|
|
|
|
The Segment framework provides a set of simplified classes
for encapsulating contiguous memory allocations. All of the higher
level classes within the APTL package that rely on contiguous memory
allocations utilize the Segment framework for maximum
performance.
|
|
|
|
The SortedList classes build upon the Tree
framework to add the auto-sorting capabilities to a list structure.
Although the interface is similiar to that of a standard List
the data-dependent sorting functionality restricts the user to a single
insertion function.
|
|
|
|
Although somewhat similiar to a List, the Stack
classes use a single-linked list structure since the data can only be
'pushed' at the top of the stack, unlike a regular List that
permits data insertion anywhere within the list.
|
|
|
|
The Tree framework provides the most powerful dynamic
structure for data-dependent storage due to its relative simplicity.
Provided are simple parent-child trees as well as binary/quad/oct trees
for efficient storage of 1-component, 2-component, and 3-component
vector data.
|
|
|
top of page
|
|
