64 using ISLANDS = std::map<RECORD_KEY, ISLAND_ENTRY, KEY_LESS>;
65 using AREAS = std::map<ITEM_KEY, AREA_ENTRY, KEY_LESS>;
NEIGHBOR_INDEX m_neighborsOf
std::map< ITEM_KEY, RECORD_KEY, KEY_LESS > ISLAND_INDEX
std::map< ITEM_KEY, std::vector< KIID >, KEY_LESS > AREA_INDEX
std::map< ITEM_KEY, AREA_ENTRY, KEY_LESS > AREAS
const ISLAND_INDEX & IslandOf() const
const std::map< SCREEN_ID, uint64_t > & ScreenRevisions() const
const AREA_INDEX & RuleAreasOf() const
const ISLANDS & Islands() const
std::set< INST_ID > m_instances
std::map< RECORD_KEY, ISLAND_ENTRY, KEY_LESS > ISLANDS
const AREAS & RuleAreas() const
AUXILIARY(SESSION_KEYS &aKeys)
std::map< ITEM_KEY, std::vector< KIID >, KEY_LESS > NEIGHBOR_INDEX
std::map< SCREEN_ID, uint64_t > m_screenRevisions
void Update(std::span< const FRAME_INSTANCE > aFrame, const INPUT_STORE &aInputs, const RECORD_STORE::RECORD_CACHE &aRecords, CHANGE_SET &aChanges)
Publish the changed islands and rule areas.
const NEIGHBOR_INDEX & NeighborsOf() const
CACHE_TABLE< RECORD_KEY, ISLAND_RECORD, KEY_LESS > RECORD_CACHE
Session IDs are dense handles, never a canonical ordering.
Value keys and the key session of the schematic connectivity engine.
uint64_t recordVersion
Version of the electrical record of the island.
uint64_t islandVersion
Geometry version of the screen islands.
Difference between two publications.
std::vector< std::pair< KIID, KIID > > ncContacts
std::vector< std::pair< KIID, KIID > > adjacency
std::vector< std::pair< KIID, KIID > > busEntryLinks
std::vector< KIID > items
std::map< KIID, uint8_t > dangling
Orders keys by value through SESSION_KEYS::Less().
std::vector< NAME_ID > netclasses
std::vector< KIID > containedItems
bool operator==(const RULE_AREA_RESULT &) const =default
std::vector< KIID > attachedDirectives