3 * Provides a class to manage a list of waypoints (i.e. a route).
6 // Written by Curtis Olson, started October 2000.
8 // Copyright (C) 2000 Curtis L. Olson - curt@hfrl.umn.edu
10 // This program is free software; you can redistribute it and/or
11 // modify it under the terms of the GNU General Public License as
12 // published by the Free Software Foundation; either version 2 of the
13 // License, or (at your option) any later version.
15 // This program is distributed in the hope that it will be useful, but
16 // WITHOUT ANY WARRANTY; without even the implied warranty of
17 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 // General Public License for more details.
20 // You should have received a copy of the GNU General Public License
21 // along with this program; if not, write to the Free Software
22 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
32 # error This library requires C++
36 #include <simgear/compiler.h>
44 #include <simgear/route/waypoint.hxx>
47 * A class to manage a list of waypoints (i.e. a route).
54 typedef vector < SGWayPoint > route_list;
58 void update_distance(int index);
68 /** Clear the entire route */
75 * Add waypoint (default), or insert waypoint at position n.
76 * @param wp a waypoint
78 void add_waypoint( const SGWayPoint &wp, int n = -1 );
80 * Get the number of waypoints (i.e. route length )
81 * @return route length
83 inline int size() const { return route.size(); }
86 * Get the front waypoint.
87 * @return the first waypoint.
89 inline SGWayPoint get_first() const {
93 return SGWayPoint( 0.0, 0.0, 0.0, SGWayPoint::WGS84, "invalid" );
98 * Get the current waypoint
99 * @return the current waypoint
101 inline SGWayPoint get_current() const {
102 if ( current_wp < (int)route.size() ) {
103 return route[current_wp];
105 return SGWayPoint( 0.0, 0.0, 0.0, SGWayPoint::WGS84, "invalid" );
110 * Set the current waypoint
111 * @param number of waypoint to make current.
113 inline void set_current( int n ) {
114 if ( n >= 0 && n < (int)route.size() ) {
119 /** Increment the current waypoint pointer. */
120 inline void increment_current() {
121 if ( current_wp < (int)route.size() - 1 ) {
127 * Get the nth waypoint
128 * @param n waypoint number
129 * @return the nth waypoint
131 inline SGWayPoint get_waypoint( const int n ) const {
132 if ( n < (int)route.size() ) {
135 return SGWayPoint( 0.0, 0.0, 0.0, SGWayPoint::WGS84, "invalid" );
139 /** Delete the front waypoint */
140 inline void delete_first() { delete_waypoint(0); }
142 /** Delete waypoint waypoint with index n (last one if n < 0) */
143 void delete_waypoint( int n = 0 );
146 * Calculate perpendicular distance from the current route segment
147 * This routine assumes all points are laying on a flat plane and
148 * ignores the altitude (or Z) dimension. For most accurate
149 * results, use with CARTESIAN way points.
151 double distance_off_route( double x, double y ) const;