class env_map{
public:
  std::vector<env_cell> cells; //list of environment's cells
  std::vector<env_cell>::iterator cellI; //iterator

  //takes point x,z and returns a pointer to the cell it resides within
  env_cell* findCell(float x,float z){
    for(cellI = cells.begin();cellI != cells.end();cellI++){
      //if point is inside the cell
      if(x<=currentCell.right && x>=currentCell.left && z>=currentCell.top && z<=currentCell.bottom){
        return iCell; //return pointer to the cell
      }
    }
    return &(*cells.begin()); //return cell 0 (could check for nearest later)
  }
};

class env_cell{
public:
  std::vector<env_cell*> visCells; //cells that can be seen from this cell
  std::vector<env_cell*>::iterator visCellsI; //visible cells iterator
  int nextCell;

  //returns a pointer to an adjacent cell which the point is within
  env_cell* findCell(float x,float z){
    env_cell * foundCell;
    for(visCellsI = visCells.begin();visCellsI != visCells.end();visCellsI++){
      //if point is inside the cell
      if(x <= (*visCellsI)->right && x >= (*visCellsI)->left && z <= (*visCellsI)->top && 
      z >= (*visCellsI)->bottom){
        foundCell = (*visCellsI);
        break;
      }
    }
    
    //if a cell was found
    if(foundCell){
      return foundCell; //return new cell
    } else {
      return this; //keep current cell assigned
    }
  }

  //adds a cell to the vector of cells in the map (only called during init)
  void addCell(float sTop,float sLeft,float sBottom,float sRight){
    cells.push_back(env_cell(nextCell,sTop,sLeft,sBottom,sRight));
    nextCell ++; //increase cellId counter
  }
};

  //(camera location starts at 0,0) (4 values are top,left,bottom,right of cell)
  map->addCell(-64,-256,128,128); //in the 0th place in the cells vector
  map->addCell(32,128,96,256); //1st place

  //manually enter vis
  map->cells[0].visCells.push_back(&map->cells[1]);
  //7 more lines similar to the above line

class environmentCell {  // ...public:  std::vector<environmentCell*> adjacentCells;  // returns a pointer to an adjacent cell surrounding the specified point.  // If none of the adjacent cells qualify, return this.  environmentCell* findCell(float x, float z) {    typedef typename std::vector<environmentCell*>::iterator iterator;    for (iterator it = adjacentCells.begin(), end = adjacentCells.end(); it != end; ++it) {      environmentCell* cell = *it;      if (x <= cell->right && x >= cell->left && z <= cell->top && z >= cell->bottom) {        return cell;      }    }        return this;  }};