1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
/************************************************************************
************************************************************************
FAUST compiler
Copyright (C) 2003-2018 GRAME, Centre National de Creation Musicale
---------------------------------------------------------------------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
************************************************************************
************************************************************************/
#ifndef __ATERM__
#define __ATERM__
#include <stdio.h>
#include <list>
#include <map>
#include "exception.hh"
#include "garbageable.hh"
#include "mterm.hh"
#include "normalize.hh"
#include "signals.hh"
#include "sigorderrules.hh"
#include "sigprint.hh"
#include "simplify.hh"
#include "tlib.hh"
/**
* Implements a additive term, a set of mterms added together
* m1 + m2 + m3 + ...
*/
class aterm : public virtual Garbageable {
std::map<Tree, mterm> fSig2MTerms; ///< mapping between signatures and corresponding mterms
public:
aterm(); ///< create an empty aterm (equivalent to 0)
aterm(Tree t); ///< create a aterm from an additive exp
// aterm (const aterm& a); ///< create a copy of an aterm
const aterm& operator+=(Tree t); ///< add in place an additive expression tree
const aterm& operator-=(Tree t); ///< add in place an additive expression tree
const aterm& operator+=(const mterm& m); ///< add in place an mterm
const aterm& operator-=(const mterm& m); ///< add in place an mterm
Tree normalizedTree() const; ///< return the corresponding normalized expression tree
std::ostream& print(std::ostream& dst) const; ///< print a aterm m1 + m2 + m3 +...
mterm greatestDivisor() const; ///< return the greatest divisor of any two mterms
aterm factorize(const mterm& d); ///< reorganize the aterm by factorizing d
};
inline std::ostream& operator<<(std::ostream& s, const aterm& a)
{
return a.print(s);
}
Tree simplifyingAdd(Tree t1, Tree t2);
#endif
|
