docs: private void rightAddWithSuccessor(
                                        GBSNode           p,
                                        GBSNode           l,
                                        Object            new1,
                                        NodeInsertPoint   ip,
                                        InsertNodes       point)
      {
          java.util.Comparator comp = l.insertComparator();
          int xcc = comp.compare(new1, l.leftMostKey());
          if (xcc < 0)                   /* If key exists it is in right part     */
          {
              /*  of current node                      */
              if (p.lessThanHalfFull())  /* Node not even half full so the insert */
                                         /*  point now is high key of current     */
                  point.setInsert(p, p.rightMostIndex());
              else                       /* Keys exist beyond the median          */
              {
                  /* Must look for insert point            */
                  p.findInsertPointInRight(new1, ip);
                  point.setInsert(p, ip);
              }
          }
          else                           /* If key exists it is in left part      */
          {
              /*  of upper successor                   */
              l.findInsertPointInLeft(new1, ip);
              if (ip.isDuplicate())      /* Key is a duplicate                    */
                  point.setInsert(l, ip);
              else                       /* Key is not a duplicate                */
              {
                  point.setInsertAndPosition(
                                            p,
                                            p.rightMostIndex(),
                                            l,
                                            ip.insertPoint());
                  point.setLeft();
              }
          }
      }