docs: private boolean optimisticGetNext1(
                                        DeleteStack      stack)
      {
          Object q = null;
  
          int v1 = _index.vno();
          int x1 = _index.xno();
  
          if ((v1&1) != 0)
              return pessimisticNeeded;
          synchronized(this)
          {
          }
  
          int idx = _last1.index() + 1;
          GBSNode p = _last1.node();
          if (idx < p.population())      /* Have more in current node             */
          {
              /* Get next one in current node          */
              _current1.setLocation(p, idx);
              q = p.key(idx);
          }
          else                           /* Have gotten all in current node       */
          {
              /* Move to next node (if any)            */
              if (1 == 1)
                  return pessimisticNeeded;
              try
              {
                  p = nextNode(stack);
                  _current1.setLocation(p, 0);
                  if (p != null)
                      q = p.leftMostKey();
              }
              catch (NullPointerException npe)
              {
                  //No FFDC Code Needed.
                  _nullPointerExceptions++;
                  return GBSTree.checkForPossibleIndexChange(v1, _index.vno(), npe, "optimisticGetNext1");
              }
              catch (OptimisticDepthException ode)
              {
                  //No FFDC Code Needed.
                  _optimisticDepthExceptions++;
                  return GBSTree.checkForPossibleIndexChange(v1, _index.vno(), ode, "optimisticGetNext1");
              }
          }
  
          if (v1 != _index.vno())
              return pessimisticNeeded;
  
          _current1.setLocation(q, v1, x1);
          _optimisticGetNext1s++;
  
          return optimisticWorked;
      }