_collList[bucket] = new Bucket(symbol, _collList[bucket]);
_collList[bucket] = new Bucket(symbol, _collList[bucket]);
_collList[bucket] = new Bucket(symbol, _collList[bucket]);
_collList[bucket] = new Bucket(symbol, _collList[bucket]);
Bucket bucket = _collList[val]; if (bucket != null) { return bucket.find(hash, firstQuad, 0);
Bucket bucket = _collList[val]; if (bucket != null) { return bucket.find(hash, quads, qlen);
Bucket bucket = _collList[val]; if (bucket != null) { return bucket.find(hash, firstQuad, secondQuad);
Bucket bucket = _collList[val]; if (bucket != null) { return bucket.find(hash, quads, qlen);
Bucket bucket = _collList[val]; if (bucket != null) { return bucket.find(hash, firstQuad, 0);
Bucket bucket = _collList[val]; if (bucket != null) { return bucket.find(hash, firstQuad, secondQuad);
/** * Method called to find the best bucket to spill a Name over to: * usually the first bucket that has only one entry, but in general * first one of the buckets with least number of entries */ private int findBestBucket() { Bucket[] buckets = _collList; int bestCount = Integer.MAX_VALUE; int bestIx = -1; for (int i = 0, len = _collEnd; i < len; ++i) { int count = buckets[i].length(); if (count < bestCount) { if (count == 1) { // best possible return i; } bestCount = count; bestIx = i; } } return bestIx; }
/** * Method called to find the best bucket to spill a Name over to: * usually the first bucket that has only one entry, but in general * first one of the buckets with least number of entries */ private int findBestBucket() { Bucket[] buckets = _collList; int bestCount = Integer.MAX_VALUE; int bestIx = -1; for (int i = 0, len = _collEnd; i < len; ++i) { int count = buckets[i].length(); if (count < bestCount) { if (count == 1) { // best possible return i; } bestCount = count; bestIx = i; } } return bestIx; }
Bucket bucket = _collList[val]; if (bucket != null) { return bucket.find(hash, quads, qlen);
Bucket bucket = _collList[val]; if (bucket != null) { return bucket.find(hash, firstQuad, 0);
Bucket bucket = _collList[val]; if (bucket != null) { return bucket.find(hash, firstQuad, secondQuad);
/** * Method called to find the best bucket to spill a Name over to: * usually the first bucket that has only one entry, but in general * first one of the buckets with least number of entries */ private int findBestBucket() { Bucket[] buckets = _collList; int bestCount = Integer.MAX_VALUE; int bestIx = -1; for (int i = 0, len = _collEnd; i < len; ++i) { int count = buckets[i].length(); if (count < bestCount) { if (count == 1) { // best possible return i; } bestCount = count; bestIx = i; } } return bestIx; }