-
-
Notifications
You must be signed in to change notification settings - Fork 1.2k
/
stream.scala
184 lines (140 loc) · 6.48 KB
/
stream.scala
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
package cats
package instances
import cats.syntax.show._
import scala.annotation.tailrec
trait StreamInstances extends cats.kernel.instances.StreamInstances {
implicit val catsStdInstancesForStream: Traverse[Stream] with Alternative[Stream] with Monad[Stream] with CoflatMap[Stream] =
new Traverse[Stream] with Alternative[Stream] with Monad[Stream] with CoflatMap[Stream] {
def empty[A]: Stream[A] = Stream.Empty
def combineK[A](x: Stream[A], y: Stream[A]): Stream[A] = x #::: y
def pure[A](x: A): Stream[A] = Stream(x)
override def map[A, B](fa: Stream[A])(f: A => B): Stream[B] =
fa.map(f)
def flatMap[A, B](fa: Stream[A])(f: A => Stream[B]): Stream[B] =
fa.flatMap(f)
override def map2[A, B, Z](fa: Stream[A], fb: Stream[B])(f: (A, B) => Z): Stream[Z] =
if (fb.isEmpty) Stream.empty // do O(1) work if fb is empty
else fa.flatMap(a => fb.map(b => f(a, b))) // already O(1) if fa is empty
override def map2Eval[A, B, Z](fa: Stream[A], fb: Eval[Stream[B]])(f: (A, B) => Z): Eval[Stream[Z]] =
if (fa.isEmpty) Eval.now(Stream.empty) // no need to evaluate fb
else fb.map(fb => map2(fa, fb)(f))
def coflatMap[A, B](fa: Stream[A])(f: Stream[A] => B): Stream[B] =
fa.tails.toStream.init.map(f)
def foldLeft[A, B](fa: Stream[A], b: B)(f: (B, A) => B): B =
fa.foldLeft(b)(f)
def foldRight[A, B](fa: Stream[A], lb: Eval[B])(f: (A, Eval[B]) => Eval[B]): Eval[B] =
Now(fa).flatMap { s =>
// Note that we don't use pattern matching to deconstruct the
// stream, since that would needlessly force the tail.
if (s.isEmpty) lb else f(s.head, Eval.defer(foldRight(s.tail, lb)(f)))
}
override def foldMap[A, B](fa: Stream[A])(f: A => B)(implicit B: Monoid[B]): B =
B.combineAll(fa.iterator.map(f))
def traverse[G[_], A, B](fa: Stream[A])(f: A => G[B])(implicit G: Applicative[G]): G[Stream[B]] = {
// We use foldRight to avoid possible stack overflows. Since
// we don't want to return a Eval[_] instance, we call .value
// at the end.
foldRight(fa, Always(G.pure(Stream.empty[B]))){ (a, lgsb) =>
G.map2Eval(f(a), lgsb)(_ #:: _)
}.value
}
override def mapWithIndex[A, B](fa: Stream[A])(f: (A, Int) => B): Stream[B] =
fa.zipWithIndex.map(ai => f(ai._1, ai._2))
override def zipWithIndex[A](fa: Stream[A]): Stream[(A, Int)] =
fa.zipWithIndex
def tailRecM[A, B](a: A)(fn: A => Stream[Either[A, B]]): Stream[B] = {
val it: Iterator[B] = new Iterator[B] {
var stack: Stream[Either[A, B]] = fn(a)
var state: Either[Unit, Option[B]] = Left(())
@tailrec
def advance(): Unit = stack match {
case Right(b) #:: tail =>
stack = tail
state = Right(Some(b))
case Left(a) #:: tail =>
stack = fn(a) #::: tail
advance()
case empty =>
state = Right(None)
}
@tailrec
def hasNext: Boolean = state match {
case Left(()) =>
advance()
hasNext
case Right(o) =>
o.isDefined
}
@tailrec
def next(): B = state match {
case Left(()) =>
advance()
next()
case Right(o) =>
val b = o.get
advance()
b
}
}
it.toStream
}
override def exists[A](fa: Stream[A])(p: A => Boolean): Boolean =
fa.exists(p)
override def forall[A](fa: Stream[A])(p: A => Boolean): Boolean =
fa.forall(p)
override def get[A](fa: Stream[A])(idx: Long): Option[A] = {
@tailrec
def go(idx: Long, s: Stream[A]): Option[A] =
s match {
case h #:: tail =>
if (idx == 0L) Some(h) else go(idx - 1L, tail)
case _ => None
}
if (idx < 0L) None else go(idx, fa)
}
override def isEmpty[A](fa: Stream[A]): Boolean = fa.isEmpty
override def foldM[G[_], A, B](fa: Stream[A], z: B)(f: (B, A) => G[B])(implicit G: Monad[G]): G[B] = {
def step(in: (Stream[A], B)): G[Either[(Stream[A], B), B]] = {
val (s, b) = in
if (s.isEmpty)
G.pure(Right(b))
else
G.map(f(b, s.head)) { bnext => Left((s.tail, bnext)) }
}
G.tailRecM((fa, z))(step)
}
override def fold[A](fa: Stream[A])(implicit A: Monoid[A]): A = A.combineAll(fa)
override def toList[A](fa: Stream[A]): List[A] = fa.toList
override def reduceLeftOption[A](fa: Stream[A])(f: (A, A) => A): Option[A] =
fa.reduceLeftOption(f)
override def find[A](fa: Stream[A])(f: A => Boolean): Option[A] = fa.find(f)
override def algebra[A]: Monoid[Stream[A]] = new kernel.instances.StreamMonoid[A]
override def collectFirst[A, B](fa: Stream[A])(pf: PartialFunction[A, B]): Option[B] = fa.collectFirst(pf)
override def collectFirstSome[A, B](fa: Stream[A])(f: A => Option[B]): Option[B] = fa.collectFirst(Function.unlift(f))
}
implicit def catsStdShowForStream[A: Show]: Show[Stream[A]] =
new Show[Stream[A]] {
def show(fa: Stream[A]): String = if (fa.isEmpty) "Stream()" else s"Stream(${fa.head.show}, ?)"
}
}
trait StreamInstancesBinCompat0 {
implicit val catsStdTraverseFilterForStream: TraverseFilter[Stream] = new TraverseFilter[Stream] {
val traverse: Traverse[Stream] = cats.instances.stream.catsStdInstancesForStream
override def mapFilter[A, B](fa: Stream[A])(f: (A) => Option[B]): Stream[B] = {
fa.collect(Function.unlift(f))
}
override def filter[A](fa: Stream[A])(f: (A) => Boolean): Stream[A] = fa.filter(f)
override def collect[A, B](fa: Stream[A])(f: PartialFunction[A, B]): Stream[B] = fa.collect(f)
override def flattenOption[A](fa: Stream[Option[A]]): Stream[A] = fa.flatten
def traverseFilter[G[_], A, B](fa: Stream[A])(f: (A) => G[Option[B]])(implicit G: Applicative[G]): G[Stream[B]] = {
fa.foldRight(Eval.now(G.pure(Stream.empty[B])))(
(x, xse) => G.map2Eval(f(x), xse)((i, o) => i.fold(o)(_ +: o))
).value
}
override def filterA[G[_], A](fa: Stream[A])(f: (A) => G[Boolean])(implicit G: Applicative[G]): G[Stream[A]] = {
fa.foldRight(Eval.now(G.pure(Stream.empty[A])))(
(x, xse) => G.map2Eval(f(x), xse)((b, as) => if (b) x +: as else as)
).value
}
}
}