#include <VLBackwardTraversable.h>
◆ VarTreeNode()
◆ ~VarTreeNode()
vl::VarTreeNode::~VarTreeNode |
( |
| ) |
|
|
virtual |
◆ AsList() [1/2]
◆ AsList() [2/2]
◆ AsObject() [1/2]
◆ AsObject() [2/2]
◆ ChildCount()
int vl::VarTreeNode::ChildCount |
( |
| ) |
const |
|
virtual |
◆ DataPtr()
const void * vl::VarTreeNode::DataPtr |
( |
| ) |
const |
|
inline |
◆ ForeachChildren()
bool vl::VarTreeNode::ForeachChildren |
( |
const std::function< bool(VarTreeNode &)> & |
pred | ) |
|
|
protected |
◆ GetData()
const vl::Var * vl::VarTreeNode::GetData |
( |
| ) |
const |
|
inline |
◆ GetId()
const std::string & vl::VarTreeNode::GetId |
( |
| ) |
const |
◆ GetIndex()
int vl::VarTreeNode::GetIndex |
( |
| ) |
const |
◆ GetParent()
const VarTreeNode * vl::VarTreeNode::GetParent |
( |
| ) |
const |
|
inline |
◆ GetPath()
std::string vl::VarTreeNode::GetPath |
( |
| ) |
const |
◆ GetRegistry()
◆ IsList()
bool vl::VarTreeNode::IsList |
( |
| ) |
const |
|
virtual |
◆ IsObject()
bool vl::VarTreeNode::IsObject |
( |
| ) |
const |
|
virtual |
◆ IsRoot()
bool vl::VarTreeNode::IsRoot |
( |
| ) |
const |
|
inline |
◆ SetParent()
void vl::VarTreeNode::SetParent |
( |
VarTreeNode * |
newParent | ) |
|
|
inlineprotected |
◆ SharedFromThis()
◆ Update()
void vl::VarTreeNode::Update |
( |
Observable * |
sender, |
|
|
vl::VarPtr |
info |
|
) |
| |
|
override |
◆ ListTreeNode
◆ ObjectTreeNode
◆ VarNodeRegistry
◆ mData
vl::AbstractVar* vl::VarTreeNode::mData = nullptr |
|
protected |
◆ mDataPtr
const void* vl::VarTreeNode::mDataPtr = nullptr |
|
protected |
◆ mParent
◆ mRegistry
◆ mToBeReplaced
bool vl::VarTreeNode::mToBeReplaced = false |
|
protected |
The documentation for this class was generated from the following files: