docs: private void leftAddWithPredecessor(
                                         GBSNode           p,
                                         GBSNode           r,
                                         Object            new1,
                                         NodeInsertPoint   ip,
                                         InsertNodes       point)
      {
          java.util.Comparator comp = r.insertComparator();
          int xcc = comp.compare(new1, r.rightMostKey());
          if (xcc > 0)                   /* If key exists it is in left part      */
          {
              /*  of current node                      */
              p.findInsertPointInLeft(new1, ip);
              point.setInsert(p, ip);
          }
          else                           /* If key exists it is in right part     */
          {
              /*  of predecessor node                  */
              r.findInsertPointInRight(new1, ip);
              if (ip.isDuplicate())      /* Key is a duplicate                    */
                  point.setInsert(r, ip);
              else                       /* Key is not a duplicate                */
              {
                  point.setInsertAndPosition(
                                            p,
                                            -1,
                                            r,
                                            ip.insertPoint());
                  point.setRight();
              }
  
          }
  
      }