this[K key]

V System.Reflection.CerHashtable< K, V >.this[K key]

getsetpackage

Definition at line 53 of file CerHashtable.cs.

    {
        get
        {
            Table table = Volatile.Read(ref m_Table);
            if (table == null)
            {
                return default(V);
            }
            int num = GetHashCodeHelper(key);
            if (num < 0)
            {
                num = ~num;
            }
            K[] keys = table.m_keys;
            int num2 = num % keys.Length;
            while (true)
            {
                K val = Volatile.Read(ref keys[num2]);
                if (val == null)
                {
                    break;
                }
                if (val.Equals(key))
                {
                    return table.m_values[num2];
                }
                num2++;
                if (num2 >= keys.Length)
                {
                    num2 -= keys.Length;
                }
            }
            return default(V);
        }
        set
        {
            Table table = m_Table;
            if (table != null)
            {
                int num = 2 * (table.m_count + 1);
                if (num >= table.m_keys.Length)
                {
                    Rehash(num);
                }
            }
            else
            {
                Rehash(7);
            }
            m_Table.Insert(key, value);
        }
    }