docs: private int sequentialSearchEqual(
      SearchComparator  comp,
      int               lower,
      int               upper,
      Object            searchKey)
    {
      int xcc;                       /* Current compare result                */
      int idx = -1;                  /* The returned index (-1 if not found)  */
      for (int i = lower; i <= upper; i++)
      {
        xcc = comp.compare(searchKey, _nodeKey[i]);
        if (xcc == 0)                /* Found a match                         */
          {
            idx = i;                 /* Remember current point                */
            break;
          }
      }
      return idx;
    }