Cleanup.hh

Go to the documentation of this file.

/*
 
    Cadabra: a field-theory motivated computer algebra system.
    Copyright (C) 2001-2014  Kasper Peeters <kasper.peeters@phi-sci.com>
 
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 the Free Software Foundation, either version 3 of the
License, or (at your option) any later version.
 
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
General Public License for more details.
 
You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
 
*/
 
 
#pragma once
 
#include "Storage.hh"
#include "Kernel.hh"
 
namespace cadabra {
 
    typedef void (*dispatcher_t)(const Kernel& k, Ex&, Ex::iterator& it);
 
 
    void cleanup_dispatch(const Kernel& k, Ex&, Ex::iterator& it);
 
 
    void cleanup_dispatch_deep(const Kernel& k, Ex&, dispatcher_t disp=&cleanup_dispatch);
    void cleanup_dispatch_deep(const Kernel& k, Ex&, Ex::iterator& it, dispatcher_t disp=&cleanup_dispatch);
 
 
    bool cleanup_fraclike(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_powlike(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_productlike(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_sumlike(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_derivative(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_partialderivative(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_components(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_numericalflat(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_diagonal(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_kronecker(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_exterior_derivative(const Kernel& k, Ex&, Ex::iterator& it);
    bool cleanup_comma(const Kernel&k, Ex&, Ex::iterator& it);
    bool cleanup_tie(const Kernel&k, Ex&, Ex::iterator& it);    
 
 
    bool push_down_multiplier(const Kernel& k, Ex& tr, Ex::iterator it);
 
 
    void check_index_consistency(const Kernel& k, Ex& tr, Ex::iterator it);
 
    }