Home
last modified time | relevance | path

Searched refs:AStar (Results 1 – 25 of 62) sorted by relevance

123

/dports/devel/godot2-tools/godot-2.1.6-stable/core/math/
H A Da_star.cpp35 int AStar::get_available_point_id() const { in get_available_point_id()
61 Vector3 AStar::get_point_pos(int p_id) const { in get_point_pos()
67 float AStar::get_point_weight_scale(int p_id) const { in get_point_weight_scale()
73 void AStar::remove_point(int p_id) { in remove_point()
114 void AStar::disconnect_points(int p_id, int p_with_id) { in disconnect_points()
127 bool AStar::has_point(int p_id) const { in has_point()
138 void AStar::clear() { in clear()
293 float AStar::_compute_cost(int p_from_id, int p_to_id) { in _compute_cost()
402 void AStar::_bind_methods() { in _bind_methods()
427 AStar::AStar() { in AStar() function in AStar
[all …]
H A Da_star.h39 class AStar : public Reference {
41 OBJ_TYPE(AStar, Reference) in OBJ_TYPE() argument
121 AStar();
122 ~AStar();
/dports/devel/godot2/godot-2.1.6-stable/core/math/
H A Da_star.cpp35 int AStar::get_available_point_id() const { in get_available_point_id()
61 Vector3 AStar::get_point_pos(int p_id) const { in get_point_pos()
67 float AStar::get_point_weight_scale(int p_id) const { in get_point_weight_scale()
73 void AStar::remove_point(int p_id) { in remove_point()
114 void AStar::disconnect_points(int p_id, int p_with_id) { in disconnect_points()
127 bool AStar::has_point(int p_id) const { in has_point()
138 void AStar::clear() { in clear()
293 float AStar::_compute_cost(int p_from_id, int p_to_id) { in _compute_cost()
402 void AStar::_bind_methods() { in _bind_methods()
427 AStar::AStar() { in AStar() function in AStar
[all …]
H A Da_star.h39 class AStar : public Reference {
41 OBJ_TYPE(AStar, Reference) in OBJ_TYPE() argument
121 AStar();
122 ~AStar();
/dports/devel/godot/godot-3.2.3-stable/core/math/
H A Da_star.cpp262 void AStar::clear() { in clear()
587 AStar::AStar() { in AStar() function in AStar
592 AStar::~AStar() { in ~AStar()
693 AStar::Point *to_point; in _estimate_cost()
709 AStar::Point *to_point; in _compute_cost()
718 AStar::Point *a; in get_point_path()
722 AStar::Point *b; in get_point_path()
766 AStar::Point *a; in get_id_path()
770 AStar::Point *b; in get_id_path()
812 bool AStar2D::_solve(AStar::Point *begin_point, AStar::Point *end_point) { in _solve()
[all …]
H A Da_star.h43 class AStar : public Reference {
45 GDCLASS(AStar, Reference);
162 AStar();
163 ~AStar();
168 AStar astar;
170 bool _solve(AStar::Point *begin_point, AStar::Point *end_point);
/dports/devel/godot-tools/godot-3.2.3-stable/core/math/
H A Da_star.cpp262 void AStar::clear() { in clear()
587 AStar::AStar() { in AStar() function in AStar
592 AStar::~AStar() { in ~AStar()
693 AStar::Point *to_point; in _estimate_cost()
709 AStar::Point *to_point; in _compute_cost()
718 AStar::Point *a; in get_point_path()
722 AStar::Point *b; in get_point_path()
766 AStar::Point *a; in get_id_path()
770 AStar::Point *b; in get_id_path()
812 bool AStar2D::_solve(AStar::Point *begin_point, AStar::Point *end_point) { in _solve()
[all …]
H A Da_star.h43 class AStar : public Reference {
45 GDCLASS(AStar, Reference);
162 AStar();
163 ~AStar();
168 AStar astar;
170 bool _solve(AStar::Point *begin_point, AStar::Point *end_point);
/dports/cad/sumo/sumo-1.2.0/src/duarouter/
H A Dduarouter_main.cpp113 … typedef AStarRouter<ROEdge, ROVehicle, SUMOAbstractRouterPermissions<ROEdge, ROVehicle> > AStar; in computeRoutes() typedef
114 std::shared_ptr<const AStar::LookupTable> lookup; in computeRoutes()
116 …lookup = std::make_shared<const AStar::FLT>(oc.getString("astar.all-distances"), (int)ROEdge::getA… in computeRoutes()
122 …lookup = std::make_shared<const AStar::LMLT>(oc.getString("astar.landmark-distances"), ROEdge::get… in computeRoutes()
125 … router = new AStar(ROEdge::getAllEdges(), oc.getBool("ignore-errors"), ttFunction, lookup); in computeRoutes()
127 … typedef AStarRouter<ROEdge, ROVehicle, SUMOAbstractRouter<ROEdge, ROVehicle> > AStar; in computeRoutes() typedef
128 std::shared_ptr<const AStar::LookupTable> lookup; in computeRoutes()
130 …lookup = std::make_shared<const AStar::FLT>(oc.getString("astar.all-distances"), (int)ROEdge::getA… in computeRoutes()
136 …lookup = std::make_shared<const AStar::LMLT>(oc.getString("astar.landmark-distances"), ROEdge::get… in computeRoutes()
139 … router = new AStar(ROEdge::getAllEdges(), oc.getBool("ignore-errors"), ttFunction, lookup); in computeRoutes()
/dports/devel/p5-AI-Pathfinding-AStar/AI-Pathfinding-AStar-0.10/
H A DMANIFEST2 lib/AI/Pathfinding/AStar.pm
3 lib/AI/Pathfinding/AStar/AStarNode.pm
8 t/01_AI-Pathfinding-AStar.t
H A DREADME2 AI::Pathfinding::AStar - Perl implementation of the A* pathfinding
7 use base AI::Pathfinding::AStar;
9 # Methods required by AI::Pathfinding::AStar
33 AI::Pathfinding::AStar defines two other subs ("calcF" and "calcG")
36 AI::Pathfinding::AStar requires that the map object define a routine
52 As mentioned earlier, AI::Pathfinding::AStar provides two routines named
H A DMETA.yml3 name: AI-Pathfinding-AStar
5 version_from: lib/AI/Pathfinding/AStar.pm
/dports/devel/p5-AI-Pathfinding-AStar/AI-Pathfinding-AStar-0.10/lib/AI/Pathfinding/
H A DAStar.pm1 package AI::Pathfinding::AStar;
12 use AI::Pathfinding::AStar::AStarNode;
46 my $surr_node = AI::Pathfinding::AStar::AStarNode->new($surr_id,$G+$surr_cost,$surr_h);
93 $curr_node = AI::Pathfinding::AStar::AStarNode->new($start,0,0); # AStarNode(id,g,h)
122 $curr_node = AI::Pathfinding::AStar::AStarNode->new($start,0,0); # AStarNode(id,g,h)
/dports/cad/sumo/sumo-1.2.0/src/microsim/devices/
H A DMSRoutingEngine.cpp234 …ypedef AStarRouter<MSEdge, SUMOVehicle, SUMOAbstractRouterPermissions<MSEdge, SUMOVehicle> > AStar; in reroute() typedef
235 std::shared_ptr<const AStar::LookupTable> lookup; in reroute()
237 …lookup = std::make_shared<const AStar::FLT>(oc.getString("astar.all-distances"), (int)MSEdge::getA… in reroute()
245 …lookup = std::make_shared<const AStar::LMLT>(oc.getString("astar.landmark-distances"), MSEdge::get… in reroute()
248 … myRouter = new AStar(MSEdge::getAllEdges(), true, &MSRoutingEngine::getEffort, lookup); in reroute()
250 … typedef AStarRouter<MSEdge, SUMOVehicle, SUMOAbstractRouter<MSEdge, SUMOVehicle> > AStar; in reroute() typedef
251 std::shared_ptr<const AStar::LookupTable> lookup; in reroute()
253 …lookup = std::shared_ptr<const AStar::LookupTable> (new AStar::FLT(oc.getString("astar.all-distanc… in reroute()
261 …lookup = std::make_shared<const AStar::LMLT>(oc.getString("astar.landmark-distances"), MSEdge::get… in reroute()
264 … myRouter = new AStar(MSEdge::getAllEdges(), true, &MSRoutingEngine::getEffort, lookup); in reroute()
/dports/games/scourge/scourge/src/
H A Dastar.cpp193 AStar::AStar(){ in AStar() function in AStar
196 AStar::~AStar(){ in ~AStar()
212 void AStar::findPathToNearest( Sint16 sx, Sint16 sy, in findPathToNearest()
221 AStar::findPath(sx,sy,pVector,map,creature,player,maxNodes,ignoreParty,goal,heuristic); in findPathToNearest()
255 void AStar::findPath( Sint16 sx, Sint16 sy, in findPath()
414 bool AStar::isBlocked( Sint16 x, Sint16 y, in isBlocked()
453 bool AStar::isOutOfTheWay( Creature *a, vector<Location> *aPath, int aStart, Creature *b, vector<Lo… in isOutOfTheWay()
H A Dastar.h225 class AStar {
228 AStar();
229 ~AStar();
H A Dpathmanager.cpp74 …AStar::findPath( toint( owner->getX() ), toint( owner->getY() ), &path, map, owner, player, maxNod… in findPath()
94 …AStar::findPath( toint( owner->getX() ), toint( owner->getY() ), &path, map, owner, player, maxNod… in findPathToCreature()
113 …AStar::findPath( toint( owner->getX() ), toint( owner->getY() ), &path, map, owner, player, maxNod… in findPathAway()
159 if ( !AStar::isBlocked( x, y, owner, player, map, false ) ) { in addNextLocation()
246 …AStar::findPath( toint( owner->getX() ), toint( owner->getY() ), &path, map, owner, player, maxNod… in findPathOffLocations()
/dports/devel/p5-AI-Pathfinding-AStar/AI-Pathfinding-AStar-0.10/t/
H A D01_AI-Pathfinding-AStar.t3 package AI::Pathfinding::AStar::Test;
6 use base AI::Pathfinding::AStar;
85 #the routine required by AI::Pathfinding::AStar
112 ok($g = AI::Pathfinding::AStar::Test->new(), 'new()');
113 isa_ok($g, AI::Pathfinding::AStar, 'isa');
/dports/devel/p5-AI-Pathfinding-AStar/
H A D.license-catalog.mk9 _LICENSE_DISTFILES_ART10 =AI-Pathfinding-AStar-0.10.tar.gz
13 _LICENSE_DISTFILES_GPLv1+ =AI-Pathfinding-AStar-0.10.tar.gz
/dports/devel/godot-tools/godot-demo-projects-8d9d58f112d8/2d/navigation_astar/
H A Dpathfind_astar.gd16 # You can only create an AStar node from code, not from the Scene tab.
17 onready var astar_node = AStar.new()
56 # The AStar class references points with indices.
60 # AStar works for both 2d and 3d, so we have to convert the point
66 # Once you added all points to the AStar node, you've got to connect them.
H A DREADME.md3 This is an example of using AStar for navigation in 2D,
/dports/lang/rust/rustc-1.58.1-src/src/tools/rustfmt/tests/source/
H A Dissue-5011.rs6 pub(crate) struct AStar( struct
/dports/lang/rust/rustc-1.58.1-src/src/tools/rustfmt/tests/target/
H A Dissue-5011.rs6 pub(crate) struct AStar(/* hello */ i32); struct
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/openshift/api/vendor/gonum.org/v1/gonum/graph/path/
H A Dbench_test.go33 _, expanded = AStar(simple.Node(0), simple.Node(1), g, nil)
99 _, expanded = AStar(simple.Node(0), simple.Node(1), g, h)
/dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/graph/path/
H A Da_star_test.go130 pt, _ := AStar(simple.Node(test.s), simple.Node(test.t), test.g, test.heuristic)
200 pt, _ := AStar(start, goal, g, heuristic)
266 pt, _ = AStar(test.Query.From(), test.Query.To(), g.(graph.Graph), nil)

123