node_names
if (node_names(&names) != 0)
static int node_names(char **namesp);
auto iter = node_names.find(name);
if (iter == node_names.end())
node_names.insert(std::make_pair(name, n));
node_names.erase(iter);
node_names.clear();
target = node_names[target_name];
node_ptr nx = node_names[v.string_data];
nx = node_names[s.first];
return node_names[v.string_data];
auto existing = node_names.find(name);
if (existing == node_names.end())
existing = node_names.find(name);
if (existing == node_names.end())
auto node = node_names[ref];
std::unordered_map<std::string, node_ptr> node_names;