TwistyPuzzleLib

///////////////////////////////////////////////////////////////////////////////////////////////////

// If we have a flat cuboid than retCubitSolvedStatus() wrongly reports that the internal cubits

// are edges (they do have two non-black faces after all!) which leads to wrong solvedQuats and

// mis-detection of a solved status. Correct this manually here.

//

// Note that this is still not completely good in case of bandaged cuboids - there can be a 4x4x2

// bandaged cuboid whose 4 'internal' cubits from the 4x4 face are fused with the other 4 internal

// cubits from the other 4x4 face - and those would again get mis-detected as edges...

  @Override

  public int[][] getSolvedQuats()

    {

    if( mSolvedQuatsAbstract==null )

      {

      int[] numLayers = getNumLayers();

      float dx = 0.5f*(numLayers[0]-1) - 0.1f;

      float dy = 0.5f*(numLayers[1]-1) - 0.1f;

      float dz = 0.5f*(numLayers[2]-1) - 0.1f;

      float[][] pos = getPositions();

      int numTotal = pos.length;

      boolean[] isExternal = new boolean[numTotal];

      int[] internalQuat = new int[numTotal];

      int numExternal = 0;

      int pointer = 0;

      for(int cubit=0; cubit<numTotal; cubit++)

        {

        int q = cubitIsExternal(pos[cubit],dx,dy,dz);

        if( q<=0 )

          {

          isExternal[cubit] = true;

          numExternal++;

          }

        else

          {

          isExternal[cubit] = false;

          internalQuat[pointer] = q;

          pointer++;

          }

        }

      int numInternal = numTotal - numExternal;

      mSolvedQuatsAbstract = new int[numInternal+1][];

      mSolvedQuatsAbstract[0] = new int[numExternal+1];

      mSolvedQuatsAbstract[0][0] = numExternal;

      for(int i=0; i<numInternal; i++)

        {

        int q = internalQuat[i];

        mSolvedQuatsAbstract[i+1] = new int[5];

        mSolvedQuatsAbstract[i+1][0] = 1;

        mSolvedQuatsAbstract[i+1][2] = q;

        mSolvedQuatsAbstract[i+1][3] = q+1;

        mSolvedQuatsAbstract[i+1][4] = q+2;

        }

      int pointerExternal = 1;

      int pointerInternal = 1;

      for(int cubit=0; cubit<numTotal; cubit++)

        {

        if( isExternal[cubit] ) mSolvedQuatsAbstract[0][pointerExternal++] = cubit;

        else                    mSolvedQuatsAbstract[pointerInternal++][1] = cubit;

        }

      }

    return mSolvedQuatsAbstract;

    }