Shape derivative

src/Arrays/AppendedArrays.jl

@@ -63,7 +63,9 @@ struct AppendedArray{T,A,B} <: AbstractVector{T}
     B = typeof(b)
     ai = testitem(a)
     bi = testitem(b)
-    T = eltype(collect((ai,bi)))
+    #T = eltype(collect((ai,bi)))
+    #new{T,A,B}(a,b)
+    T = Union{typeof(ai),typeof(bi)}
     new{T,A,B}(a,b)
   end
 end

src/Arrays/LazyArrays.jl

@@ -140,7 +140,11 @@ end
 
 function _array_cache!(hash::Dict,a::LazyArray)
   @boundscheck begin
-    @notimplementedif ! all(map(isconcretetype, map(eltype, a.args)))
+    if ! all(map(isconcretetype, map(eltype, a.args)))
+      for n in 1:length(a.args)
+        @notimplementedif ! all(map(isconcretetype, map(eltype, a.args[n])))
+      end
+    end
     if ! (eltype(a.maps) <: Function)
       @notimplementedif ! isconcretetype(eltype(a.maps))
     end

src/CellData/CellData.jl

@@ -33,7 +33,7 @@ import Gridap.Geometry: get_triangulation
 
 import Gridap.TensorValues: inner, outer, double_contraction, symmetric_part
 import LinearAlgebra: det, tr, cross, dot, ⋅
-import Base: inv, abs, abs2, *, +, -, /, adjoint, transpose, real, imag, conj
+import Base: inv, abs, abs2, *, +, -, /, adjoint, transpose, real, imag, conj, exp
 
 export gradient, ∇
 export ∇∇

src/CellData/CellFields.jl

@@ -637,7 +637,7 @@ Base.:(∘)(f::Function,g::Tuple{Vararg{Union{Function,CellField}}}) = Operation
 
 # Unary ops
 
-for op in (:symmetric_part,:inv,:det,:abs,:abs2,:+,:-,:tr,:transpose,:adjoint,:grad2curl,:real,:imag,:conj)
+for op in (:symmetric_part,:inv,:det,:abs,:abs2,:+,:-,:tr,:transpose,:adjoint,:grad2curl,:real,:imag,:conj,:exp)
   @eval begin
     ($op)(a::CellField) = Operation($op)(a)
   end
@@ -861,4 +861,4 @@ struct Interpolable{M,A} <: Function
 end
 
 return_cache(a::Interpolable,x::Point) = return_cache(a.uh,x)
-evaluate!(cache,a::Interpolable,x::Point) = evaluate!(cache,a.uh,x)
+evaluate!(cache,a::Interpolable,x::Point) = evaluate!(cache,a.uh,x)

src/CellData/CellQuadratures.jl

@@ -204,7 +204,14 @@ function get_cell_measure(trian::Triangulation)
   cell_to_dV = integrate(1,quad)
   cell_to_bgcell = get_cell_to_bgcell(trian)
   bgtrian = get_background_triangulation(trian)
-  bgcell_to_dV = zeros(num_cells(bgtrian))
+
+  if typeof(trian) <: AppendedTriangulation
+    T = eltype(eltype(trian.a.subcells.point_to_coords))
+  else
+    T = eltype(cell_to_dV)
+  end
+
+  bgcell_to_dV = zeros(T,num_cells(bgtrian))
   _meas_K_fill!(bgcell_to_dV,cell_to_dV,cell_to_bgcell)
   bgcell_to_dV
 end
@@ -216,3 +223,4 @@ function _meas_K_fill!(bgcell_to_dV,cell_to_dV,cell_to_bgcell)
     bgcell_to_dV[bgcell] += dV
   end
 end
+

src/Polynomials/MonomialBases.jl

@@ -119,12 +119,21 @@ return_type(::MonomialBasis{D,T}) where {D,T} = T
 
 function return_cache(f::MonomialBasis{D,T},x::AbstractVector{<:Point}) where {D,T}
   @assert D == length(eltype(x)) "Incorrect number of point components"
+
+  point_primitive_type = eltype(eltype(x))
+
+  if isempty(T.parameters)
+        Tp = point_primitive_type
+  else
+        Tp = VectorValue{T.parameters[1],point_primitive_type}
+  end
+
   np = length(x)
   ndof = length(f.terms)*num_components(T)
   n = 1 + _maximum(f.orders)
-  r = CachedArray(zeros(T,(np,ndof)))
-  v = CachedArray(zeros(T,(ndof,)))
-  c = CachedArray(zeros(eltype(T),(D,n)))
+  r = CachedArray(zeros(Tp,(np,ndof)))
+  v = CachedArray(zeros(Tp,(ndof,)))
+  c = CachedArray(zeros(eltype(Tp),(D,n)))
   (r, v, c)
 end
 
@@ -380,7 +389,13 @@ function _gradient_nd!(
     _gradient_1d!(g,x,orders[d],d)
   end
 
-  z = zero(Mutable(VectorValue{D,T}))
+  #z = zero(Mutable(VectorValue{D,T}))
+  if isbitstype(T)
+    z = zero(Mutable(VectorValue{D,T}))
+  else 
+    z = zeros(T,D)
+  end
+
   o = one(T)
   k = 1