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
|
/************************************************************************
************************************************************************
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 "schema.h"
#include <assert.h>
using namespace std;
void collector::computeVisibleTraits()
{
bool modified;
do {
modified = false;
for (set<trait>::iterator p = fTraits.begin(); p != fTraits.end(); p++) {
if (fWithInput.count(*p) == 0) { // not connected to a real output
if (fOutputs.count(p->start) > 0) {
fWithInput.insert(*p); // the cable is connected to a real output
fOutputs.insert(p->end); // end become a real output too
modified = true;
}
}
if (fWithOutput.count(*p) == 0) { // not connected to a real input
if (fInputs.count(p->end) > 0) {
fWithOutput.insert(*p); // the cable is connected to a real input
fInputs.insert(p->start); // start become a real input too
modified = true;
}
}
}
} while (modified);
}
bool collector::isVisible(const trait& t)
{
return fWithInput.count(t) && fWithOutput.count(t);
}
void collector::draw(device& dev)
{
computeVisibleTraits();
for (set<trait>::iterator p = fTraits.begin(); p != fTraits.end(); p++) {
if (isVisible(*p)) p->draw(dev);
}
}
|
