src/java.base/share/classes/java/util/TreeMap.java

*** 857,867 ****
  
      /**
       * Returns a {@link Set} view of the mappings contained in this map.
       *
       * <p>The set's iterator returns the entries in ascending key order. The
!      * sets's spliterator is
       * <em><a href="Spliterator.html#binding">late-binding</a></em>,
       * <em>fail-fast</em>, and additionally reports {@link Spliterator#SORTED} and
       * {@link Spliterator#ORDERED} with an encounter order that is ascending key
       * order.
       *
--- 857,867 ----
  
      /**
       * Returns a {@link Set} view of the mappings contained in this map.
       *
       * <p>The set's iterator returns the entries in ascending key order. The
!      * set's spliterator is
       * <em><a href="Spliterator.html#binding">late-binding</a></em>,
       * <em>fail-fast</em>, and additionally reports {@link Spliterator#SORTED} and
       * {@link Spliterator#ORDERED} with an encounter order that is ascending key
       * order.
       *
*** 2641,2651 ****
       * split uses the root as left-fence/right-origin. From there,
       * right-hand splits replace the current fence with its left
       * child, also serving as origin for the split-off spliterator.
       * Left-hands are symmetric. Descending versions place the origin
       * at the end and invert ascending split rules.  This base class
!      * is non-commital about directionality, or whether the top-level
       * spliterator covers the whole tree. This means that the actual
       * split mechanics are located in subclasses. Some of the subclass
       * trySplit methods are identical (except for return types), but
       * not nicely factorable.
       *
--- 2641,2651 ----
       * split uses the root as left-fence/right-origin. From there,
       * right-hand splits replace the current fence with its left
       * child, also serving as origin for the split-off spliterator.
       * Left-hands are symmetric. Descending versions place the origin
       * at the end and invert ascending split rules.  This base class
!      * is non-committal about directionality, or whether the top-level
       * spliterator covers the whole tree. This means that the actual
       * split mechanics are located in subclasses. Some of the subclass
       * trySplit methods are identical (except for return types), but
       * not nicely factorable.
       *