used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 cost of incremental reallocation by doing it once up front; this can improve performance. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods 8-element Vector{Int64}: -1 -2 -3 2 5 4 3 -1 source Base.resize! – Function. resize!(a::Vector, n::Integer) -> Vector Resize a to contain n elements. If n is smaller than the current collection

used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 cost of incremental reallocation by doing it once up front; this can improve performance. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods 8-element Vector{Int64}: -1 -2 -3 2 5 4 3 -1 source Base.resize! – Function. resize!(a::Vector, n::Integer) -> Vector Resize a to contain n elements. If n is smaller than the current collection

used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 default), the collection's capacity may be reduced if its current capacity is greater than n. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods COLLECTIONS AND DATA STRUCTURES 807 2 5 4 3 -1 source Base.resize! – Function. resize!(a::Vector, n::Integer) -> Vector Resize a to contain n elements. If n is smaller than the current collection

used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 default), the collection's capacity may be reduced if its current capacity is greater than n. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods COLLECTIONS AND DATA STRUCTURES 807 2 5 4 3 -1 source Base.resize! – Function. resize!(a::Vector, n::Integer) -> Vector Resize a to contain n elements. If n is smaller than the current collection

used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 default), the collection's capacity may be reduced if its current capacity is greater than n. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods COLLECTIONS AND DATA STRUCTURES 807 2 5 4 3 -1 source Base.resize! – Function. resize!(a::Vector, n::Integer) -> Vector Resize a to contain n elements. If n is smaller than the current collection

used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 default), the collection's capacity may be reduced if its current capacity is greater than n. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods COLLECTIONS AND DATA STRUCTURES 801 2 5 4 3 -1 source Base.resize! – Function. resize!(a::Vector, n::Integer) -> Vector Resize a to contain n elements. If n is smaller than the current collection

used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 default), the collection's capacity may be reduced if its current capacity is greater than n. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods 8-element Vector{Int64}: -1 -2 -3 2 5 4 3 -1 source Base.resize! – Function. resize!(a::Vector, n::Integer) -> Vector Resize a to contain n elements. If n is smaller than the current collection

used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 default), the collection's capacity may be reduced if its current capacity is greater than n. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods (collection, n:n-1, replacement). source Base.resize! – Function.CHAPTER 44. COLLECTIONS AND DATA STRUCTURES 842 resize!(a::Vector, n::Integer) -> a Resize a to contain n elements. If n is smaller than

used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 default), the collection's capacity may be reduced if its current capacity is greater than n. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods (collection, n:n-1, replacement). source Base.resize! – Function.CHAPTER 44. COLLECTIONS AND DATA STRUCTURES 840 resize!(a::Vector, n::Integer) -> Vector Resize a to contain n elements. If n is smaller than

used to select between algorithms that pre-allocate space for their result, and algorithms that resize their result incrementally. julia> Base.IteratorSize(1:5) Base.HasShape{1}() julia> Base.IteratorSize((2 default), the collection's capacity may be reduced if its current capacity is greater than n. See also resize!. Notes on the performance model For types that support sizehint!, 1. push! and append! methods (collection, n:n-1, replacement). source Base.resize! – Function.CHAPTER 44. COLLECTIONS AND DATA STRUCTURES 839 resize!(a::Vector, n::Integer) -> Vector Resize a to contain n elements. If n is smaller than