39     HashNodeStable NodeStable;  in inputOne()  local
40     io.mapRequired(Key.str().c_str(), NodeStable);  in inputOne()
46     V.insert({Id, NodeStable});  in inputOne()
64   for (const auto &[Id, NodeStable] : IdNodeStableMap) {  in serialize()
66     Writer.write<uint64_t>(NodeStable.Hash);  in serialize()
67     Writer.write<uint32_t>(NodeStable.Terminals);  in serialize()
68     Writer.write<uint32_t>(NodeStable.SuccessorIds.size());  in serialize()
69     for (auto SuccessorId : NodeStable.SuccessorIds)  in serialize()
81     HashNodeStable NodeStable;  in deserialize()  local
82     NodeStable.Hash =  in deserialize()
84     NodeStable.Terminals =  in deserialize()
89       NodeStable.SuccessorIds.push_back(  in deserialize()
92     IdNodeStableMap[Id] = std::move(NodeStable);  in deserialize()
131     HashNodeStable NodeStable;  in convertToStableData()  local
132     NodeStable.Hash = Node->Hash;  in convertToStableData()
133     NodeStable.Terminals = Node->Terminals ? *Node->Terminals : 0;  in convertToStableData()
135       NodeStable.SuccessorIds.push_back(NodeIdMap[P.second.get()]);  in convertToStableData()
136     IdNodeStableMap[Id] = NodeStable;  in convertToStableData()
153     const HashNodeStable &NodeStable = P.second;  in convertFromStableData()  local
156     Curr->Hash = NodeStable.Hash;  in convertFromStableData()
157     if (NodeStable.Terminals)  in convertFromStableData()
158       Curr->Terminals = NodeStable.Terminals;  in convertFromStableData()
161     for (auto SuccessorId : NodeStable.SuccessorIds) {  in convertFromStableData()