* Interface to GiNaC's symmetry definitions. */
/*
- * GiNaC Copyright (C) 1999-2005 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
#include <set>
#include "ex.h"
+#include "archive.h"
namespace GiNaC {
/** Check whether this node actually represents any kind of symmetry. */
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:
/** Vector of child nodes. */
exvector children;
};
+GINAC_DECLARE_UNARCHIVER(symmetry);
// global functions
* @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<int>::max() if nothing changed */
extern int canonicalize(exvector::iterator v, const symmetry &symm);
/** Symmetrize expression over a set of objects (symbols, indices). */
return symmetrize(e, v.begin(), v.end());
}
-// utility functions
-
-/** Specialization of is_exactly_a<symmetry>(obj) for symmetry objects. */
-template<> inline bool is_exactly_a<symmetry>(const basic & obj)
-{
- return obj.tinfo()==TINFO_symmetry;
-}
-
} // namespace GiNaC
#endif // ndef __GINAC_SYMMETRY_H__