-
-
Notifications
You must be signed in to change notification settings - Fork 1.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'main' into add-scaladoc-links
- Loading branch information
Showing
6 changed files
with
238 additions
and
180 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,125 @@ | ||
| /* | ||
| * Copyright (c) 2015 Typelevel | ||
| * | ||
| * Permission is hereby granted, free of charge, to any person obtaining a copy of | ||
| * this software and associated documentation files (the "Software"), to deal in | ||
| * the Software without restriction, including without limitation the rights to | ||
| * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of | ||
| * the Software, and to permit persons to whom the Software is furnished to do so, | ||
| * subject to the following conditions: | ||
| * | ||
| * The above copyright notice and this permission notice shall be included in all | ||
| * copies or substantial portions of the Software. | ||
| * | ||
| * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
| * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS | ||
| * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR | ||
| * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER | ||
| * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN | ||
| * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. | ||
| */ | ||
|
|
||
| package cats | ||
|
|
||
| import cats.Foldable.Source | ||
| import cats.data.NonEmptyList | ||
|
|
||
| /** | ||
| * This class defines a `Reducible[F]` in terms of a `Foldable[G]` | ||
| * together with a `split` method, `F[A]` => `(A, G[A])`. | ||
| * | ||
| * This class can be used on any type where the first value (`A`) and | ||
| * the "rest" of the values (`G[A]`) can be easily found. | ||
| * | ||
| * This class is only a helper, does not define a typeclass and should not be used outside of Cats. | ||
| * Also see the discussion: PR #3541 and issue #3069. | ||
| */ | ||
| abstract class NonEmptyReducible[F[_], G[_]](implicit G: Foldable[G]) extends Reducible[F] { | ||
| def split[A](fa: F[A]): (A, G[A]) | ||
|
|
||
| def foldLeft[A, B](fa: F[A], b: B)(f: (B, A) => B): B = { | ||
| val (a, ga) = split(fa) | ||
| G.foldLeft(ga, f(b, a))(f) | ||
| } | ||
|
|
||
| def foldRight[A, B](fa: F[A], lb: Eval[B])(f: (A, Eval[B]) => Eval[B]): Eval[B] = | ||
| Always(split(fa)).flatMap { case (a, ga) => | ||
| f(a, G.foldRight(ga, lb)(f)) | ||
| } | ||
|
|
||
| def reduceLeftTo[A, B](fa: F[A])(f: A => B)(g: (B, A) => B): B = { | ||
| val (a, ga) = split(fa) | ||
| G.foldLeft(ga, f(a))((b, a) => g(b, a)) | ||
| } | ||
|
|
||
| def reduceRightTo[A, B](fa: F[A])(f: A => B)(g: (A, Eval[B]) => Eval[B]): Eval[B] = { | ||
| def loop(now: A, source: Source[A]): Eval[B] = | ||
| source.uncons match { | ||
| case Some((next, s)) => g(now, Eval.defer(loop(next, s.value))) | ||
| case None => Eval.later(f(now)) | ||
| } | ||
|
|
||
| Always(split(fa)).flatMap { case (a, ga) => | ||
| Eval.defer(loop(a, Foldable.Source.fromFoldable(ga))) | ||
| } | ||
| } | ||
|
|
||
| override def size[A](fa: F[A]): Long = { | ||
| val (_, tail) = split(fa) | ||
| 1 + G.size(tail) | ||
| } | ||
|
|
||
| override def get[A](fa: F[A])(idx: Long): Option[A] = | ||
| if (idx == 0L) Some(split(fa)._1) else G.get(split(fa)._2)(idx - 1L) | ||
|
|
||
| override def fold[A](fa: F[A])(implicit A: Monoid[A]): A = { | ||
| val (a, ga) = split(fa) | ||
| A.combine(a, G.fold(ga)) | ||
| } | ||
|
|
||
| override def foldM[H[_], A, B](fa: F[A], z: B)(f: (B, A) => H[B])(implicit H: Monad[H]): H[B] = { | ||
| val (a, ga) = split(fa) | ||
| H.flatMap(f(z, a))(G.foldM(ga, _)(f)) | ||
| } | ||
|
|
||
| override def find[A](fa: F[A])(f: A => Boolean): Option[A] = { | ||
| val (a, ga) = split(fa) | ||
| if (f(a)) Some(a) else G.find(ga)(f) | ||
| } | ||
|
|
||
| override def exists[A](fa: F[A])(p: A => Boolean): Boolean = { | ||
| val (a, ga) = split(fa) | ||
| p(a) || G.exists(ga)(p) | ||
| } | ||
|
|
||
| override def forall[A](fa: F[A])(p: A => Boolean): Boolean = { | ||
| val (a, ga) = split(fa) | ||
| p(a) && G.forall(ga)(p) | ||
| } | ||
|
|
||
| override def toList[A](fa: F[A]): List[A] = { | ||
| val (a, ga) = split(fa) | ||
| a :: G.toList(ga) | ||
| } | ||
|
|
||
| override def toNonEmptyList[A](fa: F[A]): NonEmptyList[A] = { | ||
| val (a, ga) = split(fa) | ||
| NonEmptyList(a, G.toList(ga)) | ||
| } | ||
|
|
||
| override def filter_[A](fa: F[A])(p: A => Boolean): List[A] = { | ||
| val (a, ga) = split(fa) | ||
| val filteredTail = G.filter_(ga)(p) | ||
| if (p(a)) a :: filteredTail else filteredTail | ||
| } | ||
|
|
||
| override def takeWhile_[A](fa: F[A])(p: A => Boolean): List[A] = { | ||
| val (a, ga) = split(fa) | ||
| if (p(a)) a :: G.takeWhile_(ga)(p) else Nil | ||
| } | ||
|
|
||
| override def dropWhile_[A](fa: F[A])(p: A => Boolean): List[A] = { | ||
| val (a, ga) = split(fa) | ||
| if (p(a)) G.dropWhile_(ga)(p) else a :: G.toList(ga) | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.