void scan_airspaces(const AircraftState state,
const Airspaces& airspaces,
const AirspaceAircraftPerformance& perf,
bool do_report,
const GeoPoint &target)
{
const fixed range(20000.0);
Directory::Create(Path(_T("output/results")));
{
AirspaceVisitorPrint pvisitor("output/results/res-bb-range.txt",
do_report);
for (const auto &i : airspaces.QueryWithinRange(state.location, range)) {
const AbstractAirspace &airspace = i.GetAirspace();
pvisitor.Visit(airspace);
}
}
{
AirspaceVisitorClosest pvisitor("output/results/res-bb-closest.txt",
airspaces.GetProjection(), state, perf);
for (const auto &i : airspaces.QueryWithinRange(state.location, range)) {
const AbstractAirspace &airspace = i.GetAirspace();
pvisitor.Visit(airspace);
}
}
{
AirspaceVisitorPrint pvi("output/results/res-bb-inside.txt",
do_report);
for (const auto &a : airspaces.QueryInside(state))
pvi.Visit(a.GetAirspace());
}
{
AirspaceIntersectionVisitorPrint ivisitor("output/results/res-bb-intersects.txt",
"output/results/res-bb-intersected.txt",
"output/results/res-bb-intercepts.txt",
do_report,
state, perf);
airspaces.VisitIntersecting(state.location, target, ivisitor);
}
{
const auto *as = FindSoonestAirspace(airspaces, state, perf,
AirspacePredicateTrue());
if (do_report) {
std::ofstream fout("output/results/res-bb-sortedsoonest.txt");
if (as) {
fout << *as << "\n";
} else {
fout << "# no soonest found\n";
}
}
}
}
void scan_airspaces(const AircraftState state,
const Airspaces& airspaces,
const AirspaceAircraftPerformance& perf,
bool do_report,
const GeoPoint &target)
{
const fixed range(20000.0);
Directory::Create(Path(_T("output/results")));
{
AirspaceVisitorPrint pvisitor("output/results/res-bb-range.txt",
do_report);
airspaces.VisitWithinRange(state.location, range, pvisitor);
}
{
AirspaceVisitorClosest pvisitor("output/results/res-bb-closest.txt",
airspaces.GetProjection(), state, perf);
airspaces.VisitWithinRange(state.location, range, pvisitor);
}
{
const std::vector<Airspace> vi = airspaces.FindInside(state);
AirspaceVisitorPrint pvi("output/results/res-bb-inside.txt",
do_report);
std::for_each(vi.begin(), vi.end(), CallVisitor<AirspaceVisitor>(pvi));
}
{
AirspaceIntersectionVisitorPrint ivisitor("output/results/res-bb-intersects.txt",
"output/results/res-bb-intersected.txt",
"output/results/res-bb-intercepts.txt",
do_report,
state, perf);
airspaces.VisitIntersecting(state.location, target, ivisitor);
}
{
const auto *as = FindSoonestAirspace(airspaces, state, perf,
AirspacePredicateTrue());
if (do_report) {
std::ofstream fout("output/results/res-bb-sortedsoonest.txt");
if (as) {
fout << *as << "\n";
} else {
fout << "# no soonest found\n";
}
}
}
}
void
AirspaceRenderer::Draw(Canvas &canvas,
#ifndef ENABLE_OPENGL
Canvas &stencil_canvas,
#endif
const WindowProjection &projection,
const AirspaceRendererSettings &settings)
{
if (airspaces == NULL)
return;
AirspaceWarningCopy awc;
if (warning_manager != NULL)
awc.Visit(*warning_manager);
Draw(canvas,
#ifndef ENABLE_OPENGL
stencil_canvas,
#endif
projection, settings, awc, AirspacePredicateTrue());
}
void
AirspaceRenderer::Draw(Canvas &canvas,
#ifndef ENABLE_OPENGL
Canvas &buffer_canvas, Canvas &stencil_canvas,
#endif
const WindowProjection &projection,
const AirspaceRendererSettings &settings)
{
if (airspace_database == NULL)
return;
AirspaceWarningCopy awc;
if (airspace_warnings != NULL)
awc.Visit(*airspace_warnings);
Draw(canvas,
#ifndef ENABLE_OPENGL
buffer_canvas, stencil_canvas,
#endif
projection, settings, awc, AirspacePredicateTrue());
}
/* Copyright_License {
XCSoar Glide Computer - http://www.xcsoar.org/
Copyright (C) 2000-2016 The XCSoar Project
A detailed list of copyright holders can be found in the file "AUTHORS".
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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
}
*/
#include "AirspacePredicate.hpp"
/* needs explicit initialization, or clang will complain */
const AirspacePredicateTrue AirspacePredicate::always_true =
AirspacePredicateTrue();
static bool
test_route(const unsigned n_airspaces, const RasterMap& map)
{
Airspaces airspaces;
setup_airspaces(airspaces, map.GetMapCenter(), n_airspaces);
{
Directory::Create(Path(_T("output/results")));
std::ofstream fout("output/results/terrain.txt");
unsigned nx = 100;
unsigned ny = 100;
GeoPoint origin(map.GetMapCenter());
for (unsigned i = 0; i < nx; ++i) {
for (unsigned j = 0; j < ny; ++j) {
auto fx = (double)i / (nx - 1) * 2 - 1;
auto fy = (double)j / (ny - 1) * 2 - 1;
GeoPoint x(origin.longitude + Angle::Degrees(0.2 + 0.7 * fx),
origin.latitude + Angle::Degrees(0.9 * fy));
auto h = map.GetInterpolatedHeight(x);
fout << x.longitude.Degrees() << " " << x.latitude.Degrees()
<< " " << h.GetValue() << "\n";
}
fout << "\n";
}
fout << "\n";
}
{
// local scope, see what happens when we go out of scope
GeoPoint p_start(Angle::Degrees(-0.3), Angle::Degrees(0.0));
p_start += map.GetMapCenter();
GeoPoint p_dest(Angle::Degrees(0.8), Angle::Degrees(-0.7));
p_dest += map.GetMapCenter();
AGeoPoint loc_start(p_start, map.GetHeight(p_start).GetValueOr0() + 100);
AGeoPoint loc_end(p_dest, map.GetHeight(p_dest).GetValueOr0() + 100);
AircraftState state;
GlidePolar glide_polar(0.1);
const AirspaceAircraftPerformance perf(glide_polar);
GeoVector vec(loc_start, loc_end);
auto range = 10000 + vec.distance / 2;
state.location = loc_start;
state.altitude = loc_start.altitude;
{
Airspaces as_route(false);
// dummy
// real one, see if items changed
as_route.SynchroniseInRange(airspaces, vec.MidPoint(loc_start), range,
AirspacePredicateTrue());
int size_1 = as_route.GetSize();
if (verbose)
printf("# route airspace size %d\n", size_1);
as_route.SynchroniseInRange(airspaces, vec.MidPoint(loc_start), 1,
AirspacePredicateTrue());
int size_2 = as_route.GetSize();
if (verbose)
printf("# route airspace size %d\n", size_2);
ok(size_2 < size_1, "shrink as", 0);
// go back
as_route.SynchroniseInRange(airspaces, vec.MidPoint(loc_end), range,
AirspacePredicateTrue());
int size_3 = as_route.GetSize();
if (verbose)
printf("# route airspace size %d\n", size_3);
ok(size_3 >= size_2, "grow as", 0);
// and again
as_route.SynchroniseInRange(airspaces, vec.MidPoint(loc_start), range,
AirspacePredicateTrue());
int size_4 = as_route.GetSize();
if (verbose)
printf("# route airspace size %d\n", size_4);
ok(size_4 >= size_3, "grow as", 0);
scan_airspaces(state, as_route, perf, true, loc_end);
}
// try the solver
SpeedVector wind(Angle::Degrees(0), 0);
GlidePolar polar(1);
GlideSettings settings;
settings.SetDefaults();
RoutePlannerConfig config;
config.mode = RoutePlannerConfig::Mode::BOTH;
AirspaceRoute route;
route.UpdatePolar(settings, config, polar, polar, wind);
route.SetTerrain(&map);
AirspacePredicateTrue predicate;
bool sol = false;
for (int i = 0; i < NUM_SOL; i++) {
loc_end.latitude += Angle::Degrees(0.1);
loc_end.altitude = map.GetHeight(loc_end).GetValueOr0() + 100;
route.Synchronise(airspaces, predicate, loc_start, loc_end);
if (route.Solve(loc_start, loc_end, config)) {
sol = true;
if (verbose) {
PrintHelper::print_route(route);
}
} else {
if (verbose) {
printf("# fail\n");
}
sol = false;
}
char buffer[80];
sprintf(buffer, "route %d solution", i);
ok(sol, buffer, 0);
}
}
return true;
}