RefLike#upd now doesn't have a default impl (we almost always overrid…

…e it)

With this, we essentially went back to how things were in v0.4.5,
since that seems to be the most performant.

core/shared/src/main/scala/dev/tauri/choam/refs/RefLike.scala

@@ -29,10 +29,12 @@ trait RefLike[A] {
 
   def updWith[B, C](f: (A, B) => Axn[(A, C)]): Rxn[B, C]
 
-  // derived (but overridden for performance):
+  // derivable (but primitive for performance):
 
-  def upd[B, C](f: (A, B) => (A, C)): Rxn[B, C] =
-    updWith[B, C] { (a, b) => Axn.pure(f(a, b)) }
+  def upd[B, C](f: (A, B) => (A, C)): Rxn[B, C]
+  // Note: in theory this could be implemented as
+  // `updWith[B, C] { (a, b) => Axn.pure(f(a, b)) }`,
+  // but we rather have it as a primitive.
 
   // derived:
 

data/jvm/src/main/scala/dev/tauri/choam/data/Ttrie.scala

@@ -274,7 +274,8 @@ private final class Ttrie[K, V] private (
     final def get: Axn[V] =
       self.get.provide(key).map(_.getOrElse(default))
 
-    // TODO: maybe override `upd` and/or `getAndSet` if we can make it faster than the default impl.
+    final def upd[B, C](f: (V, B) => (V, C)): B =#> C =
+      updWith[B, C] { (v, b) => Axn.pure(f(v, b)) }
 
     final def updWith[B, C](f: (V, B) => Axn[(V, C)]): B =#> C = {
       getRefWithKey(key).flatMap { ref =>

data/shared/src/main/scala/dev/tauri/choam/data/SimpleMap.scala

@@ -103,7 +103,7 @@ private final class SimpleMap[K, V] private (
     final def get: Axn[V] =
       self.get.provide(key).map(_.getOrElse(default))
 
-    final override def upd[B, C](f: (V, B) => (V, C)): B =#> C = {
+    final def upd[B, C](f: (V, B) => (V, C)): B =#> C = {
       Rxn.computed[B, C] { (b: B) =>
         repr.modify { hm =>
           val currVal = hm.getOrElse(key, default)

data/shared/src/main/scala/dev/tauri/choam/data/SimpleOrderedMap.scala

@@ -105,7 +105,7 @@ private final class SimpleOrderedMap[K, V] private (
     final def get: Axn[V] =
       self.get.provide(key).map(_.getOrElse(default))
 
-    final override def upd[B, C](f: (V, B) => (V, C)): B =#> C = {
+    final def upd[B, C](f: (V, B) => (V, C)): B =#> C = {
       Rxn.computed[B, C] { (b: B) =>
         repr.modify { am =>
           val currVal = am.get(key).getOrElse(default)