mirror of
https://github.com/ArduPilot/ardupilot
synced 2025-01-02 14:13:42 -04:00
9aeac012d2
AP_OABendyRuler: support exclusion polygons AP_OADijkstra: support exclusion polygons AC_Avoid: adjust_velocity supports exclusion polygons AC_Avoidance: handle fence::get_boundary_points returning nullptr instead of setting num_points to zero AC_Avoidance: Dijkstra's works with only exclusion polygons AC_Avoidance: Dijkstra: check for fence counts instead of polyfence validity We really only care whether fences can be returned - and they won't be returned unless they are valid AC_Avoidance: BendyRuler: just try to get inclusion fence rather than checking validity AC_Avoidance: BendyRuler supports exclusion circles AC_Avoid: Dijkstra support for exclusion circles AC_Avoid: BendyRuler support for inclusion circles AC_Avoid: stop an inclusion/exclusion circular fences AC_Avoid: stop at inclusion/exclusion circular fences AC_Avoid: fixes to Dijkstra's use of inclusion/exclusion circles and polygons AP_Avoidance: take semaphores when interacting with AHRS and polyfence AC_Avoid: Dijkstra's fix for some_fences_enabled inclusion circles
42 lines
1.3 KiB
C++
42 lines
1.3 KiB
C++
/*
|
|
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 3 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, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "AP_OAVisGraph.h"
|
|
|
|
// constructor initialises expanding array to use 20 elements per chunk
|
|
AP_OAVisGraph::AP_OAVisGraph() :
|
|
_items(20)
|
|
{
|
|
}
|
|
|
|
// add item to visiblity graph, returns true on success, false if graph is full
|
|
bool AP_OAVisGraph::add_item(const OAItemID &id1, const OAItemID &id2, float distance_cm)
|
|
{
|
|
// no more than 65k items
|
|
if (_num_items == UINT16_MAX) {
|
|
return false;
|
|
}
|
|
|
|
// ensure there is space in the array
|
|
if (!_items.expand_to_hold(_num_items+1)) {
|
|
return false;
|
|
}
|
|
|
|
// add item
|
|
_items[_num_items] = {id1, id2, distance_cm};
|
|
_num_items++;
|
|
return true;
|
|
}
|