Revision 8cccfb10
Added by Leszek Koltunski over 5 years ago
| src/main/java/org/distorted/scores/RubikScores.java | ||
|---|---|---|
| 27 | 27 |
|
| 28 | 28 |
import java.util.UUID; |
| 29 | 29 |
|
| 30 |
import static org.distorted.objects.RubikObjectList.MAX_SIZE;
|
|
| 30 |
import static org.distorted.objects.RubikObjectList.MAX_NUM_OBJECTS;
|
|
| 31 | 31 |
import static org.distorted.objects.RubikObjectList.NUM_OBJECTS; |
| 32 | 32 |
import static org.distorted.objects.RubikObjectList.MAX_LEVEL; |
| 33 | 33 |
|
| ... | ... | |
| 52 | 52 |
|
| 53 | 53 |
private RubikScores() |
| 54 | 54 |
{
|
| 55 |
mRecords = new long[NUM_OBJECTS][MAX_SIZE][MAX_LEVEL];
|
|
| 56 |
mSubmitted = new int [NUM_OBJECTS][MAX_SIZE][MAX_LEVEL];
|
|
| 55 |
mRecords = new long[NUM_OBJECTS][MAX_NUM_OBJECTS][MAX_LEVEL];
|
|
| 56 |
mSubmitted = new int [NUM_OBJECTS][MAX_NUM_OBJECTS][MAX_LEVEL];
|
|
| 57 | 57 |
|
| 58 | 58 |
for(int i=0; i<NUM_OBJECTS; i++) |
| 59 |
for(int j=0; j<MAX_SIZE; j++)
|
|
| 59 |
for(int j=0; j<MAX_NUM_OBJECTS; j++)
|
|
| 60 | 60 |
for(int k=0; k<MAX_LEVEL; k++) |
| 61 | 61 |
{
|
| 62 | 62 |
mRecords[i][j][k] = NO_RECORD; |
| ... | ... | |
| 235 | 235 |
time = Long.parseLong(timeStr); |
| 236 | 236 |
subm = Integer.parseInt(submStr); |
| 237 | 237 |
|
| 238 |
if( sizeIndex>=0 && sizeIndex<MAX_SIZE && subm>=0 && subm<=1 )
|
|
| 238 |
if( sizeIndex>=0 && sizeIndex<MAX_NUM_OBJECTS && subm>=0 && subm<=1 )
|
|
| 239 | 239 |
{
|
| 240 | 240 |
mRecords [object][sizeIndex][level] = time; |
| 241 | 241 |
mSubmitted[object][sizeIndex][level] = subm; |
| ... | ... | |
| 309 | 309 |
mNameIsVerified = true; |
| 310 | 310 |
|
| 311 | 311 |
for(int i=0; i<NUM_OBJECTS; i++) |
| 312 |
for(int j=0; j<MAX_SIZE ; j++)
|
|
| 312 |
for(int j=0; j<MAX_NUM_OBJECTS; j++)
|
|
| 313 | 313 |
for(int k=0; k<MAX_LEVEL; k++) |
| 314 | 314 |
{
|
| 315 | 315 |
mSubmitted[i][j][k]=1; |
Also available in: Unified diff
More progreess porting RubikCube.