Level Hierarchies

So far, the above description has been for a single level of index space. We can extend this to multiple levels in a straightforward fashion. First, we introduce the EBIndexSpace member function ispCoarse.Coarsen(EBIndexSpace ispFine) which sets ispCoarse (which had been previously created using the default constructor) equal to the result of having coarsened ispFine by a factor of 2. In addition, it creates the internal links between ispCoarse and ispFine. The the user interface to inter-level mapping is through member functions of the Node and Edge classes.

• Node n.Coarser(int dLev = 1), returns the Node containing n in the EBIndexSpace coarser.
• Vector<Node>Vector<Node>n.Finer(int dLev = 1) retuns the Vector of Node s at the level finer contained in n.
• Edge e.Coarser(int dLev = 1), Vector<Edge>Vector<Edge>e.Finer(int dLev = 1) are the corresponding member functions of the the Edge class.