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

◆ debug_out()

template<typename Key>
void ResF4MonomialLookupTableT< Key >::debug_out ( int disp = 1) const
private

Definition at line 446 of file res-f4-monlookup.cpp.

448{
449 nlists = 0;
450 nnodes = 0;
451 nleaves = 0;
452 ndepth = 0;
453 for (typename VECTOR(mi_node *)::const_iterator i = mis.begin();
454 i != mis.end();
455 i++)
456 if (*i != NULL) do_tree(*i, 0, 0, disp);
457 buffer o;
458 o << "list nodes = " << nlists << newline;
459 o << "internal nodes = " << nnodes << newline;
460 o << "monomials = " << nleaves << newline;
461 o << "max depth = " << ndepth << newline;
462 emit(o.str());
463}
void do_tree(mi_node *p, int depth, int indent, int disp) const
#define VECTOR(T)
Definition newdelete.hpp:78
void emit(const char *s)
Definition text-io.cpp:41

References do_tree(), emit(), ndepth, newline, nleaves, nlists, nnodes, buffer::str(), and VECTOR.