private AvlTreeKeyValue(int hash, TKey key, TValue value, AvlTreeKeyValue <TKey, TValue> left, AvlTreeKeyValue <TKey, TValue> right, ArrayStoreKeyed <TKey, TValue> collisions) { this.collisions = collisions; this.storedKey = key; this.storedHash = hash; this.leftNode = left; this.rightNode = right; this.storedValue = value; this.IsEmpty = false; this.height = 1 + (left.height > right.height ? left.height : right.height); }
private AvlTreeKeyValue() { this.Collisions = ArrayStoreKeyed <TKey, TValue> .Empty; }
/// <summary> /// Constructs a <see cref="ConcurrentOrderedKeyStore{TKey,TContent}"/> /// </summary> public ConcurrentOrderedKeyStore() { this.repository = ArrayStoreKeyed <TKey, TContent> .Empty; }
private AvlTreeKeyValue() { this.isEmpty = true; this.collisions = ArrayStoreKeyed <TKey, TValue> .Empty; }