docs: private void rightSearch(
                              SearchComparator  comp,
                              GBSNode           p,
                              GBSNode           l,
                              Object            searchKey,
                              SearchNode        point)
      {
          int xcc = comp.compare(searchKey, p.rightMostKey());
          if (xcc == 0)                /* Target is right-most key in current   */
              point.setFound(p, 0);
          else if (xcc < 0)            /* Target (if it exists) is in right     */
          {
              /*  half of current node                 */
              int idx = p.searchRight(comp, searchKey);
              if ( !(idx < 0) )
                  point.setFound(p, idx);
          }
          else                         /* Target (if it exists) is in left      */
          {
              /*  half of successor (if it exists)     */
              if (l != null)
              {
                  int idx = l.searchLeft(comp, searchKey);
                  if ( !(idx < 0) )
                      point.setFound(l, idx);
              }
          }
      }