@@ -514,9 +514,10 @@ sealed abstract private[data] class NonEmptyLazyListInstances extends NonEmptyLa
514514 NonEmptyLazyList
515515 ] & NonEmptyAlternative [NonEmptyLazyList ] & Align [NonEmptyLazyList ] =
516516 new AbstractNonEmptyInstances [LazyList , NonEmptyLazyList ] with Align [NonEmptyLazyList ] {
517-
518517 def extract [A ](fa : NonEmptyLazyList [A ]): A = fa.head
519518
519+ override def split [A ](fa : NonEmptyLazyList [A ]): (A , LazyList [A ]) = (fa.head, fa.tail)
520+
520521 def nonEmptyTraverse [G [_]: Apply , A , B ](fa : NonEmptyLazyList [A ])(f : A => G [B ]): G [NonEmptyLazyList [B ]] = {
521522 def loop (head : A , tail : LazyList [A ]): Eval [G [NonEmptyLazyList [B ]]] =
522523 tail.headOption.fold(Eval .now(Apply [G ].map(f(head))(NonEmptyLazyList (_)))) { h =>
@@ -526,9 +527,12 @@ sealed abstract private[data] class NonEmptyLazyListInstances extends NonEmptyLa
526527 loop(fa.head, fa.tail).value
527528 }
528529
529- def reduceLeftTo [A , B ](fa : NonEmptyLazyList [A ])(f : A => B )(g : (B , A ) => B ): B = fa.reduceLeftTo(f)(g)
530+ override def reduceLeftTo [A , B ](fa : NonEmptyLazyList [A ])(f : A => B )(g : (B , A ) => B ): B =
531+ fa.reduceLeftTo(f)(g)
530532
531- def reduceRightTo [A , B ](fa : NonEmptyLazyList [A ])(f : A => B )(g : (A , cats.Eval [B ]) => cats.Eval [B ]): cats.Eval [B ] =
533+ override def reduceRightTo [A , B ](
534+ fa : NonEmptyLazyList [A ]
535+ )(f : A => B )(g : (A , cats.Eval [B ]) => cats.Eval [B ]): cats.Eval [B ] =
532536 fa.tail match {
533537 case head +: tail =>
534538 val nell = NonEmptyLazyList .fromLazyListPrepend(head, tail)
0 commit comments