More pieces for new version of analysis
[IRC.git] / Robust / src / Analysis / MLP / WaitingElement.java
1 package Analysis.MLP;
2
3 import java.util.HashSet;
4 import java.util.Iterator;
5
6 import IR.Flat.TempDescriptor;
7
8 public class WaitingElement {
9
10         private int queueID;
11         private int status;
12         private String dynID="";
13         private TempDescriptor tempDesc;
14         
15         public void setTempDesc(TempDescriptor tempDesc){
16                 this.tempDesc=tempDesc;
17         }
18         
19         public TempDescriptor getTempDesc(){
20                 return tempDesc;
21         }
22
23         public void setQueueID(int queueID) {
24                 this.queueID = queueID;
25         }
26         
27         public String getDynID(){
28                 return dynID;
29         }
30         
31         public void setDynID(String dynID){
32                 this.dynID=dynID;
33         }
34         
35         public int getQueueID() {
36                 return queueID;
37         }
38
39         public void setStatus(int status) {
40                 this.status = status;
41         }
42
43         public int getStatus() {
44                 return status;
45         }
46
47         public boolean equals(Object o) {
48
49                 if (o == null) {
50                         return false;
51                 }
52
53                 if (!(o instanceof WaitingElement)) {
54                         return false;
55                 }
56
57                 WaitingElement in = (WaitingElement) o;
58
59                 if (queueID == in.getQueueID() && status == in.getStatus() && dynID.equals(in.getDynID()) ) {
60                         return true;
61                 } else {
62                         return false;
63                 }
64
65         }
66
67         public String toString() {
68                 return "[waitingID=" + queueID + " status=" + status + " dynID="
69                                 + dynID + "]";
70         }
71
72         public int hashCode() {
73
74                 int hash = 1;
75
76                 hash = hash * 31 + queueID;
77
78                 hash += status;
79                 
80                 hash += dynID.hashCode();
81
82                 return hash;
83
84         }
85
86 }