// $Id$ // // Copyright (C) 2008 // Fraunhofer Institute for Open Communication Systems (FOKUS) // Competence Center NETwork research (NET), St. Augustin, GERMANY // Stefan Bund // // 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. /** \file \brief Executor non-inline template implementation */ //#include "Executor.ih" // Custom includes #define prefix_ ///////////////////////////////ct.p//////////////////////////////////////// /////////////////////////////////////////////////////////////////////////// // senf::console::Executor template prefix_ senf::console::GenericNode & senf::console::Executor::traverse(DirectoryNode & dir, ForwardRange const & range) { typedef typename boost::range_const_iterator::type const_iterator; detail::NodeTraverser traverser (*root_, dir, autocomplete_); const_iterator i (boost::begin(range)); const_iterator const i_end (boost::end(range)); for (; i != i_end; ++i) { if ( policy_ && (*i) != std::string("") && (*i) != std::string(".") ) policy_( dynamic_cast(traverser.node()), *i ); traverser( *i ); } return traverser.node(); } ///////////////////////////////ct.e//////////////////////////////////////// #undef prefix_ // Local Variables: // mode: c++ // fill-column: 100 // comment-column: 40 // c-file-style: "senf" // indent-tabs-mode: nil // ispell-local-dictionary: "american" // compile-command: "scons -u test" // End: