1) Give a description of the problem
One of my favorite pistons works most of the time, but it gives me problems a few times a month. I have two other threads trying to resolve it from different angles, but nobody is able to help there it seems. (maybe my request there is too complex) Sooo, I have decided to try to re-write the piston from scratch here.
Can anyone help me re-write lines 35-41? I have a hunch it can all be turned into one single line. Maybe, by streamlining this, it will help out the reliability of my piston (once it gets complex again)
2) What is the expected behavior?
I need each data point in the array to shift to the previous slot.
(move the data in aa[1] to aa[0]… then from aa[2] to aa[1] etc)
3) What is happening/not happening?
It works the way it is coded now, but eventually, I want 70 data points, and my method takes up too much space.