@Override public boolean equals(java.lang.Object obj) { if (this == obj) { return true; } if (obj == null) { return false; } if (getClass() != obj.getClass()) { return false; } NodeKey other = (NodeKey) obj; if (_nodeId == null) { if (other._nodeId != null) { return false; } } else if(!_nodeId.equals(other._nodeId)) { return false; } return true; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((_nodeId == null) ? 0 : _nodeId.hashCode()); return result; }
public static NodeId getDefaultInstance(String defaultValue) { return new NodeId(defaultValue); }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((_nodeRef == null) ? 0 : _nodeRef.hashCode()); return result; }
@Override public boolean equals(java.lang.Object obj) { if (this == obj) { return true; } if (obj == null) { return false; } if (getClass() != obj.getClass()) { return false; } SupportingNodeKey other = (SupportingNodeKey) obj; if (_nodeRef == null) { if (other._nodeRef != null) { return false; } } else if(!_nodeRef.equals(other._nodeRef)) { return false; } return true; }
@Override public int hashCode() { if (hashValid) { return hash; } final int prime = 31; int result = 1; result = prime * result + ((_key == null) ? 0 : _key.hashCode()); result = prime * result + ((_nodeRef == null) ? 0 : _nodeRef.hashCode()); result = prime * result + ((augmentation == null) ? 0 : augmentation.hashCode()); hash = result; hashValid = true; return result; }
return false; } else if(!_destNode.equals(other.getDestNode())) { return false;
@Override public int hashCode() { if (hashValid) { return hash; } final int prime = 31; int result = 1; result = prime * result + ((_sourceNode == null) ? 0 : _sourceNode.hashCode()); result = prime * result + ((_sourceTp == null) ? 0 : _sourceTp.hashCode()); result = prime * result + ((augmentation == null) ? 0 : augmentation.hashCode()); hash = result; hashValid = true; return result; }
return false; } else if(!_nodeRef.equals(other.getNodeRef())) { return false;
@Override public int hashCode() { if (hashValid) { return hash; } final int prime = 31; int result = 1; result = prime * result + ((_destNode == null) ? 0 : _destNode.hashCode()); result = prime * result + ((_destTp == null) ? 0 : _destTp.hashCode()); result = prime * result + ((augmentation == null) ? 0 : augmentation.hashCode()); hash = result; hashValid = true; return result; }
return false; } else if(!_sourceNode.equals(other.getSourceNode())) { return false;
@Override public int hashCode() { if (hashValid) { return hash; } final int prime = 31; int result = 1; result = prime * result + ((_key == null) ? 0 : _key.hashCode()); result = prime * result + ((_nodeId == null) ? 0 : _nodeId.hashCode()); result = prime * result + ((_supportingNode == null) ? 0 : _supportingNode.hashCode()); result = prime * result + ((_terminationPoint == null) ? 0 : _terminationPoint.hashCode()); result = prime * result + ((augmentation == null) ? 0 : augmentation.hashCode()); hash = result; hashValid = true; return result; }
return false; } else if(!_nodeId.equals(other.getNodeId())) { return false;
@Override public int hashCode() { if (hashValid) { return hash; } final int prime = 31; int result = 1; result = prime * result + ((_igpEventType == null) ? 0 : _igpEventType.hashCode()); result = prime * result + ((_igpNodeAttributes == null) ? 0 : _igpNodeAttributes.hashCode()); result = prime * result + ((_l3UnicastIgpTopology == null) ? 0 : _l3UnicastIgpTopology.hashCode()); result = prime * result + ((_nodeId == null) ? 0 : _nodeId.hashCode()); result = prime * result + ((_supportingNode == null) ? 0 : _supportingNode.hashCode()); result = prime * result + ((_topologyRef == null) ? 0 : _topologyRef.hashCode()); result = prime * result + ((augmentation == null) ? 0 : augmentation.hashCode()); hash = result; hashValid = true; return result; }
return false; } else if(!_nodeRef.equals(other.getNodeRef())) { return false;
@Override public int hashCode() { if (hashValid) { return hash; } final int prime = 31; int result = 1; result = prime * result + ((_igpEventType == null) ? 0 : _igpEventType.hashCode()); result = prime * result + ((_l3UnicastIgpTopology == null) ? 0 : _l3UnicastIgpTopology.hashCode()); result = prime * result + ((_nodeRef == null) ? 0 : _nodeRef.hashCode()); result = prime * result + ((_prefix == null) ? 0 : _prefix.hashCode()); result = prime * result + ((_topologyRef == null) ? 0 : _topologyRef.hashCode()); result = prime * result + ((augmentation == null) ? 0 : augmentation.hashCode()); hash = result; hashValid = true; return result; }
return false; } else if(!_nodeId.equals(other.getNodeId())) { return false;
@Override public int hashCode() { if (hashValid) { return hash; } final int prime = 31; int result = 1; result = prime * result + ((_igpEventType == null) ? 0 : _igpEventType.hashCode()); result = prime * result + ((_igpTerminationPointAttributes == null) ? 0 : _igpTerminationPointAttributes.hashCode()); result = prime * result + ((_l3UnicastIgpTopology == null) ? 0 : _l3UnicastIgpTopology.hashCode()); result = prime * result + ((_nodeRef == null) ? 0 : _nodeRef.hashCode()); result = prime * result + ((_topologyRef == null) ? 0 : _topologyRef.hashCode()); result = prime * result + ((_tpId == null) ? 0 : _tpId.hashCode()); result = prime * result + ((_tpRef == null) ? 0 : _tpRef.hashCode()); result = prime * result + ((augmentation == null) ? 0 : augmentation.hashCode()); hash = result; hashValid = true; return result; }
return false; } else if(!_nodeRef.equals(other.getNodeRef())) { return false;