@@ -5,14 +5,14 @@ export continuity
5
5
6
6
for TYP in (:PiecewiseSpace ,:ArraySpace )
7
7
@eval begin
8
- function promotedomainspace (A:: InterlaceOperator{T,2} ,sp:: $TYP ) where T
8
+ function promotedomainspace (A:: InterlaceOperator{T,2} ,sp:: $TYP ):: Any where T
9
9
if domainspace (A) == sp
10
10
return A
11
11
end
12
12
@assert size (A. ops,2 ) == length (sp)
13
13
InterlaceOperator ([promotedomainspace (A. ops[k,j],sp[j]) for k= 1 : size (A. ops,1 ),j= 1 : size (A. ops,2 )],$ TYP)
14
14
end
15
- function interlace_choosedomainspace (ops,rs:: $TYP )
15
+ function interlace_choosedomainspace (ops,rs:: $TYP ):: Any
16
16
@assert length (ops) == length (rs)
17
17
# this ensures correct dispatch for unino
18
18
sps = Array {Space} (
93
93
94
94
# Sum Space and PiecewiseSpace need to allow permutation of space orders
95
95
for TYP in (:SumSpace ,:PiecewiseSpace )
96
- @eval function Conversion (S1:: $TYP ,S2:: $TYP )
96
+ @eval function Conversion (S1:: $TYP ,S2:: $TYP ):: Any
97
97
v1 = collect (S1. spaces)
98
98
v2 = collect (S2. spaces)
99
99
180
180
for (OPrule,OP) in ((:conversion_rule ,:conversion_type ),(:maxspace_rule ,:maxspace ),
181
181
(:union_rule ,:union ))
182
182
for TYP in (:SumSpace ,:PiecewiseSpace )
183
- @eval function $OPrule (S1sp:: $TYP ,S2sp:: $TYP )
183
+ @eval function $OPrule (S1sp:: $TYP ,S2sp:: $TYP ):: Any
184
184
S1 = components (S1sp)
185
185
S2 = components (S2sp)
186
186
cs1,cs2= map (canonicalspace,S1),map (canonicalspace,S2)
@@ -239,7 +239,7 @@ for (Op,OpWrap) in ((:Derivative,:DerivativeWrapper),(:Integral,:IntegralWrapper
239
239
end
240
240
end
241
241
242
- function Derivative (S:: SumSpace ,k:: Integer )
242
+ function Derivative (S:: SumSpace ,k:: Integer ):: Any
243
243
# we want to map before we decompose, as the map may introduce
244
244
# mixed bases.
245
245
if typeof (canonicaldomain (S))== typeof (domain (S))
0 commit comments