//-----------------------------------------------------------------------------
// own graph display function (no need to traverse the whole tree for the map
// so this should replace dotneato_write_one( G );
void MapCodegenState::display( graph_t *pGraph ) {
box tmpbox;
point tmppnt;
begin_graph(pGraph, tmpbox , tmppnt );
for (Agnode_t *node = agfstnode(pGraph); node!=NULL; node = agnxtnode(pGraph,node)) {
begin_node( node );
}
end_graph();
}
void
_parser::clear(void)
{
LOCK_OBJECT(std::recursive_mutex, _parser_lock);
std::vector<node> begin_stmt, end_stmt;
node begin_node(lexer::get_begin_token_id()),
end_node(lexer::get_end_token_id());
lexer::reset();
begin_stmt.push_back(begin_node);
end_stmt.push_back(end_node);
_position = 0;
_statement.clear();
_statement.push_back(begin_stmt);
_statement.push_back(end_stmt);
}
node_type* begin_node() const { begin_node(synchronized_t()); }
const_iterator_t begin(const Synchronized& sync) const { return const_iterator_t(begin_node(sync)); }
