コード例 #1
0
 @Override
 public int hashCode() {
   final int prime = 31;
   int result = super.hashCode();
   result = prime * result + (openQuery ? 1231 : 1237);
   result = prime * result + ((queryElement == null) ? 0 : queryElement.hashCode());
   result = prime * result + ((tupleSource == null) ? 0 : tupleSource.hashCode());
   return result;
 }
コード例 #2
0
ファイル: BetaNode.java プロジェクト: isaachuan/drools
 /* (non-Javadoc)
  * @see org.drools.reteoo.BaseNode#hashCode()
  */
 public int hashCode() {
   int hash =
       (23 * leftInput.hashCode()) + (29 * rightInput.hashCode()) + (31 * constraints.hashCode());
   if (leftListenedProperties != null) {
     hash += 37 * leftListenedProperties.hashCode();
   }
   if (rightListenedProperties != null) {
     hash += 41 * rightListenedProperties.hashCode();
   }
   return hash;
 }