ufl team mailing list archive
-
ufl team
-
Mailing list archive
-
Message #00093
[HG UFL] Translated flatten algorithm to recursive procedure instead of visitor-like implementation. More readable, we can check which way is faster _if_ we have the need to optimize later.
One or more new changesets pushed to the primary ufl repository.
A short summary of the last three changesets is included below.
changeset: 83:c4b4d9ab7b2263f52d2da6060f03e9a51076f544
tag: tip
user: "Martin Sandve Alnæs <martinal@xxxxxxxxx>"
date: Thu Apr 03 16:16:26 2008 +0200
files: src/ufl/utilities.py
description:
Translated flatten algorithm to recursive procedure instead of visitor-like implementation. More readable, we can check which way is faster _if_ we have the need to optimize later.
changeset: 82:9fc170a5940c0166e528a12b64ef24beb19f72b5
user: martinal@localhost
date: Wed Apr 02 17:27:19 2008 +0200
files: src/ufl/utilities.py test/algorithms.py
description:
Improved flatten test.
changeset: 81:f365515bc16c36c0d6a4d42ed5e2ab5f84c7305e
user: martinal@localhost
date: Wed Apr 02 17:16:45 2008 +0200
files: src/ufl/utilities.py test/algorithms.py
description:
Bugfix in flatten.
----------------------------------------------------------------------
For more details, visit http://www.fenics.org/hg/ufl