Insert (len
, a
) into the shape at position i
.
Insert (len
, a
) into the shape at position i
.
We require 0 <= i <= s.rank.
Remove the last element of the shape, returning the rest of the shape and the data.
Remove the last element of the shape, returning the rest of the shape and the data.
Unlike removing the first element of the shape, this method is relatively expensive.
Requires shape to be non-empty.
This is also known as rank
This is also known as rank
Given a permutation, perform that permutation on the Shape
Given a permutation, perform that permutation on the Shape
this implies the input must have length == rank
Return None if either of the axes are not valid
Return None if either of the axes are not valid
reverse the dimensions
reverse the dimensions