1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
|
17 |
|
|
18 |
|
|
19 |
|
|
20 |
|
|
21 |
|
package vamsas.objects.simple; |
22 |
|
|
|
|
| 0% |
Uncovered Elements: 70 (70) |
Complexity: 21 |
Complexity Density: 0.52 |
|
23 |
|
public class SeqSearchResult extends vamsas.objects.simple.Result |
24 |
|
implements java.io.Serializable |
25 |
|
{ |
26 |
|
private vamsas.objects.simple.Alignment alignment; |
27 |
|
|
28 |
|
private java.lang.String annotation; |
29 |
|
|
30 |
|
private java.lang.String features; |
31 |
|
|
32 |
|
private java.lang.String newickTree; |
33 |
|
|
|
|
| - |
Uncovered Elements: 0 (0) |
Complexity: 1 |
Complexity Density: - |
|
34 |
0 |
public SeqSearchResult()... |
35 |
|
{ |
36 |
|
} |
37 |
|
|
|
|
| 0% |
Uncovered Elements: 4 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
|
38 |
0 |
public SeqSearchResult(vamsas.objects.simple.Alignment alignment,... |
39 |
|
java.lang.String annotation, java.lang.String features, |
40 |
|
java.lang.String newickTree) |
41 |
|
{ |
42 |
0 |
this.alignment = alignment; |
43 |
0 |
this.annotation = annotation; |
44 |
0 |
this.features = features; |
45 |
0 |
this.newickTree = newickTree; |
46 |
|
} |
47 |
|
|
48 |
|
|
49 |
|
|
50 |
|
|
51 |
|
@return |
52 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
53 |
0 |
public vamsas.objects.simple.Alignment getAlignment()... |
54 |
|
{ |
55 |
0 |
return alignment; |
56 |
|
} |
57 |
|
|
58 |
|
|
59 |
|
|
60 |
|
|
61 |
|
@param |
62 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
63 |
0 |
public void setAlignment(vamsas.objects.simple.Alignment alignment)... |
64 |
|
{ |
65 |
0 |
this.alignment = alignment; |
66 |
|
} |
67 |
|
|
68 |
|
|
69 |
|
|
70 |
|
|
71 |
|
@return |
72 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
73 |
0 |
public java.lang.String getAnnotation()... |
74 |
|
{ |
75 |
0 |
return annotation; |
76 |
|
} |
77 |
|
|
78 |
|
|
79 |
|
|
80 |
|
|
81 |
|
@param |
82 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
83 |
0 |
public void setAnnotation(java.lang.String annotation)... |
84 |
|
{ |
85 |
0 |
this.annotation = annotation; |
86 |
|
} |
87 |
|
|
88 |
|
|
89 |
|
|
90 |
|
|
91 |
|
@return |
92 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
93 |
0 |
public java.lang.String getFeatures()... |
94 |
|
{ |
95 |
0 |
return features; |
96 |
|
} |
97 |
|
|
98 |
|
|
99 |
|
|
100 |
|
|
101 |
|
@param |
102 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
103 |
0 |
public void setFeatures(java.lang.String features)... |
104 |
|
{ |
105 |
0 |
this.features = features; |
106 |
|
} |
107 |
|
|
108 |
|
|
109 |
|
|
110 |
|
|
111 |
|
@return |
112 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
113 |
0 |
public java.lang.String getNewickTree()... |
114 |
|
{ |
115 |
0 |
return newickTree; |
116 |
|
} |
117 |
|
|
118 |
|
|
119 |
|
|
120 |
|
|
121 |
|
@param |
122 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
123 |
0 |
public void setNewickTree(java.lang.String newickTree)... |
124 |
|
{ |
125 |
0 |
this.newickTree = newickTree; |
126 |
|
} |
127 |
|
|
128 |
|
private java.lang.Object __equalsCalc = null; |
129 |
|
|
|
|
| 0% |
Uncovered Elements: 22 (22) |
Complexity: 5 |
Complexity Density: 0.36 |
|
130 |
0 |
@Override... |
131 |
|
public synchronized boolean equals(java.lang.Object obj) |
132 |
|
{ |
133 |
0 |
if (obj == null) |
134 |
|
{ |
135 |
0 |
return false; |
136 |
|
} |
137 |
0 |
if (!(obj instanceof SeqSearchResult)) |
138 |
|
{ |
139 |
0 |
return false; |
140 |
|
} |
141 |
0 |
SeqSearchResult other = (SeqSearchResult) obj; |
142 |
0 |
if (this == obj) |
143 |
|
{ |
144 |
0 |
return true; |
145 |
|
} |
146 |
0 |
if (__equalsCalc != null) |
147 |
|
{ |
148 |
0 |
return (__equalsCalc == obj); |
149 |
|
} |
150 |
0 |
__equalsCalc = obj; |
151 |
0 |
boolean _equals; |
152 |
0 |
_equals = super.equals(obj) |
153 |
|
&& ((this.alignment == null && other.getAlignment() == null) |
154 |
|
|| (this.alignment != null |
155 |
|
&& this.alignment.equals(other.getAlignment()))) |
156 |
|
&& ((this.annotation == null && other.getAnnotation() == null) |
157 |
|
|| (this.annotation != null && this.annotation |
158 |
|
.equals(other.getAnnotation()))) |
159 |
|
&& ((this.features == null && other.getFeatures() == null) |
160 |
|
|| (this.features != null |
161 |
|
&& this.features.equals(other.getFeatures()))) |
162 |
|
&& ((this.newickTree == null && other.getNewickTree() == null) |
163 |
|
|| (this.newickTree != null && this.newickTree |
164 |
|
.equals(other.getNewickTree()))); |
165 |
0 |
__equalsCalc = null; |
166 |
0 |
return _equals; |
167 |
|
} |
168 |
|
|
169 |
|
private boolean __hashCodeCalc = false; |
170 |
|
|
|
|
| 0% |
Uncovered Elements: 24 (24) |
Complexity: 6 |
Complexity Density: 0.43 |
|
171 |
0 |
@Override... |
172 |
|
public synchronized int hashCode() |
173 |
|
{ |
174 |
0 |
if (__hashCodeCalc) |
175 |
|
{ |
176 |
0 |
return 0; |
177 |
|
} |
178 |
0 |
__hashCodeCalc = true; |
179 |
0 |
int _hashCode = super.hashCode(); |
180 |
0 |
if (getAlignment() != null) |
181 |
|
{ |
182 |
0 |
_hashCode += getAlignment().hashCode(); |
183 |
|
} |
184 |
0 |
if (getAnnotation() != null) |
185 |
|
{ |
186 |
0 |
_hashCode += getAnnotation().hashCode(); |
187 |
|
} |
188 |
0 |
if (getFeatures() != null) |
189 |
|
{ |
190 |
0 |
_hashCode += getFeatures().hashCode(); |
191 |
|
} |
192 |
0 |
if (getNewickTree() != null) |
193 |
|
{ |
194 |
0 |
_hashCode += getNewickTree().hashCode(); |
195 |
|
} |
196 |
0 |
__hashCodeCalc = false; |
197 |
0 |
return _hashCode; |
198 |
|
} |
199 |
|
|
200 |
|
} |