First cleaning step in "dsp_files" directory.
[Faustine.git] / interpretor / faust-0.9.47mr3 / compiler / draw / schema / cableSchema.cpp
1 /************************************************************************
2 ************************************************************************
3 FAUST compiler
4 Copyright (C) 2003-2004 GRAME, Centre National de Creation Musicale
5 ---------------------------------------------------------------------
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
10
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
19 ************************************************************************
20 ************************************************************************/
21
22
23 #include "cableSchema.h"
24 #include <assert.h>
25 #include <iostream>
26
27 using namespace std;
28
29 /**
30 * Build n cables in parallel
31 */
32 schema* makeCableSchema (unsigned int n)
33 {
34 assert(n>0);
35 return new cableSchema(n);
36 }
37
38
39 /**
40 * Build n cables in parallel
41 */
42 cableSchema::cableSchema (unsigned int n)
43 : schema (n, n, 0, n*dWire)
44 {
45 for (unsigned int i=0; i<n; i++) fPoint.push_back(point(0,0));
46 }
47
48
49 /**
50 * Place the communication points vertically spaced by dWire
51 */
52 void cableSchema::place(double ox, double oy, int orientation)
53 {
54 beginPlace(ox, oy, orientation);
55 if (orientation == kLeftRight) {
56 for (unsigned int i=0; i<inputs(); i++) {
57 fPoint[i] = point(ox, oy + dWire/2.0 + i*dWire);
58 }
59 } else {
60 for (unsigned int i=0; i<inputs(); i++) {
61 fPoint[i] = point(ox, oy + height() - dWire/2.0 - i*dWire);
62 }
63 }
64 endPlace();
65 }
66
67
68
69 /**
70 * Nothing to draw. Actual drawing will take place when the wires
71 * are enlargered
72 */
73 void cableSchema::draw(device& dev)
74 {
75 }
76
77
78
79 /**
80 * Nothing to collect. Actual collect will take place when the wires
81 * are enlargered
82 */
83 void cableSchema::collectTraits(collector& c)
84 {
85 }
86
87 /**
88 *input and output points are the same as the width is 0
89 */
90 point cableSchema::inputPoint(unsigned int i) const
91 {
92 assert(i<inputs());
93 return fPoint[i];
94 }
95
96 /**
97 *input and output points are the same as the width is 0
98 */
99 point cableSchema::outputPoint(unsigned int i) const
100 {
101 assert(i<outputs());
102 return fPoint[i];
103 }