Rotate 1D Array

If n is positive, the indices of elements move right, and if n is negative, the indices of elements move left. For example, if n is 1, all elements in array move right one index place, so the first element becomes the second element and the last element becomes the first. If n is -1, all elements move left one index place, so the second element becomes the first element and the first element becomes the last. The node coerces n to a 32-bit integer if you wire another representation to it.

For example, if n is 1, the input array[0] becomes rotated array[1], input array[1] becomes rotated array[2], and so on, and input array[m-1] becomes rotated array[0], where m is the number of elements in the array. If n is -2, input array[0] becomes rotated array[m-2], input array[1] becomes rotated array[m-1], and so on, and input array[m-1] becomes rotated array[m-3], where m is the number of elements in the array.