| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/algorithm/construct/ |
| H A D | LargestEmptyCircle.java | 81 private Geometry obstacles; field in LargestEmptyCircle
103 public LargestEmptyCircle(Geometry obstacles, double tolerance) { in LargestEmptyCircle() argument
104 if (obstacles.isEmpty()) { in LargestEmptyCircle()
108 this.obstacles = obstacles; in LargestEmptyCircle()
109 this.factory = obstacles.getFactory(); in LargestEmptyCircle()
111 obstacleDistance = new IndexedFacetDistance( obstacles ); in LargestEmptyCircle()
112 setBoundary(obstacles); in LargestEmptyCircle()
121 private void setBoundary(Geometry obstacles) { in setBoundary() argument
123 this.boundary = obstacles.convexHull(); in setBoundary()
201 Coordinate pt = obstacles.getCoordinate(); in compute()
[all …]
|
| /dports/games/freedroidrpg/freedroidrpg-0.16.1/map/ |
| H A D | lvledit_obstacle_categories.lua | 3 obstacles = {
131 obstacles = {
275 obstacles = {
397 obstacles = {
434 obstacles = {
459 obstacles = {
|
| /dports/games/fheroes2/fheroes2-0.9.11/src/fheroes2/world/ |
| H A D | world_regions.cpp | 171 TileDataVector obstacles[4]; in ComputeStaticAnalysis() local
173 obstacles[0].reserve( width ); in ComputeStaticAnalysis()
174 obstacles[2].reserve( width ); in ComputeStaticAnalysis()
179 obstacles[1].reserve( height ); in ComputeStaticAnalysis()
180 obstacles[3].reserve( height ); in ComputeStaticAnalysis()
194 ++obstacles[0][x].second; in ComputeStaticAnalysis()
195 ++obstacles[1][y].second; in ComputeStaticAnalysis()
196 ++obstacles[2][x].second; in ComputeStaticAnalysis()
197 ++obstacles[3][y].second; in ComputeStaticAnalysis()
201 ++obstacles[2][x].second; in ComputeStaticAnalysis()
[all …]
|
| /dports/games/nlarn/nlarn-NLarn-0.7.6/src/ |
| H A D | position.c | 322 g_assert(radius > 0 && obstacles != NULL); in area_new_circle_flooded()
328 obstacles = area_add(obstacles, area_new_circle(center, radius, TRUE)); in area_new_circle_flooded()
331 start_x = X(center) - obstacles->start_x; in area_new_circle_flooded()
332 start_y = Y(center) - obstacles->start_y; in area_new_circle_flooded()
446 g_assert (obstacles != NULL && area_point_valid(obstacles, start_x, start_y)); in area_flood()
448 area *flood = area_new(obstacles->start_x, obstacles->start_y, in area_flood()
449 obstacles->size_x, obstacles->size_y); in area_flood()
453 area_destroy(obstacles); in area_flood()
500 if (area_point_get(obstacles, x, y)) in area_flood_worker()
509 area_flood_worker(flood, obstacles, x + 1, y); in area_flood_worker()
[all …]
|
| /dports/games/sauerbraten/sauerbraten/src/fpsgame/ |
| H A D | ai.h | 68 vector<obstacle> obstacles; member
73 obstacles.setsize(0); in clear()
79 obstacles.add(obstacle(owner, above)); in add()
84 if(obstacles.empty() || owner != obstacles.last().owner) add(owner, above); in add()
85 obstacles.last().numwaypoints++; in add()
92 loopv(avoid.obstacles) in add()
94 obstacle &o = avoid.obstacles[i]; in add()
95 if(obstacles.empty() || o.owner != obstacles.last().owner) add(o.owner, o.above); in add()
103 if(!(v).obstacles.empty()) \
106 loopv((v).obstacles) \
[all …]
|
| /dports/games/dhewm3/dhewm3-1.5.1/neo/game/ai/ |
| H A D | AI_pathing.cpp | 137 const idVec2 *bounds = obstacles[i].bounds; in PointInsideObstacle()
222 w1 = obstacles[i].winding; in GetPointOutsideObstacles()
231 …if ( obstacles[j].bounds[0].x > obstacles[i].bounds[1].x || obstacles[j].bounds[0].y > obstacles[i… in GetPointOutsideObstacles()
232 …obstacles[j].bounds[1].x < obstacles[i].bounds[0].x || obstacles[j].bounds[1].y < obstacles[i].bou… in GetPointOutsideObstacles()
239 w2 = obstacles[j].winding; in GetPointOutsideObstacles()
299 if ( bounds[0].x > obstacles[i].bounds[1].x || bounds[0].y > obstacles[i].bounds[1].y || in GetFirstBlockingObstacle()
300 bounds[1].x < obstacles[i].bounds[0].x || bounds[1].y < obstacles[i].bounds[0].y ) { in GetFirstBlockingObstacle()
481 obstacle_t &obstacle = obstacles[i]; in GetObstacles()
791 if ( bounds[0].x > obstacles[i].bounds[1].x || bounds[0].y > obstacles[i].bounds[1].y || in OptimizePath()
792 bounds[1].x < obstacles[i].bounds[0].x || bounds[1].y < obstacles[i].bounds[0].y ) { in OptimizePath()
[all …]
|
| /dports/games/dhewm3/dhewm3-1.5.1/neo/d3xp/ai/ |
| H A D | AI_pathing.cpp | 135 const idVec2 *bounds = obstacles[i].bounds; in PointInsideObstacle()
220 w1 = obstacles[i].winding; in GetPointOutsideObstacles()
229 …if ( obstacles[j].bounds[0].x > obstacles[i].bounds[1].x || obstacles[j].bounds[0].y > obstacles[i… in GetPointOutsideObstacles()
230 …obstacles[j].bounds[1].x < obstacles[i].bounds[0].x || obstacles[j].bounds[1].y < obstacles[i].bou… in GetPointOutsideObstacles()
237 w2 = obstacles[j].winding; in GetPointOutsideObstacles()
297 if ( bounds[0].x > obstacles[i].bounds[1].x || bounds[0].y > obstacles[i].bounds[1].y || in GetFirstBlockingObstacle()
298 bounds[1].x < obstacles[i].bounds[0].x || bounds[1].y < obstacles[i].bounds[0].y ) { in GetFirstBlockingObstacle()
479 obstacle_t &obstacle = obstacles[i]; in GetObstacles()
788 if ( bounds[0].x > obstacles[i].bounds[1].x || bounds[0].y > obstacles[i].bounds[1].y || in OptimizePath()
789 bounds[1].x < obstacles[i].bounds[0].x || bounds[1].y < obstacles[i].bounds[0].y ) { in OptimizePath()
[all …]
|
| /dports/games/tesseract-data/tesseract/src/game/ |
| H A D | ai.h | 68 vector<obstacle> obstacles; member
73 obstacles.setsize(0); in clear()
79 obstacles.add(obstacle(owner, above)); in add()
84 if(obstacles.empty() || owner != obstacles.last().owner) add(owner, above); in add()
85 obstacles.last().numwaypoints++; in add()
92 loopv(avoid.obstacles) in add()
94 obstacle &o = avoid.obstacles[i]; in add()
95 if(obstacles.empty() || o.owner != obstacles.last().owner) add(o.owner, o.above); in add()
103 if(!(v).obstacles.empty()) \
106 loopv((v).obstacles) \
[all …]
|
| /dports/games/tesseract/tesseract/src/game/ |
| H A D | ai.h | 68 vector<obstacle> obstacles; member
73 obstacles.setsize(0); in clear()
79 obstacles.add(obstacle(owner, above)); in add()
84 if(obstacles.empty() || owner != obstacles.last().owner) add(owner, above); in add()
85 obstacles.last().numwaypoints++; in add()
92 loopv(avoid.obstacles) in add()
94 obstacle &o = avoid.obstacles[i]; in add()
95 if(obstacles.empty() || o.owner != obstacles.last().owner) add(o.owner, o.above); in add()
103 if(!(v).obstacles.empty()) \
106 loopv((v).obstacles) \
[all …]
|
| /dports/games/redeclipse/base-2.0.0/src/game/ |
| H A D | ai.h | 83 vector<obstacle> obstacles; member
88 obstacles.setsize(0); in clear()
94 obstacles.add(obstacle(owner, above)); in add()
99 if(obstacles.empty() || owner != obstacles.last().owner) add(owner, above); in add()
100 obstacles.last().numwaypoints++; in add()
107 loopv(avoid.obstacles) in add()
109 obstacle &o = avoid.obstacles[i]; in add()
110 if(obstacles.empty() || o.owner != obstacles.last().owner) add(o.owner, o.above); in add()
118 if(!(v).obstacles.empty()) \
121 loopv((v).obstacles) \
[all …]
|
| /dports/games/redeclipse16/base-1.6.0/src/game/ |
| H A D | ai.h | 84 vector<obstacle> obstacles; member
89 obstacles.setsize(0); in clear()
95 obstacles.add(obstacle(owner, above)); in add()
100 if(obstacles.empty() || owner != obstacles.last().owner) add(owner, above); in add()
101 obstacles.last().numwaypoints++; in add()
108 loopv(avoid.obstacles) in add()
110 obstacle &o = avoid.obstacles[i]; in add()
111 if(obstacles.empty() || o.owner != obstacles.last().owner) add(o.owner, o.above); in add()
119 if(!(v).obstacles.empty()) \
122 loopv((v).obstacles) \
[all …]
|
| /dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/app/assets/javascripts/members/components/modals/ |
| H A D | leave_modal.vue | 47 obstacles() {
51 return this.obstacles?.length;
78 <user-deletion-obstacles-list
80 :obstacles="obstacles"
|
| /dports/graphics/libcaca/libcaca-0.99.beta19/examples/ |
| H A D | conio-snake.cpp | 37 int score, snake_length, speed, obstacles, level, firstpress, high_score=0; variable
52 obstacles=4; level=1; score=0; speed=14; in main()
113 score+=snake_length*obstacles; show_score(); snake_length++; add_segment(); in main()
117 score+=level*1000; obstacles+=2; level++; /* add to obstacles */ in main()
149 for(int i=0;i<obstacles*2;i++) in setup_level()
153 if(i<obstacles) in setup_level()
|
| /dports/misc/ompl/ompl-1.5.2/demos/PlanarManipulator/ |
| H A D | visualize.py | 129 def plotObstacles(axes, obstacles, bounds): argument
130 for k, v in obstacles.items():
158 def plotChainFrame(frame_num, ax, path, obstacles, bounds, origin, rate, slices): argument
160 plotObstacles(ax, obstacles, bounds)
173 def AnimatePath(obstacles, bounds, numLinks, linkLength, origin, path, slices): argument
182 fargs=[axes, path, obstacles, bounds, origin, slices, framerate],
|
| /dports/games/tanks-of-freedom/Tanks-of-Freedom-0.7.0-beta/scripts/ai/actions/brains/ |
| H A D | unit_brain.gd | 56 var obstacles = {}
101 obstacles = base_obstacles.keys()
102 obstacles.erase(enemy.position_on_map)
103 self.bag.ai.pathfinder.set_obstacles(obstacles)
146 var obstacles = {}
166 obstacles = base_obstacles.keys()
167 obstacles.erase(target.position_on_map)
168 self.bag.ai.pathfinder.set_obstacles(obstacles)
|
| /dports/games/tanks-of-freedom/Tanks-of-Freedom-0.7.0-beta/scripts/ai/ |
| H A D | a_star.gd | 4 var map_grid = {} #grid with obstacles and stuff
8 var obstacles = []
62 for id in self.bag.helpers.array_diff(self.obstacles, self.new_obstacles):
64 for id in self.bag.helpers.array_diff(self.new_obstacles, self.obstacles):
67 self.obstacles = Array(self.new_obstacles)
74 for id in self.bag.helpers.array_diff(self.obstacles, self.new_obstacles):
79 self.obstacles = Array(self.new_obstacles)
154 self.obstacles.clear()
|
| /dports/science/simbody/simbody-Simbody-3.7/Simbody/src/ |
| H A D | CablePath_Impl.h | 69 (const Array_<CableObstacle,CableObstacleIndex>& obstacles);
390 int getNumObstacles() const {return obstacles.size();} in getNumObstacles()
392 { return obstacles[ix]; } in getObstacle()
394 { return obstacles[ix].getImpl(); } in getObstacleImpl()
400 { if (obstacles.size() < 2) { in adoptObstacle()
401 obstacles.push_back(obstacle); in adoptObstacle()
402 return CableObstacleIndex(obstacles.size()-1); in adoptObstacle()
404 obstacles.insert(obstacles.end()-1, obstacle); in adoptObstacle()
406 obstacles.back().updImpl().setCableObstacleIndex(obstacles.size()-1); in adoptObstacle()
407 return CableObstacleIndex(obstacles.size()-2); in adoptObstacle()
[all …]
|
| /dports/games/legesmotus/legesmotus-0.4.0/data/maps/ |
| H A D | gamma3.map | 31 FORCE 0,512 - circle:512 frozen sucks-off-obstacles gravity=-200
33 FORCE 2048,512 - circle:512 frozen sucks-off-obstacles gravity=-200
60 # Big center obstacles
69 # Random small obstacles
|
| /dports/graphics/geos/geos-3.9.1/src/algorithm/construct/ |
| H A D | LargestEmptyCircle.cpp | 52 , obstacles(p_obstacles) in LargestEmptyCircle()
66 if (obstacles->isEmpty()) { in LargestEmptyCircle()
72 if (!boundary->covers(obstacles)) { in LargestEmptyCircle()
225 const Coordinate* pt = obstacles->getCoordinate(); in compute()
234 createInitialGrid(obstacles->getEnvelopeInternal(), cellQueue); in compute()
236 Cell farthestCell = createCentroidCell(obstacles); in compute()
|
| /dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/app/assets/javascripts/admin/users/components/modals/ |
| H A D | delete_user_modal.vue | 72 obstacles() {
118 <user-deletion-obstacles-list
119 v-if="obstacles.length"
120 :obstacles="obstacles"
|
| /dports/graphics/qgis/qgis-3.22.3/python/core/auto_generated/labeling/ |
| H A D | qgslabelobstaclesettings.sip.in | 16 Contains settings related to how the label engine treats features as obstacles
35 Returns ``True`` if the features are obstacles to labels of other layers.
46 Sets whether features are obstacles to labels of other layers.
81 Returns how features act as obstacles for labels.
92 Controls how features act as obstacles for labels.
|
| /dports/graphics/qgis-ltr/qgis-3.16.16/python/core/auto_generated/labeling/ |
| H A D | qgslabelobstaclesettings.sip.in | 16 Contains settings related to how the label engine treats features as obstacles
35 Returns ``True`` if the features are obstacles to labels of other layers.
46 Sets whether features are obstacles to labels of other layers.
81 Returns how features act as obstacles for labels.
92 Controls how features act as obstacles for labels.
|
| /dports/misc/ompl/ompl-1.5.2/demos/constraint/ |
| H A D | ConstrainedPlanningImplicitChain.py | 102 def __init__(self, links, obstacles=0, extra=1): argument
109 self.obstacles = obstacles
111 step = 2. * self.radius / (obstacles + 1.)
114 for i in range(obstacles)]
279 print(self.obstacles, file=outfile)
289 "obstacles", "INTEGER", str(self.obstacles))
318 options.links, options.obstacles, options.extra)
|
| /dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/spec/frontend/admin/users/components/modals/__snapshots__/ |
| H A D | delete_user_modal_spec.js.snap | 11 <user-deletion-obstacles-list-stub
12 obstacles="schedule1,policy1"
88 <user-deletion-obstacles-list-stub
89 obstacles="schedule1,policy1"
|
| /dports/games/quantumminigolf/quantumminigolf-1.1.1.src/ |
| H A D | README | 11 ball can be at several places at once and diffract around obstacles.
69 some obstacles. Purely white obstacles (i.e. obstacles with color
70 rgb(255,255,255)) are infinitely high. Gray obstacles have a finite
|