Erosion and dilasion by square successfully tested.
[Faustine.git] / interpretor / faust-0.9.47mr3 / compiler / draw / schema / collector.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 "schema.h"
24 #include <assert.h>
25
26 using namespace std;
27
28
29 void collector::computeVisibleTraits()
30 {
31 bool modified;
32
33 do {
34 modified = false;
35 for (set<trait>::iterator p = fTraits.begin(); p != fTraits.end(); p++) {
36 if (fWithInput.count(*p) == 0) { // not connected to a real output
37 if (fOutputs.count(p->start) > 0) {
38 fWithInput.insert(*p); // the cable is connected to a real output
39 fOutputs.insert(p->end); // end become a real output too
40 modified = true;
41 }
42 }
43 if (fWithOutput.count(*p) == 0) { // not connected to a real input
44 if (fInputs.count(p->end) > 0) {
45 fWithOutput.insert(*p); // the cable is connected to a real input
46 fInputs.insert(p->start); // start become a real input too
47 modified = true;
48 }
49 }
50 }
51 } while (modified);
52 }
53
54 bool collector::isVisible(const trait& t)
55 {
56 return fWithInput.count(t) && fWithOutput.count(t);
57 }
58
59 void collector::draw(device& dev)
60 {
61 computeVisibleTraits();
62 for (set<trait>::iterator p = fTraits.begin(); p != fTraits.end(); p++) {
63 if (isVisible(*p)) p->draw(dev);
64 }
65 }
66