X-Git-Url: https://scm.cri.ensmp.fr/git/Faustine.git/blobdiff_plain/1059e1cc0c2ecfa237406949aa26155b6a5b9154..66f23d4fabf89ad09adbd4dfc15ac6b5b2b7da83:/interpreter/preprocessor/faust-0.9.47mr3/compiler/draw/schema/topSchema.cpp

diff --git a/interpreter/preprocessor/faust-0.9.47mr3/compiler/draw/schema/topSchema.cpp b/interpreter/preprocessor/faust-0.9.47mr3/compiler/draw/schema/topSchema.cpp
new file mode 100644
index 0000000..054c176
--- /dev/null
+++ b/interpreter/preprocessor/faust-0.9.47mr3/compiler/draw/schema/topSchema.cpp
@@ -0,0 +1,133 @@
+/************************************************************************
+ ************************************************************************
+    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.
+ ************************************************************************
+ ************************************************************************/
+
+#include <stdlib.h>
+#include "topSchema.h"
+#include <iostream>
+#include <assert.h>
+#include <cstdlib>
+
+using namespace std;
+
+/**
+ * Creates a new top schema
+ */
+schema* makeTopSchema (schema* s, double margin, const string& text, const string& link)
+{
+	return new topSchema (makeDecorateSchema(s, margin/2, text), margin/2, "", link);
+}
+
+
+/**
+ * A topSchema is a schema surrounded by a dashed rectangle with a
+ * label on the top left. The rectangle is placed at half the margin
+ * parameter. Arrows are added to the outputs. The constructor is
+ * made private to enforce the usage of makeTopSchema.
+ */
+topSchema::topSchema( schema* s, double margin, const string& text, const string& link )
+	: 	schema(0, 0, s->width()+2*margin, s->height()+2*margin),
+	 	fSchema(s),
+	 	fMargin(margin),
+	 	fText(text),
+	 	fLink(link)
+{
+}
+
+
+/**
+ * Define the graphic position of the schema. Computes the graphic
+ * position of all the elements, in particular the inputs and outputs.
+ * This method must be called before draw(), otherwise draw is not allowed
+ */
+void topSchema::place(double ox, double oy, int orientation)
+{
+	beginPlace(ox, oy, orientation);
+
+	fSchema->place(ox+fMargin, oy+fMargin, orientation);
+	endPlace();
+}
+
+/**
+ * Top schema has no input
+ */
+point topSchema::inputPoint(unsigned int i) const
+{
+	assert (placed());
+	assert (i < inputs());
+	exit(1);
+}
+
+/**
+ * Top schema has no output
+ */
+point topSchema::outputPoint(unsigned int i) const
+{
+	assert (placed());
+	assert (i < outputs());
+	exit(1);
+}
+
+/**
+ * Draw the enlarged schema. This methos can only
+ * be called after the block have been placed
+ */
+void topSchema::draw(device& dev)
+{
+    assert(placed());
+
+    // draw a background white rectangle
+    dev.rect(x(), y(), width()-1, height()-1, "#ffffff", fLink.c_str());
+
+    // draw the label
+    dev.label(x()+fMargin, y()+fMargin/2, fText.c_str());
+
+    fSchema->draw(dev);
+
+    // draw arrows at output points of schema
+    for (unsigned int i=0; i<fSchema->outputs(); i++) {
+        point p = fSchema->outputPoint(i);
+        dev.fleche(p.x, p.y, 0, orientation());
+    }
+}
+
+/**
+ * Draw the enlarged schema. This methos can only
+ * be called after the block have been placed
+ */
+void topSchema::collectTraits(collector& c)
+{
+    assert(placed());
+    fSchema->collectTraits(c);
+
+    // draw arrows at output points of schema
+    for (unsigned int i=0; i<fSchema->inputs(); i++) {
+        point p = fSchema->inputPoint(i);
+        c.addOutput(p);;
+    }
+
+    // draw arrows at output points of schema
+    for (unsigned int i=0; i<fSchema->outputs(); i++) {
+        point p = fSchema->outputPoint(i);
+        c.addInput(p);;
+    }
+
+
+}