result = prime * result + activeCount;
result = prime * result + (int) (lookupCount ^ (lookupCount >>> 32));
result = prime * result + (int) (matchedCount ^ (matchedCount >>> 32));
+ result = prime * result + maximumEntries;
result = prime * result + ((name == null) ? 0 : name.hashCode());
result = prime * result + ((nodeTable == null) ? 0 : nodeTable.hashCode());
return result;
if (matchedCount != other.matchedCount) {
return false;
}
+ if (maximumEntries != other.maximumEntries) {
+ return false;
+ }
if (name == null) {
if (other.name != null) {
return false;
/**
* @return the maximumEntries
*/
- public long getMaximumEntries() {
+ public int getMaximumEntries() {
return maximumEntries;
}
return "NodeTableStats[tableId = " + nodeTable
+ ", activeCount = " + activeCount
+ ", lookupCount = " + lookupCount
- + ", matchedCount = " + matchedCount + "]";
+ + ", matchedCount = " + matchedCount
+ + ", maximumEntries = " + maximumEntries + "]";
}
}