/*

 * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 *

 *   - Redistributions of source code must retain the above copyright

 *     notice, this list of conditions and the following disclaimer.

 *

 *   - Redistributions in binary form must reproduce the above copyright

 *     notice, this list of conditions and the following disclaimer in the

 *     documentation and/or other materials provided with the distribution.

 *

 *   - Neither the name of Oracle nor the names of its

 *     contributors may be used to endorse or promote products derived

 *     from this software without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

 * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR

 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR

 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF

 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING

 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 */

/*

 * This source code is provided to illustrate the usage of a given feature

 * or technique and has been deliberately simplified. Additional steps

 * required for a production-quality application, such as security checks,

 * input validation and proper error handling, might not be present in

 * this sample code.

 */

/**

 * A generic sort demonstration algorithm

 * SortAlgorithm.java, Thu Oct 27 10:32:35 1994

 *

 * @author James Gosling

 */

class SortAlgorithm {

    /**

     * The sort item.

     */

    private SortItem parent;

    /**

     * When true stop sorting.

     */

    protected boolean stopRequested = false;

    /**

     * Set the parent.

     */

    public void setParent(SortItem p) {

        parent = p;

    }

    /**

     * Pause for a while.

     */

    protected void pause() throws Exception {

        if (stopRequested) {

            throw new Exception("Sort Algorithm");

        }

        parent.pause(parent.h1, parent.h2);

    }

    /**

     * Pause for a while and mark item 1.

     */

    protected void pause(int H1) throws Exception {

        if (stopRequested) {

            throw new Exception("Sort Algorithm");

        }

        parent.pause(H1, parent.h2);

    }

    /**

     * Pause for a while and mark item 1 & 2.

     */

    protected void pause(int H1, int H2) throws Exception {

        if (stopRequested) {

            throw new Exception("Sort Algorithm");

        }

        parent.pause(H1, H2);

    }

    /**

     * Stop sorting.

     */

    public void stop() {

        stopRequested = true;

    }

    /**

     * Initialize

     */

    public void init() {

        stopRequested = false;

    }

    /**

     * This method will be called to

     * sort an array of integers.

     */

    void sort(int a[]) throws Exception {

    }

}