New directory tree, with preprocessor/ inside interpretor/.

[Faustine.git] / interpretor / faust-0.9.47mr3 / compiler / signals / binop.hh

diff --git a/interpretor/faust-0.9.47mr3/compiler/signals/binop.hh b/interpretor/faust-0.9.47mr3/compiler/signals/binop.hh
deleted file mode 100644 (file)
index 54349aa..0000000
--- a/interpretor/faust-0.9.47mr3/compiler/signals/binop.hh
+++ /dev/null
@@ -1,62 +0,0 @@
-/************************************************************************
- ************************************************************************
-    FAUST compiler
-       Copyright (C) 2003-2004 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 _BINOP_
-#define _BINOP_
-
-#include "node.hh"
-
-typedef const Node     (*comp) (const Node& a, const Node& b);
-typedef bool           (*pred) (const Node& a);
-
-struct BinOp 
-{
-       const char*     fName;
-    const char*        fNameVec;
-       const char*     fNameScal;
-       comp            fCompute;
-       pred            fLeftNeutral;
-       pred            fRightNeutral;
-       int                     fPriority;
-       //
-       BinOp (const char* name, const char* namevec, const char* namescal, comp f, pred ln, pred rn, int priority) 
-                       : fName(name), fNameVec(namevec), fNameScal(namescal), fCompute(f), fLeftNeutral(ln), fRightNeutral(rn), fPriority(priority) {  }
-       //
-       Node compute(const Node& a, const Node& b) { return fCompute(a,b);      }
-       //
-       bool isRightNeutral(const Node& a)      { return fRightNeutral(a);      }
-       bool isLeftNeutral(const Node& a)       { return fLeftNeutral(a);       }
-};
-
-extern BinOp* gBinOpTable[];
-extern BinOp* gBinOpLateqTable[];
-
-
-enum {
-       kAdd, kSub, kMul, kDiv, kRem,
-       kLsh, kRsh,
-       kGT, kLT, kGE, kLE, kEQ, kNE,
-       kAND, kOR, kXOR
-};
-
-#endif