-
Notifications
You must be signed in to change notification settings - Fork 1
/
RefLike.scala
126 lines (93 loc) · 3.45 KB
/
RefLike.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
/*
* 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 refs
import cats.data.State
import cats.effect.kernel.{ Ref => CatsRef }
trait RefLike[A] {
// abstract:
def get: Axn[A]
def upd[B, C](f: (A, B) => (A, C)): Rxn[B, C]
def updWith[B, C](f: (A, B) => Axn[(A, C)]): Rxn[B, C]
// derived implementations:
final def set: Rxn[A, Unit] =
getAndSet.void
final def getAndSet: Rxn[A, A] =
upd[A, A] { (oa, na) => (na, oa) }
final def update(f: A => A): Axn[Unit] =
upd[Any, Unit] { (oa, _) => (f(oa), ()) }
final def updateWith(f: A => Axn[A]): Axn[Unit] =
updWith[Any, Unit] { (oa, _) => f(oa).map(na => (na, ())) }
/** Returns `false` iff the update failed */
final def tryUpdate(f: A => A): Axn[Boolean] =
update(f).maybe
/** Returns previous value */
final def getAndUpdate(f: A => A): Axn[A] =
upd[Any, A] { (oa, _) => (f(oa), oa) }
final def getAndUpdateWith(f: A => Axn[A]): Axn[A] =
updWith[Any, A] { (oa, _) => f(oa).map(na => (na, oa)) }
/** Returns new value */
final def updateAndGet(f: A => A): Axn[A] = {
upd[Any, A] { (oa, _) =>
val na = f(oa)
(na, na)
}
}
// TODO: updateAndGetWith OR updateWithAndGet ?
final def modify[B](f: A => (A, B)): Axn[B] =
upd[Any, B] { (a, _) => f(a) }
final def modifyWith[B](f: A => Axn[(A, B)]): Axn[B] =
updWith[Any, B] { (oa, _) => f(oa) }
final def tryModify[B](f: A => (A, B)): Axn[Option[B]] =
modify(f).?
def toCats[F[_]](implicit F: Reactive[F]): CatsRef[F, A] =
new RefLike.CatsRefFromRefLike[F, A](this) {}
}
object RefLike {
private[choam] final def catsRefFromRefLike[F[_] : Reactive, A](ref: RefLike[A]): CatsRef[F, A] =
new CatsRefFromRefLike[F, A](ref) {}
private[refs] abstract class CatsRefFromRefLike[F[_], A](self: RefLike[A])(implicit F: Reactive[F])
extends CatsRef[F, A] {
def get: F[A] =
self.get.run[F]
override def set(a: A): F[Unit] =
self.set[F](a)
override def access: F[(A, A => F[Boolean])] = {
F.monad.map(this.get) { ov =>
val setter = { (nv: A) =>
self.modify { currVal =>
if (equ(currVal, ov)) (nv, true)
else (currVal, false)
}.run[F]
}
(ov, setter)
}
}
override def tryUpdate(f: A => A): F[Boolean] =
self.tryUpdate(f).run[F]
override def tryModify[B](f: A => (A, B)): F[Option[B]] =
self.tryModify(f).run[F]
override def update(f: A => A): F[Unit] =
self.update(f).run[F]
override def modify[B](f: A => (A, B)): F[B] =
self.modify(f).run[F]
override def tryModifyState[B](state: State[A, B]): F[Option[B]] =
self.tryModify(a => state.runF.flatMap(_(a)).value).run[F]
override def modifyState[B](state: State[A,B]): F[B] =
self.modify(a => state.runF.flatMap(_(a)).value).run[F]
}
}