See: Description
| Interface | Description |
|---|---|
| PuCompare_If |
Interface for comparing Objects.
|
| Class | Description |
|---|---|
| PuAVLTree |
AVL tree is a self-balancing binary search tree.
|
| PuBinaryTreeNode |
Class for nodes in a binary search tree.
|
| PuComparePdVectorsLexi |
Comparator for PdVector objects, comparing by lexicographic order.
|
| PuCompareStringsLexi |
Comparator for Strings, comparing by lexicographic order.
|
| PuEnum |
Basic enum class with update functionality and panel containing a choice.
|
| PuEnum_IP |
Info panel of enum with label.
|
| PuPriorityQueue |
Integer heap with
double keys (resp. weights) based on following special
property: The ints given to the heap must be the numbers
from 0 to capacity-1 and each int can be in the heap
just once. |
| PuQueue |
This class provides the functionality of a queue or a stack of integers.
|
Contains data structure and container similar to java.util but with a focus on algorithmic structures.
"