![]() |
ufe
3.2
Universal Front End is a DCC-agnostic component that will allow a DCC to browse and edit data in multiple data models
|
Node for Universal Front End trie. More...
#include <selectionTrieFwd.h>
Public Member Functions | |
Trie () | |
Trie (const Trie &)=delete | |
Trie & | operator= (const Trie &)=delete |
Trie (Trie &&) | |
Trie & | operator= (Trie &&) |
TrieNode< T >::Ptr | root () const |
TrieNode< T >::Ptr | add (const Path &path, const T &data) |
TrieNode< T >::Ptr | remove (const Path &) |
TrieNode< T >::Ptr | move (const Path &oldPath, const Path &newPath) |
void | clear () |
TrieNode< T >::Ptr | find (const Path &path) const |
bool | contains (const Path &path) const |
TrieNode< T >::Ptr | node (const Path &path) const |
bool | containsDescendant (const Path &path) const |
bool | containsDescendantInclusive (const Path &path) const |
bool | containsAncestor (const Path &path) const |
bool | containsAncestorInclusive (const Path &path) const |
int | closestCommonAncestor () const |
std::size_t | size () const |
bool | empty () const |
Private Member Functions | |
TrieNode< T >::Ptr | createNode (const Path &path) |
void | cleanUpNode (const typename TrieNode< T >::Ptr &node) |
template<bool INCLUDE_DESCENDANT> | |
bool | containsAncestorHelper (const Path &path) const |
template<bool INCLUDE_ANCESTOR> | |
bool | containsDescendantHelper (const Path &path) const |
Private Attributes | |
TrieNode< T >::Ptr | fRoot |
Node for Universal Front End trie.
Trie.
Each node in the trie represents a path component in the graph, except the trie root node, which is empty. Each node has a dictionary of children trie nodes.
It holds the name of a node in a runtime, a dictionary of children trie nodes, and optionally data. The runtime node is the parent of children runtime nodes, each of which have an associated trie node.
Trie nodes created to represent components that are iternal to the trie won't have data. For example, in a trivial trie, for a node with path "a|b|c|d" that has data, trie nodes for path components a, b, and c will not have data, while the trie node for d will. Data can later be added to runtime node a, b, or c.
The trie is a prefix tree data structure to allow fast hierarchical searching by path. The path can represent containment, or a 3D hierarchy.
Trie nodes can have data. A trie node without data is an internal node, and only exists to serve as parent of one or more descendant trie node(s).
Definition at line 18 of file selectionTrieFwd.h.
Definition at line 204 of file trie.imp.h.
Definition at line 208 of file trie.imp.h.
Definition at line 245 of file trie.imp.h.
References Ufe::PathString::path(), and Ufe::TrieNode< T >::setData().
|
private |
Definition at line 409 of file trie.imp.h.
References Ufe::TrieNode< T >::empty(), Ufe::TrieNode< T >::hasData(), Ufe::TrieNode< T >::parent(), and Ufe::TrieNode< T >::remove().
void Ufe::Trie< T >::clear | ( | ) |
Definition at line 435 of file trie.imp.h.
int Ufe::Trie< T >::closestCommonAncestor | ( | ) | const |
Definition at line 384 of file trie.imp.h.
Definition at line 280 of file trie.imp.h.
References Ufe::PathString::path().
Definition at line 372 of file trie.imp.h.
|
private |
Definition at line 331 of file trie.imp.h.
References Ufe::Path::cbegin(), Ufe::Path::cend(), Ufe::Path::empty(), and Ufe::TrieNode< T >::hasData().
Definition at line 378 of file trie.imp.h.
Definition at line 318 of file trie.imp.h.
|
private |
Definition at line 287 of file trie.imp.h.
References Ufe::TrieNode< T >::empty(), and Ufe::Path::empty().
Definition at line 324 of file trie.imp.h.
Definition at line 228 of file trie.imp.h.
References Ufe::TrieNode< T >::add(), and Ufe::PathString::path().
bool Ufe::Trie< T >::empty | ( | ) | const |
Definition at line 447 of file trie.imp.h.
Definition at line 255 of file trie.imp.h.
References Ufe::TrieNode< T >::hasData(), and Ufe::PathString::path().
TrieNode< T >::Ptr Ufe::Trie< T >::move | ( | const Path & | oldPath, |
const Path & | newPath | ||
) |
Definition at line 421 of file trie.imp.h.
References Ufe::Path::back(), Ufe::Path::pop(), and UFE_ASSERT_MSG.
Definition at line 265 of file trie.imp.h.
References Ufe::PathString::path().
Definition at line 214 of file trie.imp.h.
Definition at line 390 of file trie.imp.h.
References Ufe::TrieNode< T >::clearData(), Ufe::TrieNode< T >::hasData(), and UFE_ASSERT_MSG.
Definition at line 222 of file trie.imp.h.
std::size_t Ufe::Trie< T >::size | ( | ) | const |
Definition at line 441 of file trie.imp.h.