File tree 1 file changed +1
-1
lines changed
1 file changed +1
-1
lines changed Original file line number Diff line number Diff line change @@ -258,7 +258,7 @@ provides a traits-based mechanism to enable efficient generic code for all array
258
258
259
259
This distinction determines which scalar indexing methods the type must define. ` IndexLinear() `
260
260
arrays are simple: just define ` getindex(A::ArrayType, i::Int) ` . When the array is subsequently
261
- indexed with a multidimensional set of indices, the fallback ` getindex(A::AbstractArray, I...)() `
261
+ indexed with a multidimensional set of indices, the fallback ` getindex(A::AbstractArray, I...) `
262
262
efficiently converts the indices into one linear index and then calls the above method. ` IndexCartesian() `
263
263
arrays, on the other hand, require methods to be defined for each supported dimensionality with
264
264
` ndims(A) ` ` Int ` indices. For example, [ ` SparseMatrixCSC ` ] ( @ref ) from the ` SparseArrays ` standard
You can’t perform that action at this time.
0 commit comments