public void removeAnimatedEntity(AnimatedEntity ae) { animatedEntities.remove(ae); }
/** * Remove from this collection all elements in the given collection. If the * collection is an instance of this class, it uses faster iterators. * * @param c a collection. * @return <code>true</code> if this collection changed as a result of the * call. */ public boolean removeAll(Collection<?> c) { boolean retVal = false; int n = c.size(); final Iterator<?> i = c.iterator(); while (n-- != 0) if (remove(i.next())) retVal = true; return retVal; }
public void recallActor(TextCellFactory.Glyph a, boolean restoreSym, int nextX, int nextY) { animationCount--; if(a == null) return; // if something has already removed the Glyph, we still reduce animationCount but do nothing more if(onlyRenderEven) { // this just sets the least significant bit to 0, making any odd numbers even (decrementing) nextX &= -2; nextY &= -2; } if(restoreSym && nextX >= 0 && nextY >= 0 && nextX < contents.length && nextY < contents[nextX].length) { contents[nextX][nextY] = a.shown; } removeActor(a); autoActors.remove(a); }
public void recallActor(Actor a, boolean restoreSym, int nextX, int nextY) { animationCount--; if(onlyRenderEven) { // this just sets the least significant bit to 0, making any odd numbers even (decrementing) nextX &= -2; nextY &= -2; } String n; if(restoreSym && nextX >= 0 && nextY >= 0 && nextX < contents.length && nextY < contents[nextX].length && (n = a.getName()) != null && !n.isEmpty()) { contents[nextX][nextY] = n.charAt(0); } removeActor(a); autoActors.remove(a); }
protected OrderedSet<Coord> removeAdjacent(OrderedSet<Coord> coll, Coord pt) { for(Coord temp : new Coord[]{Coord.get(pt.x + 1, pt.y), Coord.get(pt.x - 1, pt.y), Coord.get(pt.x, pt.y + 1), Coord.get(pt.x, pt.y - 1)}) { coll.remove(temp); } return coll; } protected OrderedSet<Coord> removeAdjacent(OrderedSet<Coord> coll, Coord pt1, Coord pt2)
currentFresh.remove(cell); anyFreshMap.remove(cell.x, cell.y);
protected OrderedSet<Coord> removeAdjacent(OrderedSet<Coord> coll, Coord pt) { for(Coord temp : new Coord[]{Coord.get(pt.x + 1, pt.y), Coord.get(pt.x - 1, pt.y), Coord.get(pt.x, pt.y + 1), Coord.get(pt.x, pt.y - 1)}) { if(coll.contains(temp) && !(temp.x == pt.x && temp.y == pt.y)) coll.remove(temp); } return coll; } protected OrderedSet<Coord> removeAdjacent(OrderedSet<Coord> coll, Coord pt1, Coord pt2)
fresh.remove(cell);
currentFresh.remove(cell); anyFreshMap.remove(cell.x, cell.y);
protected OrderedSet<Coord> removeAdjacent(OrderedSet<Coord> coll, Coord pt1, Coord pt2) { for(Coord temp : new Coord[]{Coord.get(pt1.x + 1, pt1.y), Coord.get(pt1.x - 1, pt1.y), Coord.get(pt1.x, pt1.y + 1), Coord.get(pt1.x, pt1.y - 1), Coord.get(pt2.x + 1, pt2.y), Coord.get(pt2.x - 1, pt2.y), Coord.get(pt2.x, pt2.y + 1), Coord.get(pt2.x, pt2.y - 1),}) { if(!(temp.x == pt1.x && temp.y == pt1.y) && !(temp.x == pt2.x && temp.y == pt2.y)) coll.remove(temp); } return coll; } protected OrderedSet<Coord> removeNearby(OrderedSet<Coord> coll, char[][] disallowed)
protected OrderedSet<Coord> removeAdjacent(OrderedSet<Coord> coll, Coord pt1, Coord pt2) { for(Coord temp : new Coord[]{Coord.get(pt1.x + 1, pt1.y), Coord.get(pt1.x - 1, pt1.y), Coord.get(pt1.x, pt1.y + 1), Coord.get(pt1.x, pt1.y - 1), Coord.get(pt2.x + 1, pt2.y), Coord.get(pt2.x - 1, pt2.y), Coord.get(pt2.x, pt2.y + 1), Coord.get(pt2.x, pt2.y - 1),}) { if(coll.contains(temp) && !(temp.x == pt1.x && temp.y == pt1.y) && !(temp.x == pt2.x && temp.y == pt2.y)) coll.remove(temp); } return coll; } protected OrderedSet<Coord> viableDoorways(boolean doubleDoors, char[][] map)
above.remove(abv);
for(Map.Entry<Coord, OrderedMap<Coord, Edge>> n : waypoints.entrySet()) chokes.remove(n.getKey()); if(chokes.isEmpty()) break;
for(Map.Entry<Coord, OrderedMap<Coord, Edge>> n : waypoints.entrySet()) chokes.remove(n.getKey()); if(chokes.isEmpty()) break;
chokes.remove(n.getKey()); if(chokes.isEmpty()) break;
while (!p.equals(target)) { finished[p.x][p.y] = true; open.remove(p); for (byte d = 0; d < dirCount; d++) { dir = dirs[d];
for(Map.Entry<Coord, OrderedMap<Coord, Edge>> n : waypoints.entrySet()) chokes.remove(n.getKey()); if(chokes.isEmpty()) break;