One sequence for all cache tables for the lifetime of an engine session.
Cache current component evaluations by exact node/version identity, within one stratum and key sessio...
CACHE_TABLE< RECORD_KEY, ISLAND_RECORD, KEY_LESS > RECORD_CACHE
Session IDs are dense handles, never a canonical ordering.
CACHE_TABLE< SLOT_KEY, SLOT_INPUT, KEY_LESS > SLOT_CACHE
std::map< NODE_ID, uint64_t > m_bundleInputs
void Update(const COMPONENT_CACHE< BUNDLE_BINDING > &aBundles)
SLOT_STORE(CACHE_VERSIONS &aVersions, SESSION_KEYS &aKeys)
const SLOT_CACHE & Slots() const
Value keys and the key session of the schematic connectivity engine.
BUNDLE_INPUT PrepareBundle(const PARTITION &aPartition, const RECORD_STORE::RECORD_CACHE &aRecords, SESSION_KEYS &aKeys)
Collect the bus claims of a bundle partition and intern their leaf names on the main thread.
uint32_t NAME_ID
Session handle of a name, ordered by UTF-8 value through NAME_LESS.
uint32_t NODE_ID
Session handle of a NODE_KEY graph node.
constexpr uint32_t INVALID_ID
Marks an unset handle.
BUNDLE_BINDING BindBundle(const BUNDLE_INPUT &aInput, const SESSION_KEYS &aKeys)
Align the prepared claims to the canonical claim and make the member slots.
std::vector< NODE_INPUT > SignalNodes(const RECORD_STORE::RECORD_CACHE &aRecords, const SLOT_STORE::SLOT_CACHE &aSlots, SESSION_KEYS &aKeys)
Main-thread interning of current signal records and slots for the signal fold.
Bound result of one bus component.
std::vector< NAME_ID > netclasses
std::vector< SLOT_KEY > members
Canonical slots in leaf order. Extra slots are not listed.
std::vector< SLOT_INPUT > slots
Canonical and extra slots, sorted by key.
std::optional< CLAIM > canonical
Strongest bus claim. It is empty for a bus without a bus claim.
std::vector< ITEM_KEY > items
NAME_ID fullName
Leaf name after the sheet path of this claim.
NAME_ID localName
Group path and leaf local name joined with dots.
NAME_ID name
Leaf name with all group prefixes.
One bus claim of a bundle partition, with its leaf names interned.
bool drivesRecord
The claim drives its own island, which lets a sheet pin name members in the parent sheet.
std::vector< LEAF_NAME > leaves
One entry for each leaf of the claim schema, in the same order.
RECORD_KEY record
Record of the island that holds the claim.
The claim of one item for the name of its island.
Exact identity of one connected component.
One island in one sheet instance.
One member position of a bus.