01: //
02: // Copyright (C) 2005 United States Government as represented by the
03: // Administrator of the National Aeronautics and Space Administration
04: // (NASA). All Rights Reserved.
05: //
06: // This software is distributed under the NASA Open Source Agreement
07: // (NOSA), version 1.3. The NOSA has been approved by the Open Source
08: // Initiative. See the file NOSA-1.3-JPF at the top of the distribution
09: // directory tree for the complete NOSA document.
10: //
11: // THE SUBJECT SOFTWARE IS PROVIDED "AS IS" WITHOUT ANY WARRANTY OF ANY
12: // KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT
13: // LIMITED TO, ANY WARRANTY THAT THE SUBJECT SOFTWARE WILL CONFORM TO
14: // SPECIFICATIONS, ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR
15: // A PARTICULAR PURPOSE, OR FREEDOM FROM INFRINGEMENT, ANY WARRANTY THAT
16: // THE SUBJECT SOFTWARE WILL BE ERROR FREE, OR ANY WARRANTY THAT
17: // DOCUMENTATION, IF PROVIDED, WILL CONFORM TO THE SUBJECT SOFTWARE.
18: //
19: package gov.nasa.jpf.search.heuristic;
20:
21: import java.util.Comparator;
22:
23: /**
24: * hashcode comparator for heuristic state ordering
25: */
26: public class HashcodeComparator implements Comparator {
27:
28: public int compare(Object o1, Object o2) {
29: HeuristicState hs1 = (HeuristicState) o1;
30: HeuristicState hs2 = (HeuristicState) o2;
31:
32: int p1 = hs1.getPriority();
33: int p2 = hs2.getPriority();
34:
35: if (p1 == p2) {
36: int h1 = hs1.hashCode();
37: int h2 = hs2.hashCode();
38:
39: if (h1 == h2) {
40: return 0;
41: } else if (h1 < h2) {
42: return -1;
43: } else {
44: return 1;
45: }
46: } else if (p1 < p2) {
47: return -1;
48: } else {
49: return 1;
50: }
51: }
52: }
|