Insert()

void System.Collections.Hashtable.Insert ( object key, object nvalue, bool add )

inlineprivateinherited

Definition at line 935 of file Hashtable.cs.

    {
        if (key == null)
        {
            throw new ArgumentNullException("key", SR.ArgumentNull_Key);
        }
        if (_count >= _loadsize)
        {
            expand();
        }
        else if (_occupancy > _loadsize && _count > 100)
        {
            rehash();
        }
        uint seed;
        uint incr;
        uint num = InitHash(key, _buckets.Length, out seed, out incr);
        int num2 = 0;
        int num3 = -1;
        int num4 = (int)(seed % (uint)_buckets.Length);
        do
        {
            if (num3 == -1 && _buckets[num4].key == _buckets && _buckets[num4].hash_coll < 0)
            {
                num3 = num4;
            }
            if (_buckets[num4].key == null || (_buckets[num4].key == _buckets && (_buckets[num4].hash_coll & 0x80000000u) == 0L))
            {
                if (num3 != -1)
                {
                    num4 = num3;
                }
                _isWriterInProgress = true;
                _buckets[num4].val = nvalue;
                _buckets[num4].key = key;
                _buckets[num4].hash_coll |= (int)num;
                _count++;
                UpdateVersion();
                _isWriterInProgress = false;
                return;
            }
            if ((_buckets[num4].hash_coll & 0x7FFFFFFF) == num && KeyEquals(_buckets[num4].key, key))
            {
                if (add)
                {
                    throw new ArgumentException(SR.Format(SR.Argument_AddingDuplicate__, _buckets[num4].key, key));
                }
                _isWriterInProgress = true;
                _buckets[num4].val = nvalue;
                UpdateVersion();
                _isWriterInProgress = false;
                return;
            }
            if (num3 == -1 && _buckets[num4].hash_coll >= 0)
            {
                _buckets[num4].hash_coll |= int.MinValue;
                _occupancy++;
            }
            num4 = (int)((num4 + incr) % (uint)_buckets.Length);
        }
        while (++num2 < _buckets.Length);
        if (num3 != -1)
        {
            _isWriterInProgress = true;
            _buckets[num3].val = nvalue;
            _buckets[num3].key = key;
            _buckets[num3].hash_coll |= (int)num;
            _count++;
            UpdateVersion();
            _isWriterInProgress = false;
            return;
        }
        throw new InvalidOperationException(SR.InvalidOperation_HashInsertFailed);
    }

References System.Collections.Hashtable._buckets, System.Collections.Hashtable._count, System.Collections.Hashtable._isWriterInProgress, System.Collections.Hashtable._loadsize, System.Collections.Hashtable._occupancy, System.SR.Argument_AddingDuplicate__, System.SR.ArgumentNull_Key, System.Runtime.Serialization.Dictionary, System.Collections.Hashtable.expand(), System.SR.Format(), System.Collections.Hashtable.bucket.hash_coll, System.Collections.Hashtable.InitHash(), System.SR.InvalidOperation_HashInsertFailed, System.Collections.Hashtable.bucket.key, System.key, System.Collections.Hashtable.KeyEquals(), System.L, System.Collections.Hashtable.rehash(), System.Collections.Hashtable.UpdateVersion(), and System.Collections.Hashtable.bucket.val.