Macaulay2 Engine
Loading...
Searching...
No Matches

◆ do_tree()

template<typename Key>
void F4MonomialLookupTableT< Key >::do_tree ( mi_node * p,
int depth,
int indent,
int disp ) const
private

Definition at line 414 of file f4-monlookup.cpp.

418{
419 if (depth > ndepth) ndepth = depth;
420 do_node(p, indent, disp);
421 mi_node *q = p->right;
422 while (q != p)
423 {
424 do_node(q, indent, disp);
425 if (q->tag != mi_node::leaf)
426 do_tree(q->down(), depth + 1, indent + 2, disp);
427 q = q->right;
428 }
429}
void do_node(mi_node *p, int indent, int disp) const
void do_tree(mi_node *p, int depth, int indent, int disp) const

References do_node(), do_tree(), F4MonomialLookupTableT< Key >::mi_node::down, F4MonomialLookupTableT< Key >::mi_node::leaf, ndepth, p, F4MonomialLookupTableT< Key >::mi_node::right, and F4MonomialLookupTableT< Key >::mi_node::tag.

Referenced by debug_out(), and do_tree().