// Copyright (C) 2006 David Griffiths // // 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #include "GraphNode.h" #include #include using namespace std; /////////////////////////////////////////// GraphNode::GraphNode(unsigned int numinputs) { for(unsigned int n=0; n::iterator i=m_ChildNodes.begin(); i!=m_ChildNodes.end(); ++i) { if (*i!=NULL) { (*i)->Trigger(time); } } } void GraphNode::ProcessChildren(unsigned int bufsize) { for(vector::iterator i=m_ChildNodes.begin(); i!=m_ChildNodes.end(); ++i) { if (*i!=NULL) { (*i)->Process(bufsize); } } } void GraphNode::Clear() { for(unsigned int n=0; nGetOutput(); } float GraphNode::GetCVValue() { if (IsTerminal()) return GetValue(); else return GetOutput()[(unsigned int)0]; }