1 // navlist.cxx -- navaids management class
3 // Written by Curtis Olson, started April 2000.
5 // Copyright (C) 2000 Curtis L. Olson - http://www.flightgear.org/~curt
7 // This program is free software; you can redistribute it and/or
8 // modify it under the terms of the GNU General Public License as
9 // published by the Free Software Foundation; either version 2 of the
10 // License, or (at your option) any later version.
12 // This program is distributed in the hope that it will be useful, but
13 // WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 // General Public License for more details.
17 // You should have received a copy of the GNU General Public License
18 // along with this program; if not, write to the Free Software
19 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
29 #include <boost/foreach.hpp>
32 #include <simgear/debug/logstream.hxx>
33 #include <simgear/math/sg_geodesy.hxx>
34 #include <simgear/sg_inlines.h>
36 #include "navlist.hxx"
38 #include <Airports/runways.hxx>
39 #include <Navaids/NavDataCache.hxx>
43 namespace { // anonymous
45 class NavRecordDistanceSortPredicate
48 NavRecordDistanceSortPredicate( const SGGeod & position ) :
49 _position(SGVec3d::fromGeod(position)) {}
51 bool operator()( const nav_rec_ptr & n1, const nav_rec_ptr & n2 )
53 if( n1 == NULL || n2 == NULL ) return false;
54 return distSqr(n1->cart(), _position) < distSqr(n2->cart(), _position);
61 // discount navids if they conflict with another on the same frequency
62 // this only applies to navids associated with opposite ends of a runway,
63 // with matching frequencies.
64 bool navidUsable(FGNavRecord* aNav, const SGGeod &aircraft)
66 FGRunway* r(aNav->runway());
67 if (!r || !r->reciprocalRunway()) {
71 // check if the runway frequency is paired
72 FGNavRecord* locA = r->ILS();
73 FGNavRecord* locB = r->reciprocalRunway()->ILS();
75 if (!locA || !locB || (locA->get_freq() != locB->get_freq())) {
76 return true; // not paired, ok
79 // okay, both ends have an ILS, and they're paired. We need to select based on
80 // aircraft position. What we're going to use is *runway* (not navid) position,
81 // ie whichever runway end we are closer too. This makes back-course / missed
82 // approach behaviour incorrect, but that's the price we accept.
83 double crs = SGGeodesy::courseDeg(aircraft, r->geod());
84 double hdgDiff = crs - r->headingDeg();
85 SG_NORMALIZE_RANGE(hdgDiff, -180.0, 180.0);
86 return (fabs(hdgDiff) < 90.0);
89 } // of anonymous namespace
91 // FGNavList ------------------------------------------------------------------
94 //------------------------------------------------------------------------------
95 FGNavList::TypeFilter::TypeFilter(const FGPositioned::Type type)
97 if (type == FGPositioned::INVALID) {
98 _mintype = FGPositioned::NDB;
99 _maxtype = FGPositioned::GS;
101 _mintype = _maxtype = type;
105 //------------------------------------------------------------------------------
106 FGNavList::TypeFilter::TypeFilter( const FGPositioned::Type minType,
107 const FGPositioned::Type maxType ):
113 //------------------------------------------------------------------------------
114 bool FGNavList::TypeFilter::fromTypeString(const std::string& type)
116 FGPositioned::Type t;
117 if( type == "any" ) t = FGPositioned::INVALID;
118 else if( type == "fix" ) t = FGPositioned::FIX;
119 else if( type == "vor" ) t = FGPositioned::VOR;
120 else if( type == "ndb" ) t = FGPositioned::NDB;
121 else if( type == "ils" ) t = FGPositioned::ILS;
122 else if( type == "dme" ) t = FGPositioned::DME;
123 else if( type == "tacan") t = FGPositioned::TACAN;
126 _mintype = _maxtype = t;
132 * Filter returning Tacan stations. Checks for both pure TACAN stations
133 * but also co-located VORTACs. This is done by searching for DMEs whose
134 * name indicates they are a TACAN or VORTAC; not a great solution.
136 class TacanFilter : public FGNavList::TypeFilter
140 TypeFilter(FGPositioned::DME, FGPositioned::TACAN)
144 virtual bool pass(FGPositioned* pos) const
146 if (pos->type() == FGPositioned::TACAN) {
150 assert(pos->type() == FGPositioned::DME);
151 string::size_type loc1 = pos->name().find( "TACAN" );
152 string::size_type loc2 = pos->name().find( "VORTAC" );
153 return (loc1 != string::npos) || (loc2 != string::npos);
157 FGNavList::TypeFilter* FGNavList::locFilter()
159 static TypeFilter tf(FGPositioned::ILS, FGPositioned::LOC);
163 FGNavList::TypeFilter* FGNavList::ndbFilter()
165 static TypeFilter tf(FGPositioned::NDB);
169 FGNavList::TypeFilter* FGNavList::navFilter()
171 static TypeFilter tf(FGPositioned::VOR, FGPositioned::LOC);
175 FGNavList::TypeFilter* FGNavList::tacanFilter()
177 static TacanFilter tf;
181 FGNavList::TypeFilter* FGNavList::carrierFilter()
183 static TypeFilter tf(FGPositioned::MOBILE_TACAN);
187 FGNavRecord *FGNavList::findByFreq( double freq, const SGGeod& position,
190 flightgear::NavDataCache* cache = flightgear::NavDataCache::instance();
191 int freqKhz = static_cast<int>(freq * 100 + 0.5);
192 PositionedIDVec stations(cache->findNavaidsByFreq(freqKhz, position, filter));
193 if (stations.empty()) {
197 // now walk the (sorted) results list to find a usable, in-range navaid
198 SGVec3d acCart(SGVec3d::fromGeod(position));
200 = FG_NAV_MAX_RANGE*SG_NM_TO_METER*FG_NAV_MAX_RANGE*SG_NM_TO_METER;
202 BOOST_FOREACH(PositionedID id, stations) {
203 FGNavRecord* station = (FGNavRecord*) cache->loadById(id);
204 if (!filter->pass(station)) {
208 double d2 = distSqr(station->cart(), acCart);
210 // since results are sorted by proximity, as soon as we pass the
211 // distance cutoff we're done - fall out and return NULL
215 if (navidUsable(station, position)) {
220 // fell out of the loop, no usable match
224 FGNavRecord *FGNavList::findByFreq( double freq, TypeFilter* filter)
226 flightgear::NavDataCache* cache = flightgear::NavDataCache::instance();
227 int freqKhz = static_cast<int>(freq * 100 + 0.5);
228 PositionedIDVec stations(cache->findNavaidsByFreq(freqKhz, filter));
229 if (stations.empty()) {
233 BOOST_FOREACH(PositionedID id, stations) {
234 FGNavRecord* station = (FGNavRecord*) cache->loadById(id);
235 if (filter->pass(station)) {
243 nav_list_type FGNavList::findAllByFreq( double freq, const SGGeod& position,
246 nav_list_type stations;
248 flightgear::NavDataCache* cache = flightgear::NavDataCache::instance();
249 int freqKhz = static_cast<int>(freq * 1000 + 0.5);
250 PositionedIDVec ids(cache->findNavaidsByFreq(freqKhz, position, filter));
252 BOOST_FOREACH(PositionedID id, ids) {
253 FGNavRecord* station = (FGNavRecord*) cache->loadById(id);
254 if (!filter->pass(station)) {
258 stations.push_back(station);
264 nav_list_type FGNavList::findByIdentAndFreq(const string& ident, const double freq,
268 int f = (int)(freq*100.0 + 0.5);
270 FGPositioned::List stations = FGPositioned::findAllWithIdent(ident, filter);
271 BOOST_FOREACH(FGPositionedRef ref, stations) {
272 FGNavRecord* nav = static_cast<FGNavRecord*>(ref.ptr());
273 if ( f <= 0.0 || nav->get_freq() == f) {
274 reply.push_back( nav );
281 // Given an Ident and optional frequency and type ,
282 // return a list of matching stations sorted by distance to the given position
283 nav_list_type FGNavList::findByIdentAndFreq( const SGGeod & position,
284 const std::string& ident, const double freq,
287 nav_list_type reply = findByIdentAndFreq( ident, freq, filter );
288 NavRecordDistanceSortPredicate sortPredicate( position );
289 std::sort( reply.begin(), reply.end(), sortPredicate );
294 // FGTACANList ----------------------------------------------------------------
296 FGTACANList::FGTACANList( void )
301 FGTACANList::~FGTACANList( void )
306 bool FGTACANList::init()
312 // add an entry to the lists
313 bool FGTACANList::add( FGTACANRecord *c )
315 ident_channels[c->get_channel()].push_back(c);
320 // Given a TACAN Channel return the first matching frequency
321 FGTACANRecord *FGTACANList::findByChannel( const string& channel )
323 const tacan_list_type& stations = ident_channels[channel];
324 SG_LOG( SG_NAVAID, SG_DEBUG, "findByChannel " << channel<< " size " << stations.size() );
326 if (!stations.empty()) {