* Interface to GiNaC's symmetry definitions. */
/*
- * GiNaC Copyright (C) 1999-2009 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2017 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
/** Create node with two children. */
symmetry(symmetry_type t, const symmetry &c1, const symmetry &c2);
+ // functions overriding virtual functions from base classes
+public:
+ /** Save (a.k.a. serialize) object into archive. */
+ void archive(archive_node& n) const override;
+ /** Read (a.k.a. deserialize) object from archive. */
+ void read_archive(const archive_node& n, lst& syms) override;
+protected:
+ unsigned calchash() const override;
+
// non-virtual functions in this class
public:
/** Get symmetry type. */
/** Check whether this node actually represents any kind of symmetry. */
bool has_symmetry() const {return type != none || !children.empty(); }
+ /** Check whether this node involves anything non symmetric. */
+ bool has_nonsymmetric() const;
/** 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:
return antisymmetrize(e, v.begin(), v.end());
}
-/** Symmetrize expression by cyclic permuation over a set of objects
+/** Symmetrize expression by cyclic permutation over a set of objects
* (symbols, indices). */
ex symmetrize_cyclic(const ex & e, exvector::const_iterator first, exvector::const_iterator last);