| SSD::Diff | Quasi-abstract class for a diff |
| SSD::DiffDijkstra | Dijkstra search core object |
| SSD::DiffDijkstraState | State object for the Dijkstra search we are implementing |
| SSD::DiffDijkstraStateQueue | Sorting function used for sorting the state queue |
| SSD::Doc | Document wrapper class this class wraps around a document, in the current version only XML documents are supported, but other similar formats might be added later on (by making Doc an abstract class and deriving from it |
| SSD::eq_str | Equality functor for char* strings |
| __gnu_cxx::hash< void * > | Trivial "hash function" for pointers |
| SSD::hash_NEqC | C++ hash function object uses the has function supplied in the object code |
| SSD::hash_releqc | Hash functor for relation equality classes |
| SSD::hash_ustring | Hash functor for ustrings in maps |
| SSD::MarkedWriter | Output writer for the "marked" output format |
| SSD::MergedWriter | Output writer class for the "merged" format |
| SSD::Node | Class encapsulating a single node this is an abstraction layer away from the libxml data structure while allowing at the same time storage of additional information |
| SSD::NodeAssignments | Reference counting list carrying two Node* as data this is a reference counting list since we are not going to use it a true list, but it can grow into different directions. The real structure will look like a tree, but with the children pointing to its parents |
| SSD::NodeEqClass | Key for a node equality class, and hash function |
| SSD::RelCount | Relation count class |
| SSD::RelEqClass | Relation Equality Class - get the equality class for two given nodes |
| SSD::ustring | Class which stores each string only once and enables faster comparision |
| SSD::XUpdateWriter | XUpdate output writer class |
