.NET 实现Hashlist--可以排序的哈希表

/// <summary>

///

/// </summary>

public abstract class Hashlist : IDictionary, IEnumerable

{

//array list that contains all the keys

//as they are inserted, the index is associated with

//a key so when pulling out values by index

//we can get the key for the index, pull from the

//hashtable the proper value with the corresponding

//key

//This is basically the same as a sorted list but

//does not sort the items, rather it leaves them in the

//order they were inserted - like a list

/// <summary>

///

/// </summary>

protected ArrayList m_oKeys = new ArrayList();

/// <summary>

///

/// </summary>

protected Hashtable m_oValues = new Hashtable();

#region ICollection implementation

//ICollection implementation

/// <summary>

///

/// </summary>

public int Count

{

get{return m_oValues.Count;}

}

/// <summary>

///

/// </summary>

public bool IsSynchronized

{

get{return m_oValues.IsSynchronized;}

}

/// <summary>

///

/// </summary>

public object SyncRoot

{

get{return m_oValues.SyncRoot;}

}

/// <summary>

///

/// </summary>

/// <param name="oArray"></param>

/// <param name="iArrayIndex"></param>

public void CopyTo(System.Array oArray, int iArrayIndex)

{

m_oValues.CopyTo(oArray, iArrayIndex);

}

#endregion

#region IDictionary implementation

//IDictionary implementation

/// <summary>

///

/// </summary>

/// <param name="oKey"></param>

/// <param name="oValue"></param>

public void Add(object oKey, object oValue)

{

m_oKeys.Add(oKey);

m_oValues.Add(oKey, oValue);

}

/// <summary>

///

/// </summary>

public bool IsFixedSize

{

get{return m_oKeys.IsFixedSize;}

}

/// <summary>

///

/// </summary>

public bool IsReadOnly

{

get{return m_oKeys.IsReadOnly;}

}

/// <summary>

///

/// </summary>

public ICollection Keys

{

get{return m_oValues.Keys;}

}

/// <summary>

///

/// </summary>

public void Clear()

{

m_oValues.Clear();

m_oKeys.Clear();

}

/// <summary>

///

/// </summary>

/// <param name="oKey"></param>

/// <returns></returns>

public bool Contains(object oKey)

{

return m_oValues.Contains(oKey);

}

/// <summary>

///

/// </summary>

/// <param name="oKey"></param>

/// <returns></returns>

public bool ContainsKey(object oKey)

{

return m_oValues.ContainsKey(oKey);

}

/// <summary>

///

/// </summary>

/// <returns></returns>

public IDictionaryEnumerator GetEnumerator()

{

return m_oValues.GetEnumerator();

}

/// <summary>

///

/// </summary>

/// <param name="oKey"></param>

public void Remove(object oKey)

{

m_oValues.Remove(oKey);

m_oKeys.Remove(oKey);

}

/// <summary>

///

/// </summary>

public object this[object oKey]

{

get{return m_oValues[oKey];}

set{m_oValues[oKey] = value;}

}

/// <summary>

///

/// </summary>

public ICollection Values

{

get{return m_oValues.Values;}

}

#endregion

#region IEnumerable implementation

IEnumerator IEnumerable.GetEnumerator()

{

return m_oValues.GetEnumerator();

}

#endregion

#region Hashlist specialized implementation

//specialized indexer routines

/// <summary>

///

/// </summary>

public object this[string Key]

{

get{return m_oValues[Key];}

}

/// <summary>

///

/// </summary>

public object this[int Index]

{

get{return m_oValues[m_oKeys[Index]];}

}

#endregion

}