-
Notifications
You must be signed in to change notification settings - Fork 11
/
HierarchicalVector.jl
175 lines (143 loc) · 6.83 KB
/
HierarchicalVector.jl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
export HierarchicalVector, partition, nlevels
partition(x)=x
nlevels(A)=0
##
# Represent a binary hierarchical vector
##
abstract type AbstractHierarchicalArray{SV,T,HS,N} <: AbstractArray{T,N} end
const AbstractHierarchicalVector{S,T,HS} = AbstractHierarchicalArray{S,T,HS,1}
mutable struct HierarchicalVector{S,T,HS} <: AbstractHierarchicalVector{S,T,HS}
data::HS
HierarchicalVector{S,T,HS}(data::HS) where {S,T,HS} = new{S,T,HS}(data)
end
HierarchicalVector(data::Tuple{S1,S2}) where {S1,S2} = HierarchicalVector{promote_type(S1,S2),promote_type(eltype(S1),eltype(S2)),Tuple{S1,S2}}(data)
HierarchicalVector(data::Tuple{HierarchicalVector{S1,T1,HS1},HierarchicalVector{S2,T2,HS2}}) where {S1,S2,T1,T2,HS1,HS2} = HierarchicalVector{promote_type(S1,S2),promote_type(eltype(S1),eltype(S2),T1,T2),Tuple{HierarchicalVector{S1,T1,HS1},HierarchicalVector{S2,T2,HS2}}}(data)
HierarchicalVector(data::Tuple{S1,HierarchicalVector{S,T,HS}}) where {S,S1,T,HS} = HierarchicalVector{promote_type(S,S1),promote_type(eltype(S),eltype(S1),T),Tuple{S1,HierarchicalVector{S,T,HS}}}(data)
HierarchicalVector(data::Tuple{HierarchicalVector{S,T,HS},S1}) where {S,S1,T,HS} = HierarchicalVector{promote_type(S,S1),promote_type(eltype(S),eltype(S1),T),Tuple{HierarchicalVector{S,T,HS},S1}}(data)
HierarchicalVector(data::Vector) = HierarchicalVector(data,round(Int,log2(length(data))))
function HierarchicalVector(data::Vector,n::Int)
@assert length(data) == 2^n
if n == 1
return HierarchicalVector(tuple(data...))
elseif n ≥ 2
return HierarchicalVector((HierarchicalVector(data[1:2^(n-1)],n-1),HierarchicalVector(data[1+2^(n-1):end],n-1)))
end
end
Base.similar(H::HierarchicalVector) = HierarchicalVector(map(similar,data(H)))
Base.similar(H::HierarchicalVector{SS,V,T}, ::Type{S}) where {SS,V,T,S} =
HierarchicalVector(map(A->similar(A,S),data(H)))
Base.similar(H::HierarchicalVector{SS,V,T}, S) where {SS,V,T} =
HierarchicalVector(map(A->similar(A,S),data(H)))
data(H::HierarchicalVector) = H.data
nlevels(H::HierarchicalVector) = 1+mapreduce(nlevels,max,data(H))
partition(H::HierarchicalVector) = data(H)
function partition(H::Vector{HierarchicalVector})
n = length(H)
H11,H12 = partition(H[1])
H1,H2 = fill(H11,n),fill(H12,n)
for i=1:n
H1[i],H2[i] = partition(H[i])
end
H1,H2
end
collectdata(H::HierarchicalVector{S,T,NTuple{2,S}}) where {S,T} = collect(data(H))
collectdata(H::HierarchicalVector{S,T,Tuple{S,HierarchicalVector{S,T,HS}}}) where {S,T,HS} = vcat(H.data[1],collectdata(H.data[2]))
collectdata(H::HierarchicalVector{S,T,Tuple{HierarchicalVector{S,T,HS},S}}) where {S,T,HS} = vcat(collectdata(H.data[1]),H.data[2])
function collectdata(H::HierarchicalVector{S}) where S
ret = S[]
append!(ret,mapreduce(collectdata,vcat,data(H)))
ret
end
convert(::Type{HierarchicalVector{S,T,HS}},M::HierarchicalVector) where {S,T,HS} = HierarchicalVector(convert(Vector{S},collectdata(M)))
Base.promote_rule(::Type{HierarchicalVector{S,T,HS}},::Type{HierarchicalVector{SS,TT,HSS}}) where {S,T,HS,SS,TT,HSS}=HierarchicalVector{promote_type(S,SS),promote_type(T,TT),promote_type(HS,HSS)}
function Base.size(H::HierarchicalVector{S}) where S<:AbstractVector
H1,H2 = data(H)
(size(H1)[1]+size(H2)[1],)
end
function Base.size(H::HierarchicalVector{S}) where S<:Number
H1,H2 = data(H)
if typeof(H1) <: S && typeof(H2) <: S
return (2,)
elseif typeof(H1) <: S
return (1+size(H2)[1],)
elseif typeof(H2) <: S
return (size(H1)[1]+1,)
else
return (size(H1)[1]+size(H2)[1],)
end
end
function Base.getindex(H::HierarchicalVector{S},i::Int) where S<:Union{Number,AbstractVector}
H1,H2 = data(H)
m1,m2 = length(H1),length(H2)
if 1 ≤ i ≤ m1
return H1[i]
elseif m1 < i ≤ m1+m2
return H2[i-m1]
else
throw(BoundsError())
end
end
function Base.setindex!(H::HierarchicalVector{S},v,i::Int) where S<:Union{Number,AbstractVector}
H1,H2 = data(H)
m1,m2 = length(H1),length(H2)
if 1 ≤ i ≤ m1
H1[i] = v
elseif m1 < i ≤ m1+m2
H2[i-m1] = v
else
throw(BoundsError())
end
end
Base.getindex(H::HierarchicalVector{S},ir::Range) where {S<:Union{Number,AbstractVector}} =
eltype(H)[H[i] for i=ir]
Base.full(H::HierarchicalVector{S}) where {S<:Union{Number,AbstractVector}}=H[1:size(H,1)]
# algebra
for op in ( VERSION < v"0.6-" ? (:+,:-,:.+,:.-,:.*) : (:+,:-))
@eval begin
$op(a::Bool,H::HierarchicalVector{S,Bool}) where {S} = error("Not callable")
$op(H::HierarchicalVector{S,Bool},a::Bool) where {S} = error("Not callable")
$op(H::HierarchicalVector) = HierarchicalVector(map($op,data(H)))
$op(H::HierarchicalVector,a::Number) = HierarchicalVector(($op(H.data[1],a),$op(H.data[2],a)))
$op(a::Number,H::HierarchicalVector) = HierarchicalVector(($op(a,H.data[1]),$op(a,H.data[2])))
$op(H::HierarchicalVector,J::HierarchicalVector) = HierarchicalVector(map($op,data(H),data(J)))
$op(H::HierarchicalVector,J::Vector) = $op(full(H),J)
$op(J::Vector,H::HierarchicalVector) = $op(J,full(H))
end
end
*(H::HierarchicalVector,a::Number) = HierarchicalVector((H.data[1]*a,H.data[2]*a))
*(a::Number,H::HierarchicalVector) = H*a
for op in (:(Base.dot),:dotu)
@eval begin
$op(H::HierarchicalVector,J::HierarchicalVector) = $op(H.data[1],J.data[1])+$op(H.data[2],J.data[2])
$op(H::HierarchicalVector,J::Vector) = $op(full(H),J)
$op(J::Vector,H::HierarchicalVector) = $op(J,full(H))
end
end
Base.cumsum(H::HierarchicalVector) = HierarchicalVector((cumsum(H.data[1]),sum(H.data[1])+cumsum(H.data[2])))
Base.conj!(H::HierarchicalVector) = (map(conj!,data(H));H)
Base.copy!(H::HierarchicalVector,J::HierarchicalVector) = (map(copy!,data(H),data(J));H)
for op in (VERSION < v"0.6-" ? (:(Base.zero),:(Base.ones),:(Base.abs),:(Base.abs2),:(Base.conj),:(Base.copy),:.^) :
(:(Base.zero),:(Base.ones),:(Base.abs),:(Base.abs2),:(Base.conj),:(Base.copy)))
@eval begin
$op(H::HierarchicalVector) = HierarchicalVector(map($op,data(H)))
end
end
Base.A_mul_B!(b::Vector,A::Matrix,H::HierarchicalVector) = A_mul_B!(b,A,full(H))
Base.A_mul_B!(b::Vector,A::LowRankMatrix,H::HierarchicalVector) = A_mul_B!(b,A,full(H))
#=
function $op{S,T,HS,SS,TT,HSS}(H::Array{HierarchicalVector{S,T,HS}}, J::Array{HierarchicalVector{SS,TT,HSS}})
ret = similar(H)
for i in eachindex(H,J)
@inbounds ret[i] = $op(H[i], J[i])
end
ret
end
function $op{S,T,HS,V}(H::Array{HierarchicalVector{S,T,HS}}, J::Array{V})
ret = similar(H)
for i in eachindex(H,J)
@inbounds ret[i] = $op(H[i], J[i])
end
ret
end
$op{S,T,HS,V}(J::Array{V}, H::Array{HierarchicalVector{S,T,HS}}) = $op(H,J)
=#