Changeset 397

Timestamp:

03/09/12 13:24:55 (12 years ago)

Author:

sherbold

Message:

• implemented equals and hashCode for de.ugoe.cs.eventbench.models.Trie and de.ugoe.cs.eventbench.models.TrieNode?

Location:

trunk/EventBenchCore/src/de/ugoe/cs/eventbench/models

Files:

• Trie.java (modified) (1 diff)
• TrieNode.java (modified) (1 diff)

trunk/EventBenchCore/src/de/ugoe/cs/eventbench/models/Trie.java

@@ -437 +437 @@
                 }
         }
+
+        /**
+         * <p>
+         * Two Tries are defined as equal, if their {@link #rootNode} are equal.
+         * </p>
+         * 
+         * @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;
+        }
 }

trunk/EventBenchCore/src/de/ugoe/cs/eventbench/models/TrieNode.java

@@ -397 +397 @@
                 this.count = count;
         }
+
+        /**
+         * <p>
+         * Two TrieNodes are defined as equal, if their {@link #count},
+         * {@link #symbol}, and {@link #children} are equal.
+         * </p>
+         * 
+         * @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;
+        }
 }