nutcracker/nutcracker.data/CellSet

CellSet

object CellSet
Companion:
class
class Object
trait Matchable
class Any
CellSet.type

Type members

Classlikes

final case class Added[Ref[_], A](value: Set[Ref[A]]) extends AnyVal
final class InitSyntaxHelper[A]
sealed trait Update[Ref[_], A]

Types

type Delta[Ref[_], A] = Added[Ref, A]
type IncRefSetDom[Ref[_], A] = Aux[CellSet[Ref, A], Update[Ref, A], Added[Ref, A]]

Value members

Concrete methods

def apply[Ref[_], A](refs: Ref[A]*): CellSet[Ref, A]
def collect[F[_], Var[_], A](cps: ContU[F, Var[A]])(implicit P: Aux0[F, Var], dom: Dom[A], F: Bind[F]): F[Var[CellSet[Var, A]]]
def collectAll[F[_], Var[_], A](cps: ContU[F, Var[A]]*)(implicit P: Aux0[F, Var], dom: Dom[A], F: Monad[F]): F[Var[CellSet[Var, A]]]
def collectAll[F[_], Var[_], A](cps: Iterable[ContU[F, Var[A]]])(implicit P: Aux0[F, Var], dom: Dom[A], F: Monad[F]): F[Var[CellSet[Var, A]]]
def empty[Ref[_], A]: CellSet[Ref, A]
def forEach[F[_], Var[_], A](set: Var[CellSet[Var, A]])(implicit P: Aux0[F, Var], F: Applicative[F]): IndexedContT[Subscription[F], Unit, F, Var[A]]

Returns the given set in a CPS style, executing any subsequently given callback for every current and future element of that set.

Returns the given set in a CPS style, executing any subsequently given callback for every current and future element of that set.

def forEach_[F[_], Var[_], A](set: Var[CellSet[Var, A]])(implicit P: Aux0[F, Var], F: Applicative[F]): ContU[F, Var[A]]
def include[F[_], Var[_], A](sub: Var[CellSet[Var, A]], sup: Var[CellSet[Var, A]])(implicit P: Aux0[F, Var], dom: Dom[A], F: Applicative[F]): F[Unit]
def includeC[F[_], Var[_], A](cps: ContU[F, Var[A]], ref: Var[CellSet[Var, A]])(implicit P: Aux0[F, Var], dom: Dom[A], F: Functor[F]): F[Unit]
def insert[F[_], Var[_], A](ref: Var[A], into: Var[CellSet[Var, A]])(implicit P: Aux0[F, Var], dom: Dom[A], F: Functor[F]): F[Unit]
def insertAll[F[_], Var[_], A](add: Set[Var[A]], into: Var[CellSet[Var, A]])(implicit P: Aux0[F, Var], dom: Dom[A], F: Applicative[F]): F[Unit]
def relBind[F[_], Var[_], Val[_], A, B](sref: Val[CellSet[Var, A]])(f: Var[A] => F[Var[CellSet[Var, B]]])(implicit P: Aux1[F, Var, Val], domB: Dom[B], M: Monad[F]): F[Var[CellSet[Var, B]]]
def singleton[Ref[_], A](ref: Ref[A]): CellSet[Ref, A]
def wrap[Ref[_], A](refs: Set[Ref[A]]): CellSet[Ref, A]

Implicits

Implicits

implicit def deepEqual[Ptr1[_], Ptr2[_], A1, A2](implicit ev: DeepEqual[A1, A2, Ptr1, Ptr2]): DeepEqual[CellSet[Ptr1, A1], CellSet[Ptr2, A2], Ptr1, Ptr2]
implicit def deepShow[Ptr[_], A](implicit ev: DeepShow[A, Ptr]): DeepShow[CellSet[Ptr, A], Ptr]
implicit def domInstance[Ref[_], A]: IncRefSetDom[Ref, A]