@@ -261,38 +261,6 @@ Base.convert(R::Type{ArrayOfSimilarVectors{T}}, A::AbstractArray{<:AbstractVecto
261
261
Base. convert (R:: Type{ArrayOfSimilarVectors} , A:: AbstractArray{<:AbstractVector{T},N} ) where {T,N} = R (A)
262
262
263
263
264
- # @inline Base.IndexStyle(A::ArrayOfSimilarVectors) = IndexLinear()
265
-
266
-
267
- # Base.@propagate_inbounds function _linear_data_idxs(A::ArrayOfSimilarVectors, i::Integer)
268
- # @boundscheck checkbounds(A, i)
269
- # n_inner = _innerlength(A)
270
- # i0 = firstindex(A.data)
271
- # from = (i - i0) * n_inner + i0
272
- # to = from + n_inner - 1
273
- # from:to
274
- # end
275
-
276
-
277
- # # Base.@propagate_inbounds function _linear_data_idxs(A::ArrayOfSimilarVectors, idxs::AbstractUnitRange{<:Integer})
278
- # # @boundscheck checkbounds(A, idxs)
279
- # # n_inner = _innerlength(A)
280
- # # i0 = firstindex(A.data)
281
- # # a = first(idxs)
282
- # # b = last(idxs) + 1
283
- # # from = (a - i0) * n_inner + i0
284
- # # to = (b - i0) * n_inner + i0 - 1
285
- # # from:to
286
- # # end
287
-
288
-
289
- # Base.@propagate_inbounds Base.getindex(A::ArrayOfSimilarVectors{T}, i::Integer) where {T} =
290
- # Base.view(A.data, _linear_data_idxs(A, i))
291
- #
292
- # Base.@propagate_inbounds Base.setindex!(A::ArrayOfSimilarVectors{T}, x::AbstractVector{U}, i::Integer) where {T,U} =
293
- # setindex!(A.data, x, _linear_data_idxs(A, i))
294
-
295
-
296
264
const VectorOfSimilarVectors{
297
265
T,
298
266
P<: AbstractArray{T,2}
@@ -319,9 +287,3 @@ Base.convert(R::Type{VectorOfSimilarVectors}, A::AbstractVector{<:AbstractVector
319
287
320
288
321
289
@inline Base. IndexStyle (A:: VectorOfSimilarVectors ) = IndexLinear ()
322
-
323
- # Base.@propagate_inbounds Base.getindex(A::VectorOfSimilarVectors{T}, i::Integer) where {T} =
324
- # Base.view(A.data, :, i)
325
- #
326
- # Base.@propagate_inbounds Base.setindex!(A::VectorOfSimilarVectors{T}, x::AbstractVector{U}, i::Integer) where {T,U} =
327
- # setindex!(A.data, x, :, i)
0 commit comments