1 /* =============================================================================
5 * =============================================================================
7 * Copyright (C) Stanford University, 2006. All Rights Reserved.
10 * =============================================================================
12 * For the license of bayes/sort.h and bayes/sort.c, please see the header
15 * ------------------------------------------------------------------------
17 * For the license of kmeans, please see kmeans/LICENSE.kmeans
19 * ------------------------------------------------------------------------
21 * For the license of ssca2, please see ssca2/COPYRIGHT
23 * ------------------------------------------------------------------------
25 * For the license of lib/mt19937ar.c and lib/mt19937ar.h, please see the
26 * header of the files.
28 * ------------------------------------------------------------------------
30 * For the license of lib/rbtree.h and lib/rbtree.c, please see
31 * lib/LEGALNOTICE.rbtree and lib/LICENSE.rbtree
33 * ------------------------------------------------------------------------
35 * Unless otherwise noted, the following license applies to STAMP files:
37 * Copyright (c) 2007, Stanford University
38 * All rights reserved.
40 * Redistribution and use in source and binary forms, with or without
41 * modification, are permitted provided that the following conditions are
44 * * Redistributions of source code must retain the above copyright
45 * notice, this list of conditions and the following disclaimer.
47 * * Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in
49 * the documentation and/or other materials provided with the
52 * * Neither the name of Stanford University nor the names of its
53 * contributors may be used to endorse or promote products derived
54 * from this software without specific prior written permission.
56 * THIS SOFTWARE IS PROVIDED BY STANFORD UNIVERSITY ``AS IS'' AND ANY
57 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
58 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
59 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL STANFORD UNIVERSITY BE LIABLE
60 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
61 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
62 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
63 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
64 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
65 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
66 * THE POSSIBILITY OF SUCH DAMAGE.
68 * =============================================================================
74 import java.lang.Math;
76 public class Coordinate {
82 public Coordinate() {}
85 // coordiate_alloc will be constructor
86 // coordinate_t* coordinate_alloc(long x, long y, long z)
87 public Coordinate(int x,int y,int z) {
93 public Coordinate alloc(int x,int y,int z) {
94 Coordinate c = new Coordinate(x,y,z);
104 /*========================================================
105 // coordinate_isEqual
106 ==========================================================*/
107 public static boolean isEqual(Coordinate a,Coordinate b)
109 if((a.x == b.x) && (a.y == b.y) && (a.z == b.z))
115 /*==========================================================
119 *========================================================*/
120 private static double getPairDistance(Pair p)
122 Coordinate a = (Coordinate)p.first;
123 Coordinate b = (Coordinate)p.second;
131 return Math.sqrt((double)(dx2+dy2+dz2));
135 /*================================================
136 // coordinat_ comparePair
137 * -- For sorting in list of source/destination pairs
138 * -- Route longer paths first so they are more likely to suceed
140 *================================================*/
141 public static int comparePair(final Object a,final Object b)
143 double aDistance = getPairDistance((Pair)a);
144 double bDistance = getPairDistance((Pair)b);
146 if(aDistance < bDistance) {
148 } else if(aDistance > bDistance) {
155 /*=======================================================
156 * coordinate_areAdjacent
157 *=======================================================*/
159 public static boolean areAdjacent(Coordinate a,Coordinate b)
168 return (((dx2 + dy2 + dz2) == 1) ? true : false);
172 /*=====================================================
176 *====================================================*/