|
| 1 | +// ) * |
| 2 | +// ( /( * ) ( ( ` |
| 3 | +// )\()) ( ` ) /( ( )\ )\))( |
| 4 | +// ((_)\ )\ ( )(_)))\ ((((_)( ((_)()\ |
| 5 | +// __ ((_)((_) (_(_())((_) )\ _ )\ (_()((_) |
| 6 | +// \ \ / / (_) |_ _|| __|(_)_\(_)| \/ | |
| 7 | +// \ V / | | _ | | | _| / _ \ | |\/| | |
| 8 | +// |_| |_|(_)|_| |___|/_/ \_\ |_| |_| |
| 9 | +// |
| 10 | +// This file is subject to the terms and conditions defined in |
| 11 | +// file 'License.txt', which is part of this source code package. |
| 12 | +// |
| 13 | +// Copyright © Yi.TEAM. All rights reserved. |
| 14 | +// ------------------------------------------------------------------------------- |
| 15 | + |
| 16 | +using System; |
| 17 | +using System.Collections; |
| 18 | +using System.Collections.Generic; |
| 19 | + |
| 20 | +namespace Yisoft.Framework.Collections.Generic |
| 21 | +{ |
| 22 | + public class BidirectionalDictionary<TKey, TValue> : IDictionary<TKey, TValue> |
| 23 | + { |
| 24 | + private readonly IEqualityComparer<TKey> _keyComparer; |
| 25 | + private readonly Dictionary<TKey, TValue> _keysToValues; |
| 26 | + private readonly IEqualityComparer<TValue> _valueComparer; |
| 27 | + private readonly Dictionary<TValue, TKey> _valuesToKeys; |
| 28 | + |
| 29 | + public BidirectionalDictionary() : this(10, null, null) { } |
| 30 | + |
| 31 | + public BidirectionalDictionary(int capacity) : this(capacity, null, null) { } |
| 32 | + |
| 33 | + public BidirectionalDictionary(IEqualityComparer<TKey> keyComparer, IEqualityComparer<TValue> valueComparer) |
| 34 | + : this(10, keyComparer, valueComparer) |
| 35 | + { |
| 36 | + } |
| 37 | + |
| 38 | + public BidirectionalDictionary(int capacity, IEqualityComparer<TKey> keyComparer, IEqualityComparer<TValue> valueComparer) |
| 39 | + { |
| 40 | + if (capacity < 0) throw new ArgumentOutOfRangeException(nameof(capacity), capacity, "capacity cannot be less than 0"); |
| 41 | + |
| 42 | + _keyComparer = keyComparer ?? EqualityComparer<TKey>.Default; |
| 43 | + _valueComparer = valueComparer ?? EqualityComparer<TValue>.Default; |
| 44 | + |
| 45 | + _keysToValues = new Dictionary<TKey, TValue>(capacity, _keyComparer); |
| 46 | + _valuesToKeys = new Dictionary<TValue, TKey>(capacity, _valueComparer); |
| 47 | + |
| 48 | + Inverse = new BidirectionalDictionary<TValue, TKey>(this); |
| 49 | + } |
| 50 | + |
| 51 | + private BidirectionalDictionary(BidirectionalDictionary<TValue, TKey> inverse) |
| 52 | + { |
| 53 | + Inverse = inverse ?? throw new ArgumentNullException(nameof(inverse)); |
| 54 | + _keyComparer = inverse._valueComparer; |
| 55 | + _valueComparer = inverse._keyComparer; |
| 56 | + _valuesToKeys = inverse._keysToValues; |
| 57 | + _keysToValues = inverse._valuesToKeys; |
| 58 | + } |
| 59 | + |
| 60 | + public BidirectionalDictionary<TValue, TKey> Inverse { get; } |
| 61 | + |
| 62 | + public ICollection<TKey> Keys => _keysToValues.Keys; |
| 63 | + |
| 64 | + public ICollection<TValue> Values => _keysToValues.Values; |
| 65 | + |
| 66 | + public IEnumerator<KeyValuePair<TKey, TValue>> GetEnumerator() { return _keysToValues.GetEnumerator(); } |
| 67 | + |
| 68 | + IEnumerator IEnumerable.GetEnumerator() { return GetEnumerator(); } |
| 69 | + |
| 70 | + void ICollection<KeyValuePair<TKey, TValue>>.CopyTo(KeyValuePair<TKey, TValue>[] array, int arrayIndex) |
| 71 | + { |
| 72 | + ((ICollection<KeyValuePair<TKey, TValue>>) _keysToValues).CopyTo(array, arrayIndex); |
| 73 | + } |
| 74 | + |
| 75 | + public bool ContainsKey(TKey key) |
| 76 | + { |
| 77 | + return key == null |
| 78 | + ? throw new ArgumentNullException(nameof(key)) |
| 79 | + : _keysToValues.ContainsKey(key); |
| 80 | + } |
| 81 | + |
| 82 | + bool ICollection<KeyValuePair<TKey, TValue>>.Contains(KeyValuePair<TKey, TValue> item) |
| 83 | + { |
| 84 | + return ((ICollection<KeyValuePair<TKey, TValue>>) _keysToValues).Contains(item); |
| 85 | + } |
| 86 | + |
| 87 | + public bool TryGetValue(TKey key, out TValue value) |
| 88 | + { |
| 89 | + return key == null |
| 90 | + ? throw new ArgumentNullException(nameof(key)) |
| 91 | + : _keysToValues.TryGetValue(key, out value); |
| 92 | + } |
| 93 | + |
| 94 | + public TValue this[TKey key] |
| 95 | + { |
| 96 | + get => _keysToValues[key]; |
| 97 | + set |
| 98 | + { |
| 99 | + if (key == null) throw new ArgumentNullException(nameof(key)); |
| 100 | + if (value == null) throw new ArgumentNullException(nameof(value)); |
| 101 | + |
| 102 | + if (_ValueBelongsToOtherKey(key, value)) throw new ArgumentException("Value already exists", nameof(value)); |
| 103 | + |
| 104 | + |
| 105 | + if (_keysToValues.TryGetValue(key, out TValue oldValue)) |
| 106 | + { |
| 107 | + var oldKey = _valuesToKeys[oldValue]; |
| 108 | + |
| 109 | + _keysToValues[oldKey] = value; |
| 110 | + _valuesToKeys.Remove(oldValue); |
| 111 | + _valuesToKeys[value] = oldKey; |
| 112 | + } |
| 113 | + else |
| 114 | + { |
| 115 | + _keysToValues[key] = value; |
| 116 | + _valuesToKeys[value] = key; |
| 117 | + } |
| 118 | + } |
| 119 | + } |
| 120 | + |
| 121 | + public int Count => _keysToValues.Count; |
| 122 | + |
| 123 | + bool ICollection<KeyValuePair<TKey, TValue>>.IsReadOnly => false; |
| 124 | + |
| 125 | + public void Add(TKey key, TValue value) |
| 126 | + { |
| 127 | + if (key == null) throw new ArgumentNullException(nameof(key)); |
| 128 | + if (value == null) throw new ArgumentNullException(nameof(value)); |
| 129 | + |
| 130 | + if (_keysToValues.ContainsKey(key)) throw new ArgumentException("Key already exists", nameof(key)); |
| 131 | + if (_valuesToKeys.ContainsKey(value)) throw new ArgumentException("Value already exists", nameof(value)); |
| 132 | + |
| 133 | + _keysToValues.Add(key, value); |
| 134 | + _valuesToKeys.Add(value, key); |
| 135 | + } |
| 136 | + |
| 137 | + void ICollection<KeyValuePair<TKey, TValue>>.Add(KeyValuePair<TKey, TValue> item) { Add(item.Key, item.Value); } |
| 138 | + |
| 139 | + public bool Remove(TKey key) |
| 140 | + { |
| 141 | + if (key == null) throw new ArgumentNullException("ke" + "y"); |
| 142 | + |
| 143 | + if (!_keysToValues.TryGetValue(key, out TValue value)) return false; |
| 144 | + |
| 145 | + _keysToValues.Remove(key); |
| 146 | + _valuesToKeys.Remove(value); |
| 147 | + |
| 148 | + return true; |
| 149 | + } |
| 150 | + |
| 151 | + bool ICollection<KeyValuePair<TKey, TValue>>.Remove(KeyValuePair<TKey, TValue> item) |
| 152 | + { |
| 153 | + var removed = ((ICollection<KeyValuePair<TKey, TValue>>) _keysToValues).Remove(item); |
| 154 | + |
| 155 | + if (removed) _valuesToKeys.Remove(item.Value); |
| 156 | + |
| 157 | + return removed; |
| 158 | + } |
| 159 | + |
| 160 | + public void Clear() |
| 161 | + { |
| 162 | + _keysToValues.Clear(); |
| 163 | + _valuesToKeys.Clear(); |
| 164 | + } |
| 165 | + |
| 166 | + public TValue GetValue(TKey key) { return TryGetValue(key, out TValue value) ? value : default(TValue); } |
| 167 | + |
| 168 | + public bool ContainsValue(TValue value) |
| 169 | + { |
| 170 | + return value == null |
| 171 | + ? throw new ArgumentNullException(nameof(value)) |
| 172 | + : _valuesToKeys.ContainsKey(value); |
| 173 | + } |
| 174 | + |
| 175 | + public TKey GetKey(TValue value) { return TryGetKey(value, out TKey key) ? key : default(TKey); } |
| 176 | + |
| 177 | + public bool TryGetKey(TValue value, out TKey key) |
| 178 | + { |
| 179 | + return value == null |
| 180 | + ? throw new ArgumentNullException(nameof(value)) |
| 181 | + : _valuesToKeys.TryGetValue(value, out key); |
| 182 | + } |
| 183 | + |
| 184 | + public void Replace(TKey key, TValue value) |
| 185 | + { |
| 186 | + if (key == null) throw new ArgumentNullException(nameof(key)); |
| 187 | + if (value == null) throw new ArgumentNullException(nameof(value)); |
| 188 | + |
| 189 | + Remove(key); |
| 190 | + |
| 191 | + Inverse.Remove(value); |
| 192 | + |
| 193 | + Add(key, value); |
| 194 | + } |
| 195 | + |
| 196 | + private bool _ValueBelongsToOtherKey(TKey key, TValue value) |
| 197 | + { |
| 198 | + return _valuesToKeys.TryGetValue(value, out TKey otherKey) && !_keyComparer.Equals(key, otherKey); |
| 199 | + } |
| 200 | + } |
| 201 | +} |
0 commit comments