00001
00002 #ifndef GEOGRAPHIC_MSGS_MESSAGE_ROUTENETWORK_H
00003 #define GEOGRAPHIC_MSGS_MESSAGE_ROUTENETWORK_H
00004 #include <string>
00005 #include <vector>
00006 #include <map>
00007 #include <ostream>
00008 #include "ros/serialization.h"
00009 #include "ros/builtin_message_traits.h"
00010 #include "ros/message_operations.h"
00011 #include "ros/time.h"
00012
00013 #include "ros/macros.h"
00014
00015 #include "ros/assert.h"
00016
00017 #include "std_msgs/Header.h"
00018 #include "geographic_msgs/UniqueID.h"
00019 #include "geographic_msgs/BoundingBox.h"
00020 #include "geographic_msgs/WayPoint.h"
00021 #include "geographic_msgs/RouteSegment.h"
00022 #include "geographic_msgs/KeyValue.h"
00023
00024 namespace geographic_msgs
00025 {
00026 template <class ContainerAllocator>
00027 struct RouteNetwork_ {
00028 typedef RouteNetwork_<ContainerAllocator> Type;
00029
00030 RouteNetwork_()
00031 : header()
00032 , id()
00033 , bounds()
00034 , points()
00035 , segments()
00036 , props()
00037 {
00038 }
00039
00040 RouteNetwork_(const ContainerAllocator& _alloc)
00041 : header(_alloc)
00042 , id(_alloc)
00043 , bounds(_alloc)
00044 , points(_alloc)
00045 , segments(_alloc)
00046 , props(_alloc)
00047 {
00048 }
00049
00050 typedef ::std_msgs::Header_<ContainerAllocator> _header_type;
00051 ::std_msgs::Header_<ContainerAllocator> header;
00052
00053 typedef ::geographic_msgs::UniqueID_<ContainerAllocator> _id_type;
00054 ::geographic_msgs::UniqueID_<ContainerAllocator> id;
00055
00056 typedef ::geographic_msgs::BoundingBox_<ContainerAllocator> _bounds_type;
00057 ::geographic_msgs::BoundingBox_<ContainerAllocator> bounds;
00058
00059 typedef std::vector< ::geographic_msgs::WayPoint_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::WayPoint_<ContainerAllocator> >::other > _points_type;
00060 std::vector< ::geographic_msgs::WayPoint_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::WayPoint_<ContainerAllocator> >::other > points;
00061
00062 typedef std::vector< ::geographic_msgs::RouteSegment_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::RouteSegment_<ContainerAllocator> >::other > _segments_type;
00063 std::vector< ::geographic_msgs::RouteSegment_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::RouteSegment_<ContainerAllocator> >::other > segments;
00064
00065 typedef std::vector< ::geographic_msgs::KeyValue_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::KeyValue_<ContainerAllocator> >::other > _props_type;
00066 std::vector< ::geographic_msgs::KeyValue_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::KeyValue_<ContainerAllocator> >::other > props;
00067
00068
00069 ROS_DEPRECATED uint32_t get_points_size() const { return (uint32_t)points.size(); }
00070 ROS_DEPRECATED void set_points_size(uint32_t size) { points.resize((size_t)size); }
00071 ROS_DEPRECATED void get_points_vec(std::vector< ::geographic_msgs::WayPoint_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::WayPoint_<ContainerAllocator> >::other > & vec) const { vec = this->points; }
00072 ROS_DEPRECATED void set_points_vec(const std::vector< ::geographic_msgs::WayPoint_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::WayPoint_<ContainerAllocator> >::other > & vec) { this->points = vec; }
00073 ROS_DEPRECATED uint32_t get_segments_size() const { return (uint32_t)segments.size(); }
00074 ROS_DEPRECATED void set_segments_size(uint32_t size) { segments.resize((size_t)size); }
00075 ROS_DEPRECATED void get_segments_vec(std::vector< ::geographic_msgs::RouteSegment_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::RouteSegment_<ContainerAllocator> >::other > & vec) const { vec = this->segments; }
00076 ROS_DEPRECATED void set_segments_vec(const std::vector< ::geographic_msgs::RouteSegment_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::RouteSegment_<ContainerAllocator> >::other > & vec) { this->segments = vec; }
00077 ROS_DEPRECATED uint32_t get_props_size() const { return (uint32_t)props.size(); }
00078 ROS_DEPRECATED void set_props_size(uint32_t size) { props.resize((size_t)size); }
00079 ROS_DEPRECATED void get_props_vec(std::vector< ::geographic_msgs::KeyValue_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::KeyValue_<ContainerAllocator> >::other > & vec) const { vec = this->props; }
00080 ROS_DEPRECATED void set_props_vec(const std::vector< ::geographic_msgs::KeyValue_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::geographic_msgs::KeyValue_<ContainerAllocator> >::other > & vec) { this->props = vec; }
00081 private:
00082 static const char* __s_getDataType_() { return "geographic_msgs/RouteNetwork"; }
00083 public:
00084 ROS_DEPRECATED static const std::string __s_getDataType() { return __s_getDataType_(); }
00085
00086 ROS_DEPRECATED const std::string __getDataType() const { return __s_getDataType_(); }
00087
00088 private:
00089 static const char* __s_getMD5Sum_() { return "4b9cdc670b2883417d0fb7ae1ec06c50"; }
00090 public:
00091 ROS_DEPRECATED static const std::string __s_getMD5Sum() { return __s_getMD5Sum_(); }
00092
00093 ROS_DEPRECATED const std::string __getMD5Sum() const { return __s_getMD5Sum_(); }
00094
00095 private:
00096 static const char* __s_getMessageDefinition_() { return "# Geographic map route network.\n\
00097 #\n\
00098 # A directed graph of WayPoint nodes and RouteSegment edges. This\n\
00099 # information is extracted from the more-detailed contents of a\n\
00100 # GeographicMap. A RouteNetwork contains only the way points and\n\
00101 # route segments of interest for path planning.\n\
00102 \n\
00103 Header header\n\
00104 \n\
00105 UniqueID id # This route network identifier\n\
00106 BoundingBox bounds # 2D bounding box for network\n\
00107 \n\
00108 WayPoint[] points # Way points in this network\n\
00109 RouteSegment[] segments # Directed edges of this network\n\
00110 \n\
00111 KeyValue[] props # Network key/value properties\n\
00112 \n\
00113 ================================================================================\n\
00114 MSG: std_msgs/Header\n\
00115 # Standard metadata for higher-level stamped data types.\n\
00116 # This is generally used to communicate timestamped data \n\
00117 # in a particular coordinate frame.\n\
00118 # \n\
00119 # sequence ID: consecutively increasing ID \n\
00120 uint32 seq\n\
00121 #Two-integer timestamp that is expressed as:\n\
00122 # * stamp.secs: seconds (stamp_secs) since epoch\n\
00123 # * stamp.nsecs: nanoseconds since stamp_secs\n\
00124 # time-handling sugar is provided by the client library\n\
00125 time stamp\n\
00126 #Frame this data is associated with\n\
00127 # 0: no frame\n\
00128 # 1: global frame\n\
00129 string frame_id\n\
00130 \n\
00131 ================================================================================\n\
00132 MSG: geographic_msgs/UniqueID\n\
00133 # A universally unique identifier (UUID) for a geographic feature.\n\
00134 #\n\
00135 # http://en.wikipedia.org/wiki/Universally_unique_identifier\n\
00136 # http://tools.ietf.org/html/rfc4122.html\n\
00137 #\n\
00138 # For simplicity and human readability, the UUID is represented as a\n\
00139 # string of hex digits and dashes.\n\
00140 #\n\
00141 # UUID generation is up to the programmer, but the intent is for\n\
00142 # matching features within a domain such as Open Street Map to yield\n\
00143 # the same UUID. The recommended method is RFC 4122 variant 5,\n\
00144 # computing the SHA-1 hash of a URL encoded using the map source. For\n\
00145 # example:\n\
00146 #\n\
00147 # http://openstreetmap.org/node/NUMBER\n\
00148 # http://openstreetmap.org/way/NUMBER\n\
00149 # http://openstreetmap.org/relation/NUMBER\n\
00150 #\n\
00151 # Here NUMBER is the decimal representation of the OSM node, way, or\n\
00152 # relation ID without leading zeros.\n\
00153 #\n\
00154 # Other map sources should use similar conventions.\n\
00155 \n\
00156 string uuid # format: 01234567-89ab-cdef-0123-456789abcdef\n\
00157 \n\
00158 ================================================================================\n\
00159 MSG: geographic_msgs/BoundingBox\n\
00160 # Two-dimensional geographic map bounding box. \n\
00161 \n\
00162 # Latitudes are in degrees [-90 .. +90]. Positive is north of equator;\n\
00163 # negative is south.\n\
00164 \n\
00165 # Longitudes are in degrees [-180 .. +180]. Positive is east of prime\n\
00166 # meridian; negative is west. At the poles, latitude is -90 or +90,\n\
00167 # and longitude is irrelevant, but must be in range.\n\
00168 \n\
00169 # If all bounds are zeros, the bounding box includes the whole world.\n\
00170 \n\
00171 float64 min_latitude\n\
00172 float64 min_longitude\n\
00173 float64 max_latitude\n\
00174 float64 max_longitude\n\
00175 \n\
00176 ================================================================================\n\
00177 MSG: geographic_msgs/WayPoint\n\
00178 # Way-point element for a geographic map.\n\
00179 \n\
00180 UniqueID id # Unique way-point identifier\n\
00181 GeoPoint position # Position relative to WGS 84 ellipsoid\n\
00182 KeyValue[] props # Key/value properties for this point\n\
00183 \n\
00184 ================================================================================\n\
00185 MSG: geographic_msgs/GeoPoint\n\
00186 # Geographic point, using the WGS 84 reference ellipsoid.\n\
00187 \n\
00188 # Latitude [degrees]. Positive is north of equator; negative is south\n\
00189 # (-90 <= latitude <= +90).\n\
00190 float64 latitude\n\
00191 \n\
00192 # Longitude [degrees]. Positive is east of prime meridian; negative is\n\
00193 # west (-180 <= longitude <= +180). At the poles, latitude is -90 or\n\
00194 # +90, and longitude is irrelevant, but must be in range.\n\
00195 float64 longitude\n\
00196 \n\
00197 # Altitude [m]. Positive is above the WGS 84 ellipsoid (NaN if unspecified).\n\
00198 float64 altitude\n\
00199 \n\
00200 ================================================================================\n\
00201 MSG: geographic_msgs/KeyValue\n\
00202 # Geographic map tag (key, value) pair\n\
00203 #\n\
00204 # This is equivalent to diagnostic_msgs/KeyValue, repeated here to\n\
00205 # avoid introducing a trivial stack dependency.\n\
00206 \n\
00207 string key # tag label\n\
00208 string value # corresponding value\n\
00209 \n\
00210 ================================================================================\n\
00211 MSG: geographic_msgs/RouteSegment\n\
00212 # Route network segment.\n\
00213 #\n\
00214 # This is one directed edge of a RouteNetwork graph. It represents a\n\
00215 # known path from one way point to another. If the path is two-way,\n\
00216 # there will be another RouteSegment with \"start\" and \"end\" reversed.\n\
00217 \n\
00218 UniqueID id # Unique identifier for this segment\n\
00219 \n\
00220 UniqueID start # beginning way point of segment\n\
00221 UniqueID end # ending way point of segment\n\
00222 \n\
00223 KeyValue[] props # segment properties\n\
00224 \n\
00225 "; }
00226 public:
00227 ROS_DEPRECATED static const std::string __s_getMessageDefinition() { return __s_getMessageDefinition_(); }
00228
00229 ROS_DEPRECATED const std::string __getMessageDefinition() const { return __s_getMessageDefinition_(); }
00230
00231 ROS_DEPRECATED virtual uint8_t *serialize(uint8_t *write_ptr, uint32_t seq) const
00232 {
00233 ros::serialization::OStream stream(write_ptr, 1000000000);
00234 ros::serialization::serialize(stream, header);
00235 ros::serialization::serialize(stream, id);
00236 ros::serialization::serialize(stream, bounds);
00237 ros::serialization::serialize(stream, points);
00238 ros::serialization::serialize(stream, segments);
00239 ros::serialization::serialize(stream, props);
00240 return stream.getData();
00241 }
00242
00243 ROS_DEPRECATED virtual uint8_t *deserialize(uint8_t *read_ptr)
00244 {
00245 ros::serialization::IStream stream(read_ptr, 1000000000);
00246 ros::serialization::deserialize(stream, header);
00247 ros::serialization::deserialize(stream, id);
00248 ros::serialization::deserialize(stream, bounds);
00249 ros::serialization::deserialize(stream, points);
00250 ros::serialization::deserialize(stream, segments);
00251 ros::serialization::deserialize(stream, props);
00252 return stream.getData();
00253 }
00254
00255 ROS_DEPRECATED virtual uint32_t serializationLength() const
00256 {
00257 uint32_t size = 0;
00258 size += ros::serialization::serializationLength(header);
00259 size += ros::serialization::serializationLength(id);
00260 size += ros::serialization::serializationLength(bounds);
00261 size += ros::serialization::serializationLength(points);
00262 size += ros::serialization::serializationLength(segments);
00263 size += ros::serialization::serializationLength(props);
00264 return size;
00265 }
00266
00267 typedef boost::shared_ptr< ::geographic_msgs::RouteNetwork_<ContainerAllocator> > Ptr;
00268 typedef boost::shared_ptr< ::geographic_msgs::RouteNetwork_<ContainerAllocator> const> ConstPtr;
00269 boost::shared_ptr<std::map<std::string, std::string> > __connection_header;
00270 };
00271 typedef ::geographic_msgs::RouteNetwork_<std::allocator<void> > RouteNetwork;
00272
00273 typedef boost::shared_ptr< ::geographic_msgs::RouteNetwork> RouteNetworkPtr;
00274 typedef boost::shared_ptr< ::geographic_msgs::RouteNetwork const> RouteNetworkConstPtr;
00275
00276
00277 template<typename ContainerAllocator>
00278 std::ostream& operator<<(std::ostream& s, const ::geographic_msgs::RouteNetwork_<ContainerAllocator> & v)
00279 {
00280 ros::message_operations::Printer< ::geographic_msgs::RouteNetwork_<ContainerAllocator> >::stream(s, "", v);
00281 return s;}
00282
00283 }
00284
00285 namespace ros
00286 {
00287 namespace message_traits
00288 {
00289 template<class ContainerAllocator> struct IsMessage< ::geographic_msgs::RouteNetwork_<ContainerAllocator> > : public TrueType {};
00290 template<class ContainerAllocator> struct IsMessage< ::geographic_msgs::RouteNetwork_<ContainerAllocator> const> : public TrueType {};
00291 template<class ContainerAllocator>
00292 struct MD5Sum< ::geographic_msgs::RouteNetwork_<ContainerAllocator> > {
00293 static const char* value()
00294 {
00295 return "4b9cdc670b2883417d0fb7ae1ec06c50";
00296 }
00297
00298 static const char* value(const ::geographic_msgs::RouteNetwork_<ContainerAllocator> &) { return value(); }
00299 static const uint64_t static_value1 = 0x4b9cdc670b288341ULL;
00300 static const uint64_t static_value2 = 0x7d0fb7ae1ec06c50ULL;
00301 };
00302
00303 template<class ContainerAllocator>
00304 struct DataType< ::geographic_msgs::RouteNetwork_<ContainerAllocator> > {
00305 static const char* value()
00306 {
00307 return "geographic_msgs/RouteNetwork";
00308 }
00309
00310 static const char* value(const ::geographic_msgs::RouteNetwork_<ContainerAllocator> &) { return value(); }
00311 };
00312
00313 template<class ContainerAllocator>
00314 struct Definition< ::geographic_msgs::RouteNetwork_<ContainerAllocator> > {
00315 static const char* value()
00316 {
00317 return "# Geographic map route network.\n\
00318 #\n\
00319 # A directed graph of WayPoint nodes and RouteSegment edges. This\n\
00320 # information is extracted from the more-detailed contents of a\n\
00321 # GeographicMap. A RouteNetwork contains only the way points and\n\
00322 # route segments of interest for path planning.\n\
00323 \n\
00324 Header header\n\
00325 \n\
00326 UniqueID id # This route network identifier\n\
00327 BoundingBox bounds # 2D bounding box for network\n\
00328 \n\
00329 WayPoint[] points # Way points in this network\n\
00330 RouteSegment[] segments # Directed edges of this network\n\
00331 \n\
00332 KeyValue[] props # Network key/value properties\n\
00333 \n\
00334 ================================================================================\n\
00335 MSG: std_msgs/Header\n\
00336 # Standard metadata for higher-level stamped data types.\n\
00337 # This is generally used to communicate timestamped data \n\
00338 # in a particular coordinate frame.\n\
00339 # \n\
00340 # sequence ID: consecutively increasing ID \n\
00341 uint32 seq\n\
00342 #Two-integer timestamp that is expressed as:\n\
00343 # * stamp.secs: seconds (stamp_secs) since epoch\n\
00344 # * stamp.nsecs: nanoseconds since stamp_secs\n\
00345 # time-handling sugar is provided by the client library\n\
00346 time stamp\n\
00347 #Frame this data is associated with\n\
00348 # 0: no frame\n\
00349 # 1: global frame\n\
00350 string frame_id\n\
00351 \n\
00352 ================================================================================\n\
00353 MSG: geographic_msgs/UniqueID\n\
00354 # A universally unique identifier (UUID) for a geographic feature.\n\
00355 #\n\
00356 # http://en.wikipedia.org/wiki/Universally_unique_identifier\n\
00357 # http://tools.ietf.org/html/rfc4122.html\n\
00358 #\n\
00359 # For simplicity and human readability, the UUID is represented as a\n\
00360 # string of hex digits and dashes.\n\
00361 #\n\
00362 # UUID generation is up to the programmer, but the intent is for\n\
00363 # matching features within a domain such as Open Street Map to yield\n\
00364 # the same UUID. The recommended method is RFC 4122 variant 5,\n\
00365 # computing the SHA-1 hash of a URL encoded using the map source. For\n\
00366 # example:\n\
00367 #\n\
00368 # http://openstreetmap.org/node/NUMBER\n\
00369 # http://openstreetmap.org/way/NUMBER\n\
00370 # http://openstreetmap.org/relation/NUMBER\n\
00371 #\n\
00372 # Here NUMBER is the decimal representation of the OSM node, way, or\n\
00373 # relation ID without leading zeros.\n\
00374 #\n\
00375 # Other map sources should use similar conventions.\n\
00376 \n\
00377 string uuid # format: 01234567-89ab-cdef-0123-456789abcdef\n\
00378 \n\
00379 ================================================================================\n\
00380 MSG: geographic_msgs/BoundingBox\n\
00381 # Two-dimensional geographic map bounding box. \n\
00382 \n\
00383 # Latitudes are in degrees [-90 .. +90]. Positive is north of equator;\n\
00384 # negative is south.\n\
00385 \n\
00386 # Longitudes are in degrees [-180 .. +180]. Positive is east of prime\n\
00387 # meridian; negative is west. At the poles, latitude is -90 or +90,\n\
00388 # and longitude is irrelevant, but must be in range.\n\
00389 \n\
00390 # If all bounds are zeros, the bounding box includes the whole world.\n\
00391 \n\
00392 float64 min_latitude\n\
00393 float64 min_longitude\n\
00394 float64 max_latitude\n\
00395 float64 max_longitude\n\
00396 \n\
00397 ================================================================================\n\
00398 MSG: geographic_msgs/WayPoint\n\
00399 # Way-point element for a geographic map.\n\
00400 \n\
00401 UniqueID id # Unique way-point identifier\n\
00402 GeoPoint position # Position relative to WGS 84 ellipsoid\n\
00403 KeyValue[] props # Key/value properties for this point\n\
00404 \n\
00405 ================================================================================\n\
00406 MSG: geographic_msgs/GeoPoint\n\
00407 # Geographic point, using the WGS 84 reference ellipsoid.\n\
00408 \n\
00409 # Latitude [degrees]. Positive is north of equator; negative is south\n\
00410 # (-90 <= latitude <= +90).\n\
00411 float64 latitude\n\
00412 \n\
00413 # Longitude [degrees]. Positive is east of prime meridian; negative is\n\
00414 # west (-180 <= longitude <= +180). At the poles, latitude is -90 or\n\
00415 # +90, and longitude is irrelevant, but must be in range.\n\
00416 float64 longitude\n\
00417 \n\
00418 # Altitude [m]. Positive is above the WGS 84 ellipsoid (NaN if unspecified).\n\
00419 float64 altitude\n\
00420 \n\
00421 ================================================================================\n\
00422 MSG: geographic_msgs/KeyValue\n\
00423 # Geographic map tag (key, value) pair\n\
00424 #\n\
00425 # This is equivalent to diagnostic_msgs/KeyValue, repeated here to\n\
00426 # avoid introducing a trivial stack dependency.\n\
00427 \n\
00428 string key # tag label\n\
00429 string value # corresponding value\n\
00430 \n\
00431 ================================================================================\n\
00432 MSG: geographic_msgs/RouteSegment\n\
00433 # Route network segment.\n\
00434 #\n\
00435 # This is one directed edge of a RouteNetwork graph. It represents a\n\
00436 # known path from one way point to another. If the path is two-way,\n\
00437 # there will be another RouteSegment with \"start\" and \"end\" reversed.\n\
00438 \n\
00439 UniqueID id # Unique identifier for this segment\n\
00440 \n\
00441 UniqueID start # beginning way point of segment\n\
00442 UniqueID end # ending way point of segment\n\
00443 \n\
00444 KeyValue[] props # segment properties\n\
00445 \n\
00446 ";
00447 }
00448
00449 static const char* value(const ::geographic_msgs::RouteNetwork_<ContainerAllocator> &) { return value(); }
00450 };
00451
00452 template<class ContainerAllocator> struct HasHeader< ::geographic_msgs::RouteNetwork_<ContainerAllocator> > : public TrueType {};
00453 template<class ContainerAllocator> struct HasHeader< const ::geographic_msgs::RouteNetwork_<ContainerAllocator> > : public TrueType {};
00454 }
00455 }
00456
00457 namespace ros
00458 {
00459 namespace serialization
00460 {
00461
00462 template<class ContainerAllocator> struct Serializer< ::geographic_msgs::RouteNetwork_<ContainerAllocator> >
00463 {
00464 template<typename Stream, typename T> inline static void allInOne(Stream& stream, T m)
00465 {
00466 stream.next(m.header);
00467 stream.next(m.id);
00468 stream.next(m.bounds);
00469 stream.next(m.points);
00470 stream.next(m.segments);
00471 stream.next(m.props);
00472 }
00473
00474 ROS_DECLARE_ALLINONE_SERIALIZER;
00475 };
00476 }
00477 }
00478
00479 namespace ros
00480 {
00481 namespace message_operations
00482 {
00483
00484 template<class ContainerAllocator>
00485 struct Printer< ::geographic_msgs::RouteNetwork_<ContainerAllocator> >
00486 {
00487 template<typename Stream> static void stream(Stream& s, const std::string& indent, const ::geographic_msgs::RouteNetwork_<ContainerAllocator> & v)
00488 {
00489 s << indent << "header: ";
00490 s << std::endl;
00491 Printer< ::std_msgs::Header_<ContainerAllocator> >::stream(s, indent + " ", v.header);
00492 s << indent << "id: ";
00493 s << std::endl;
00494 Printer< ::geographic_msgs::UniqueID_<ContainerAllocator> >::stream(s, indent + " ", v.id);
00495 s << indent << "bounds: ";
00496 s << std::endl;
00497 Printer< ::geographic_msgs::BoundingBox_<ContainerAllocator> >::stream(s, indent + " ", v.bounds);
00498 s << indent << "points[]" << std::endl;
00499 for (size_t i = 0; i < v.points.size(); ++i)
00500 {
00501 s << indent << " points[" << i << "]: ";
00502 s << std::endl;
00503 s << indent;
00504 Printer< ::geographic_msgs::WayPoint_<ContainerAllocator> >::stream(s, indent + " ", v.points[i]);
00505 }
00506 s << indent << "segments[]" << std::endl;
00507 for (size_t i = 0; i < v.segments.size(); ++i)
00508 {
00509 s << indent << " segments[" << i << "]: ";
00510 s << std::endl;
00511 s << indent;
00512 Printer< ::geographic_msgs::RouteSegment_<ContainerAllocator> >::stream(s, indent + " ", v.segments[i]);
00513 }
00514 s << indent << "props[]" << std::endl;
00515 for (size_t i = 0; i < v.props.size(); ++i)
00516 {
00517 s << indent << " props[" << i << "]: ";
00518 s << std::endl;
00519 s << indent;
00520 Printer< ::geographic_msgs::KeyValue_<ContainerAllocator> >::stream(s, indent + " ", v.props[i]);
00521 }
00522 }
00523 };
00524
00525
00526 }
00527 }
00528
00529 #endif // GEOGRAPHIC_MSGS_MESSAGE_ROUTENETWORK_H
00530