sclass JEImageCompressionTest1 {
  settable BufferedImage originalImage;
  settable BufferedImage scaledImage;
  
  *() { this(screenshot()); }
  *(BufferedImage *originalImage) {}
  
  int rows = 20;
  int imgHeight = 200;
  
  Matrix<Int> m;
  long dataBytes, dataChars;
  Matrix<Matrix<Int>> grid;
  JE_CompressEachElementIndividually<LInt> strat;
  CompressionSearch_AnyType<IJavaExpr, LLInt> search;
  CompressionSearch_AnyType<IJavaExpr, LLInt>.Submission winner;

  S get() {
    assertNotNull(originalImage);
    scaledImage = resizeImageToHeight(originalImage, imgHeight);

    m = imageToMatrix(scaledImage);
    dataBytes = m.nCells()*4+2;
    dataChars = dataBytes*2 + l("lInt(\"\")");
    print("Matrix ~ " + takeFirst_str(60, m));
    print("Trivial comp ~ " + (m.nCells()*8));
    grid = matrixToMNGrid_rows(m, rows);
    
    // the cells as int matrices
    L<Matrix<Int>> flat = matrixToList(grid);
    
    // the cells as int lists
    //L<LByte> cells = map intMatrixToByteList_littleEndian(flat);
    L<LInt> cells = map matrixToList(flat);
    
    search = jeCompressionSearch(cells, dataChars);
    strat = new JE_CompressEachElementIndividually<LInt>()
      .elementCompressionStrategy(-> new JE_RepElement)
      .onCompressionFail(ints -> javaObjectToIJavaExpr(ints);
    
    //enableScaffolding(search.scheduler());
    //enableScaffolding(strat);
    //print(scaffolding := metaGet(strat, "scaffolding"));
    search.addStrategy(strat);
    
    runProbabilisticForNSeconds(5.0, search);
    winner = search.bestSubmission();
    print(strat.stats());
    if (winner != null) {
      //print("Hard result (score " + result.scoreRatio() + ")", result.checkUnder(hardJERegime());
      print(winner);
    }
    ret winnerCode();
  }
  
  S winnerCode() {
    ret winner == null ?: str(winner.decompressor());
  }
}