/** @file printtree.cpp
*
* print in tree- (indented-) form, so developers can have a look at the
- * underlying structure.
- *
+ * underlying structure. */
+
+/*
* GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
#include <iostream>
#include <math.h>
-#include "ginac.h"
+#include "basic.h"
+#include "ex.h"
+#include "add.h"
+#include "constant.h"
+#include "expairseq.h"
+#include "indexed.h"
+#include "inifcns.h"
+#include "mul.h"
+#include "ncmul.h"
+#include "numeric.h"
+#include "power.h"
+#include "relational.h"
+#include "series.h"
+#include "symbol.h"
+#include "debugmsg.h"
+
+namespace GiNaC {
void ex::printtree(ostream & os, unsigned indent) const
{
debugmsg("ex printtree",LOGLEVEL_PRINT);
- ASSERT(bp!=0);
+ GINAC_ASSERT(bp!=0);
// os << "refcount=" << bp->refcount << " ";
bp->printtree(os,indent);
}
void ex::dbgprinttree(void) const
{
debugmsg("ex dbgprinttree",LOGLEVEL_PRINT);
- ASSERT(bp!=0);
+ GINAC_ASSERT(bp!=0);
bp->dbgprinttree();
}
#endif // def EXPAIRSEQ_USE_HASHTAB
}
+} // namespace GiNaC