1 files changed, 0 insertions, 79 deletions
diff --git a/mcs/class/Mono.C5/C5/hashing/HashDictionary.cs b/mcs/class/Mono.C5/C5/hashing/HashDictionary.cs
deleted file mode 100644
index 4dbc7a62a35..00000000000
--- a/mcs/class/Mono.C5/C5/hashing/HashDictionary.cs
+++ /dev/null
@@ -1,79 +0,0 @@
-#if NET_2_0
-/*
- Copyright (c) 2003-2006 Niels Kokholm and Peter Sestoft
- Permission is hereby granted, free of charge, to any person obtaining a copy
- of this software and associated documentation files (the "Software"), to deal
- in the Software without restriction, including without limitation the rights
- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- copies of the Software, and to permit persons to whom the Software is
- furnished to do so, subject to the following conditions:
- 
- The above copyright notice and this permission notice shall be included in
- all copies or substantial portions of the Software.
- 
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- SOFTWARE.
-*/
-
-using System;
-using System.Diagnostics;
-using SCG = System.Collections.Generic;
-
-namespace C5
-{
-  /// <summary>
-  /// A generic dictionary class based on a hash set class <see cref="T:C5.HashSet`1"/>. 
-  /// </summary>
-  [Serializable]
-  public class HashDictionary<K, V> : DictionaryBase<K, V>, IDictionary<K, V>
-  {
-    /// <summary>
-    /// Create a hash dictionary using a default equalityComparer for the keys.
-    /// Initial capacity of internal table will be 16 entries and threshold for 
-    /// expansion is 66% fill.
-    /// </summary>
-    public HashDictionary() : this(EqualityComparer<K>.Default) { }
-
-    /// <summary>
-    /// Create a hash dictionary using a custom equalityComparer for the keys.
-    /// Initial capacity of internal table will be 16 entries and threshold for 
-    /// expansion is 66% fill.
-    /// </summary>
-    /// <param name="keyequalityComparer">The external key equalityComparer</param>
-    public HashDictionary(SCG.IEqualityComparer<K> keyequalityComparer) : base(keyequalityComparer)
-    {
-      pairs = new HashSet<KeyValuePair<K, V>>(new KeyValuePairEqualityComparer<K, V>(keyequalityComparer));
-    }
-
-    /// <summary>
-    /// Create a hash dictionary using a custom equalityComparer and prescribing the 
-    /// initial size of the dictionary and a non-default threshold for internal table expansion.
-    /// </summary>
-    /// <param name="capacity">The initial capacity. Will be rounded upwards to nearest
-    /// power of 2, at least 16.</param>
-    /// <param name="fill">The expansion threshold. Must be between 10% and 90%.</param>
-    /// <param name="keyequalityComparer">The external key equalityComparer</param>
-    public HashDictionary(int capacity, double fill, SCG.IEqualityComparer<K> keyequalityComparer): base(keyequalityComparer)
-    {
-      pairs = new HashSet<KeyValuePair<K, V>>(capacity, fill, new KeyValuePairEqualityComparer<K, V>(keyequalityComparer));
-    }
-
-    /// <summary>
-    /// 
-    /// </summary>
-    /// <returns></returns>
-    public override object Clone()
-    {
-      HashDictionary<K, V> clone = new HashDictionary<K, V>(EqualityComparer);
-      clone.pairs.AddAll(pairs);
-      return clone;
-    }
-
-  }
-}
-#endif