.. _program_listing_file__tmp_ws_src_message_filters_include_message_filters_chain.h: Program Listing for File chain.h ================================ |exhale_lsh| :ref:`Return to documentation for file ` (``/tmp/ws/src/message_filters/include/message_filters/chain.h``) .. |exhale_lsh| unicode:: U+021B0 .. UPWARDS ARROW WITH TIP LEFTWARDS .. code-block:: cpp /********************************************************************* * Software License Agreement (BSD License) * * Copyright (c) 2010, Willow Garage, Inc. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following * disclaimer in the documentation and/or other materials provided * with the distribution. * * Neither the name of the Willow Garage nor the names of its * contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. *********************************************************************/ #ifndef MESSAGE_FILTERS__CHAIN_H #define MESSAGE_FILTERS__CHAIN_H #include #include "message_filters/simple_filter.h" #include "message_filters/pass_through.h" namespace message_filters { class ChainBase { public: virtual ~ChainBase() {} template std::shared_ptr getFilter(size_t index) const { std::shared_ptr filter = getFilterForIndex(index); if (filter) { return std::static_pointer_cast(filter); } return std::shared_ptr(); } protected: virtual std::shared_ptr getFilterForIndex(size_t index) const = 0; }; typedef std::shared_ptr ChainBasePtr; template class Chain : public ChainBase, public SimpleFilter { public: typedef std::shared_ptr MConstPtr; typedef MessageEvent EventType; Chain() { } template Chain(F& f) { connectInput(f); } struct NullDeleter { void operator()(void const*) const { } }; template size_t addFilter(F* filter) { std::shared_ptr ptr(filter, NullDeleter()); return addFilter(ptr); } template size_t addFilter(const std::shared_ptr& filter) { FilterInfo info; info.add_func = std::bind((void(F::*)(const EventType&))&F::add, filter.get(), std::placeholders::_1); info.filter = filter; info.passthrough = std::make_shared >(); last_filter_connection_.disconnect(); info.passthrough->connectInput(*filter); last_filter_connection_ = info.passthrough->registerCallback(typename SimpleFilter::EventCallback(std::bind(&Chain::lastFilterCB, this, std::placeholders::_1))); if (!filters_.empty()) { filter->connectInput(*filters_.back().passthrough); } size_t count = filters_.size(); filters_.push_back(info); return count; } template std::shared_ptr getFilter(size_t index) const { if (index >= filters_.size()) { return std::shared_ptr(); } return std::static_pointer_cast(filters_[index].filter); } template void connectInput(F& f) { incoming_connection_.disconnect(); incoming_connection_ = f.registerCallback(typename SimpleFilter::EventCallback(std::bind(&Chain::incomingCB, this, std::placeholders::_1))); } void add(const MConstPtr& msg) { add(EventType(msg)); } void add(const EventType& evt) { if (!filters_.empty()) { filters_[0].add_func(evt); } } protected: virtual std::shared_ptr getFilterForIndex(size_t index) const { if (index >= filters_.size()) { return std::shared_ptr(); } return filters_[index].filter; } private: void incomingCB(const EventType& evt) { add(evt); } void lastFilterCB(const EventType& evt) { this->signalMessage(evt); } struct FilterInfo { std::function add_func; std::shared_ptr filter; std::shared_ptr > passthrough; }; typedef std::vector V_FilterInfo; V_FilterInfo filters_; Connection incoming_connection_; Connection last_filter_connection_; }; } // namespace message_filters #endif // MESSAGE_FILTERS__CHAIN_H_