You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Sorry, I know you probably don't want to hear about another array indexing issue, but it would be super nice if this actually worked.
Here's the flow code in question
int starts[14] = {6,10,9,4,4,4,3,4,4,3,5,4,4,3};
int catCount = (GET_CNT(1) - 500) / 50;
int remainder = (GET_CNT(1) - 500) % 50;
int selectedSong = 0;
for(int x = 0; x < catCount; x++){
selectedSong += starts[x];
}
selectedSong += remainder + sebec;
FUNCTION_011C(19, selectedSong);
When compiling, the compiler throws a return address corruption.
We can get the code working right by unraveling the array indexing into a switch case, but that's a very messy way of doing it.
We've tried making the array a constant, dropping the length, removing the += short hand, and have had no luck.
Anything we can do to get it working right?
The text was updated successfully, but these errors were encountered:
Sorry, I know you probably don't want to hear about another array indexing issue, but it would be super nice if this actually worked.
Here's the flow code in question
When compiling, the compiler throws a return address corruption.
We can get the code working right by unraveling the array indexing into a switch case, but that's a very messy way of doing it.
We've tried making the array a constant, dropping the length, removing the
+=
short hand, and have had no luck.Anything we can do to get it working right?
The text was updated successfully, but these errors were encountered: