00001 /* 00002 * Copyright (C) 2009, Willow Garage, Inc. 00003 * 00004 * Redistribution and use in source and binary forms, with or without 00005 * modification, are permitted provided that the following conditions are met: 00006 * * Redistributions of source code must retain the above copyright notice, 00007 * this list of conditions and the following disclaimer. 00008 * * Redistributions in binary form must reproduce the above copyright 00009 * notice, this list of conditions and the following disclaimer in the 00010 * documentation and/or other materials provided with the distribution. 00011 * * Neither the names of Stanford University or Willow Garage, Inc. nor the names of its 00012 * contributors may be used to endorse or promote products derived from 00013 * this software without specific prior written permission. 00014 * 00015 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00016 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00017 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00018 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 00019 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 00020 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 00021 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 00022 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 00023 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 00024 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00025 * POSSIBILITY OF SUCH DAMAGE. 00026 */ 00027 00028 #ifndef ROSCPP_TRANSPORT_HINTS_H 00029 #define ROSCPP_TRANSPORT_HINTS_H 00030 00031 #include "ros/forwards.h" 00032 00033 #include <boost/lexical_cast.hpp> 00034 00035 namespace ros 00036 { 00037 00053 class TransportHints 00054 { 00055 public: 00059 TransportHints& reliable() 00060 { 00061 tcp(); 00062 00063 return *this; 00064 } 00065 00069 TransportHints& tcp() 00070 { 00071 transports_.push_back("TCP"); 00072 return *this; 00073 } 00074 00081 TransportHints& tcpNoDelay(bool nodelay = true) 00082 { 00083 options_["tcp_nodelay"] = nodelay ? "true" : "false"; 00084 return *this; 00085 } 00086 00090 bool getTCPNoDelay() 00091 { 00092 M_string::iterator it = options_.find("tcp_nodelay"); 00093 if (it == options_.end()) 00094 { 00095 return false; 00096 } 00097 00098 const std::string& val = it->second; 00099 if (val == "true") 00100 { 00101 return true; 00102 } 00103 00104 return false; 00105 } 00106 00112 TransportHints& maxDatagramSize(int size) 00113 { 00114 options_["max_datagram_size"] = boost::lexical_cast<std::string>(size); 00115 return *this; 00116 } 00117 00122 int getMaxDatagramSize() 00123 { 00124 M_string::iterator it = options_.find("max_datagram_size"); 00125 if (it == options_.end()) 00126 { 00127 return 0; 00128 } 00129 00130 return boost::lexical_cast<int>(it->second); 00131 } 00132 00136 TransportHints& unreliable() 00137 { 00138 udp(); 00139 00140 return *this; 00141 } 00142 00146 TransportHints& udp() 00147 { 00148 transports_.push_back("UDP"); 00149 return *this; 00150 } 00151 00155 const V_string& getTransports() { return transports_; } 00159 const M_string& getOptions() { return options_; } 00160 00161 private: 00162 V_string transports_; 00163 M_string options_; 00164 }; 00165 00166 } 00167 00168 #endif