/** @file basic.h
*
- * Interface to GiNaC's ABC.
- *
- * GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
+ * Interface to GiNaC's ABC. */
+
+/*
+ * GiNaC Copyright (C) 1999-2000 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
#include <typeinfo>
#include <vector>
+// CINT needs <algorithm> to work properly with <vector>
+#include <algorithm>
+
#include <ginac/flags.h>
#include <ginac/tinfos.h>
-#include <ginac/debugmsg.h>
+#include <ginac/assertion.h>
+#include <ginac/registrar.h>
+
+#ifndef NO_GINAC_NAMESPACE
+namespace GiNaC {
+#endif // ndef NO_GINAC_NAMESPACE
class basic;
class ex;
class symbol;
class lst;
class numeric;
+class archive_node;
-typedef vector<ex> exvector;
+//typedef vector<ex> exvector;
+typedef vector<ex,malloc_alloc> exvector; // CINT does not like vector<...,default_alloc>
#define INLINE_BASIC_CONSTRUCTORS
* It is responsible for the reference counting. */
class basic
{
+ GINAC_DECLARE_REGISTERED_CLASS(basic, void)
+
friend class ex;
// member functions
#ifdef INLINE_BASIC_CONSTRUCTORS
: tinfo_key(TINFO_basic), flags(0), refcount(0)
{
- debugmsg("basic default constructor",LOGLEVEL_CONSTRUCT);
- // nothing to do
}
#else
;
virtual ~basic()
#ifdef INLINE_BASIC_CONSTRUCTORS
{
- debugmsg("basic destructor",LOGLEVEL_DESTRUCT);
destroy(0);
- ASSERT((!(flags & status_flags::dynallocated))||(refcount==0));
+ GINAC_ASSERT((!(flags & status_flags::dynallocated))||(refcount==0));
}
#else
;
basic(basic const & other)
#ifdef INLINE_BASIC_CONSTRUCTORS
{
- debugmsg("basic copy constructor",LOGLEVEL_CONSTRUCT);
copy(other);
}
#else
#ifdef INLINE_BASIC_CONSTRUCTORS
: tinfo_key(ti), flags(0), refcount(0)
{
- debugmsg("basic constructor with tinfo_key",LOGLEVEL_CONSTRUCT);
- // nothing to do
}
#else
;
// new virtual functions which can be overridden by derived classes
public: // only const functions please (may break reference counting)
virtual basic * duplicate() const;
+ virtual void print(ostream & os,unsigned upper_precedence=0) const;
virtual void printraw(ostream & os) const;
virtual void printtree(ostream & os, unsigned indent) const;
- virtual void print(ostream & os,unsigned upper_precedence=0) const;
virtual void printcsrc(ostream & os, unsigned type, unsigned upper_precedence=0) const;
virtual void dbgprint(void) const;
virtual void dbgprinttree(void) const;
virtual bool info(unsigned inf) const;
- virtual int nops() const;
+ virtual unsigned nops() const;
virtual ex op(int const i) const;
virtual ex & let_op(int const i);
virtual ex operator[](ex const & index) const;
virtual ex subs(lst const & ls, lst const & lr) const;
virtual ex normal(lst &sym_lst, lst &repl_lst, int level=0) const;
virtual numeric integer_content(void) const;
- virtual ex smod(numeric const &xi) const;
+ virtual ex smod(const numeric &xi) const;
virtual numeric max_coefficient(void) const;
virtual exvector get_indices(void) const;
virtual ex simplify_ncmul(exvector const & v) const;
// convenience macros
+#ifndef NO_GINAC_NAMESPACE
+
#define is_of_type(OBJ,TYPE) \
- (dynamic_cast<TYPE *>(const_cast<basic *>(&OBJ))!=0)
+ (dynamic_cast<TYPE *>(const_cast<GiNaC::basic *>(&OBJ))!=0)
#define is_exactly_of_type(OBJ,TYPE) \
- ((OBJ).tinfo()==TINFO_##TYPE)
+ ((OBJ).tinfo()==GiNaC::TINFO_##TYPE)
#define is_ex_of_type(OBJ,TYPE) \
- (dynamic_cast<TYPE *>(const_cast<basic *>((OBJ).bp))!=0)
+ (dynamic_cast<TYPE *>(const_cast<GiNaC::basic *>((OBJ).bp))!=0)
#define is_ex_exactly_of_type(OBJ,TYPE) \
- ((*(OBJ).bp).tinfo()==TINFO_##TYPE)
+ ((*(OBJ).bp).tinfo()==GiNaC::TINFO_##TYPE)
-#define are_ex_trivially_equal(EX1,EX2) \
- ((EX1).bp==(EX2).bp)
+#else // ndef NO_GINAC_NAMESPACE
-// global functions
+#define is_of_type(OBJ,TYPE) \
+ (dynamic_cast<TYPE *>(const_cast<basic *>(&OBJ))!=0)
-inline unsigned rotate_left_31(unsigned n)
-{
- // clear highest bit and shift 1 bit to the left
- n=(n & 0x7FFFFFFFU) << 1;
+#define is_exactly_of_type(OBJ,TYPE) \
+ ((OBJ).tinfo()==TINFO_##TYPE)
- // overflow? clear highest bit and set lowest bit
- if (n & 0x80000000U) {
- n=(n & 0x7FFFFFFFU) | 0x00000001U;
- }
+#define is_ex_of_type(OBJ,TYPE) \
+ (dynamic_cast<TYPE *>(const_cast<basic *>((OBJ).bp))!=0)
- ASSERT(n<0x80000000U);
+#define is_ex_exactly_of_type(OBJ,TYPE) \
+ ((*(OBJ).bp).tinfo()==TINFO_##TYPE)
- return n;
-}
+#endif // ndef NO_GINAC_NAMESPACE
-inline unsigned golden_ratio_hash(unsigned n)
-{
-#if 0
- // This requires ´long long´ (or an equivalent 64 bit type)---which is,
- // unfortunately, not ANSI-compliant:
- unsigned long long l = n * 0x4f1bbcddLL;
- return (l & 0x7fffffffU) ^ (l >> 32);
-#else
- // This requires ´long double´ to have a mantissa of at least 64 bit---
- // which is not guaranteed by any standard:
- const static long double golden_ratio=.618033988749894848204586834370;
- long double m=golden_ratio*n;
- return unsigned((m-int(m))*0x80000000);
-#endif
-}
+#ifndef NO_GINAC_NAMESPACE
+} // namespace GiNaC
+#endif // ndef NO_GINAC_NAMESPACE
#endif // ndef __GINAC_BASIC_H__