Trait/Object

polynote.kernel.interpreter

State

Related Docs: object State | package interpreter

Permalink

trait State extends AnyRef

A state of cell execution.

Linear Supertypes
AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. State
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def id: CellID

    Permalink

    The cell ID

  2. abstract def prev: State

    Permalink

    The state on which this one depends

  3. abstract def updateValues(fn: (ResultValue) ⇒ ResultValue): State

    Permalink
  4. abstract def updateValuesM[R](fn: (ResultValue) ⇒ RIO[R, ResultValue]): RIO[R, State]

    Permalink
  5. abstract def values: List[ResultValue]

    Permalink

    The values contained by this state (i.e.

    The values contained by this state (i.e. defined by the cell whose execution state this represents)

  6. abstract def withPrev(prev: State): State

    Permalink

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def at(id: CellID): Option[State]

    Permalink
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def collect[A](pf: PartialFunction[State, A]): List[A]

    Permalink

    Evaluate the given partial function in all states where it's defined, travelling in reverse chronological order and collecting results into a List.

  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def foreachPrev(fn: (State) ⇒ Unit): Unit

    Permalink

    Perform the side effect for each state, moving back through states in reverse chronological order

  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. def insert(after: CellID, state: State): State

    Permalink

    Insert the given state after the given state, such that the state with the given ID becomes the given state's predecessor.

    Insert the given state after the given state, such that the state with the given ID becomes the given state's predecessor. If no state exists with the given ID, it will be inserted after Root.

  15. def insertOrReplace(state: State): State

    Permalink

    Replace the state with the same ID as the given state with the given state.

    Replace the state with the same ID as the given state with the given state. If a state with the given state's predecessor is found before a state with the same ID as the given state, the given state will be inserted between the predecessor and its successor.

  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  17. def lastPredef: State

    Permalink
  18. def moveAfter(id: CellID, after: CellID): State

    Permalink

    Move a previous state to be after another given previous state.

    Move a previous state to be after another given previous state. The state with the given id will get after as its parent.

  19. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. def remove(id: CellID): State

    Permalink
  23. def rewindUntil(predicate: (State) ⇒ Boolean): State

    Permalink

    Find the first state in the chain where the predicate holds

  24. def rewindWhile(predicate: (State) ⇒ Boolean): State

    Permalink

    Find the furthest state in the chain where the predicate still holds

  25. def scope: List[ResultValue]

    Permalink
  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  27. def takeUntil(fn: (State) ⇒ Boolean): List[State]

    Permalink

    returns

    a list of states in reverse chronological order, until the predicate is satisfied, *including* the state which satisfied the predicate (if any)

  28. def takeWhile(fn: (State) ⇒ Boolean): List[State]

    Permalink

    returns

    a list of states in reverse chronological order, until (but not including) the predicate fails to hold

  29. def toList: List[State]

    Permalink

    returns

    a list of states in reverse chronological order

  30. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  31. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped