1 // positioned.cxx - base class for objects which are positioned
3 // Copyright (C) 2008 James Turner
5 // This program is free software; you can redistribute it and/or
6 // modify it under the terms of the GNU General Public License as
7 // published by the Free Software Foundation; either version 2 of the
8 // License, or (at your option) any later version.
10 // This program is distributed in the hope that it will be useful, but
11 // WITHOUT ANY WARRANTY; without even the implied warranty of
12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 // General Public License for more details.
15 // You should have received a copy of the GNU General Public License
16 // along with this program; if not, write to the Free Software
17 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
25 #include "positioned.hxx"
29 #include <algorithm> // for sort
33 #include <boost/algorithm/string/case_conv.hpp>
34 #include <boost/algorithm/string/predicate.hpp>
36 #include <simgear/timing/timestamp.hxx>
37 #include <simgear/debug/logstream.hxx>
38 #include <simgear/structure/exception.hxx>
39 #include <simgear/math/SGGeometry.hxx>
40 #include <simgear/sg_inlines.h>
42 #include "Navaids/PositionedOctree.hxx"
45 using namespace flightgear;
47 static void validateSGGeod(const SGGeod& geod)
49 if (SGMisc<double>::isNaN(geod.getLatitudeDeg()) ||
50 SGMisc<double>::isNaN(geod.getLongitudeDeg()))
52 throw sg_range_exception("position is invalid, NaNs");
57 ///////////////////////////////////////////////////////////////////////////////
59 FGPositioned::FGPositioned(PositionedID aGuid, Type ty, const std::string& aIdent, const SGGeod& aPos) :
62 mCart(SGVec3d::fromGeod(mPosition)),
68 FGPositioned::~FGPositioned()
70 // std::cout << "destroying:" << mIdent << "/" << nameForType(mType) << std::endl;
74 FGPositioned::createUserWaypoint(const std::string& aIdent, const SGGeod& aPos)
76 NavDataCache* cache = NavDataCache::instance();
77 TypeFilter filter(WAYPOINT);
78 FGPositioned::List existing = cache->findAllWithIdent(aIdent, &filter, true);
79 if (!existing.empty()) {
80 SG_LOG(SG_NAVAID, SG_WARN, "attempt to insert duplicate WAYPOINT:" << aIdent);
81 return existing.front().ptr();
84 PositionedID id = cache->createPOI(WAYPOINT, aIdent, aPos);
85 return cache->loadById(id);
88 void FGPositioned::deleteUserWaypoint(const std::string& aIdent)
90 NavDataCache* cache = NavDataCache::instance();
91 cache->removePOI(WAYPOINT, aIdent);
96 FGPositioned::cart() const
101 FGPositioned::Type FGPositioned::typeFromName(const std::string& aName)
103 if (aName.empty() || (aName == "")) {
112 const NameTypeEntry names[] = {
113 {"airport", AIRPORT},
125 {"tower", FREQ_TOWER},
126 {"ground", FREQ_GROUND},
127 {"approach", FREQ_APP_DEP},
128 {"departure", FREQ_APP_DEP},
130 {"helipad", HELIPAD},
131 {"country", COUNTRY},
136 {"gnd", FREQ_GROUND},
138 {"waypoint", WAYPOINT},
148 std::string lowerName(boost::to_lower_copy(aName));
150 for (const NameTypeEntry* n = names; (n->_name != NULL); ++n) {
151 if (::strcmp(n->_name, lowerName.c_str()) == 0) {
156 SG_LOG(SG_NAVAID, SG_WARN, "FGPositioned::typeFromName: couldn't match:" << aName);
160 const char* FGPositioned::nameForType(Type aTy)
163 case RUNWAY: return "runway";
164 case HELIPAD: return "helipad";
165 case TAXIWAY: return "taxiway";
166 case PAVEMENT: return "pavement";
167 case PARKING: return "parking stand";
168 case FIX: return "fix";
169 case VOR: return "VOR";
170 case NDB: return "NDB";
171 case ILS: return "ILS";
172 case LOC: return "localiser";
173 case GS: return "glideslope";
174 case OM: return "outer-marker";
175 case MM: return "middle-marker";
176 case IM: return "inner-marker";
177 case AIRPORT: return "airport";
178 case HELIPORT: return "heliport";
179 case SEAPORT: return "seaport";
180 case WAYPOINT: return "waypoint";
181 case DME: return "dme";
182 case TACAN: return "tacan";
183 case FREQ_TOWER: return "tower";
184 case FREQ_ATIS: return "atis";
185 case FREQ_AWOS: return "awos";
186 case FREQ_GROUND: return "ground";
187 case FREQ_CLEARANCE: return "clearance";
188 case FREQ_UNICOM: return "unicom";
189 case FREQ_APP_DEP: return "approach-departure";
190 case TAXI_NODE: return "taxi-node";
191 case COUNTRY: return "country";
192 case CITY: return "city";
193 case TOWN: return "town";
199 ///////////////////////////////////////////////////////////////////////////////
200 // search / query functions
203 FGPositioned::findClosestWithIdent(const std::string& aIdent, const SGGeod& aPos, Filter* aFilter)
205 validateSGGeod(aPos);
206 return NavDataCache::instance()->findClosestWithIdent(aIdent, aPos, aFilter);
210 FGPositioned::findFirstWithIdent(const std::string& aIdent, Filter* aFilter)
212 if (aIdent.empty()) {
216 List r = NavDataCache::instance()->findAllWithIdent(aIdent, aFilter, true);
225 FGPositioned::findWithinRange(const SGGeod& aPos, double aRangeNm, Filter* aFilter)
227 validateSGGeod(aPos);
230 Octree::findAllWithinRange(SGVec3d::fromGeod(aPos),
231 aRangeNm * SG_NM_TO_METER, aFilter, result, 0xffffff);
236 FGPositioned::findWithinRangePartial(const SGGeod& aPos, double aRangeNm, Filter* aFilter, bool& aPartial)
238 validateSGGeod(aPos);
242 aPartial = Octree::findAllWithinRange(SGVec3d::fromGeod(aPos),
243 aRangeNm * SG_NM_TO_METER, aFilter, result,
249 FGPositioned::findAllWithIdent(const std::string& aIdent, Filter* aFilter, bool aExact)
251 return NavDataCache::instance()->findAllWithIdent(aIdent, aFilter, aExact);
255 FGPositioned::findAllWithName(const std::string& aName, Filter* aFilter, bool aExact)
257 return NavDataCache::instance()->findAllWithName(aName, aFilter, aExact);
261 FGPositioned::findClosest(const SGGeod& aPos, double aCutoffNm, Filter* aFilter)
263 validateSGGeod(aPos);
265 List l(findClosestN(aPos, 1, aCutoffNm, aFilter));
270 assert(l.size() == 1);
275 FGPositioned::findClosestN(const SGGeod& aPos, unsigned int aN, double aCutoffNm, Filter* aFilter)
277 validateSGGeod(aPos);
280 int limitMsec = 0xffff;
281 Octree::findNearestN(SGVec3d::fromGeod(aPos), aN, aCutoffNm * SG_NM_TO_METER, aFilter, result, limitMsec);
286 FGPositioned::findClosestNPartial(const SGGeod& aPos, unsigned int aN, double aCutoffNm, Filter* aFilter, bool &aPartial)
288 validateSGGeod(aPos);
292 aPartial = Octree::findNearestN(SGVec3d::fromGeod(aPos), aN, aCutoffNm * SG_NM_TO_METER, aFilter, result,
298 FGPositioned::sortByRange(List& aResult, const SGGeod& aPos)
300 validateSGGeod(aPos);
302 SGVec3d cartPos(SGVec3d::fromGeod(aPos));
303 // computer ordering values
304 Octree::FindNearestResults r;
305 List::iterator it = aResult.begin(), lend = aResult.end();
306 for (; it != lend; ++it) {
307 double d2 = distSqr((*it)->cart(), cartPos);
308 r.push_back(Octree::OrderedPositioned(*it, d2));
312 std::sort(r.begin(), r.end());
314 // convert to a plain list
315 unsigned int count = aResult.size();
316 for (unsigned int i=0; i<count; ++i) {
317 aResult[i] = r[i].get();
321 void FGPositioned::modifyPosition(const SGGeod& newPos)
323 const_cast<SGGeod&>(mPosition) = newPos;
324 const_cast<SGVec3d&>(mCart) = SGVec3d::fromGeod(newPos);
327 FGPositioned::TypeFilter::TypeFilter(Type aTy) :
334 void FGPositioned::TypeFilter::addType(Type aTy)
336 if (aTy == INVALID) {
340 types.push_back(aTy);
341 mMinType = std::min(mMinType, aTy);
342 mMaxType = std::max(mMaxType, aTy);
346 FGPositioned::TypeFilter::pass(FGPositioned* aPos) const
352 std::vector<Type>::const_iterator it = types.begin(),
354 for (; it != end; ++it) {
355 return aPos->type() == *it;