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 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
|
/************************************************************************
************************************************************************
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 General Public License as published by
the Free Software Foundation; either version 2 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, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
************************************************************************
************************************************************************/
#ifndef _PPBOX_H
#define _PPBOX_H
/**********************************************************************
- ppbox.h : pretty print box expressions (projet FAUST) -
Historique :
-----------
12-07-2002 first implementation (yo)
***********************************************************************/
#include <iostream>
#include <sstream>
#include "boxes.hh"
#include "garbageable.hh"
using namespace std;
// void fppbox (FILE* fout, Tree box, int priority=0);
// inline void ppbox (Tree box, int priority=0) { fppbox(stdout, box, priority); }
const char *prim0name(CTree *(*ptr)());
const char *prim1name(CTree *(*ptr)(CTree *));
const char *prim2name(CTree *(*ptr)(CTree *, CTree *));
const char *prim3name(CTree *(*ptr)(CTree *, CTree *, CTree *));
const char *prim4name(CTree *(*ptr)(CTree *, CTree *, CTree *, CTree *));
const char *prim5name(CTree *(*ptr)(CTree *, CTree *, CTree *, CTree *, CTree *));
// box pretty printer.
// usage : out << boxpp(aBoxExp);
class boxpp : public virtual Garbageable {
protected:
Tree box;
int priority;
public:
boxpp(Tree b, int p = 0) : box(b), priority(p) {}
virtual ~boxpp() {}
virtual ostream &print(ostream &fout) const;
};
inline ostream &operator<<(ostream &file, const boxpp &bpp)
{
return bpp.print(file);
}
// box pretty printer.
// usage : out << boxpp(aBoxExp);
// Used on the stack so not Garbageable
class envpp : public virtual Garbageable {
Tree fEnv;
public:
envpp(Tree e) : fEnv(e) {}
ostream &print(ostream &fout) const;
};
inline ostream &operator<<(ostream &file, const envpp &epp)
{
return epp.print(file);
}
#endif
|