288buckets = new bucket[hashsize]; 763buckets = newBuckets; 1272buckets = new bucket[hashsize];

456for (int i = 0; i < buckets.Length; i++){ 457buckets[i].hash_coll = 0; 458buckets[i].key = null; 459buckets[i].val = null; 476bucket[] lbuckets = buckets; 511bucket[] lbuckets = buckets; 541for (int i = buckets.Length; --i >= 0;) { 542if (buckets[i].key != null && buckets[i].key != buckets && buckets[i].val == null) 547for (int i = buckets.Length; --i >= 0;) { 548Object val = buckets[i].val; 562bucket[] lbuckets = buckets; 565if ((keyv != null) && (keyv != buckets)){ 578bucket[] lbuckets = buckets; 581if ((keyv != null) && (keyv != buckets)){ 612bucket[] lbuckets = buckets; 615if ((keyv != null) && (keyv != buckets)){ 631bucket[] lbuckets = buckets; 634if ((keyv != null) && (keyv != buckets)){ 655bucket[] lbuckets = buckets; 719int rawsize = HashHelpers.ExpandPrime(buckets.Length); 725rehash( buckets.Length, false ); 750for (nb = 0; nb < buckets.Length; nb++){ 751bucket oldb = buckets[nb]; 752if ((oldb.key != null) && (oldb.key != buckets)) { 824if( Object.ReferenceEquals(buckets, item)) { 892uint hashcode = InitHash(key, buckets.Length, out seed, out incr); 896int bucketNumber = (int) (seed % (uint)buckets.Length); 903if (emptySlotNumber == -1 && (buckets[bucketNumber].key == buckets) && (buckets[bucketNumber].hash_coll < 0))//(((buckets[bucketNumber].hash_coll & unchecked(0x80000000))!=0))) 909if ((buckets[bucketNumber].key == null) || 910(buckets[bucketNumber].key == buckets && ((buckets[bucketNumber].hash_coll & unchecked(0x80000000))==0))) { 923buckets[bucketNumber].val = nvalue; 924buckets[bucketNumber].key = key; 925buckets[bucketNumber].hash_coll |= (int) hashcode; 944rehash(buckets.Length, true); 956if (((buckets[bucketNumber].hash_coll & 0x7FFFFFFF) == hashcode) && 957KeyEquals (buckets[bucketNumber].key, key)) { 959throw new ArgumentException(Environment.GetResourceString("Argument_AddingDuplicate__", buckets[bucketNumber].key, key)); 965buckets[bucketNumber].val = nvalue; 981rehash(buckets.Length, true); 993if( buckets[bucketNumber].hash_coll >= 0 ) { 994buckets[bucketNumber].hash_coll |= unchecked((int)0x80000000); 999bucketNumber = (int) (((long)bucketNumber + incr)% (uint)buckets.Length); 1000} while (++ntry < buckets.Length); 1011buckets[emptySlotNumber].val = nvalue; 1012buckets[emptySlotNumber].key = key; 1013buckets[emptySlotNumber].hash_coll |= (int) hashcode; 1023if(buckets.Length > HashHelpers.HashCollisionThreshold && HashHelpers.IsWellKnownEqualityComparer(_keycomparer)) 1030rehash(buckets.Length, true); 1054if ((newBuckets[bucketNumber].key == null) || (newBuckets[bucketNumber].key == buckets)) { 1084uint hashcode = InitHash(key, buckets.Length, out seed, out incr); 1088int bn = (int) (seed % (uint)buckets.Length); // bucketNumber 1090b = buckets[bn]; 1098buckets[bn].hash_coll &= unchecked((int)0x80000000); 1099if (buckets[bn].hash_coll != 0) { 1100buckets[bn].key = buckets; 1103buckets[bn].key = null; 1105buckets[bn].val = null; // Free object references sooner & simplify ContainsValue. 1114bn = (int) (((long)bn + incr)% (uint)buckets.Length); 1115} while (b.hash_coll < 0 && ++ntry < buckets.Length); 1192info.AddValue(HashSizeName, buckets.Length); //This is the length of the bucket array. 1211if (buckets!=null) { 1561bucket = hashtable.buckets.Length; 1582Object keyv = hashtable.buckets[bucket].key; 1583if ((keyv!= null) && (keyv != hashtable.buckets)) { 1585currentValue = hashtable.buckets[bucket].val; 1625bucket = hashtable.buckets.Length;