Now anchorPoint may be confusing so any suggestions on how that functions would be great and I’ll add it to the class.

Maybe fixing that mistake makes more sense to you now but I’ll break down that complicated bit operation that I did if you are still unsure.

Let’s assume that normally we have an array of kProgressTextureCoords = { {0,0}, {0,1}, {1,1}, {1,0} } which represents the corners of the rectangle.
{0,0} is the top left, {0,1} is the bottom left, {1,1} is the bottom right, {1,0} is the top right

For now I’ll assume our type is kProgressTimerTypeRadialCW. This means we want to grab corners in a clock-wise direction.
So if I passed in index = 1 we need to get access to the bottom right corner. {1, 1}
So an index 0 => {1,0}, 1 => {1,1}, 2 => {0,1} and so on.

But now I’ve simplified it into bits to save space 00011110.

If I pass in index = 1, it should return {1,1}. Let’s see if it works.
The function sets up our CGPoint for (x,y) where:
x = (kProgressTextureCoords>>((index< <1)+1))&1
and
y = (kProgressTextureCoords>>(index< <1))&1)

Remember that we want the value between the square bracket in our bit pattern: 0001[11]10. Which is contained in kProgressTextureCoords.

Let's solve each term to see if we do get the correct value for x = (kProgressTextureCoords>>((index< <1)+1))&1
Since our index is 1. We'll work of course from our inner brackets outward.

x = (00011110>>((1< <1)+1))&1
(00011110>>(2+1))&1
(00011110>>3)&1
(00011)&1
x = 1