/Collections/Specialized/MultiKeyDictionary.cs |
@@ -0,0 +1,244 @@ |
/////////////////////////////////////////////////////////////////////////// |
// Copyright (C) Wizardry and Steamworks 2016 - License: GNU GPLv3 // |
// Please see: http://www.gnu.org/licenses/gpl.html for legal details, // |
// rights of fair usage, the disclaimer and warranty conditions. // |
/////////////////////////////////////////////////////////////////////////// |
// Based on the work of Herman Schoenfeld |
|
using System; |
using System.Collections.Generic; |
using System.Linq; |
|
namespace wasSharp.Collections.Specialized |
{ |
public class MultiKeyDictionary<K1, K2, V> : Dictionary<K1, Dictionary<K2, V>> |
{ |
public V this[K1 key1, K2 key2] |
{ |
get |
{ |
if (!ContainsKey(key1) || !this[key1].ContainsKey(key2)) |
throw new ArgumentOutOfRangeException(); |
return base[key1][key2]; |
} |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new Dictionary<K2, V>(); |
this[key1][key2] = value; |
} |
} |
|
public new IEnumerable<V> Values |
{ |
get |
{ |
return from baseDict in base.Values |
from baseKey in baseDict.Keys |
select baseDict[baseKey]; |
} |
} |
|
public void Add(K1 key1, K2 key2, V value) |
{ |
if (!ContainsKey(key1)) |
this[key1] = new Dictionary<K2, V>(); |
this[key1][key2] = value; |
} |
|
public bool ContainsKey(K1 key1, K2 key2) |
{ |
return base.ContainsKey(key1) && this[key1].ContainsKey(key2); |
} |
} |
|
public class MultiKeyDictionary<K1, K2, K3, V> : Dictionary<K1, MultiKeyDictionary<K2, K3, V>> |
{ |
public V this[K1 key1, K2 key2, K3 key3] |
{ |
get { return ContainsKey(key1) ? this[key1][key2, key3] : default(V); } |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new MultiKeyDictionary<K2, K3, V>(); |
this[key1][key2, key3] = value; |
} |
} |
|
public bool ContainsKey(K1 key1, K2 key2, K3 key3) |
{ |
return base.ContainsKey(key1) && this[key1].ContainsKey(key2, key3); |
} |
} |
|
public class MultiKeyDictionary<K1, K2, K3, K4, V> : Dictionary<K1, MultiKeyDictionary<K2, K3, K4, V>> |
{ |
public V this[K1 key1, K2 key2, K3 key3, K4 key4] |
{ |
get { return ContainsKey(key1) ? this[key1][key2, key3, key4] : default(V); } |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new MultiKeyDictionary<K2, K3, K4, V>(); |
this[key1][key2, key3, key4] = value; |
} |
} |
|
public bool ContainsKey(K1 key1, K2 key2, K3 key3, K4 key4) |
{ |
return base.ContainsKey(key1) && this[key1].ContainsKey(key2, key3, key4); |
} |
} |
|
public class MultiKeyDictionary<K1, K2, K3, K4, K5, V> : Dictionary<K1, MultiKeyDictionary<K2, K3, K4, K5, V>> |
{ |
public V this[K1 key1, K2 key2, K3 key3, K4 key4, K5 key5] |
{ |
get { return ContainsKey(key1) ? this[key1][key2, key3, key4, key5] : default(V); } |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new MultiKeyDictionary<K2, K3, K4, K5, V>(); |
this[key1][key2, key3, key4, key5] = value; |
} |
} |
|
public bool ContainsKey(K1 key1, K2 key2, K3 key3, K4 key4, K5 key5) |
{ |
return base.ContainsKey(key1) && this[key1].ContainsKey(key2, key3, key4, key5); |
} |
} |
|
public class MultiKeyDictionary<K1, K2, K3, K4, K5, K6, V> : |
Dictionary<K1, MultiKeyDictionary<K2, K3, K4, K5, K6, V>> |
{ |
public V this[K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6] |
{ |
get { return ContainsKey(key1) ? this[key1][key2, key3, key4, key5, key6] : default(V); } |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new MultiKeyDictionary<K2, K3, K4, K5, K6, V>(); |
this[key1][key2, key3, key4, key5, key6] = value; |
} |
} |
|
public bool ContainsKey(K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6) |
{ |
return base.ContainsKey(key1) && this[key1].ContainsKey(key2, key3, key4, key5, key6); |
} |
} |
|
public class MultiKeyDictionary<K1, K2, K3, K4, K5, K6, K7, V> : |
Dictionary<K1, MultiKeyDictionary<K2, K3, K4, K5, K6, K7, V>> |
{ |
public V this[K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7] |
{ |
get { return ContainsKey(key1) ? this[key1][key2, key3, key4, key5, key6, key7] : default(V); } |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new MultiKeyDictionary<K2, K3, K4, K5, K6, K7, V>(); |
this[key1][key2, key3, key4, key5, key6, key7] = value; |
} |
} |
|
public bool ContainsKey(K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7) |
{ |
return base.ContainsKey(key1) && this[key1].ContainsKey(key2, key3, key4, key5, key6, key7); |
} |
} |
|
public class MultiKeyDictionary<K1, K2, K3, K4, K5, K6, K7, K8, V> : |
Dictionary<K1, MultiKeyDictionary<K2, K3, K4, K5, K6, K7, K8, V>> |
{ |
public V this[K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7, K8 key8] |
{ |
get { return ContainsKey(key1) ? this[key1][key2, key3, key4, key5, key6, key7, key8] : default(V); } |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new MultiKeyDictionary<K2, K3, K4, K5, K6, K7, K8, V>(); |
this[key1][key2, key3, key4, key5, key6, key7, key8] = value; |
} |
} |
|
public bool ContainsKey(K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7, K8 key8) |
{ |
return base.ContainsKey(key1) && this[key1].ContainsKey(key2, key3, key4, key5, key6, key7, key8); |
} |
} |
|
public class MultiKeyDictionary<K1, K2, K3, K4, K5, K6, K7, K8, K9, V> : |
Dictionary<K1, MultiKeyDictionary<K2, K3, K4, K5, K6, K7, K8, K9, V>> |
{ |
public V this[K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7, K8 key8, K9 key9] |
{ |
get { return ContainsKey(key1) ? this[key1][key2, key3, key4, key5, key6, key7, key8, key9] : default(V); } |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new MultiKeyDictionary<K2, K3, K4, K5, K6, K7, K8, K9, V>(); |
this[key1][key2, key3, key4, key5, key6, key7, key8, key9] = value; |
} |
} |
|
public bool ContainsKey(K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7, K8 key8, K9 key9) |
{ |
return base.ContainsKey(key1) && this[key1].ContainsKey(key2, key3, key4, key5, key6, key7, key8, key9); |
} |
} |
|
public class MultiKeyDictionary<K1, K2, K3, K4, K5, K6, K7, K8, K9, K10, V> : |
Dictionary<K1, MultiKeyDictionary<K2, K3, K4, K5, K6, K7, K8, K9, K10, V>> |
{ |
public V this[K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7, K8 key8, K9 key9, K10 key10] |
{ |
get |
{ |
return ContainsKey(key1) ? this[key1][key2, key3, key4, key5, key6, key7, key8, key9, key10] : default(V); |
} |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new MultiKeyDictionary<K2, K3, K4, K5, K6, K7, K8, K9, K10, V>(); |
this[key1][key2, key3, key4, key5, key6, key7, key8, key9, key10] = value; |
} |
} |
|
public bool ContainsKey(K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7, K8 key8, K9 key9, |
K10 key10) |
{ |
return base.ContainsKey(key1) && |
this[key1].ContainsKey(key2, key3, key4, key5, key6, key7, key8, key9, key10); |
} |
} |
|
public class MultiKeyDictionary<K1, K2, K3, K4, K5, K6, K7, K8, K9, K10, K11, V> : |
Dictionary<K1, MultiKeyDictionary<K2, K3, K4, K5, K6, K7, K8, K9, K10, K11, V>> |
{ |
public V this[ |
K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7, K8 key8, K9 key9, K10 key10, K11 key11] |
{ |
get |
{ |
return ContainsKey(key1) |
? this[key1][key2, key3, key4, key5, key6, key7, key8, key9, key10, key11] |
: default(V); |
} |
set |
{ |
if (!ContainsKey(key1)) |
this[key1] = new MultiKeyDictionary<K2, K3, K4, K5, K6, K7, K8, K9, K10, K11, V>(); |
this[key1][key2, key3, key4, key5, key6, key7, key8, key9, key10, key11] = value; |
} |
} |
|
public bool ContainsKey(K1 key1, K2 key2, K3 key3, K4 key4, K5 key5, K6 key6, K7 key7, K8 key8, K9 key9, |
K10 key10, K11 key11) |
{ |
return base.ContainsKey(key1) && |
this[key1].ContainsKey(key2, key3, key4, key5, key6, key7, key8, key9, key10, key11); |
} |
} |
} |
/Collections/Specialized/ObservableDictionary.cs |
@@ -0,0 +1,124 @@ |
/////////////////////////////////////////////////////////////////////////// |
// Copyright (C) Wizardry and Steamworks 2016 - License: GNU GPLv3 // |
// Please see: http://www.gnu.org/licenses/gpl.html for legal details, // |
// rights of fair usage, the disclaimer and warranty conditions. // |
/////////////////////////////////////////////////////////////////////////// |
|
using System.Collections; |
using System.Collections.Generic; |
using System.Collections.Specialized; |
|
namespace wasSharp.Collections.Specialized |
{ |
/////////////////////////////////////////////////////////////////////////// |
// Copyright (C) 2016 Wizardry and Steamworks - License: GNU GPLv3 // |
/////////////////////////////////////////////////////////////////////////// |
/// <summary> |
/// An implementation of an observable Dictionary. |
/// </summary> |
/// <typeparam name="K">the key type</typeparam> |
/// <typeparam name="V">the value type</typeparam> |
public class ObservableDictionary<K, V> : IDictionary<K, V>, INotifyCollectionChanged |
{ |
private readonly Dictionary<K, V> store = new Dictionary<K, V>(); |
|
public bool IsVirgin { get; private set; } = true; |
|
public V this[K key] |
{ |
get { return store[key]; } |
|
set { store[key] = value; } |
} |
|
public int Count => store.Count; |
|
public bool IsReadOnly => false; |
|
public ICollection<K> Keys => store.Keys; |
|
public ICollection<V> Values => store.Values; |
|
public void Add(KeyValuePair<K, V> item) |
{ |
((IDictionary<K, V>) store).Add(item); |
IsVirgin = false; |
OnCollectionChanged(new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Add, item)); |
} |
|
public void Add(K key, V value) |
{ |
store.Add(key, value); |
IsVirgin = false; |
OnCollectionChanged(new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Add, |
new KeyValuePair<K, V>(key, value))); |
} |
|
public void Clear() |
{ |
store.Clear(); |
if (!IsVirgin) |
OnCollectionChanged(new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Reset)); |
IsVirgin = false; |
} |
|
public bool Contains(KeyValuePair<K, V> item) |
{ |
return ((IDictionary<K, V>) store).Contains(item); |
} |
|
public bool ContainsKey(K key) |
{ |
return store.ContainsKey(key); |
} |
|
public void CopyTo(KeyValuePair<K, V>[] array, int arrayIndex) |
{ |
((IDictionary<K, V>) store).CopyTo(array, arrayIndex); |
} |
|
public IEnumerator<KeyValuePair<K, V>> GetEnumerator() |
{ |
return ((IDictionary<K, V>) store).GetEnumerator(); |
} |
|
public bool Remove(KeyValuePair<K, V> item) |
{ |
var removed = ((IDictionary<K, V>) store).Remove(item); |
IsVirgin = false; |
if (removed) |
OnCollectionChanged(new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Remove, item)); |
return removed; |
} |
|
public bool Remove(K key) |
{ |
KeyValuePair<K, V> item; |
if (store.ContainsKey(key)) |
item = new KeyValuePair<K, V>(key, store[key]); |
|
var removed = store.Remove(key); |
IsVirgin = false; |
if (removed) |
OnCollectionChanged(new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Remove, item)); |
return removed; |
} |
|
public bool TryGetValue(K key, out V value) |
{ |
return store.TryGetValue(key, out value); |
} |
|
IEnumerator IEnumerable.GetEnumerator() |
{ |
return ((IDictionary<K, V>) store).GetEnumerator(); |
} |
|
public event NotifyCollectionChangedEventHandler CollectionChanged; |
|
private void OnCollectionChanged(NotifyCollectionChangedEventArgs args) |
{ |
CollectionChanged?.Invoke(this, args); |
} |
} |
} |