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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
/************************************************************************
************************************************************************
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 "splitSchema.h"
#include <iostream>
#include <assert.h>
using namespace std;
/**
* Creates a new split schema. Cables are enlarged to dWire.
* The horizontal gap between the two subschema is such that
* the connections are not too slopy.
*/
schema* makeSplitSchema (schema* s1, schema* s2)
{
// make sure a and b are at least dWire large
schema * a = makeEnlargedSchema(s1, dWire);
schema * b = makeEnlargedSchema(s2, dWire);
// horizontal gap to avaoid too slopy connections
double hgap = (a->height()+b->height())/4;
return new splitSchema(a,b,hgap);
}
/**
* Constructor for a split schema s1 <: s2 where the outputs
* of s1 are distributed to the inputs of s2. The constructor is
* private in order to enforce the usage of makeSplitSchema
*/
splitSchema::splitSchema (schema* s1, schema* s2, double hgap)
: schema( s1->inputs(),
s2->outputs(),
s1->width() + s2->width() + hgap,
max(s1->height(), s2->height()) ),
fSchema1(s1),
fSchema2(s2),
fHorzGap(hgap)
{
}
/**
* Places the two subschema horizontaly, centered, with enough gap for
* the connections
*/
void splitSchema::place(double ox, double oy, int orientation)
{
beginPlace(ox, oy, orientation);
double dy1 = max(0.0, fSchema2->height()-fSchema1->height()) / 2.0;
double dy2 = max(0.0, fSchema1->height()-fSchema2->height()) / 2.0;
if (orientation == kLeftRight) {
fSchema1->place(ox, oy+dy1, orientation);
fSchema2->place(ox+fSchema1->width()+fHorzGap, oy+dy2, orientation);
} else {
fSchema2->place(ox, oy+dy2, orientation);
fSchema1->place(ox+fSchema2->width()+fHorzGap, oy+dy1, orientation);
}
endPlace();
}
/**
* The inputs of s1 <: s2 are the inputs of s1
*/
point splitSchema::inputPoint(unsigned int i) const
{
return fSchema1->inputPoint(i);
}
/**
* The outputs of s1 <: s2 are the outputs of s2
*/
point splitSchema::outputPoint(unsigned int i) const
{
return fSchema2->outputPoint(i);
}
/**
* Draw the two sub schema and the connections between them
*/
void splitSchema::draw(device& dev)
{
assert(placed());
// draw the two subdiagrams
fSchema1->draw(dev);
fSchema2->draw(dev);
unsigned int r = fSchema1->outputs();
assert(r>0);
#if 0
// draw the connections between them
for (unsigned int i=0; i<fSchema2->inputs(); i++) {
point p = fSchema1->outputPoint(i%r);
point q = fSchema2->inputPoint(i);
if(p.z>0) {
dev.trait(p.x, p.y, q.x, q.y);
}
}
#endif
}
/**
* Draw the two sub schema and the connections between them
*/
void splitSchema::collectTraits(collector& c)
{
assert(placed());
// draw the two subdiagrams
fSchema1->collectTraits(c);
fSchema2->collectTraits(c);
unsigned int r = fSchema1->outputs();
assert(r>0);
// draw the connections between them
for (unsigned int i=0; i<fSchema2->inputs(); i++) {
point p = fSchema1->outputPoint(i%r);
point q = fSchema2->inputPoint(i);
c.addTrait(trait(point(p.x, p.y), point(q.x, q.y)));
}
}
|
