@@ -47,11 +47,11 @@ rangespace(S::SpaceOperator) = S.rangespace
47
47
48
48
49
49
# #TODO : Do we need both max and min?
50
- function findmindomainspace (ops:: AbstractVector )
50
+ function findmindomainspace (ops)
51
51
mapreduce (domainspace, union, ops, init = UnsetSpace ())
52
52
end
53
53
54
- function findmaxrangespace (ops:: AbstractVector )
54
+ function findmaxrangespace (ops)
55
55
mapreduce (rangespace, maxspace, ops, init = UnsetSpace ())
56
56
end
57
57
@@ -77,21 +77,21 @@ promotedomainspace(P::Operator,sp::Space,cursp::Space) =
77
77
78
78
79
79
80
- function promoterangespace (ops:: AbstractVector{O} ) where O<: Operator
80
+ function promoterangespace (ops:: Union{ AbstractVector{O}, Tuple{O,Vararg{O}} } ) where O<: Operator
81
81
isempty (ops) && return strictconvert (Vector{Operator{eltype (O)}}, ops)
82
82
k= findmaxrangespace (ops)
83
83
# TODO : T might be incorrect
84
84
T= mapreduce (eltype,promote_type,ops)
85
85
Operator{T}[promoterangespace (op,k) for op in ops]
86
86
end
87
- function promotedomainspace (ops:: AbstractVector{O} ) where O<: Operator
87
+ function promotedomainspace (ops:: Union{ AbstractVector{O}, Tuple{O,Vararg{O}} } ) where O<: Operator
88
88
isempty (ops) && return strictconvert (Vector{Operator{eltype (O)}}, ops)
89
89
k= findmindomainspace (ops)
90
90
# TODO : T might be incorrect
91
91
T= mapreduce (eltype,promote_type,ops)
92
92
Operator{T}[promotedomainspace (op,k) for op in ops]
93
93
end
94
- function promotedomainspace (ops:: AbstractVector{O} ,S:: Space ) where O<: Operator
94
+ function promotedomainspace (ops:: Union{ AbstractVector{O}, Tuple{O,Vararg{O}} } ,S:: Space ) where O<: Operator
95
95
isempty (ops) && return strictconvert (Vector{Operator{eltype (O)}}, ops)
96
96
k= conversion_type (findmindomainspace (ops),S)
97
97
# TODO : T might be incorrect
0 commit comments