Project

General

Profile

Download (19.4 KB) Statistics
| Branch: | Tag: | Revision:

magiccube / src / main / java / org / distorted / objects / TwistyKilominx.java @ ca824448

1 bbc6da6c Leszek Koltunski
///////////////////////////////////////////////////////////////////////////////////////////////////
2
// Copyright 2020 Leszek Koltunski                                                               //
3
//                                                                                               //
4
// This file is part of Magic Cube.                                                              //
5
//                                                                                               //
6
// Magic Cube is free software: you can redistribute it and/or modify                            //
7
// it under the terms of the GNU General Public License as published by                          //
8
// the Free Software Foundation, either version 2 of the License, or                             //
9
// (at your option) any later version.                                                           //
10
//                                                                                               //
11
// Magic Cube is distributed in the hope that it will be useful,                                 //
12
// but WITHOUT ANY WARRANTY; without even the implied warranty of                                //
13
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the                                 //
14
// GNU General Public License for more details.                                                  //
15
//                                                                                               //
16
// You should have received a copy of the GNU General Public License                             //
17
// along with Magic Cube.  If not, see <http://www.gnu.org/licenses/>.                           //
18
///////////////////////////////////////////////////////////////////////////////////////////////////
19
20
package org.distorted.objects;
21
22
import android.content.res.Resources;
23
import android.graphics.Canvas;
24
import android.graphics.Paint;
25
26
import org.distorted.library.effect.MatrixEffectQuaternion;
27
import org.distorted.library.main.DistortedEffects;
28
import org.distorted.library.main.DistortedTexture;
29
import org.distorted.library.mesh.MeshBase;
30
import org.distorted.library.mesh.MeshSquare;
31
import org.distorted.library.type.Static3D;
32
import org.distorted.library.type.Static4D;
33
import org.distorted.main.R;
34 ead91342 Leszek Koltunski
import org.distorted.main.RubikSurfaceView;
35
36
import static org.distorted.objects.FactoryCubit.COS18;
37
import static org.distorted.objects.FactoryCubit.COS54;
38 7764a67a Leszek Koltunski
import static org.distorted.objects.FactoryCubit.SIN18;
39 ca824448 Leszek Koltunski
import static org.distorted.objects.FactoryCubit.SIN54;
40 bbc6da6c Leszek Koltunski
41
///////////////////////////////////////////////////////////////////////////////////////////////////
42
43 a64e07d0 Leszek Koltunski
public class TwistyKilominx extends TwistyMinx
44 bbc6da6c Leszek Koltunski
{
45 7764a67a Leszek Koltunski
  private static MeshBase[] mCenterMeshes, mCornerMeshes;
46
  private static MeshBase[][] mEdgeMeshes;
47
48 22b32e57 Leszek Koltunski
  private static final int[] mCenterFaceMap = new int[]
49
      {
50
        0,0,0,0,1,
51
        1,0,1,1,0,
52
        2,0,1,1,0,
53
        2,2,1,0,2,
54
        2,1,0,0,1,
55
        1,2,0,1,0,
56
        0,1,0,1,1,
57
        0,1,0,2,0,
58
        2,1,2,2,2,
59
        1,0,2,1,2,
60
        2,1,0,1,2,
61
        2,2,2,2,2
62
      };
63
64 7764a67a Leszek Koltunski
  private static final int mNumCornerEdgeVariants;
65
66
  static
67
    {
68
    int[] sizes = ObjectList.KILO.getSizes();
69
    int variants = sizes.length;
70
    mNumCornerEdgeVariants = sizes[0]==3 ? variants-1 : variants;
71
    }
72 bbc6da6c Leszek Koltunski
73
///////////////////////////////////////////////////////////////////////////////////////////////////
74
75 a64e07d0 Leszek Koltunski
  TwistyKilominx(int size, Static4D quat, DistortedTexture texture, MeshSquare mesh,
76
                 DistortedEffects effects, int[][] moves, Resources res, int scrWidth)
77 bbc6da6c Leszek Koltunski
    {
78 a64e07d0 Leszek Koltunski
    super(size, size, quat, texture, mesh, effects, moves, ObjectList.KILO, res, scrWidth);
79 bbc6da6c Leszek Koltunski
    }
80
81
///////////////////////////////////////////////////////////////////////////////////////////////////
82
83 f6e46300 Leszek Koltunski
  private int numCubitsPerCorner(int numLayers)
84 bbc6da6c Leszek Koltunski
    {
85 ead91342 Leszek Koltunski
    return 3*((numLayers-3)/2)*((numLayers-5)/2) + (numLayers<5 ? 0:1);
86 bbc6da6c Leszek Koltunski
    }
87
88
///////////////////////////////////////////////////////////////////////////////////////////////////
89
90 f6e46300 Leszek Koltunski
  private int numCubitsPerEdge(int numLayers)
91 bbc6da6c Leszek Koltunski
    {
92 ead91342 Leszek Koltunski
    return numLayers<5 ? 0 : 2*(numLayers-4);
93 bbc6da6c Leszek Koltunski
    }
94
95
///////////////////////////////////////////////////////////////////////////////////////////////////
96
97 f6e46300 Leszek Koltunski
  int getNumStickerTypes(int numLayers)
98 bbc6da6c Leszek Koltunski
    {
99 ead91342 Leszek Koltunski
    return numLayers<5 ? 1 : numLayers/2 + 1;
100 bbc6da6c Leszek Koltunski
    }
101
102 ab210d63 Leszek Koltunski
///////////////////////////////////////////////////////////////////////////////////////////////////
103
104
  float getScreenRatio()
105
    {
106
    return 1.00f;
107
    }
108
109 bbc6da6c Leszek Koltunski
///////////////////////////////////////////////////////////////////////////////////////////////////
110 f6e46300 Leszek Koltunski
111
  float[] getCuts(int numLayers)
112
    {
113 ead91342 Leszek Koltunski
    float[] cuts = new float[numLayers-1];
114
    float D = numLayers*MovementMinx.DIST3D;
115
    float E = 2*C1;           // 2*cos(36 deg)
116
    float X = 2*D*E/(1+2*E);  // height of the 'upper' part of a dodecahedron, i.e. put it on a table,
117
                              // its height is then D*2*DIST3D, it has one 'lower' part of height X, one
118
                              // 'middle' part of height Y and one upper part of height X again.
119
                              // It's edge length = numLayers/3.0f.
120
    int num = (numLayers-1)/2;
121
    float G = X*0.5f/num;     // height of one Layer
122
123
    for(int i=0; i<num; i++)
124
      {
125
      cuts[        i] = -D + (i+0.5f)*G;
126
      cuts[2*num-1-i] = -cuts[i];
127
      }
128
129
    return cuts;
130
    }
131
132
///////////////////////////////////////////////////////////////////////////////////////////////////
133
// Fill out mCurrCorner{X,Y,Z} by applying appropriate Quat to mBasicCorner{X,Y,Z}
134
// Appropriate one: QUATS[QUAT_INDICES[corner]].
135
136
  private void computeBasicCornerVectors(int corner)
137
    {
138
    Static4D quat = QUATS[QUAT_CORNER_INDICES[corner]];
139
140
    mCurrCornerV[0] = RubikSurfaceView.rotateVectorByQuat(mBasicCornerV[0],quat);
141
    mCurrCornerV[1] = RubikSurfaceView.rotateVectorByQuat(mBasicCornerV[1],quat);
142
    mCurrCornerV[2] = RubikSurfaceView.rotateVectorByQuat(mBasicCornerV[2],quat);
143
    }
144
145
///////////////////////////////////////////////////////////////////////////////////////////////////
146
147
  private float[] computeCorner(int numCubitsPerCorner, int numLayers, int corner, int part)
148
    {
149
    float D = numLayers/3.0f;
150
    float[] corn = CORNERS[corner];
151
152
    if( part==0 )
153
      {
154
      return new float[] { corn[0]*D, corn[1]*D, corn[2]*D };
155
      }
156
    else
157
      {
158
      float E = D/(0.5f*(numLayers-1));   // ?? maybe 0.5*
159
      int N = (numCubitsPerCorner-1)/3;
160
      int block = (part-1) % N;
161
      int index = (part-1) / N;
162
      Static4D pri = mCurrCornerV[index];
163
      Static4D sec = mCurrCornerV[(index+2)%3];
164
165
      int layers= (numLayers-5)/2;
166
      int multP = (block % layers) + 1;
167
      int multS = (block / layers);
168
169
      return new float[] {
170
                          corn[0]*D + (pri.get0()*multP + sec.get0()*multS)*E,
171
                          corn[1]*D + (pri.get1()*multP + sec.get1()*multS)*E,
172
                          corn[2]*D + (pri.get2()*multP + sec.get2()*multS)*E
173
                         };
174
      }
175
    }
176
177
///////////////////////////////////////////////////////////////////////////////////////////////////
178
179
  private float[] computeCenter(int numLayers, int center, int part)
180
    {
181
    int corner = mCenterMap[center][part];
182
    float[] cent = mCenterCoords[center];
183
    float[] corn = CORNERS[corner];
184
    float D = numLayers/3.0f;
185
    float F = 1.0f - (2.0f*numLayers-6.0f)/(numLayers-1)*COS54*COS54;
186
187
    return new float[]
188
      {
189
        D * ( cent[0] + (corn[0]-cent[0])*F),
190
        D * ( cent[1] + (corn[1]-cent[1])*F),
191
        D * ( cent[2] + (corn[2]-cent[2])*F)
192
      };
193
    }
194
195
///////////////////////////////////////////////////////////////////////////////////////////////////
196
197
  private int computeEdgeType(int cubit, int numCubitsPerCorner, int numCubitsPerEdge)
198
    {
199
    int part = (cubit - NUM_CORNERS*numCubitsPerCorner) % numCubitsPerEdge;
200 7764a67a Leszek Koltunski
    return part - 2*(part/4);
201 ead91342 Leszek Koltunski
    }
202
203
///////////////////////////////////////////////////////////////////////////////////////////////////
204
205
  private float[] computeEdge(int numLayers, int edge, int part)
206
    {
207
    float D = numLayers/3.0f;
208
    float[] c1 = CORNERS[ mEdgeMap[edge][0] ];
209
    float[] c2 = CORNERS[ mEdgeMap[edge][1] ];
210
211 16f34a98 Leszek Koltunski
    int leftRight = 2*(part%2) -1;
212 ead91342 Leszek Koltunski
    part /= 2;
213
214
    if( part==0 )
215
      {
216 16f34a98 Leszek Koltunski
      float T = 0.5f + leftRight/(numLayers-1.0f);
217
      float x = D * (T*c1[0]+(1.0f-T)*c2[0]);
218
      float y = D * (T*c1[1]+(1.0f-T)*c2[1]);
219
      float z = D * (T*c1[2]+(1.0f-T)*c2[2]);
220
221 ead91342 Leszek Koltunski
      return new float[] { x, y, z };
222
      }
223
    else
224
      {
225
      int mult = (part+1)/2;
226
      int dir  = (part+1)%2;
227
      float[] center = mCenterCoords[ mEdgeMap[edge][dir+2] ];
228 16f34a98 Leszek Koltunski
      float x = 0.5f * D * (c1[0]+c2[0]);
229
      float y = 0.5f * D * (c1[1]+c2[1]);
230
      float z = 0.5f * D * (c1[2]+c2[2]);
231 ead91342 Leszek Koltunski
232
      float vX = D*center[0] - x;
233
      float vY = D*center[1] - y;
234
      float vZ = D*center[2] - z;
235
236 a4962b9c Leszek Koltunski
      float T = 0.5f + leftRight*(mult*SIN18 + 1.0f)/(numLayers-1);
237
238 16f34a98 Leszek Koltunski
      x = D * (T*c1[0]+(1.0f-T)*c2[0]);
239
      y = D * (T*c1[1]+(1.0f-T)*c2[1]);
240
      z = D * (T*c1[2]+(1.0f-T)*c2[2]);
241
242
      float H = mult*D*COS18/(numLayers-1);
243
      H /= (float)Math.sqrt(vX*vX+vY*vY+vZ*vZ);
244 ead91342 Leszek Koltunski
245 16f34a98 Leszek Koltunski
      return new float[] { x + H*vX, y + H*vY, z + H*vZ };
246 ead91342 Leszek Koltunski
      }
247 f6e46300 Leszek Koltunski
    }
248
249
///////////////////////////////////////////////////////////////////////////////////////////////////
250
251
  float[][] getCubitPositions(int numLayers)
252
    {
253 ead91342 Leszek Koltunski
    if( numLayers<5 ) return CORNERS;
254
255
    int numCubitsPerCorner = numCubitsPerCorner(numLayers);
256
    int numCubitsPerEdge   = numCubitsPerEdge(numLayers);
257
    int numCubitsPerCenter = 5;
258
    int numCubits = NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge + NUM_CENTERS*numCubitsPerCenter;
259
    int index=0;
260
261
    final float[][] CENTERS = new float[numCubits][];
262
263
    for(int corner=0; corner<NUM_CORNERS; corner++)
264
      {
265
      computeBasicCornerVectors(corner);
266
267
      for(int part=0; part<numCubitsPerCorner; part++, index++)
268
        {
269
        CENTERS[index] = computeCorner(numCubitsPerCorner,numLayers,corner,part);
270
        }
271
      }
272
273
    for(int edge=0; edge<NUM_EDGES; edge++)
274
      {
275
      for(int part=0; part<numCubitsPerEdge; part++, index++)
276
        {
277
        CENTERS[index] = computeEdge(numLayers, edge, part );
278
        }
279
      }
280
281 b5347187 Leszek Koltunski
    for(int center=0; center<NUM_CENTERS; center++)
282 ead91342 Leszek Koltunski
      {
283
      for(int part=0; part<numCubitsPerCenter; part++, index++)
284
        {
285
        CENTERS[index] = computeCenter(numLayers,center, part);
286
        }
287
      }
288
289
    return CENTERS;
290 f6e46300 Leszek Koltunski
    }
291
292
///////////////////////////////////////////////////////////////////////////////////////////////////
293 bbc6da6c Leszek Koltunski
294 7764a67a Leszek Koltunski
  private int getQuat(int cubit, int numCubitsPerCorner, int numCubitsPerEdge)
295 bbc6da6c Leszek Koltunski
    {
296 7764a67a Leszek Koltunski
    if( cubit < NUM_CORNERS*numCubitsPerCorner )
297
      {
298
      int corner = cubit/numCubitsPerCorner;
299
      return QUAT_CORNER_INDICES[corner];
300
      }
301
302
    if( cubit < NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge )
303
      {
304
      int edge = (cubit-NUM_CORNERS*numCubitsPerCorner)/numCubitsPerEdge;
305
      return QUAT_EDGE_INDICES[edge];
306
      }
307
308
    if( numCubitsPerCorner==0 )
309
      {
310
      return QUAT_CORNER_INDICES[cubit];
311
      }
312
    else
313
      {
314
      cubit -= (NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge);
315
      int numCubitsPerCenter = 5;
316
      int face = cubit/numCubitsPerCenter;
317
      int index= cubit%numCubitsPerCenter;
318
      int corner=mCenterMap[face][index];
319
320
      return QUAT_CORNER_INDICES[corner];
321
      }
322 bbc6da6c Leszek Koltunski
    }
323
324
///////////////////////////////////////////////////////////////////////////////////////////////////
325
326 a64e07d0 Leszek Koltunski
  MeshBase createCubitMesh(int cubit, int numLayers)
327 bbc6da6c Leszek Koltunski
    {
328 7764a67a Leszek Koltunski
    int numCubitsPerCorner = numCubitsPerCorner(numLayers);
329
    int numCubitsPerEdge   = numCubitsPerEdge(numLayers);
330
    int[] sizes = ObjectList.KILO.getSizes();
331
    int variants = sizes.length;
332
    int highestSize = sizes[variants-1];
333
    int lowestSize = sizes[0];
334
    int indexCornerEdge = (numLayers-lowestSize)/2 - (lowestSize==3 ? 1:0);
335
    MeshBase mesh;
336
337
    if( mNumCornerEdgeVariants>0 )
338
      {
339
      if( mCornerMeshes==null ) mCornerMeshes = new MeshBase[mNumCornerEdgeVariants];
340 b5347187 Leszek Koltunski
      if( mEdgeMeshes  ==null ) mEdgeMeshes   = new MeshBase[mNumCornerEdgeVariants][highestSize-3];
341 7764a67a Leszek Koltunski
      }
342
343
    if( mCenterMeshes==null ) mCenterMeshes = new MeshBase[variants];
344
345
    if( cubit < NUM_CORNERS*numCubitsPerCorner )
346
      {
347
      if( mCornerMeshes[indexCornerEdge]==null )
348
        {
349 16f34a98 Leszek Koltunski
        float width = (numLayers/3.0f)/(numLayers-1);
350
        mCornerMeshes[indexCornerEdge] = FactoryCubit.getInstance().createMinxCornerMesh(numLayers,width);
351 7764a67a Leszek Koltunski
        }
352
      mesh = mCornerMeshes[indexCornerEdge].copy(true);
353
      }
354
    else if( cubit<NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge )
355
      {
356
      int type = computeEdgeType(cubit,numCubitsPerCorner,numCubitsPerEdge);  // left-top, right-top, left-second, right-second, left-third...
357
358
      if( mEdgeMeshes[indexCornerEdge][type]==null )
359
        {
360
        float tmp   = (numLayers/3.0f)/(numLayers-1);
361
        float height= tmp*COS18;
362 a4962b9c Leszek Koltunski
        float width = tmp + (type/2)*tmp*SIN18;
363 7764a67a Leszek Koltunski
364 16f34a98 Leszek Koltunski
        mEdgeMeshes[indexCornerEdge][type] = FactoryCubit.getInstance().createKilominxEdgeMesh(numLayers,width,height, (type%2)==0 );
365 7764a67a Leszek Koltunski
        }
366
367
      mesh = mEdgeMeshes[indexCornerEdge][type].copy(true);
368
      }
369
    else
370
      {
371
      int indexCenter = (numLayers-3)/2;
372
373
      if( mCenterMeshes[indexCenter]==null )
374
        {
375
        float width = (1+0.5f*(numLayers-3)*SIN18)*(numLayers/3.0f)/(numLayers-1);
376
        mCenterMeshes[indexCenter] = FactoryCubit.getInstance().createKilominxCenterMesh(width);
377
        }
378
379
      mesh = mCenterMeshes[indexCenter].copy(true);
380
      }
381 bbc6da6c Leszek Koltunski
382 7764a67a Leszek Koltunski
    Static4D q = QUATS[getQuat(cubit,numCubitsPerCorner,numCubitsPerEdge)];
383
    MatrixEffectQuaternion quat = new MatrixEffectQuaternion( q, new Static3D(0,0,0) );
384 bbc6da6c Leszek Koltunski
    mesh.apply(quat,0xffffffff,0);
385
386
    return mesh;
387
    }
388
389
///////////////////////////////////////////////////////////////////////////////////////////////////
390
391 a4962b9c Leszek Koltunski
  int getCornerColor(int cubit, int cubitface, int numLayers, int numCubitsPerCorner)
392 bbc6da6c Leszek Koltunski
    {
393 a4962b9c Leszek Koltunski
    if( cubitface<0 || cubitface>2 ) return NUM_TEXTURES;
394
395
    int part  = cubit % numCubitsPerCorner;
396
    int corner= cubit / numCubitsPerCorner;
397
398
    if( part==0 )
399 b5347187 Leszek Koltunski
      {
400 a4962b9c Leszek Koltunski
      return mCornerFaceMap[corner][cubitface];
401 b5347187 Leszek Koltunski
      }
402 a4962b9c Leszek Koltunski
    else
403
      {
404
      int N = (numCubitsPerCorner-1)/3;
405
      int block = (part-1) % N;
406
      int index = (part-1) / N;
407 b5347187 Leszek Koltunski
408 a4962b9c Leszek Koltunski
      if( block< (numLayers-3)/2 )
409
        {
410
        switch(index)
411
          {
412
          case 0: return cubitface==1 ? NUM_TEXTURES : mCornerFaceMap[corner][cubitface];
413
          case 1: return cubitface==0 ? NUM_TEXTURES : mCornerFaceMap[corner][cubitface];
414
          case 2: return cubitface==2 ? NUM_TEXTURES : mCornerFaceMap[corner][cubitface];
415
          }
416
        }
417
      else
418
        {
419
        switch(index)
420
          {
421
          case 0: return cubitface==0 ? mCornerFaceMap[corner][cubitface] : NUM_TEXTURES;
422
          case 1: return cubitface==2 ? mCornerFaceMap[corner][cubitface] : NUM_TEXTURES;
423
          case 2: return cubitface==1 ? mCornerFaceMap[corner][cubitface] : NUM_TEXTURES;
424
          }
425
        }
426
      }
427
428
    return NUM_TEXTURES;
429
    }
430
431
///////////////////////////////////////////////////////////////////////////////////////////////////
432
433
  int getEdgeColor(int edge, int cubitface, int numCubitsPerEdge)
434
    {
435
    if( cubitface<0 || cubitface>1 ) return NUM_TEXTURES;
436 7a606778 Leszek Koltunski
437 a4962b9c Leszek Koltunski
    int part    = edge % numCubitsPerEdge;
438
    int variant = edge / numCubitsPerEdge;
439 7a606778 Leszek Koltunski
440 a4962b9c Leszek Koltunski
    part /=2;
441
442
    return (part==0 || cubitface==((part+1)%2)) ? mEdgeMap[variant][cubitface+2] + ((part+3)/2)*NUM_FACES : NUM_TEXTURES;
443
    }
444
445
///////////////////////////////////////////////////////////////////////////////////////////////////
446
447
  int getCenterColor(int center, int cubitface, int numLayers)
448
    {
449
     if( numLayers==3 )
450 7a606778 Leszek Koltunski
      {
451 a4962b9c Leszek Koltunski
      return cubitface>=0 && cubitface<3 ? mCornerFaceMap[center][cubitface] : NUM_TEXTURES;
452 7a606778 Leszek Koltunski
      }
453
454 22b32e57 Leszek Koltunski
    return cubitface==mCenterFaceMap[center] ? center/5 + NUM_FACES*(numLayers-1)/2 : NUM_TEXTURES;
455 a4962b9c Leszek Koltunski
    }
456
457
///////////////////////////////////////////////////////////////////////////////////////////////////
458
459
  int getFaceColor(int cubit, int cubitface, int numLayers)
460
    {
461
    int numCubitsPerCorner = numCubitsPerCorner(numLayers);
462
    int numCubitsPerEdge   = numCubitsPerEdge(numLayers);
463
464
    if( cubit < NUM_CORNERS*numCubitsPerCorner )
465
      {
466
      return getCornerColor(cubit,cubitface,numLayers,numCubitsPerCorner);
467
      }
468
    else if( cubit<NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge )
469
      {
470
      int edge = cubit - NUM_CORNERS*numCubitsPerCorner;
471
      return getEdgeColor(edge,cubitface,numCubitsPerEdge);
472
      }
473
    else
474
      {
475
      int center = cubit-NUM_CORNERS*numCubitsPerCorner-NUM_EDGES*numCubitsPerEdge;
476
      return getCenterColor( center, cubitface, numLayers);
477
      }
478 bbc6da6c Leszek Koltunski
    }
479
480
///////////////////////////////////////////////////////////////////////////////////////////////////
481
482
  void createFaceTexture(Canvas canvas, Paint paint, int face, int left, int top)
483
    {
484 ca824448 Leszek Koltunski
    int COLORS = FACE_COLORS.length;
485
    int variant = face/COLORS;
486
    int numLayers = getNumLayers();
487 bbc6da6c Leszek Koltunski
488 ca824448 Leszek Koltunski
    if( variant == (numLayers-1)/2 || numLayers==3 )
489
      {
490
      float S = 0.07f;
491
      float R = 0.09f;
492
493
      float A = 0.86f;
494
      float X1= (SQ5+1)/8;
495
      float Y1= (float)(Math.sqrt(2+0.4f*SQ5)/4);
496
      float Y2= Y1 - (float)(Math.sqrt(10-2*SQ5)/8);
497
498
      float[] vertices = { -X1, Y2, 0, -A*Y1, X1, Y2, 0, Y1 };
499 4e627d8b Leszek Koltunski
500 ca824448 Leszek Koltunski
      FactorySticker factory = FactorySticker.getInstance();
501
      factory.drawRoundedPolygon(canvas, paint, left, top, vertices, S, FACE_COLORS[face%NUM_FACES], R);
502 bbc6da6c Leszek Koltunski
503 ca824448 Leszek Koltunski
      float MID = TEXTURE_HEIGHT*0.5f;
504
      float WID = TEXTURE_HEIGHT*0.1f;
505
      float HEI = TEXTURE_HEIGHT*(0.47f+Y1);
506
      canvas.drawLine(left+MID-WID,top+HEI,left+MID+WID,top+HEI,paint);
507
      }
508
    else if( variant==0 )
509
      {
510
      float Y = COS54/(2*SIN54);
511
      float R = 0.09f;
512
      float S = 0.09f;
513
      float[] vertices = { -0.5f, 0.0f, 0.0f, -Y, 0.5f, 0.0f, 0.0f, Y };
514 4b4c217e Leszek Koltunski
515 ca824448 Leszek Koltunski
      FactorySticker factory = FactorySticker.getInstance();
516
      factory.drawRoundedPolygon(canvas, paint, left, top, vertices, S, FACE_COLORS[face%COLORS], R);
517
      }
518
    else
519
      {
520
      float R = 0.07f;
521
      float S = 0.07f;
522
523
      float tmp   = (numLayers/3.0f)/(numLayers-1);
524
      float height= tmp*COS18;
525
      float width = tmp + (variant-1)*tmp*SIN18;
526
      float D = height/COS18;
527
      float W = D*SIN18;
528
      float X1 = height/2;
529
      float Y1 = width/2;
530
      float[] vertices = { -X1,-Y1, X1, -Y1, X1, Y1+W,-X1, Y1 };
531
532
      FactorySticker factory = FactorySticker.getInstance();
533
      factory.drawRoundedPolygon(canvas, paint, left, top, vertices, S, FACE_COLORS[face%COLORS], R);
534
      }
535 bbc6da6c Leszek Koltunski
    }
536
537
///////////////////////////////////////////////////////////////////////////////////////////////////
538
// PUBLIC API
539
540
  public boolean isSolved()
541
    {
542 f6e46300 Leszek Koltunski
    int index = CUBITS[0].mQuatIndex;
543 bbc6da6c Leszek Koltunski
544 f6e46300 Leszek Koltunski
    for(int i=1; i<NUM_CUBITS; i++)
545 bbc6da6c Leszek Koltunski
      {
546 f6e46300 Leszek Koltunski
      if( thereIsVisibleDifference(CUBITS[i], index) ) return false;
547 bbc6da6c Leszek Koltunski
      }
548
549
    return true;
550
    }
551
552
///////////////////////////////////////////////////////////////////////////////////////////////////
553
554
  public int getObjectName(int numLayers)
555
    {
556 f6e46300 Leszek Koltunski
    if( numLayers==3 ) return R.string.minx2;
557
    if( numLayers==5 ) return R.string.minx4;
558
559
    return 0;
560 bbc6da6c Leszek Koltunski
    }
561
562
///////////////////////////////////////////////////////////////////////////////////////////////////
563
564
  public int getInventor(int numLayers)
565
    {
566 f6e46300 Leszek Koltunski
    if( numLayers==3 ) return R.string.minx2_inventor;
567
    if( numLayers==5 ) return R.string.minx4_inventor;
568
569
    return 0;
570 bbc6da6c Leszek Koltunski
    }
571
572
///////////////////////////////////////////////////////////////////////////////////////////////////
573
574
  public int getComplexity(int numLayers)
575
    {
576
    return 3;
577
    }
578
}