#include <GridTable.hpp>
Inheritance diagram for GridTable< T >:
Public Member Functions | |
| GridTable () | |
| GridTable (int d, int maxLev) | |
| void | DoNotSaveSolutions () |
| int | Dimension () |
| int | InsertComplete (Array< int > &pos, List< Array< int > > &newGrids) |
| Recursively inserts a new grid and all its hierarchical ancestors, if not already there. | |
| int | SetGridData (gridData< T > &dat) |
| int | InsertAtLevel (const int level, gridData< T > &dat) |
| Insert at the given level, if not already there. | |
| int | GetValue (Array< int > &pos, double &val) |
| Gets the value corresponding to position pos and leaves list pointer there. | |
| int | SetValue (Array< int > &pos, double val) |
| int | GetSurplus (Array< int > &pos, double &val) |
| int | SetSurplus (Array< int > &pos, double val) |
| int | CalcSurplus () |
| int | CalcSurplus (Array< int > &pos) |
| double | CalcSurplusRecursive (Array< int > &pos, int lev) |
| int | CalcSurplus (List< Array< int > > &list) |
| int | CalcWeight (Array< int > &pos) |
| int | Print (std::ostream &out) |
Protected Attributes | |
| int | dim |
| int | maxLevel |
| int | currentLevel |
| bool | saveSolutions |
| Array< List< gridData< T > > > | table |
| SortedList< refinementInfo > | activeSet |
provides basic operations, eg insertion of grids, computation of surplus, printing...
| void GridTable< T >::DoNotSaveSolutions | ( | ) | [inline] |
| int GridTable< T >::Dimension | ( | ) | [inline] |
| int GridTable< T >::InsertComplete | ( | Array< int > & | pos, | |
| List< Array< int > > & | newGrids | |||
| ) | [inline] |
Recursively inserts a new grid and all its hierarchical ancestors, if not already there.
It is assumed that before the table was admissible in the sense that for each grid all hierarchical ancestors are in the table newly added grids are automatically added to active set!
| int GridTable< T >::InsertAtLevel | ( | const int | level, | |
| gridData< T > & | dat | |||
| ) | [inline] |
Insert at the given level, if not already there.
Gets the value corresponding to position pos and leaves list pointer there.
| int GridTable< T >::CalcSurplus | ( | ) | [inline] |
| double GridTable< T >::CalcSurplusRecursive | ( | Array< int > & | pos, | |
| int | lev | |||
| ) | [inline] |
| int GridTable< T >::Print | ( | std::ostream & | out | ) | [inline] |
int GridTable< T >::currentLevel [protected] |
The level of the currently finest grid
bool GridTable< T >::saveSolutions [protected] |
Indicates if the solutions on each grid are fully saved or not (saves memory)
The table of grids has dim dimensions, the entries have positions i_1, ..., i_dim they are ordered according to the level i_1 + ... + i_d, ie all grids with 2^{i_1}+1, ..., 2^{i_dim}+1 points in each of the directions are stored in the list table[level], where level = i_1 + ... + i_d. in the case of the sparse grid all possible combinations will be present in each line, in general however this is not necessarily the case and is just a useful way of storing the grids
SortedList<refinementInfo> GridTable< T >::activeSet [protected] |
Contains the "active boundary" of indices contained in the table such that at least one neighbour is not yet in the table; they are ordered according to the indicator, such that adaptive refinement can be performed easily
1.5.2