# $Id$
# Wolfgang Bangerth, 1998
+
# concatenate lines belonging together
-perl -pi -e 's/([^;])\n/$1/g;' shape_value_1d
-perl -pi -e 's/([^;])\n/$1/g;' shape_grad_1d
+perl -pi -e 's/([^;])\n/$1/g;' *1d_shape_value
+perl -pi -e 's/([^;])\n/$1/g;' *1d_shape_grad
+perl -pi -e 's/([^;])\n/$1/g;' *1d_shape_grad_grad
# give the programs a structure
perl -pi -e 's/phi_polynom\[(\d)\] =/case $1: return/g;' *1d_shape_value
perl -pi -e 's/grad_phi_polynom\[(\d)\] = (.*);/case $1: return Point<1>($2);/g;' *1d_shape_grad
+perl -pi -e 's/grad_grad_phi_polynom\[(\d)\] = (.*);/case $1: return_value[0][0] = $2;/g;' *1d_shape_grad_grad
# use other indexing format for matrices
perl -pi -e 's/\[(\d+)\]\[(\d)\]/($1,$2)/g;' *1d_massmatrix
# omit lines assigning zeroes to matrix elements, since zero is
# already set and to save compilation time
-perl -pi -e 's/.*= 0.0;\n//g;' restriction_1d
-perl -pi -e 's/.*= 0.0;\n//g;' prolongation_1d
\ No newline at end of file
+perl -pi -e 's/.*= 0.0;\n//g;' *1d_restriction
+perl -pi -e 's/.*= 0.0;\n//g;' *1d_prolongation