X-Git-Url: https://scm.cri.ensmp.fr/git/Faustine.git/blobdiff_plain/c7f552fd8888da2f0d8cfb228fe0f28d3df3a12c..b4b6f2ea75b9f0f3ca918f5b84016610bf7a4d4f:/interpretor/preprocessor/faust-0.9.47mr3/compiler/draw/schema/collector.cpp diff --git a/interpretor/preprocessor/faust-0.9.47mr3/compiler/draw/schema/collector.cpp b/interpretor/preprocessor/faust-0.9.47mr3/compiler/draw/schema/collector.cpp new file mode 100644 index 0000000..248d00c --- /dev/null +++ b/interpretor/preprocessor/faust-0.9.47mr3/compiler/draw/schema/collector.cpp @@ -0,0 +1,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 + +using namespace std; + + +void collector::computeVisibleTraits() +{ + bool modified; + + do { + modified = false; + for (set::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::iterator p = fTraits.begin(); p != fTraits.end(); p++) { + if (isVisible(*p)) p->draw(dev); + } +} +