View difference between Paste ID: kFa7WAzy and ksBEaQLJ

-struct foo
+// primary structure
-{
+struct foo
-    Data  data;
+{
-    foo*  next;
+    Data  data;
-    foo** prevNext;
+    foo*  next;
     foo** prevNext;
 };
 
 HashTable<foo> hash;
-template <class T>
+
-void HashTable<T>::insert(T* x)
+// insert
-{
+template <class T>
-    int bucket  = hashFunc(x->data);
+void HashTable<T>::insert(T* x)
-    T** xPtr    = &elements_[bucket];
+{
-    x->next     = *xPtr;
+    int bucket  = hashFunc(x->data);
-    x->prevNext = xPtr;
+    T** xPtr    = &elements_[bucket];
-
+    x->next     = *xPtr;
-    if (x->next)
+    x->prevNext = xPtr;
-        x->next->prevNext = &x->next;
+
-
+    if (x->next)
-    *xPtr = x;
+        x->next->prevNext = &x->next;
 
     *xPtr = x;
-template<class T>
+
-void HashTable<T>::remove(T* x)
+
-{
+// remove
-    if (x->next)
+template<class T>
-        x->next->prevNext = x->prevNext;
+void HashTable<T>::remove(T* x)
-
+{
-    *x->prevNext = x->next;
+    if (x->next)
         x->next->prevNext = x->prevNext;
 
-template<class T>
+    *x->prevNext = x->next;
-T* HashTable<T>::find(Data& data)
+
-{
+
-    int bucket = hashFunc(data);
+// find
-
+template<class T>
-    T* ptr = elements_[bucket];
+T* HashTable<T>::find(Data& data)
-    while (ptr != 0)
+{
-    {
+    int bucket = hashFunc(data);
-        if(ptr->data == data)
+
-            return ptr;
+    T* ptr = elements_[bucket];
-        ptr = ptr->next;
+    while (ptr != 0)
-    }
+    {
-    return 0;
+        if(ptr->data == data)
             return ptr;
         ptr = ptr->next;
     }
     return 0;
 }