/* This file is part of Machina. * Copyright (C) 2007 Dave Robillard * * Machina 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. * * Machina 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 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., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA */ #include #include #include #include namespace Machina { Node::Node(BeatCount duration, bool initial) : _is_initial(initial) , _is_selector(false) , _is_active(false) , _enter_time(0) , _duration(duration) { } void Node::set_enter_action(SharedPtr action) { _enter_action = action; } void Node::remove_enter_action() { _enter_action.reset(); } void Node::set_exit_action(SharedPtr action) { _exit_action = action; } void Node::remove_exit_action() { _exit_action.reset(); } //using namespace std; void Node::enter(SharedPtr sink, BeatTime time) { assert(!_is_active); //std::cerr << "ENTER " << time << std::endl; _is_active = true; _enter_time = time; if (sink && _enter_action) _enter_action->execute(sink, time); } void Node::exit(SharedPtr sink, BeatTime time) { assert(_is_active); //std::cerr << "EXIT " << time << std::endl; if (sink && _exit_action) _exit_action->execute(sink, time); _is_active = false; _enter_time = 0; } void Node::add_outgoing_edge(SharedPtr edge) { assert(edge->src().lock().get() == this); _outgoing_edges.push_back(edge); } void Node::remove_outgoing_edge(SharedPtr edge) { _outgoing_edges.erase(_outgoing_edges.find(edge)); } void Node::remove_outgoing_edges_to(SharedPtr node) { for (Edges::iterator i = _outgoing_edges.begin(); i != _outgoing_edges.end() ; ) { Edges::iterator next = i; ++next; if ((*i)->dst() == node) _outgoing_edges.erase(i); i = next; } } void Node::write_state(Raul::RDFWriter& writer) { using Raul::RdfId; if (!_id) set_id(writer.blank_id()); if (_is_selector) writer.write(_id, RdfId(RdfId::RESOURCE, "rdf:type"), RdfId(RdfId::RESOURCE, "machina:SelectorNode")); else writer.write(_id, RdfId(RdfId::RESOURCE, "rdf:type"), RdfId(RdfId::RESOURCE, "machina:Node")); writer.write(_id, RdfId(RdfId::RESOURCE, "machina:duration"), Raul::Atom((float)_duration)); if (_enter_action) { _enter_action->write_state(writer); writer.write(_id, RdfId(RdfId::RESOURCE, "machina:enterAction"), _enter_action->id()); } if (_exit_action) { _exit_action->write_state(writer); writer.write(_id, RdfId(RdfId::RESOURCE, "machina:exitAction"), _exit_action->id()); } /*for (Node::Edges::const_iterator e = _outgoing_edges.begin(); e != _outgoing_edges.end(); ++e) (*e)->write_state(writer);*/ } } // namespace Machina