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]]

>From now on all implementations of the Grid interface should be derived
from the Default Classes, i.e. GridDefault.
All Default classes implement some extra functionality using the slim
interface described in the interface classes. For example the method
subIndex of the class EntityDefault<codim=0...> returns the global index of
a sub entity with codim=cc and a local number. The Implenentation is done
via the interface method entity of the Entity Interface.

The class GridDefault provides an LeafIterator. This iterator uses the
LevelIterator and Hierarchical Iterator to iterate over all leaf elements
until a given maxlevel.
The LeafIterator has the same Interface as the LevelIterator.

Furtermore added some methods for writing the grid to an file. But im still
working on it. Therefore explanations later.

[[Imported from SVN: r157]]

[[Imported from SVN: r156]]

HierarchicIterator. The traverseLeafElLevel method of LevelIterator must be
revised.

[[Imported from SVN: r155]]

Furthermore wrote wrapper for ALBERT refine in albertextra.hh.
Now the AlbertGrid has the methods refine and coarsen.

[[Imported from SVN: r154]]

Wrote a new fill_elinfo method, because in Albert there are Neighbor
realtions only on leaf level. Now all elements on all levels have their
real neighbors.

The fillElInfo Method of AlbertGrid seems to work, but is not tested
consequently. (for futur reference)

[[Imported from SVN: r153]]

[[Imported from SVN: r152]]

it's i times operator ++ ().

[[Imported from SVN: r151]]

Added the method  mark (int refCount) in class AlbertGridEntity<codim=0>

and the methods refineLocal and coarsenLocal ind class AlbertGrid.
Methods for error estimates should be placed in discrestfunction and local
function. (next time)

[[Imported from SVN: r150]]

[[Imported from SVN: r149]]

ALBERT_LIBS = "-lalbert_util" instead of "albert_util"

Now it works.

grape.m4:
added AC_LANG_PUSH([C]) for grape.h, because Grape cannot be compiled with
a c++ Compiler because of redefinition of keywords like class.
It's Grape you know.

[[Imported from SVN: r148]]

Futhermore check for DIM and DIM_OF_WORLD removed, because is done in
albert.m4

[[Imported from SVN: r147]]