X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fsymmetry.h;h=4b4fea5c8d731c7aafaa8b86388bfc268044229f;hp=9cf9aa6c4695918a72c7b8d501f2ac4bbda14ce6;hb=a12c1d88131c5a301d35767f0c4c947064703418;hpb=e7cc6a764ff67b5885d6633385fac23ccc1dc9a7 diff --git a/ginac/symmetry.h b/ginac/symmetry.h index 9cf9aa6c..4b4fea5c 100644 --- a/ginac/symmetry.h +++ b/ginac/symmetry.h @@ -3,7 +3,7 @@ * Interface to GiNaC's symmetry definitions. */ /* - * GiNaC Copyright (C) 1999-2002 Johannes Gutenberg University Mainz, Germany + * GiNaC Copyright (C) 1999-2008 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 @@ -17,7 +17,7 @@ * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software - * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */ #ifndef __GINAC_SYMMETRY_H__ @@ -26,6 +26,7 @@ #include #include "ex.h" +#include "archive.h" namespace GiNaC { @@ -61,10 +62,6 @@ public: /** Create node with two children. */ symmetry(symmetry_type t, const symmetry &c1, const symmetry &c2); - // functions overriding virtual functions from base classes -public: - void print(const print_context & c, unsigned level = 0) const; - // non-virtual functions in this class public: /** Get symmetry type. */ @@ -83,7 +80,18 @@ public: void validate(unsigned n); /** Check whether this node actually represents any kind of symmetry. */ - bool has_symmetry(void) const {return type != none || !children.empty(); } + bool has_symmetry() const {return type != none || !children.empty(); } + /** Check whether this node involves a cyclic symmetry. */ + bool has_cyclic() const; + + /** Save (a.k.a. serialize) object into archive. */ + void archive(archive_node& n) const; + /** Read (a.k.a. deserialize) object from archive. */ + void read_archive(const archive_node& n, lst& syms); +protected: + void do_print(const print_context & c, unsigned level) const; + void do_print_tree(const print_tree & c, unsigned level) const; + unsigned calchash() const; // member variables private: @@ -96,37 +104,48 @@ private: /** Vector of child nodes. */ exvector children; }; +GINAC_DECLARE_UNARCHIVER(symmetry); // global functions -inline symmetry sy_none(void) { return symmetry(); } +inline symmetry sy_none() { return symmetry(); } inline symmetry sy_none(const symmetry &c1, const symmetry &c2) { return symmetry(symmetry::none, c1, c2); } inline symmetry sy_none(const symmetry &c1, const symmetry &c2, const symmetry &c3) { return symmetry(symmetry::none, c1, c2).add(c3); } inline symmetry sy_none(const symmetry &c1, const symmetry &c2, const symmetry &c3, const symmetry &c4) { return symmetry(symmetry::none, c1, c2).add(c3).add(c4); } -inline symmetry sy_symm(void) { symmetry s; s.set_type(symmetry::symmetric); return s; } +inline symmetry sy_symm() { symmetry s; s.set_type(symmetry::symmetric); return s; } inline symmetry sy_symm(const symmetry &c1, const symmetry &c2) { return symmetry(symmetry::symmetric, c1, c2); } inline symmetry sy_symm(const symmetry &c1, const symmetry &c2, const symmetry &c3) { return symmetry(symmetry::symmetric, c1, c2).add(c3); } inline symmetry sy_symm(const symmetry &c1, const symmetry &c2, const symmetry &c3, const symmetry &c4) { return symmetry(symmetry::symmetric, c1, c2).add(c3).add(c4); } -inline symmetry sy_anti(void) { symmetry s; s.set_type(symmetry::antisymmetric); return s; } +inline symmetry sy_anti() { symmetry s; s.set_type(symmetry::antisymmetric); return s; } inline symmetry sy_anti(const symmetry &c1, const symmetry &c2) { return symmetry(symmetry::antisymmetric, c1, c2); } inline symmetry sy_anti(const symmetry &c1, const symmetry &c2, const symmetry &c3) { return symmetry(symmetry::antisymmetric, c1, c2).add(c3); } inline symmetry sy_anti(const symmetry &c1, const symmetry &c2, const symmetry &c3, const symmetry &c4) { return symmetry(symmetry::antisymmetric, c1, c2).add(c3).add(c4); } -inline symmetry sy_cycl(void) { symmetry s; s.set_type(symmetry::cyclic); return s; } +inline symmetry sy_cycl() { symmetry s; s.set_type(symmetry::cyclic); return s; } inline symmetry sy_cycl(const symmetry &c1, const symmetry &c2) { return symmetry(symmetry::cyclic, c1, c2); } inline symmetry sy_cycl(const symmetry &c1, const symmetry &c2, const symmetry &c3) { return symmetry(symmetry::cyclic, c1, c2).add(c3); } inline symmetry sy_cycl(const symmetry &c1, const symmetry &c2, const symmetry &c3, const symmetry &c4) { return symmetry(symmetry::cyclic, c1, c2).add(c3).add(c4); } +// These return references to preallocated common symmetries (similar to +// the numeric flyweights). +const symmetry & not_symmetric(); +const symmetry & symmetric2(); +const symmetry & symmetric3(); +const symmetry & symmetric4(); +const symmetry & antisymmetric2(); +const symmetry & antisymmetric3(); +const symmetry & antisymmetric4(); + /** Canonicalize the order of elements of an expression vector, according to * the symmetry properties defined in a symmetry tree. * * @param v Start of expression vector * @param symm Root node of symmetry tree * @return the overall sign introduced by the reordering (+1, -1 or 0) - * or INT_MAX if nothing changed */ + * or numeric_limits::max() if nothing changed */ extern int canonicalize(exvector::iterator v, const symmetry &symm); /** Symmetrize expression over a set of objects (symbols, indices). */ @@ -158,14 +177,6 @@ inline ex symmetrize_cyclic(const ex & e, const exvector & v) return symmetrize(e, v.begin(), v.end()); } -// utility functions - -/** Specialization of is_exactly_a(obj) for symmetry objects. */ -template<> inline bool is_exactly_a(const basic & obj) -{ - return obj.tinfo()==TINFO_symmetry; -} - } // namespace GiNaC #endif // ndef __GINAC_SYMMETRY_H__