* Interface to GiNaC's indexed expressions. */
/*
- * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2015 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
*
* 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_INDEXED_H__
-#define __GINAC_INDEXED_H__
-
-#include <map>
+#ifndef GINAC_INDEXED_H
+#define GINAC_INDEXED_H
#include "exprseq.h"
+#include "wildcard.h"
-namespace GiNaC {
+#include <map>
+namespace GiNaC {
class scalar_products;
class symmetry;
friend ex simplify_indexed(const ex & e, exvector & free_indices, exvector & dummy_indices, const scalar_products & sp);
friend ex simplify_indexed_product(const ex & e, exvector & free_indices, exvector & dummy_indices, const scalar_products & sp);
+ friend bool reposition_dummy_indices(ex & e, exvector & variant_dummy_indices, exvector & moved_indices);
// other constructors
public:
// internal constructors
indexed(const symmetry & symm, const exprseq & es);
indexed(const symmetry & symm, const exvector & v, bool discardable = false);
- indexed(const symmetry & symm, exvector * vp); // vp will be deleted
+ indexed(const symmetry & symm, std::auto_ptr<exvector> vp);
// functions overriding virtual functions from base classes
public:
- void print(const print_context & c, unsigned level = 0) const;
+ unsigned precedence() const {return 55;}
bool info(unsigned inf) const;
ex eval(int level = 0) const;
- int degree(const ex & s) const;
- int ldegree(const ex & s) const;
- ex coeff(const ex & s, int n = 1) const;
- exvector get_free_indices(void) const;
-
+ ex real_part() const;
+ ex imag_part() const;
+ exvector get_free_indices() const;
+
+ /** Save (a.k.a. serialize) indexed object into archive. */
+ void archive(archive_node& n) const;
+ /** Read (a.k.a. deserialize) indexed object from archive. */
+ void read_archive(const archive_node& n, lst& syms);
protected:
- ex thisexprseq(const exvector & v) const;
- ex thisexprseq(exvector * vp) const;
- unsigned return_type(void) const { return return_types::commutative; }
+ ex derivative(const symbol & s) const;
+ ex thiscontainer(const exvector & v) const;
+ ex thiscontainer(std::auto_ptr<exvector> vp) const;
+ unsigned return_type() const;
+ return_type_t return_type_tinfo() const { return op(0).return_type_tinfo(); }
ex expand(unsigned options = 0) const;
// new virtual functions which can be overridden by derived classes
bool all_index_values_are(unsigned inf) const;
/** Return a vector containing the object's indices. */
- exvector get_indices(void) const;
+ exvector get_indices() const;
/** Return a vector containing the dummy indices of the object, if any. */
- exvector get_dummy_indices(void) const;
+ exvector get_dummy_indices() const;
/** Return a vector containing the dummy indices in the contraction with
- * another indexed object. */
+ * another indexed object. This is symmetric: a.get_dummy_indices(b)
+ * == b.get_dummy_indices(a) */
exvector get_dummy_indices(const indexed & other) const;
/** Check whether the object has an index that forms a dummy index pair
bool has_dummy_index_for(const ex & i) const;
/** Return symmetry properties. */
- ex get_symmetry(void) const {return symtree;}
+ ex get_symmetry() const {return symtree;}
protected:
void printindices(const print_context & c, unsigned level) const;
- void validate(void) const;
+ void print_indexed(const print_context & c, const char *openbrace, const char *closebrace, unsigned level) const;
+ void do_print(const print_context & c, unsigned level) const;
+ void do_print_latex(const print_latex & c, unsigned level) const;
+ void do_print_tree(const print_tree & c, unsigned level) const;
+ void validate() const;
// member variables
protected:
ex symtree; /**< Index symmetry (tree of symmetry objects) */
};
+GINAC_DECLARE_UNARCHIVER(indexed);
-typedef std::pair<ex, ex> spmapkey;
+class spmapkey {
+public:
+ spmapkey() : dim(wild()) {}
+ spmapkey(const ex & v1, const ex & v2, const ex & dim = wild());
+
+ bool operator==(const spmapkey &other) const;
+ bool operator<(const spmapkey &other) const;
+
+ void debugprint() const;
-struct spmapkey_is_less {
- bool operator() (const spmapkey &p, const spmapkey &q) const
- {
- int cmp = p.first.compare(q.first);
- return ((cmp<0) || (!(cmp>0) && p.second.compare(q.second)<0));
- }
+protected:
+ ex v1, v2, dim;
};
-typedef std::map<spmapkey, ex, spmapkey_is_less> spmap;
+typedef std::map<spmapkey, ex> spmap;
/** Helper class for storing information about known scalar products which
* are to be automatically replaced by simplify_indexed().
/** Register scalar product pair and its value. */
void add(const ex & v1, const ex & v2, const ex & sp);
+ /** Register scalar product pair and its value for a specific space dimension. */
+ void add(const ex & v1, const ex & v2, const ex & dim, const ex & sp);
+
/** Register list of vectors. This adds all possible pairs of products
* a.i * b.i with the value a*b (note that this is not a scalar vector
* product but an ordinary product of scalars). */
- void add_vectors(const lst & l);
+ void add_vectors(const lst & l, const ex & dim = wild());
/** Clear all registered scalar products. */
- void clear(void);
+ void clear();
- bool is_defined(const ex & v1, const ex & v2) const;
- ex evaluate(const ex & v1, const ex & v2) const;
- void debugprint(void) const;
-
-private:
- static spmapkey make_key(const ex & v1, const ex & v2);
+ bool is_defined(const ex & v1, const ex & v2, const ex & dim) const;
+ ex evaluate(const ex & v1, const ex & v2, const ex & dim) const;
+ void debugprint() const;
+protected:
spmap spm; /*< Map from defined scalar product pairs to their values */
};
// utility functions
-/** Return the indexed object handled by an ex. Deprecated: use ex_to<indexed>().
- * This is unsafe: you need to check the type first. */
-inline const indexed &ex_to_indexed(const ex &e)
-{
- return static_cast<const indexed &>(*e.bp);
-}
+/** Returns all dummy indices from the expression */
+exvector get_all_dummy_indices(const ex & e);
-/** Specialization of is_exactly_a<indexed>(obj) for indexed objects. */
-template<> inline bool is_exactly_a<indexed>(const basic & obj)
-{
- return obj.tinfo()==TINFO_indexed;
-}
+/** More reliable version of the form. The former assumes that e is an
+ * expanded expression. */
+exvector get_all_dummy_indices_safely(const ex & e);
+
+/** Returns b with all dummy indices, which are listed in va, renamed
+ * if modify_va is set to TRUE all dummy indices of b will be appended to va */
+ex rename_dummy_indices_uniquely(exvector & va, const ex & b, bool modify_va = false);
+
+/** Returns b with all dummy indices, which are common with a, renamed */
+ex rename_dummy_indices_uniquely(const ex & a, const ex & b);
+
+/** Same as above, where va and vb contain the indices of a and b and are sorted */
+ex rename_dummy_indices_uniquely(const exvector & va, const exvector & vb, const ex & b);
+
+/** Similar to above, where va and vb are the same and the return value is a list of two lists
+ * for substitution in b */
+lst rename_dummy_indices_uniquely(const exvector & va, const exvector & vb);
+
+/** This function returns the given expression with expanded sums
+ * for all dummy index summations, where the dimensionality of
+ * the dummy index is a nonnegative integer.
+ * Optionally all indices with a variance will be substituted by
+ * indices with the corresponding numeric values without variance.
+ *
+ * @param e the given expression
+ * @param subs_idx indicates if variance of dummy indices should be neglected
+ */
+ex expand_dummy_sum(const ex & e, bool subs_idx = false);
} // namespace GiNaC
-#endif // ndef __GINAC_INDEXED_H__
+#endif // ndef GINAC_INDEXED_H