ufl team mailing list archive

["Martin Sandve Alnæs" <martinal@xxxxxxxxx>]

I was wondering how you intended to use that :)
Lets discuss how to best do this soon, I can show you
how I've been thinking in the other algorithms as well.

-- 
Martin


2008/9/29 UFL <ufl@xxxxxxxxxx>:
> One or more new changesets pushed to the primary ufl repository.
> A short summary of the last three changesets is included below.
>
> changeset:   286:1a8f946c08dbd537cdafd0ab33fe14a7c546f7eb
> tag:         tip
> user:        Anders Logg <logg@xxxxxxxxx>
> date:        Mon Sep 29 21:56:47 2008 +0200
> files:       sandbox/multilinear.py ufl/algorithms/predicates.py
> description:
> Temporarily give up on implementation of is_multilinear (see comment
> in predicates.py). The extra stack argument that was added to the traversal
> algorithms is not used, so it can be removed if we find out we don't need it.
>
>
> changeset:   285:2347e1f6ce51e00492e6eed0e769d582bd37a2ca
> parent:      284:c31a973fa84f0ed15e3a8c3761a608a2bdbc1b61
> parent:      283:6fa9c6e9e2989fcb8d2242b15a1353fb8374cfa8
> user:        Anders Logg <logg@xxxxxxxxx>
> date:        Mon Sep 29 16:33:26 2008 +0200
> files:
> description:
> merge
>
>
> changeset:   284:c31a973fa84f0ed15e3a8c3761a608a2bdbc1b61
> parent:      282:eefbe0539581b033128e669ba1f87e3588388aa4
> user:        Anders Logg <logg@xxxxxxxxx>
> date:        Mon Sep 29 16:33:00 2008 +0200
> files:       sandbox/multilinear.py ufl/algorithms/analysis.py ufl/algorithms/predicates.py ufl/algorithms/traversal.py
> description:
> Work on traversal algorithms:
> - Keep track of operator stack when traversing expression tree:
> - Add default iterator traversal() same as pre_traversal
>
> Usage:
>
>  for (o, stack) in traversal(expression):
>      ...
>
> ----------------------------------------------------------------------
> For more details, visit http://www.fenics.org/hg/ufl
> _______________________________________________
> UFL-dev mailing list
> UFL-dev@xxxxxxxxxx
> http://fenics.org/mailman/listinfo/ufl-dev
>