function. Furthermore added the method 'done' to the interface.

[[Imported from SVN: r197]]

[[Imported from SVN: r196]]

local function at the same time (entity and neighbor) and the local
functions are kept until needed again.

For this reason fro each time the method 'access' of discrete function was
called the method 'done' has to be called to free the local function.

[[Imported from SVN: r195]]

implementation and only the corresponding discretefunction needs to know
this method. Sometimes we dont nned this method.

Furthermore removed the interface for LocalFunctionInterator because we
dont nned this.

[[Imported from SVN: r194]]

The implementation of the management moved to agmemory.hh.

[[Imported from SVN: r193]]

[[Imported from SVN: r192]]

Access to neighbor was tuned. Now ist a lot fast due to
stack management of NeighborEntity in NeighborIterator.
The Objects are first generated with new and then holded until
the corresponding grid is deleted.

[[Imported from SVN: r191]]

[[Imported from SVN: r190]]

function information file which stores the information about the underlying
functionspace and the grid type.

[[Imported from SVN: r189]]

This is a special implementation of the discretefunction interface which
uses an array to store the dofs.

[[Imported from SVN: r188]]

[[Imported from SVN: r187]]

timestep (=0) a filename grid000000000.

[[Imported from SVN: r186]]

[[Imported from SVN: r185]]

Returns true, if the discrete functions that belong to this function space
are continuous.

Furthermore added methods to get polynom order of base functions.

[[Imported from SVN: r184]]

ascii.

[[Imported from SVN: r183]]

[[Imported from SVN: r182]]

For this grid only ascii format is supported, because
we have to store only H and N.

[[Imported from SVN: r181]]

grid via the interface methods of a grid implementation. This Method works
for all Grids and reads/writes the grid infromation file with type
information ...

[[Imported from SVN: r180]]

The interface is to write one file which contains
information about the grid type and then use the writeGrid
method which is unique for each grid.

Therefore I added two methods in GridDefault, grid2File and file2Grid.
These methods write/read a grid ,i.e. the grid information file and then
they call the writeGrid methods of the actual implementation.
If a grid is written to 'grid' then the grid information is written to file
'grid' and the grids are stored in grid|timestep, i.e. grid0000000000.
For generating these filename I added a routine genFilename ind misc.hh.

[[Imported from SVN: r179]]

wrong, false instead of true ....

[[Imported from SVN: r178]]

[[Imported from SVN: r177]]

[[Imported from SVN: r176]]

Added a applyLocal method for FEOperator for tests.

[[Imported from SVN: r175]]

[[Imported from SVN: r174]]

implementations of different numerical schemes.

Here we work without virtual methods. Therefore all local apply methods of
the combined operators can be inlined.

But i still working and testing this implementatitons.

[[Imported from SVN: r173]]

[[Imported from SVN: r172]]

[[Imported from SVN: r171]]

[[Imported from SVN: r170]]

int localPolynomOrder (Entity &en) as interface methods to
the DiscreteFunctionSpace class.

[[Imported from SVN: r169]]

type as template parameter like the other two classes.

[[Imported from SVN: r168]]

[[Imported from SVN: r167]]

on class SEntity<codim =0>.

[[Imported from SVN: r166]]

Default is, that no BLAS Library is used. With the --enable-blas
option BLAS Library searching is enabled. The default Path is /usr/lib.

With the --with-blas-lib=PATH an optional PATH can be specified.

[[Imported from SVN: r165]]

[[Imported from SVN: r164]]

[[Imported from SVN: r163]]

[[Imported from SVN: r162]]

Futhermore implemented the changes of the NeighborIterator and the new
BoundaryEntity. On SGrid the methods of BoundaryEntity are only declared at
the moment but not implemented.

[[Imported from SVN: r161]]

This method returns true if an point is located within the current element.

Furthermore added an interface class BoundaryEntity which provides
information about the boundary. This is a new template parameter for
NeighborIterator. I adapted the interface classes and SGrid and AlbertGrid.

On NeighborIterator the method < bool boundary .. > returns wether we are
at boubdary or not. The method < neighbor > returns true if an neihgbor on this
level exists. The method < boundaryEntity > returns a BoundaryEntity with
information about boundary type and so on, if we are at boundary.

[[Imported from SVN: r160]]

[[Imported from SVN: r159]]

Furthermore all routines belonging to ALBERT are implemented in
albertextra.hh in a special namespace.

Added write and read methods for the AlbertGrid.

[[Imported from SVN: r158]]