public void next()
		{
			// check for concurrent modification
			if(expectedModCount != modCount)
				throw new ConcurrentModificationException();
			
			// go to next entry in chain, if it exists
			current = current.nextEntry;
			
			if (current == null)
			{
				// at end of chain; go to next cell containing an entry
				while (++currentIndex < table.length && table[currentIndex] == null)
					;
				
				if (currentIndex >= table.length)
				{
					// past end of table
					current = null;
				}
				else
				{
					// set next entry
					current = table[currentIndex];
				}
			}
		}