Fix bug with CopyTo method of ChainedHashTable

If a hashTable node contain a list with some values then the method CopyTo try to fill an array by the end from this node.
But need check existing next element in the list in the hashTable node.

Author: Gutsonok

DataStructures/Dictionaries/ChainedHashTable.cs

@@ -442,7 +442,7 @@ public void Add(TKey key, TValue value)
                 // Decrease the number of free slots.
                 _freeSlotsCount--;
             }
-            else if (_hashTableStore[hashcode] != null && _hashTableStore[hashcode].Count > 0)
+            else if (_hashTableStore[hashcode].Count > 0)
             {
                 if (_hashTableStore[hashcode].ContainsKey(key) == true)
                     throw new ArgumentException("Key already exists in the hash table.");
@@ -582,7 +582,7 @@ public void CopyTo(KeyValuePair<TKey, TValue>[] array, int arrayIndex)
 
             int i = arrayIndex;
             int hashTableIndex = 0;
-            int countOfElements = (array.Length - arrayIndex);
+            var currentChainNode = new DLinkedListNode<TKey, TValue>();
 
             while (true)
             {
@@ -591,30 +591,19 @@ public void CopyTo(KeyValuePair<TKey, TValue>[] array, int arrayIndex)
                 if (i >= array.Length)
                     break;
 
-                if (_hashTableStore[hashTableIndex] != null && _hashTableStore[hashTableIndex].Count > 0)
+                if (_hashTableStore[hashTableIndex] != null)
                 {
-                    if (_hashTableStore[hashTableIndex].Count == 1)
+                    currentChainNode = _hashTableStore[hashTableIndex].Head;
+                    while (currentChainNode != null && i < array.Length)
                     {
-                        pair = new KeyValuePair<TKey, TValue>(_hashTableStore[hashTableIndex].First.Key, _hashTableStore[hashTableIndex].First.Value);
+                        pair = new KeyValuePair<TKey, TValue>(currentChainNode.Key, currentChainNode.Value);
                         array[i] = pair;
                         i++;
                         hashTableIndex++;
-                    }
-                    else
-                    {
-                        var headOfChain = _hashTableStore[hashTableIndex].Head;
-
-                        while (i < array.Length)
-                        {
-                            pair = new KeyValuePair<TKey, TValue>(headOfChain.Key, headOfChain.Value);
-                            array[i] = pair;
-                            i++;
-                            hashTableIndex++;
 
-                            headOfChain = headOfChain.Next;
-                        }
-                    }//end-if-else
-                }//end-if
+                        currentChainNode = currentChainNode.Next;
+                    }
+                }
                 else
                 {
                     hashTableIndex++;