def _init(self, a, b):
"Constructor, called by __new__ with already checked arguments."
self.ufl_operands = (a, b)
# Extract indices
fi, fid = merge_unique_indices(a.ufl_free_indices,
a.ufl_index_dimensions,
b.ufl_free_indices,
b.ufl_index_dimensions)
self.ufl_free_indices = fi
self.ufl_index_dimensions = fid
def __init__(self, expression, multiindex):
# Store operands
Operator.__init__(self, (expression, multiindex))
# Error checking
if not isinstance(expression, Expr):
error("Expecting Expr instance, not %s." % ufl_err_str(expression))
if not isinstance(multiindex, MultiIndex):
error("Expecting MultiIndex instance, not %s." %
ufl_err_str(multiindex))
shape = expression.ufl_shape
# Error checking
if len(shape) != len(multiindex):
error("Invalid number of indices (%d) for tensor "
"expression of rank %d:\n\t%s\n" %
(len(multiindex), len(
expression.ufl_shape), ufl_err_str(expression)))
if any(
int(di) >= int(si) or int(di) < 0
for si, di in zip(shape, multiindex)
if isinstance(di, FixedIndex)):
error("Fixed index out of range!")
# Build tuples of free index ids and dimensions
if 1:
efi = expression.ufl_free_indices
efid = expression.ufl_index_dimensions
fi = list(zip(efi, efid))
for pos, ind in enumerate(multiindex._indices):
if isinstance(ind, Index):
fi.append((ind.count(), shape[pos]))
fi = unique_sorted_indices(sorted(fi))
if fi:
fi, fid = zip(*fi)
else:
fi, fid = (), ()
else:
mfiid = [(ind.count(), shape[pos])
for pos, ind in enumerate(multiindex._indices)
if isinstance(ind, Index)]
mfi, mfid = zip(*mfiid) if mfiid else ((), ())
fi, fid = merge_unique_indices(expression.ufl_free_indices,
expression.ufl_index_dimensions,
mfi, mfid)
# Cache free index and dimensions
self.ufl_free_indices = fi
self.ufl_index_dimensions = fid
def __init__(self, expression, multiindex):
# Store operands
Operator.__init__(self, (expression, multiindex))
# Error checking
if not isinstance(expression, Expr):
error("Expecting Expr instance, not %s." % ufl_err_str(expression))
if not isinstance(multiindex, MultiIndex):
error("Expecting MultiIndex instance, not %s." % ufl_err_str(multiindex))
shape = expression.ufl_shape
# Error checking
if len(shape) != len(multiindex):
error("Invalid number of indices (%d) for tensor "
"expression of rank %d:\n\t%s\n"
% (len(multiindex), len(expression.ufl_shape), ufl_err_str(expression)))
if any(int(di) >= int(si)
for si, di in zip(shape, multiindex)
if isinstance(di, FixedIndex)):
error("Fixed index out of range!")
# Build tuples of free index ids and dimensions
if 1:
efi = expression.ufl_free_indices
efid = expression.ufl_index_dimensions
fi = list(zip(efi, efid))
for pos, ind in enumerate(multiindex._indices):
if isinstance(ind, Index):
fi.append((ind.count(), shape[pos]))
fi = unique_sorted_indices(sorted(fi))
if fi:
fi, fid = zip(*fi)
else:
fi, fid = (), ()
else:
mfiid = [(ind.count(), shape[pos])
for pos, ind in enumerate(multiindex._indices)
if isinstance(ind, Index)]
mfi, mfid = zip(*mfiid) if mfiid else ((), ())
fi, fid = merge_unique_indices(expression.ufl_free_indices,
expression.ufl_index_dimensions,
mfi, mfid)
# Cache free index and dimensions
self.ufl_free_indices = fi
self.ufl_index_dimensions = fid
def __new__(cls, a, b):
# Conversion
a = as_ufl(a)
b = as_ufl(b)
# Type checking
# Make sure everything is scalar
if a.ufl_shape or b.ufl_shape:
error("Product can only represent products of scalars, "
"got\n\t%s\nand\n\t%s" % (ufl_err_str(a), ufl_err_str(b)))
# Simplification
if isinstance(a, Zero) or isinstance(b, Zero):
# Got any zeros? Return zero.
fi, fid = merge_unique_indices(a.ufl_free_indices,
a.ufl_index_dimensions,
b.ufl_free_indices,
b.ufl_index_dimensions)
return Zero((), fi, fid)
sa = isinstance(a, ScalarValue)
sb = isinstance(b, ScalarValue)
if sa and sb: # const * const = const
# FIXME: Handle free indices like with zero? I think
# IntValue may be index annotated now?
return as_ufl(a._value * b._value)
elif sa: # 1 * b = b
if a._value == 1:
return b
# a, b = a, b
elif sb: # a * 1 = a
if b._value == 1:
return a
a, b = b, a
# elif a == b: # a * a = a**2 # TODO: Why? Maybe just remove this?
# if not a.ufl_free_indices:
# return a**2
else: # a * b = b * a
# Sort operands in a semi-canonical order
# (NB! This is fragile! Small changes here can have large effects.)
a, b = sorted_expr((a, b))
# Construction
self = Operator.__new__(cls)
self._init(a, b)
return self