![]() |
XII Release 0.1.0
|
Copyright (c) Theophilus Eriata. All Rights Reserved. More...
#include <GraphData.h>
Public Member Functions | |
| xiiGraphData (const xiiGraph &graph, xiiAllocator *pAllocator=xiiDefaultAllocatorWrapper::GetAllocator()) | |
| xiiGraphData (const xiiGraphData &)=delete | |
| void | operator= (const xiiGraphData &)=delete |
| template<typename T> | |
| xiiResult | SetVertexData (xiiGraphVertexHandle vertex, T &&data) |
| template<typename T> | |
| xiiResult | SetEdgeData (xiiGraphEdgeHandle edge, T &&data) |
| VertexData * | GetVertexData (xiiGraphVertexHandle vertex) |
| const VertexData * | GetVertexData (xiiGraphVertexHandle vertex) const |
| EdgeData * | GetEdgeData (xiiGraphEdgeHandle edge) |
| const EdgeData * | GetEdgeData (xiiGraphEdgeHandle edge) const |
| void | Compact () |
Copyright (c) Theophilus Eriata. All Rights Reserved.
Typed, owning property maps attached to an existing graph. Payloads may be values, pointers or engine smart pointers. Missing properties are allowed. Removed elements and topology replacement automatically destroy their properties. The graph must outlive this object. Property pointers are transient across changes to their property map. No virtual node base, void pointers, reflection requirements or per-element allocations are imposed.