-
Notifications
You must be signed in to change notification settings - Fork 1
/
Stack.scala
56 lines (48 loc) · 1.57 KB
/
Stack.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
/*
* SPDX-License-Identifier: Apache-2.0
* Copyright 2016-2024 Daniel Urban and contributors listed in NOTICE.txt
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package dev.tauri.choam
package data
import cats.Monad
import cats.syntax.all._
abstract class Stack[A] {
def push: Rxn[A, Unit]
def tryPop: Axn[Option[A]]
def size: Axn[Int]
}
object Stack {
def treiberStack[A]: Axn[Stack[A]] =
TreiberStack[A]
// TODO: on JS, we could just return a TreiberStack
def eliminationStack[A]: Axn[Stack[A]] =
EliminationStack[A]
private[data] def fromList[F[_], A](mkEmpty: Axn[Stack[A]])(as: List[A])(implicit F: Reactive[F]): F[Stack[A]] = {
implicit val monadF: Monad[F] = F.monad
mkEmpty.run[F].flatMap { stack =>
as.traverse { a =>
stack.push[F](a)
}.as(stack)
}
}
private[data] def popAll[F[_], A](s: Stack[A])(implicit F: Reactive[F]): F[List[A]] = {
F.monad.tailRecM(List.empty[A]) { lst =>
F.monad.map(s.tryPop.run[F]) {
case None => Right(lst.reverse)
case Some(a) => Left(a :: lst)
}
}
}
}