+ * Two Tries are defined as equal, if their {@link #rootNode} are equal. + *
+ * + * @see java.lang.Object#equals(java.lang.Object) + */ + @SuppressWarnings("rawtypes") + @Override + public boolean equals(Object other) { + if (other == this) { + return true; + } + if (other instanceof Trie) { + return rootNode.equals(((Trie) other).rootNode); + } + return false; + } + + /* + * (non-Javadoc) + * + * @see java.lang.Object#hashCode() + */ + @Override + public int hashCode() { + int multiplier = 17; + int hash = 42; + if (rootNode != null) { + hash = multiplier * hash + rootNode.hashCode(); + } + return hash; + } } Index: /trunk/EventBenchCore/src/de/ugoe/cs/eventbench/models/TrieNode.java =================================================================== --- /trunk/EventBenchCore/src/de/ugoe/cs/eventbench/models/TrieNode.java (revision 396) +++ /trunk/EventBenchCore/src/de/ugoe/cs/eventbench/models/TrieNode.java (revision 397) @@ -397,3 +397,48 @@ this.count = count; } + + /** + *+ * Two TrieNodes are defined as equal, if their {@link #count}, + * {@link #symbol}, and {@link #children} are equal. + *
+ * + * @see java.lang.Object#equals(java.lang.Object) + */ + @SuppressWarnings("rawtypes") + @Override + public boolean equals(Object other) { + if (other == this) { + return true; + } + if (other instanceof TrieNode) { + TrieNode otherNode = (TrieNode) other; + if (symbol == null) { + return count == otherNode.count && otherNode.symbol == null + && children.equals(otherNode.children); + } else { + return count == otherNode.count + && symbol.equals(((TrieNode) other).symbol) + && children.equals(((TrieNode) other).children); + } + } + return false; + } + + /* + * (non-Javadoc) + * + * @see java.lang.Object#hashCode() + */ + @Override + public int hashCode() { + int multiplier = 17; + int hash = 42; + if (symbol != null) { + hash = multiplier * hash + symbol.hashCode(); + } + hash = multiplier * hash + count; + hash = multiplier * hash + children.hashCode(); + return hash; + } }