Sparse Arrays 1461 92.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . 1461 92.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed if there are leading zero digits which don’t contribute to the value, they count for determining storage size of a literal. So 0x01 is a UInt8 while 0x0001 is a UInt16. That allows the user to control

Sparse Arrays 1461 92.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . 1461 92.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed if there are leading zero digits which don’t contribute to the value, they count for determining storage size of a literal. So 0x01 is a UInt8 while 0x0001 is a UInt16. That allows the user to control

Arrays 1223 89.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . . . . . . 1223 89.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed The traditional function declaration syntax demonstrated above is equivalent to the following compact "assignment form": julia> f(x,y) = x + y f (generic function with 1 method) In the assignment

Arrays 1166 89.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . . . . . . 1166 89.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed The traditional function declaration syntax demonstrated above is equivalent to the following compact "assignment form": julia> f(x,y) = x + y f (generic function with 1 method) In the assignment

Arrays 1167 89.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . . . . . . 1167 89.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed The traditional function declaration syntax demonstrated above is equivalent to the following compact "assignment form": julia> f(x,y) = x + y f (generic function with 1 method) In the assignment

Arrays 1166 88.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . . . . . . 1166 88.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed The traditional function declaration syntax demonstrated above is equivalent to the following compact "assignment form": julia> f(x,y) = x + y f (generic function with 1 method) In the assignment

Arrays 1219 89.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . . . . . . 1219 89.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed The traditional function declaration syntax demonstrated above is equivalent to the following compact "assignment form": julia> f(x,y) = x + y f (generic function with 1 method) In the assignment

Arrays 1166 89.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . . . . . . 1166 89.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed The traditional function declaration syntax demonstrated above is equivalent to the following compact "assignment form": julia> f(x,y) = x + y f (generic function with 1 method) In the assignment

Arrays 1205 87.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . . . . . . 1205 87.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed The traditional function declaration syntax demonstrated above is equivalent to the following compact "assignment form": julia> f(x,y) = x + y f (generic function with 1 method) In the assignment

Arrays 1166 89.1 Compressed Sparse Column (CSC) Sparse Matrix Storage . . . . . . . . . . . . . . . . . . . . 1166 89.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . comparable systems include: • Free and open source (MIT licensed) • User-defined types are as fast and compact as built-ins • No need to vectorize code for performance; devectorized code is fast • Designed The traditional function declaration syntax demonstrated above is equivalent to the following compact "assignment form": julia> f(x,y) = x + y f (generic function with 1 method) In the assignment