I have an $n \times m \times p$ array, let's call it $r$.
I want to obtain an $n \times m \times p \times 5$ array (let's call it $q$) where $q$ is the same as $r$ except that every non-zero component now has a 3 in the new, fourth entry.
should return an array identical to
q[[;;,;;,;;,1]], q[[;;,;;,;;,2]], q[[;;,;;,;;,4]], q[[;;,;;,;;,5]]
should all return arrays with zeroes in all components.
This is obviously quite easy to achieve by acting directly on the array rules, but for larger arrays this becomes quite inefficient and it would be good to implement in a way which acts directly on the sparse arrays.