src/societal_level/CellSociety.java
private Map<CellName, List<Cell>> updateAllCells(List<Location> available) {
		TreeMap<CellName, List<Cell>> newMap = new TreeMap<CellName, List<Cell>>();
		for (CellName name : getCurrentCells().keySet()) {
			for (Cell cell : getCurrentCells().get(name)) {
				ArrayList<Cell> cells = new ArrayList<Cell>(updateCell(cell, available));
				removeUsedSpots(available, cells);
				for (Cell updated : cells) {
					CellName n = CellGenerator.getCellName(updated);
					if (newMap.containsKey(n)) {
						(newMap.get(n)).add(updated);
					} else {
						ArrayList<Cell> newList = new ArrayList<>();
						newList.add(updated);
						newMap.put(n, newList);
					}
				}
			}
		}
		return newMap;
	}
/**
	 * Cycle through each cell and add the returned updated cells to an
	 * ArrayList for return
	 * 
	 * @param available
	 *            Available spots
	 * @return ArrayList of updated cells
	 */
Cycle through each cell and add the returned updated cells to an
ArrayList for return

@param available
Available spots
@return ArrayList of updated cells
Cycle through each cell and add the returned updated cells to an ArrayList for return @param available Available spots @return ArrayList of updated cells
private Map<CellName, List<Cell>> updateAllCells(List<Location> available) {
		TreeMap<CellName, List<Cell>> newMap = new TreeMap<CellName, List<Cell>>();
		for (CellName name : getCurrentCells().keySet()) {
			for (Cell cell : getCurrentCells().get(name)) {
				ArrayList<Cell> cells = new ArrayList<Cell>(updateCell(cell, available));
				removeUsedSpots(available, cells);
				for (Cell updated : cells) {
					CellName n = CellGenerator.getCellName(updated);
					if (newMap.containsKey(n)) {
						(newMap.get(n)).add(updated);
					} else {
						ArrayList<Cell> newList = new ArrayList<>();
						newList.add(updated);
						newMap.put(n, newList);
					}
				}
			}
		}
		return newMap;
	}
private Map < CellName , List < Cell > > updateAllCells ( List < Location > available ) { TreeMap < CellName , List < Cell > > newMap = new TreeMap < CellName , List < Cell > > ( ) ; for ( CellName name : getCurrentCells ( ) . keySet ( ) ) { for ( Cell cell : getCurrentCells ( ) . get ( name ) ) { ArrayList < Cell > cells = new ArrayList < Cell > ( updateCell ( cell , available ) ) ; removeUsedSpots ( available , cells ) ; for ( Cell updated : cells ) { CellName n = CellGenerator . getCellName ( updated ) ; if ( newMap . containsKey ( n ) ) { ( newMap . get ( n ) ) . add ( updated ) ; } else { ArrayList < Cell > newList = new ArrayList < > ( ) ; newList . add ( updated ) ; newMap . put ( n , newList ) ; } } } } return newMap ; }
Cycle through each cell and add the returned updated cells to an
 ArrayList for return
Cycle through each cell and add the returned updated cells to an ArrayList for return