sortcmd.java

来自「Hecl编程语言是一个高层次的脚本语言的Java实现。其用意是要小」· Java 代码 · 共 120 行

/* Copyright 2004-2006 David N. Welton

 Licensed under the Apache License, Version 2.0 (the "License");
 you may not use this file except in compliance with the License.
 You may obtain a copy of the License at

 http://www.apache.org/licenses/LICENSE-2.0

 Unless required by applicable law or agreed to in writing, software
 distributed under the License is distributed on an "AS IS" BASIS,
 WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 See the License for the specific language governing permissions and
 limitations under the License.
 */

package org.hecl;

import java.util.*;

/**
 * <code>SortCmd</code> implements the "sort" command.
 *
 * @author <a href="mailto:[e-mail]">David N. Welton </a>
 * @version 1.0
 */

class SortCmd implements Command {
    //private Properties p = null;
    private int sortalgorithm = 0;
    private Thing sortproc = null;
    private Interp localinterp = null;

    public Thing cmdCode(Interp interp, Thing[] argv) throws HeclException {
        Vector v = ListThing.get(argv[1]);
	localinterp = interp;
	sortalgorithm = Compare.STRINGCOMPARE;
	sortproc = null;

	Properties p = new Properties(new Object[] {"by", new Thing("string")});
	p.setProps(argv, 2);

	String sortby = ((Thing)p.getProp("by")).toString();
	if (sortby.equals("int")) {
	    sortalgorithm = Compare.NUMCOMPARE;
	} else if (sortby.equals("proc")) {
	    sortalgorithm = Compare.PROCCOMPARE;
	    sortproc = p.getProp("command");
	}

	if (v.size() != 0) {
	    v = quicksort(v, 0, v.size() - 1);
	}
	//p = null;
        return ListThing.create(v);
    }

    /* FIXME - speeding this up a bit wouldn't hurt things. */

    /**
     * <code>quicksort</code> implementation.
     *
     * @param a a <code>Vector</code> value
     * @param lo an <code>int</code> value
     * @param hi an <code>int</code> value
     * @return a <code>Vector</code> value
     */
    private Vector quicksort(Vector a, int lo, int hi) throws HeclException {
        //  lo is the lower index, hi is the upper index
        //  of the region of array a that is to be sorted
        int i = lo, j = hi;
        Thing x = (Thing) a.elementAt((lo + hi) / 2);
        Thing h;

        //  partition
        do {
	    if (sortalgorithm == Compare.NUMCOMPARE) {
		while (MathCmds.compare((Thing)a.elementAt(i), x) < 0) {
		    i++;
		}
		while (MathCmds.compare((Thing)a.elementAt(j), x) > 0) {
		    j--;
		}
	    } else if (sortalgorithm == Compare.STRINGCOMPARE) {
		while (Compare.compareString((Thing)a.elementAt(i), x) < 0) {
		    i++;
		}
		while (Compare.compareString((Thing)a.elementAt(j), x) > 0) {
		    j--;
		}
	    } else if (sortalgorithm == Compare.PROCCOMPARE) {
		int vsz = a.size();
		while (Compare.compareProc((Thing)a.elementAt(i), x, localinterp, sortproc) < 0 &&
		       i < vsz) {
		    i++;
		}
		while (Compare.compareProc((Thing)a.elementAt(j), x, localinterp, sortproc) > 0 &&
		    j > 0) {
		    j--;
		}
	    }

            if (i <= j) {
                h = (Thing) a.elementAt(i);
                a.setElementAt(a.elementAt(j), i);
                a.setElementAt(h, j);
                i++;
                j--;
            }


        } while (i <= j);

        if (lo < j)
            a = quicksort(a, lo, j);
        if (i < hi && i > lo)
            a = quicksort(a, i, hi);
        return a;
    }
}