/** @file basic.cpp
*
- * Implementation of GiNaC's ABC.
- *
+ * Implementation of GiNaC's ABC. */
+
+/*
* GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
#include "lst.h"
#include "ncmul.h"
#include "utils.h"
+#include "debugmsg.h"
+
+namespace GiNaC {
//////////
// default constructor, destructor, copy constructor assignment operator and helpers
{
debugmsg("basic destructor",LOGLEVEL_DESTRUCT);
destroy(0);
- ASSERT((!(flags & status_flags::dynallocated))||(refcount==0));
+ GINAC_ASSERT((!(flags & status_flags::dynallocated))||(refcount==0));
}
basic::basic(basic const & other) : flags(0), refcount(0), tinfo_key(TINFO_BASIC)
bool basic::has(ex const & other) const
{
- ASSERT(other.bp!=0);
+ GINAC_ASSERT(other.bp!=0);
if (is_equal(*other.bp)) return true;
if (nops()>0) {
for (int i=0; i<nops(); i++) {
return 1;
}
- ASSERT(typeid(*this)==typeid(other));
+ GINAC_ASSERT(typeid(*this)==typeid(other));
int cmpval=compare_same_type(other);
if ((cmpval!=0)&&(hash_this<0x80000000U)) {
if (typeid_this!=typeid_other) return false;
- ASSERT(typeid(*this)==typeid(other));
+ GINAC_ASSERT(typeid(*this)==typeid(other));
return is_equal_same_type(other);
}
//////////
int max_recursion_level=1024;
+
+} // namespace GiNaC