Subject: [UFL-dev] [HG UFL] Optimization: Caching repr string for elements, sums and products.

From: [email-masked] (UFL)
Date: Mon, 27 Oct 2008 14:23:21 +0100 (CET)

One or more new changesets pushed to the primary ufl repository.
A short summary of the last three changesets is included below.

changeset:   358:9559ced7496bd84132b17e601287ef4ed5fc8a0b
tag:         tip
user:        "Martin Sandve Alnæs <[email-masked]>"
date:        Mon Oct 27 14:23:19 2008 +0100
files:       ufl/algebra.py ufl/finiteelement.py
description:
Optimization: Caching repr string for elements, sums and products.
Since repr is currently used for equality between expressions,
and its cost is O(size of expression tree), it can destroy the
order of some algorithms. This wasn't unexpected, but is starting
to show.

changeset:   357:68b6c8acad9df99261aeaee4bce336bf28a6940f
user:        "Martin Sandve Alnæs <[email-masked]>"
date:        Mon Oct 27 14:07:11 2008 +0100
files:       ufl/algorithms/transformations.py ufl/algorithms/variables.py
description:
Bugfixes.

changeset:   356:4c3c2aeff26eb0b46148f2e6659cee0288e242f8
user:        "Martin Sandve Alnæs <[email-masked]>"
date:        Mon Oct 27 13:15:21 2008 +0100
files:       sandbox/basic_form_compiler.py ufl/algorithms/variables.py
description:
Some minor cleanup.

Added timing to basic_form_compiler.py, showing that
mark_duplications is too slow and growing quickly with
expression size.

----------------------------------------------------------------------
For more details, visit http://www.fenics.org/hg/ufl