libalgebra-demo/libalgebra/poly_lie.h

/* *************************************************************

Copyright 2010 Terry Lyons, Stephen Buckley, Djalil Chafai, 
Greg Gyurkó and Arend Janssen. 

Distributed under the terms of the GNU General Public License, 
Version 3. (See accompanying file License.txt)

************************************************************* */




#ifndef DJC_COROPA_LIBALGEBRA_POLYLIEH_SEEN
#define DJC_COROPA_LIBALGEBRA_POLYLIEH_SEEN





template<typename SCA, typename RAT, DEG n_letters, DEG max_degree>
class poly_lie : public algebra<poly_lie_basis<SCA, RAT, n_letters, max_degree> >
{
public:
        typedef typename poly_basis<SCA, RAT>::KEY POLYBASISKEY;
        typedef poly_lie_basis<SCA, RAT, n_letters, max_degree> BASIS;
        typedef typename BASIS::KEY KEY;
        typedef sparse_vector<BASIS> VECT;
        typedef algebra<BASIS> ALG;
        typedef typename ALG::iterator iterator;
        typedef typename ALG::const_iterator const_iterator;
public:
        poly_lie(void) {}
        poly_lie(const poly_lie& l)
                : ALG(l) {}
        poly_lie(const ALG& a)
                : ALG(a) {}
        poly_lie(const VECT& v)
                : ALG(v) {}
        explicit poly_lie(LET x, LET y, DEG z)
                : ALG ()
        {
                POLYBASISKEY tempkey;
                tempkey[ y ] = z;
                ALG tempalg(KEY (x, tempkey));
                ALG:: swap(tempalg);
        }
        explicit poly_lie(const KEY& k)
                : ALG(k) {}
        explicit poly_lie(LET letter, const SCA& s)
                : ALG(VECT::basis.keyofletter(letter), s) {}
public:
        inline friend poly_lie replace(const poly_lie& src, const std::vector<LET>& s, const std::vector<poly_lie*>& v) 
        {
                poly_lie result;
                std::map<KEY, poly_lie> table;
                const_iterator i;
                for (i = src.begin(); i != src.end(); ++i)
                        result.add_scal_prod(VECT::basis.replace(i->first, s, v, table), i->second);
                return result;
        }
};
#endif