1 write to _key
System.Collections.Concurrent (1)
System\Collections\Concurrent\ConcurrentDictionary.cs (1)
2244_key = key;
22 references to _key
System.Collections.Concurrent (22)
System\Collections\Concurrent\ConcurrentDictionary.cs (22)
326EqualityComparer<TKey>.Default.Equals(node._key, key) : 327comparer.Equals(node._key, key); 331return comparer.Equals(node._key, key); 533if (hashcode == n._hashcode && EqualityComparer<TKey>.Default.Equals(n._key, key)) 546if (hashcode == n._hashcode && comparer.Equals(n._key, key)) 567if (hashcode == n._hashcode && EqualityComparer<TKey>.Default.Equals(n._key, key)) 579if (hashcode == n._hashcode && comparer.Equals(n._key, key)) 681var newNode = new Node(node._key, newValue, hashcode, node._next); 813array[index] = new KeyValuePair<TKey, TValue>(current._key, current._value); 828array[index] = new DictionaryEntry(current._key, current._value); 843array[index] = new KeyValuePair<TKey, TValue>(current._key, current._value); 928Current = new KeyValuePair<TKey, TValue>(node._key, node._value); 1004var newNode = new Node(node._key, value, hashcode, node._next); 2050int hashCode = upgradeComparer is null ? current._hashcode : upgradeComparer.GetHashCode(current._key); 2055newBucket = new Node(current._key, current._value, hashCode, newBucket); 2173keys[i] = node._key; 2452if (hashcode == node._hashcode && comparer.Equals(key, node._key)) 2469var newNode = new Node(node._key, value, hashcode, node._next); 2581if (hashcode == n._hashcode && comparer.Equals(key, n._key)) 2583actualKey = n._key; 2654if (hashcode == curr._hashcode && comparer.Equals(key, curr._key)) 2665actualKey = curr._key;