TwistyPuzzleLib

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

// Copyright 2023 Leszek Koltunski                                                               //

//                                                                                               //

// This file is part of Magic Cube.                                                              //

//                                                                                               //

// Magic Cube is proprietary software licensed under an EULA which you should have received      //

// along with the code. If not, check https://distorted.org/magic/License-Magic-Cube.html        //

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

package org.distorted.objectlib.tablebases;

import android.content.res.Resources;

import java.io.ByteArrayOutputStream;

import java.io.IOException;

import java.io.InputStream;

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

public abstract class TablebasesMITM extends TablebasesAbstract

{

  private PruningTable[] mTables;

  private boolean mInitialized;

  private int[] mLevels;

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

  abstract int[] getPruningLevels();

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

  private void createPruningTable(Resources res, int id, int index)

    {

    InputStream stream = res.openRawResource(id);

    ByteArrayOutputStream buffer = new ByteArrayOutputStream();

    int nRead;

    byte[] tmp = new byte[16384];

    try

      {

      while ((nRead = stream.read(tmp, 0, tmp.length)) != -1)

        {

        buffer.write(tmp, 0, nRead);

        }

      stream.close();

      byte[] data = buffer.toByteArray();

      buffer.close();

      mTables[index] = new PruningTable(data);

      mLevels[index] = mTables[index].getLevel();

      }

    catch(IOException ex)

      {

      mInitialized = false;

      }

    }

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

  public TablebasesMITM()

    {

    super();

    }

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

  public TablebasesMITM(Resources res, int[] resourceIDs)

    {

    super();

    int numOfIDs = resourceIDs.length;

    mTables = new PruningTable[numOfIDs];

    mLevels = new int[numOfIDs];

    mInitialized = true;

    for(int i=0; i<numOfIDs; i++) createPruningTable(res,resourceIDs[i],i);

    }

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

  public byte[][] getPacked()

    {

    int[] levels = getPruningLevels();

    int numLevels = levels.length;

    int maxLevel = 0;

    for( int l : levels )

      if( l>maxLevel ) maxLevel = l;

    createTablebase(maxLevel);

    byte[][] data = new byte[numLevels][];

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

      {

      PruningTable table = new PruningTable(mTablebase,levels[i]);

      data[i] = table.getPacked();

      }

    return data;

    }

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

  public int[][] solution(int index, int[] extra)

    {

    return null;

    }

}