exercise.cca.data.cli.main.MainCli.java Source code

Introduction

Here is the source code for exercise.cca.data.cli.main.MainCli.java

Source

package exercise.cca.data.cli.main;

//
//Copyright (c) 1979, the Gra projects.
//Please see the AUTHORS file for details.
//All rights reserved.
//Use of this source code is governed by a MIT-style license
//that can be found in the LICENSE file.
//
import java.io.IOException;

import org.springframework.beans.factory.config.PropertyPlaceholderConfigurer;
import org.springframework.beans.factory.xml.XmlBeanDefinitionReader;
import org.springframework.context.ConfigurableApplicationContext;
import org.springframework.context.support.GenericApplicationContext;
import org.springframework.core.io.ClassPathResource;

/**
 *  Core main file, runs all needed.
 *  Now just basic to began.
 *  // TODO add more, correct doc.
 *
 * @author Gra <Gobiewski Radosaw A.>
 *      https://github.com/golebier or https://golebier.github.io
 *      https://google.com/+RadoslawGolebiewski
 *      http://www.linkedin.com/pub/rados%C5%82aw-go%C5%82%C4%99biewski/70/832/35
*/
public class MainCli {
    private static final int OK_EXIT_STATUS = 0;
    private static final String CONTEXT_PATH = "main-context.xml";

    public static void main(String[] args) throws IOException {
        final ConfigurableApplicationContext applicationContext = loadContext(CONTEXT_PATH);

        if (null != applicationContext) {
            // TODO add more
        }

        new MainCli().run();
    }

    public void run() throws IOException {
        // TODO just adding final solutions, make this correct when all done.
        // DataInputReaderSimple dataInputReaderSimple = new DataInputReaderSimple(new DataInputReaderDimensions(), new DataInputReaderPieces());
        // dataInputReaderSimple.read(args)

        /* TODO first algorithm:
        List<Board> boards = new ArrayList<Board>();
        for (int y = 0; y < boardYSize(); ++y) {
            for (int x = 0; x < boardXSize(); ++x) {
                
            // TODO create list of free positions
             * use auto mode, what with start position?
                
                
                
                Board board = new Board();
                // for each position on board try to generate new pieces places to stay/place
                // if there is no same pieces in list then there is no problem,
                //   but there are/will be, should remember are this piece in different sequence
                //   was placed here? or remove clones
                 * 
                 * yep not always is possible to add board,
                 * but where costs are bigger?
                 *  move pieces on board or destroy wrong attempted and start from scratch?
                if (prepareBeard(x, y, board)) {
                    boards.add(board);
                }
                // TODO is more needed here?
            }
        }
        printBoards(boards);
        */
        System.exit(OK_EXIT_STATUS);
    }

    /* TODO pseudo code now, just to see how to do this ;)
    boolean prepareBeard(int xToStart, int yToStart, Board board) {
    // sortedListOfPiecesToPlaceOnBoard more invasive on front, then less moves are needed
    for (Piece piece : sortedListOfPiecesToPlaceOnBoard) {
        // this method fill the list of free positions to use if new piece has not got collisions
        // and place the piece on board
        if (!board.placePieceInPlaceWhereHasNotGotCollisions(piece)) {
            return false;
        }
    }
    return true;
    }
     */

    protected static ConfigurableApplicationContext loadContext(final String contextPath) {
        final GenericApplicationContext ctx = new GenericApplicationContext();
        final XmlBeanDefinitionReader xmlReader = new XmlBeanDefinitionReader(ctx);
        xmlReader.loadBeanDefinitions(new ClassPathResource(contextPath));
        final PropertyPlaceholderConfigurer placeholderProcessor = new PropertyPlaceholderConfigurer();
        ctx.addBeanFactoryPostProcessor(placeholderProcessor);
        ctx.refresh();
        return ctx;
    }
}