src/java.base/share/classes/java/util/concurrent/ConcurrentSkipListMap.java

*** 2708,2718 ****
              else
                  return m.findNear(hi, LT, cmp);
          }
  
          /**
!          * Returns lowest absolute key (ignoring directonality).
           */
          K lowestKey() {
              Comparator<? super K> cmp = m.comparator;
              ConcurrentSkipListMap.Node<K,V> n = loNode(cmp);
              if (isBeforeEnd(n, cmp))
--- 2708,2718 ----
              else
                  return m.findNear(hi, LT, cmp);
          }
  
          /**
!          * Returns lowest absolute key (ignoring directionality).
           */
          K lowestKey() {
              Comparator<? super K> cmp = m.comparator;
              ConcurrentSkipListMap.Node<K,V> n = loNode(cmp);
              if (isBeforeEnd(n, cmp))
*** 2720,2730 ****
              else
                  throw new NoSuchElementException();
          }
  
          /**
!          * Returns highest absolute key (ignoring directonality).
           */
          K highestKey() {
              Comparator<? super K> cmp = m.comparator;
              ConcurrentSkipListMap.Node<K,V> n = hiNode(cmp);
              if (n != null) {
--- 2720,2730 ----
              else
                  throw new NoSuchElementException();
          }
  
          /**
!          * Returns highest absolute key (ignoring directionality).
           */
          K highestKey() {
              Comparator<? super K> cmp = m.comparator;
              ConcurrentSkipListMap.Node<K,V> n = hiNode(cmp);
              if (n != null) {