public
Last active

Generic OrderedDictionary<TKey, TValue> See http://stackoverflow.com/a/15146898/801189 for details.

  • Download Gist
OrderedDictionary<TKey, TValue>
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240
using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
 
namespace Data
{
[Serializable]
public class OrderedList<TKey, TValue> : IDictionary<TKey, TValue>, IDictionary
{
private Dictionary<TKey, int> _order;
private int _lastOrder;
private readonly SortedList<TKey, TValue> _internalList;
 
private readonly bool _sorted;
private readonly OrderComparer _comparer;
 
private readonly object _lockObject = new Object();
 
public OrderedList(IEnumerable<KeyValuePair<TKey, TValue>> pairedCollection, bool sorted = false)
{
_sorted = sorted;
 
if (pairedCollection == null) pairedCollection = new Dictionary<TKey, TValue>();
 
if (_sorted)
{
_internalList = new SortedList<TKey, TValue>(
(pairedCollection as Dictionary<TKey, TValue>) ?? pairedCollection.ToDictionary(i => i.Key, i => i.Value)
);
}
else
{
_order = new Dictionary<TKey, int>();
_comparer = new OrderComparer(ref _order);
_internalList = new SortedList<TKey, TValue>(_comparer);
// keep prder of the IDictionary
foreach (var kvp in pairedCollection)
{
Add(kvp);
}
 
}
 
}
 
public bool Sorted
{
get { return _sorted; }
}
 
private class OrderComparer : Comparer<TKey>
{
public Dictionary<TKey, int> Order { private get; set; }
 
public OrderComparer(ref Dictionary<TKey, int> order)
{
Order = order;
}
 
public override int Compare(TKey x, TKey y)
{
var xo = Order[x];
var yo = Order[y];
return xo.CompareTo(yo);
}
}
 
private void ReOrder()
{
var i = 0;
_order = _order.OrderBy(kvp => kvp.Value).ToDictionary(kvp => kvp.Key, kvp => i++);
_comparer.Order = _order;
_lastOrder = _order.Values.Max() + 1;
}
 
public void Add(TKey key, TValue value)
{
lock (_lockObject)
{
if (!_sorted)
{
_order.Add(key, _lastOrder);
_lastOrder++;
//very rare event
if (_lastOrder == int.MaxValue) ReOrder();
}
 
_internalList.Add(key, value);
}
}
 
public bool Remove(TKey key)
{
lock (_lockObject)
{
var result = _internalList.Remove(key);
if (!_sorted) _order.Remove(key);
return result;
}
}
 
// Other IDictionary<> + IDictionary members implementation wrapping around _internalList
// ...
// }
//}
 
public bool ContainsKey(TKey key)
{
return _internalList.ContainsKey(key);
}
 
public bool TryGetValue(TKey key, out TValue value)
{
return _internalList.TryGetValue(key, out value);
}
 
public TValue this[TKey key]
{
get { return _internalList[key]; }
// key remains at its place
set { _internalList[key] = value; }
}
 
public ICollection<TKey> Keys { get { return _internalList.Keys; } }
 
ICollection IDictionary.Values
{
get { return (_internalList as IDictionary).Values; }
}
 
ICollection IDictionary.Keys
{
get { return (_internalList as IDictionary).Keys; }
}
 
public ICollection<TValue> Values { get { return _internalList.Values; } }
 
public IEnumerator<KeyValuePair<TKey, TValue>> GetEnumerator()
{
return _internalList.GetEnumerator();
}
 
public void Remove(object key)
{
(_internalList as IDictionary).Remove(key);
}
 
object IDictionary.this[object key]
{
get { return (_internalList as IDictionary)[key]; }
set { (_internalList as IDictionary)[key] = value; }
}
 
IEnumerator IEnumerable.GetEnumerator()
{
return GetEnumerator();
}
 
public void Add(KeyValuePair<TKey, TValue> item)
{
Add(item.Key, item.Value);
}
 
public bool Contains(object key)
{
return (_internalList as IDictionary).Contains(key);
}
 
public void Add(object key, object value)
{
(_internalList as IDictionary).Add(key, value);
}
 
public void Clear()
{
lock (_lockObject)
{
_internalList.Clear();
if (!_sorted) _order.Clear();
}
}
 
IDictionaryEnumerator IDictionary.GetEnumerator()
{
return (_internalList as IDictionary).GetEnumerator();
}
 
public bool Contains(KeyValuePair<TKey, TValue> item)
{
return _internalList.Contains(item);
}
 
public void CopyTo(KeyValuePair<TKey, TValue>[] array, int arrayIndex)
{
(_internalList as IDictionary<TKey, TValue>).CopyTo(array, arrayIndex);
}
 
public bool Remove(KeyValuePair<TKey, TValue> item)
{
lock (_lockObject)
{
var result = (_internalList as IDictionary<TKey, TValue>).Remove(item);
if (!_sorted) _order.Remove(item.Key);
return result;
}
}
 
public void CopyTo(Array array, int index)
{
(_internalList as IDictionary).CopyTo(array, index);
}
 
public int Count
{
get { return _internalList.Count; }
}
 
public object SyncRoot
{
get { return (_internalList as IDictionary).SyncRoot; }
}
 
public bool IsSynchronized
{
get { return (_internalList as IDictionary).IsSynchronized; }
}
 
public bool IsReadOnly
{
get { return (_internalList as IDictionary<TKey, TValue>).IsReadOnly; }
}
 
public bool IsFixedSize
{
get { return (_internalList as IDictionary).IsFixedSize; }
}
}
 
}

Please sign in to comment on this gist.

Something went wrong with that request. Please try again.