Пример #1
0
 @Override
 public boolean equals(Object obj) {
   if (this == obj) return true;
   if (obj == null) return false;
   if (getClass() != obj.getClass()) return false;
   AddNodesItem other = (AddNodesItem) obj;
   if (ParentNodeId == null) {
     if (other.ParentNodeId != null) return false;
   } else if (!ParentNodeId.equals(other.ParentNodeId)) return false;
   if (ReferenceTypeId == null) {
     if (other.ReferenceTypeId != null) return false;
   } else if (!ReferenceTypeId.equals(other.ReferenceTypeId)) return false;
   if (RequestedNewNodeId == null) {
     if (other.RequestedNewNodeId != null) return false;
   } else if (!RequestedNewNodeId.equals(other.RequestedNewNodeId)) return false;
   if (BrowseName == null) {
     if (other.BrowseName != null) return false;
   } else if (!BrowseName.equals(other.BrowseName)) return false;
   if (NodeClass == null) {
     if (other.NodeClass != null) return false;
   } else if (!NodeClass.equals(other.NodeClass)) return false;
   if (NodeAttributes == null) {
     if (other.NodeAttributes != null) return false;
   } else if (!NodeAttributes.equals(other.NodeAttributes)) return false;
   if (TypeDefinition == null) {
     if (other.TypeDefinition != null) return false;
   } else if (!TypeDefinition.equals(other.TypeDefinition)) return false;
   return true;
 }
Пример #2
0
 @Override
 public int hashCode() {
   final int prime = 31;
   int result = 1;
   result = prime * result + ((ParentNodeId == null) ? 0 : ParentNodeId.hashCode());
   result = prime * result + ((ReferenceTypeId == null) ? 0 : ReferenceTypeId.hashCode());
   result = prime * result + ((RequestedNewNodeId == null) ? 0 : RequestedNewNodeId.hashCode());
   result = prime * result + ((BrowseName == null) ? 0 : BrowseName.hashCode());
   result = prime * result + ((NodeClass == null) ? 0 : NodeClass.hashCode());
   result = prime * result + ((NodeAttributes == null) ? 0 : NodeAttributes.hashCode());
   result = prime * result + ((TypeDefinition == null) ? 0 : TypeDefinition.hashCode());
   return result;
 }