ufe 5.5
Universal Front End is a DCC-agnostic component that will allow a DCC to browse and edit data in multiple data models
|
#include <trie.h>
Public Types | |
typedef std::shared_ptr< TrieNode > | Ptr |
Public Member Functions | |
TrieNode (const PathComponent &component) | |
TrieNode () | |
Ptr | parent () const |
void | add (const Ptr &child) |
void | remove (const Ptr &child) |
bool | contains (const PathComponent &child) const |
Ptr | operator[] (const PathComponent &child) const |
std::vector< PathComponent > | childrenComponents () const |
std::size_t | size () const |
std::size_t | treeSize () const |
bool | empty () const |
PathComponent | component () const |
void | rename (const PathComponent &component) |
void | move (const PathComponent &component, const Ptr &newParent) |
void | setData (const T &data) |
const T & | data () const |
bool | hasData () const |
int | closestCommonAncestor (int depth) const |
Private Types | |
typedef std::unordered_map< PathComponent, Ptr > | Children |
typedef std::weak_ptr< TrieNode > | ParentPtr |
Private Member Functions | |
void | clear () |
void | clearData () |
void | setParent (Ptr parent) |
Private Attributes | |
PathComponent | fComponent |
ParentPtr | fParent |
Children | fChildren |
bool | fHasData |
T | fData |
Friends | |
class | Trie< T > |
|
private |
|
private |
typedef std::shared_ptr<TrieNode> Ufe::TrieNode< T >::Ptr |
Ufe::TrieNode< T >::TrieNode | ( | const PathComponent & | component | ) |
Definition at line 26 of file trie.imp.h.
Ufe::TrieNode< T >::TrieNode |
Definition at line 32 of file trie.imp.h.
void Ufe::TrieNode< T >::add | ( | const Ptr & | child | ) |
Definition at line 36 of file trie.imp.h.
References UFE_ASSERT_MSG.
Referenced by Ufe::Trie< T >::createNode().
std::vector< PathComponent > Ufe::TrieNode< T >::childrenComponents |
Definition at line 86 of file trie.imp.h.
|
private |
Definition at line 58 of file trie.imp.h.
|
private |
Definition at line 188 of file trie.imp.h.
Referenced by Ufe::Trie< T >::remove().
int Ufe::TrieNode< T >::closestCommonAncestor | ( | int | depth | ) | const |
Definition at line 98 of file trie.imp.h.
PathComponent Ufe::TrieNode< T >::component |
Definition at line 149 of file trie.imp.h.
bool Ufe::TrieNode< T >::contains | ( | const PathComponent & | child | ) | const |
Definition at line 73 of file trie.imp.h.
const T & Ufe::TrieNode< T >::data |
Definition at line 194 of file trie.imp.h.
bool Ufe::TrieNode< T >::empty |
Definition at line 143 of file trie.imp.h.
Referenced by Ufe::Trie< T >::cleanUpNode(), and Ufe::Trie< T >::containsDescendantHelper().
bool Ufe::TrieNode< T >::hasData |
Definition at line 200 of file trie.imp.h.
Referenced by Ufe::Trie< T >::cleanUpNode(), Ufe::Trie< T >::containsAncestorHelper(), Ufe::Trie< T >::find(), and Ufe::Trie< T >::remove().
void Ufe::TrieNode< T >::move | ( | const PathComponent & | component, |
const Ptr & | newParent | ||
) |
Definition at line 167 of file trie.imp.h.
References UFE_ASSERT_MSG.
Referenced by Ufe::Trie< T >::move().
TrieNode< T >::Ptr Ufe::TrieNode< T >::operator[] | ( | const PathComponent & | child | ) | const |
Definition at line 79 of file trie.imp.h.
TrieNode< T >::Ptr Ufe::TrieNode< T >::parent |
Definition at line 67 of file trie.imp.h.
Referenced by Ufe::Trie< T >::cleanUpNode(), and Ufe::Trie< T >::move().
void Ufe::TrieNode< T >::remove | ( | const Ptr & | child | ) |
Definition at line 49 of file trie.imp.h.
References UFE_ASSERT_COMPILED, and UFE_ASSERT_MSG.
Referenced by Ufe::Trie< T >::cleanUpNode().
void Ufe::TrieNode< T >::rename | ( | const PathComponent & | component | ) |
Definition at line 155 of file trie.imp.h.
References UFE_ASSERT_MSG.
void Ufe::TrieNode< T >::setData | ( | const T & | data | ) |
Definition at line 181 of file trie.imp.h.
Referenced by Ufe::Trie< T >::add().
|
private |
Definition at line 206 of file trie.imp.h.
std::size_t Ufe::TrieNode< T >::size |
Definition at line 127 of file trie.imp.h.
std::size_t Ufe::TrieNode< T >::treeSize |
Definition at line 133 of file trie.imp.h.
|
private |
|
private |
|
private |
|
private |
|
private |