code: public boolean add(final WorkbenchEntry e) {
  		// The starting point.
  		int pos = hashCode(e.ipAddress) & mask;
  		// There's always an unused entry.
  		while (workbenchEntry[pos] != null) {
  			if (Arrays.equals(workbenchEntry[pos].ipAddress, e.ipAddress)) return false;
  			pos = (pos + 1) & mask;
  		}
  		workbenchEntry[pos] = e;
  		if (++size >= maxFill && n < (1 << 30)) rehash(2 * n);
  		return true;
  	}
docs: Adds a workbench entry to the set, if necessary.
  
  @param e the entry to be added.
  @return true if the state set changed as a result of this operation.