3030 * Pos(middle), Pos(end1) and Pos(end2).<br>
3131 * ChokePoints play an important role in BWEM:<br>
3232 * - they define accessibility between Areas.<br>
33- * - the Paths provided by BWEMMap ::GetPath are made of ChokePoints.<br>
33+ * - the Paths provided by BWMap ::GetPath are made of ChokePoints.<br>
3434 * Like Areas and Bases, the number and the addresses of ChokePoint instances remain unchanged.<br>
3535 * <br>
3636 * Pseudo ChokePoints:<br>
@@ -99,7 +99,7 @@ > getMap().getData().getMiniTile(geometry.get(i)).getAltitude().intValue())) {
9999 }
100100 this .nodes [Node .MIDDLE .ordinal ()] = geometry .get (i );
101101
102- BWEMMap map = getMap ();
102+ BWMap map = getMap ();
103103 for (int n = 0 ; n < Node .NODE_COUNT .ordinal (); ++n ) {
104104 for (final Area area : new Area []{area1 , area2 }) {
105105 final WalkPosition nodeInArea =
@@ -150,7 +150,7 @@ > getMap().getData().getMiniTile(geometry.get(i)).getAltitude().intValue())) {
150150 this (graph , index , area1 , area2 , geometry , null );
151151 }
152152
153- private BWEMMap getMap () {
153+ private BWMap getMap () {
154154 return this .graph .getMap ();
155155 }
156156
@@ -193,7 +193,7 @@ public WalkPosition getNodePosition(final Node node) {
193193
194194 /**
195195 * Pretty much the same as pos(n), except that the returned MiniTile position is guaranteed to be
196- * part of pArea. That is: BWEMMap ::getArea(positionOfNodeInArea(n, pArea)) == pArea.
196+ * part of pArea. That is: BWMap ::getArea(positionOfNodeInArea(n, pArea)) == pArea.
197197 */
198198 public WalkPosition getNodePositionInArea (final Node node , final Area area ) {
199199 if (!(area .equals (this .areas .getLeft ()) || area .equals (this .areas .getRight ()))) {
@@ -219,7 +219,7 @@ public List<WalkPosition> getGeometry() {
219219 * If !isPseudo(), returns false. Otherwise, returns whether this ChokePoint is considered
220220 * blocked. Normally, a pseudo ChokePoint either remains blocked, or switches to not isBlocked
221221 * when blockingNeutral() is destroyed and there is no remaining Neutral stacked with it. However,
222- * in the case where BWEMMap ::automaticPathUpdate() == false, blocked() will always return true
222+ * in the case where BWMap ::automaticPathUpdate() == false, blocked() will always return true
223223 * whatever blockingNeutral() returns. Cf. Area::AccessibleNeighbors().
224224 */
225225 public boolean isBlocked () {
@@ -265,7 +265,7 @@ public boolean accessibleFrom(final ChokePoint chokePoint) {
265265 * - Note: if this == cp, returns [cp].<br>
266266 * Time complexity: O(1)<br>
267267 * To get the length of the path returned in pixels, use distanceFrom(cp).<br>
268- * - Note: all the possible Paths are precomputed during BWEMMap ::initialize().<br>
268+ * - Note: all the possible Paths are precomputed during BWMap ::initialize().<br>
269269 * The best one is then stored for each pair of getChokePoints. However, only the center of the
270270 * getChokePoints is considered. As a consequence, the returned path may not be the shortest one.
271271 */
0 commit comments