2002-06-07 21:03:27 +00:00
|
|
|
// navlist.cxx -- navaids management class
|
2000-04-21 04:19:22 +00:00
|
|
|
//
|
|
|
|
// Written by Curtis Olson, started April 2000.
|
|
|
|
//
|
|
|
|
// Copyright (C) 2000 Curtis L. Olson - curt@flightgear.org
|
|
|
|
//
|
|
|
|
// This program is free software; you can redistribute it and/or
|
|
|
|
// modify it under the terms of the GNU General Public License as
|
|
|
|
// published by the Free Software Foundation; either version 2 of the
|
|
|
|
// License, or (at your option) any later version.
|
|
|
|
//
|
|
|
|
// This program is distributed in the hope that it will be useful, but
|
|
|
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
// General Public License for more details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
|
|
// along with this program; if not, write to the Free Software
|
|
|
|
// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
//
|
|
|
|
// $Id$
|
|
|
|
|
|
|
|
|
2001-05-15 22:30:39 +00:00
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
# include <config.h>
|
|
|
|
#endif
|
|
|
|
|
2000-04-21 04:19:22 +00:00
|
|
|
#include <simgear/debug/logstream.hxx>
|
2001-03-25 14:20:12 +00:00
|
|
|
#include <simgear/misc/sgstream.hxx>
|
2000-09-27 20:16:22 +00:00
|
|
|
#include <simgear/math/sg_geodesy.hxx>
|
2000-04-21 04:19:22 +00:00
|
|
|
|
2000-04-21 16:03:36 +00:00
|
|
|
#include "navlist.hxx"
|
2000-04-21 04:19:22 +00:00
|
|
|
|
|
|
|
|
2000-04-24 23:51:56 +00:00
|
|
|
FGNavList *current_navlist;
|
|
|
|
|
|
|
|
|
2000-04-21 04:19:22 +00:00
|
|
|
// Constructor
|
2000-04-21 16:42:01 +00:00
|
|
|
FGNavList::FGNavList( void ) {
|
2000-04-21 04:19:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Destructor
|
2000-04-21 16:42:01 +00:00
|
|
|
FGNavList::~FGNavList( void ) {
|
2000-04-21 04:19:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// load the navaids and build the map
|
2001-03-25 14:20:12 +00:00
|
|
|
bool FGNavList::init( SGPath path ) {
|
2000-04-21 04:19:22 +00:00
|
|
|
|
|
|
|
navaids.erase( navaids.begin(), navaids.end() );
|
|
|
|
|
2001-03-25 14:20:12 +00:00
|
|
|
sg_gzifstream in( path.str() );
|
2000-04-21 04:19:22 +00:00
|
|
|
if ( !in.is_open() ) {
|
2001-03-24 06:03:11 +00:00
|
|
|
SG_LOG( SG_GENERAL, SG_ALERT, "Cannot open file: " << path.str() );
|
2000-04-21 04:19:22 +00:00
|
|
|
exit(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
// read in each line of the file
|
|
|
|
|
|
|
|
in >> skipeol;
|
|
|
|
in >> skipcomment;
|
|
|
|
|
2002-03-30 12:51:42 +00:00
|
|
|
// double min = 100000;
|
|
|
|
// double max = 0;
|
2000-04-21 04:19:22 +00:00
|
|
|
|
2002-03-30 12:51:42 +00:00
|
|
|
#ifdef __MWERKS__
|
2000-04-21 04:19:22 +00:00
|
|
|
char c = 0;
|
2002-03-30 12:51:42 +00:00
|
|
|
while ( in.get(c) && c != '\0' ) {
|
2000-04-21 04:19:22 +00:00
|
|
|
in.putback(c);
|
|
|
|
#else
|
2002-03-27 12:49:29 +00:00
|
|
|
while ( ! in.eof() ) {
|
2002-03-30 12:51:42 +00:00
|
|
|
#endif
|
2002-03-27 12:49:29 +00:00
|
|
|
|
2002-06-07 21:03:27 +00:00
|
|
|
FGNav *n = new FGNav;
|
|
|
|
in >> (*n);
|
|
|
|
if ( n->get_type() == '[' ) {
|
2002-03-27 12:49:29 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2000-04-21 04:19:22 +00:00
|
|
|
/* cout << "id = " << n.get_ident() << endl;
|
|
|
|
cout << " type = " << n.get_type() << endl;
|
|
|
|
cout << " lon = " << n.get_lon() << endl;
|
|
|
|
cout << " lat = " << n.get_lat() << endl;
|
|
|
|
cout << " elev = " << n.get_elev() << endl;
|
|
|
|
cout << " freq = " << n.get_freq() << endl;
|
2002-03-30 12:51:42 +00:00
|
|
|
cout << " range = " << n.get_range() << endl << endl; */
|
2002-03-27 12:49:29 +00:00
|
|
|
|
2002-06-07 21:03:27 +00:00
|
|
|
navaids [n->get_freq() ].push_back(n);
|
|
|
|
ident_navaids[n->get_ident()].push_back(n);
|
|
|
|
|
2000-04-21 04:19:22 +00:00
|
|
|
in >> skipcomment;
|
2000-04-25 17:33:13 +00:00
|
|
|
|
2002-03-30 12:51:42 +00:00
|
|
|
/* if ( n.get_type() != 'N' ) {
|
2000-04-25 17:33:13 +00:00
|
|
|
if ( n.get_freq() < min ) {
|
|
|
|
min = n.get_freq();
|
|
|
|
}
|
|
|
|
if ( n.get_freq() > max ) {
|
|
|
|
max = n.get_freq();
|
|
|
|
}
|
2002-03-30 12:51:42 +00:00
|
|
|
} */
|
2000-04-21 04:19:22 +00:00
|
|
|
}
|
|
|
|
|
2000-05-04 01:18:45 +00:00
|
|
|
// cout << "min freq = " << min << endl;
|
|
|
|
// cout << "max freq = " << max << endl;
|
2000-04-25 17:33:13 +00:00
|
|
|
|
2000-04-21 04:19:22 +00:00
|
|
|
return true;
|
|
|
|
}
|
2000-04-21 05:26:24 +00:00
|
|
|
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
// Query the database for the specified frequency. It is assumed that
|
|
|
|
// there will be multiple stations with matching frequencies so a
|
|
|
|
// position must be specified. Lon and lat are in degrees, elev is in
|
|
|
|
// meters.
|
|
|
|
FGNav *FGNavList::findByFreq( double freq, double lon, double lat, double elev )
|
2000-04-21 05:26:24 +00:00
|
|
|
{
|
2000-04-24 23:51:56 +00:00
|
|
|
nav_list_type stations = navaids[(int)(freq*100.0 + 0.5)];
|
2000-09-27 20:16:22 +00:00
|
|
|
Point3D aircraft = sgGeodToCart( Point3D(lon, lat, elev) );
|
2003-01-25 20:45:39 +00:00
|
|
|
|
|
|
|
return findNavFromList( aircraft, stations );
|
2002-06-07 21:03:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
FGNav *FGNavList::findByIdent( const char* ident,
|
|
|
|
const double lon, const double lat )
|
2002-06-07 21:03:27 +00:00
|
|
|
{
|
|
|
|
nav_list_type stations = ident_navaids[ident];
|
|
|
|
Point3D aircraft = sgGeodToCart( Point3D(lon, lat, 0.0) );
|
2003-01-25 20:45:39 +00:00
|
|
|
|
|
|
|
return findNavFromList( aircraft, stations );
|
2002-06-07 21:03:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
// Given an Ident and optional freqency, return the first matching
|
|
|
|
// station.
|
|
|
|
FGNav *FGNavList::findByIdentAndFreq( const char* ident, const double freq )
|
2003-01-05 00:10:36 +00:00
|
|
|
{
|
|
|
|
nav_list_type stations = ident_navaids[ident];
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
if ( freq > 0.0 ) {
|
|
|
|
// sometimes there can be duplicated idents. If a freq is
|
|
|
|
// specified, use it to refine the search.
|
2003-01-05 00:10:36 +00:00
|
|
|
int f = (int)(freq*100.0 + 0.5);
|
2003-01-25 20:45:39 +00:00
|
|
|
for ( unsigned int i = 0; i < stations.size(); ++i ) {
|
|
|
|
if ( f == stations[i]->get_freq() ) {
|
|
|
|
return stations[i];
|
2003-01-05 00:10:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
2003-01-25 20:45:39 +00:00
|
|
|
return stations[0];
|
2003-01-05 00:10:36 +00:00
|
|
|
}
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
return NULL;
|
2003-01-05 00:10:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
// Given a point and a list of stations, return the closest one to the
|
|
|
|
// specified point.
|
|
|
|
FGNav *FGNavList::findNavFromList( const Point3D &aircraft,
|
|
|
|
const nav_list_type &stations )
|
2002-06-07 21:03:27 +00:00
|
|
|
{
|
2003-01-25 20:45:39 +00:00
|
|
|
FGNav *nav = NULL;
|
2000-05-04 01:18:45 +00:00
|
|
|
Point3D station;
|
2002-09-02 05:31:46 +00:00
|
|
|
double d2;
|
2003-02-03 20:05:27 +00:00
|
|
|
double min_dist = 999999999.0;
|
2003-01-25 20:45:39 +00:00
|
|
|
|
|
|
|
// prime the pump with info from stations[0]
|
|
|
|
if ( stations.size() > 0 ) {
|
|
|
|
nav = stations[0];
|
|
|
|
station = Point3D( nav->get_x(), nav->get_y(), nav->get_z());
|
|
|
|
min_dist = aircraft.distance3Dsquared( station );
|
|
|
|
}
|
|
|
|
|
|
|
|
// check if any of the remaining stations are closer
|
|
|
|
for ( unsigned int i = 1; i < stations.size(); ++i ) {
|
2000-04-21 05:26:24 +00:00
|
|
|
// cout << "testing " << current->get_ident() << endl;
|
2003-02-03 20:05:27 +00:00
|
|
|
station = Point3D( stations[i]->get_x(),
|
|
|
|
stations[i]->get_y(),
|
|
|
|
stations[i]->get_z() );
|
2000-05-04 01:18:45 +00:00
|
|
|
|
2002-09-02 05:31:46 +00:00
|
|
|
d2 = aircraft.distance3Dsquared( station );
|
2000-05-04 01:18:45 +00:00
|
|
|
|
2000-05-14 01:41:11 +00:00
|
|
|
// cout << " dist = " << sqrt(d)
|
2002-06-07 21:03:27 +00:00
|
|
|
// << " range = " << current->get_range() * SG_NM_TO_METER
|
|
|
|
// << endl;
|
2001-03-14 07:25:14 +00:00
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
if ( d2 < min_dist ) {
|
|
|
|
min_dist = d2;
|
|
|
|
nav = stations[i];
|
|
|
|
}
|
2000-04-21 05:26:24 +00:00
|
|
|
}
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
return nav;
|
2000-04-21 05:26:24 +00:00
|
|
|
}
|