code: private int search(Object[] keys, Object toFind)
      {
          for (int i = 0; i < keys.length; ++i)
          {
              if (toFind == null)
              {
                  if (keys[i] == null)
                      return i;
              }
              else if (toFind.equals(keys[i]))
                  return i;
          }
          return -1; // niets gevonden
      }
docs: Arrays.binarySearch(..) does exist in java, but assumes that array is
  sorted, we don't have this restriction so dumb search from first to
  last...
  
  @param keys
  @param toFind
  @return