Query-time snapshot; reacquire after Update. More...

#include <conn_facade.h>

Public Attributes
std::shared_ptr< const BUS_SCHEMA::NODE >	tree

std::shared_ptr< const BUS_SCHEMA >	schema

std::vector< NET_VIEW >	leaves

Detailed Description

Query-time snapshot; reacquire after Update.

An absent tree means empty leaves. Tree and schema leaf ordinals index signal views; schema retains declaration-local names. Item views preserve same-kind local declarations; mixed kinds and net views use the canonical declaration. Nested buses exist only in tree, not in leaves. Walk tree for recursive presentation. Leaves prefer the querying instance when present, otherwise the canonical bus driver's instance, including itemless members.

Definition at line 104 of file conn_facade.h.

Member Data Documentation

◆ leaves

std::vector<NET_VIEW> SCH_CONNECTIVITY::BUS_MEMBERS::leaves

Definition at line 108 of file conn_facade.h.

◆ schema

std::shared_ptr<const BUS_SCHEMA> SCH_CONNECTIVITY::BUS_MEMBERS::schema

Definition at line 107 of file conn_facade.h.

Referenced by BUS_UNFOLD_MENU::memberEntries().

◆ tree

std::shared_ptr<const BUS_SCHEMA::NODE> SCH_CONNECTIVITY::BUS_MEMBERS::tree

Definition at line 106 of file conn_facade.h.