path.java

High performance DB query

/*
 * @(#)$Id: Path.java,v 1.10 2004/07/02 23:59:22 huebsch Exp $
 *
 * Copyright (c) 2001-2004 Regents of the University of California.
 * All rights reserved.
 *
 * This file is distributed under the terms in the attached BERKELEY-LICENSE
 * file. If you do not find these files, copies can be found by writing to:
 * Computer Science Division, Database Group, Universite of California,
 * 617 Soda Hall #1776, Berkeley, CA 94720-1776. Attention: Berkeley License
 *
 * Copyright (c) 2003-2004 Intel Corporation. All rights reserved.
 *
 * This file is distributed under the terms in the attached INTEL-LICENSE file.
 * If you do not find these files, copies can be found by writing to:
 * Intel Research Berkeley, 2150 Shattuck Avenue, Suite 1300,
 * Berkeley, CA, 94704.  Attention:  Intel License Inquiry.
 */


package simulator.schedulers.network.topology.transitstub;

/**
 * Class Path
 *
 */
public class Path {

    Object[] vertices = null;
    short startNode, endNode;    // source and destination

    /**
     * Constructor Path
     *
     * @param startNode
     * @param endNode
     */
    public Path(short startNode, short endNode) {
        this.startNode = startNode;
        this.endNode = endNode;
    }

    /**
     * Method setPath
     *
     * @param vertices
     */
    public void setPath(Object[] vertices) {
        this.vertices = vertices;
    }

    /**
     * Method hashCode
     * @return
     */
    public int hashCode() {
        return startNode + endNode;
    }

    /**
     * Method equals
     *
     * @param obj
     * @return
     */
    public boolean equals(Object obj) {
        if ( !(obj instanceof Path)) {
            return false;
        }

        Path path = (Path) obj;

        return ((path.startNode == this.startNode)
                && (path.endNode == this.endNode));
    }

    /**
     * Method getPath
     * @return
     */
    public Object[] getPath() {
        return vertices;
    }

    /**
     * Method toString
     * @return
     */
    public String toString() {
        String tempStr = "Path:< " + startNode + " " + endNode + " ";

        for (int k = 0; k < vertices.length; k++) {
            tempStr += vertices[k] + " ";
        }

        return tempStr;
    }
}