ScalaCellState

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def at(id: CellID): Option[State]

   

   Definition Classes

   State

6. val cellCode: CellCode

   

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. def collect[A](pf: PartialFunction[State, A]): List[A]

   

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

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

   Definition Classes

   State

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

   

   Definition Classes

   AnyRef

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11. def foreachPrev(fn: (State) ⇒ Unit): Unit

    

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

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

    Definition Classes

    State

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

    

    Definition Classes

    AnyRef → Any

13. val id: CellID

    

    The cell ID

    The cell ID

    Definition Classes

    ScalaCellState → State

14. def insert(after: CellID, state: State): State

    

    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.

    Definition Classes

    State

15. def insertOrReplace(state: State): State

    

    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.

    Definition Classes

    State

16. val instance: Option[AnyRef]

    

17. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

18. def lastPredef: State

    

    Definition Classes

    State

19. def moveAfter(id: CellID, after: CellID): State

    

    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.

    Definition Classes

    State

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

    

    Definition Classes

    AnyRef

21. final def notify(): Unit

    

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

23. val prev: State

    

    The state on which this one depends

    The state on which this one depends

    Definition Classes

    ScalaCellState → State

24. def remove(id: CellID): State

    

    Definition Classes

    State

25. def rewindUntil(predicate: (State) ⇒ Boolean): State

    

    Find the first state in the chain where the predicate holds

    Find the first state in the chain where the predicate holds

    Definition Classes

    State

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

    

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

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

    Definition Classes

    State

27. def scope: List[ResultValue]

    

    Definition Classes

    State

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

    

    Definition Classes

    AnyRef

29. def takeUntil(fn: (State) ⇒ Boolean): List[State]

    
    returns

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

    Definition Classes

    State

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

    
    returns

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

    Definition Classes

    State

31. def toList: List[State]

    
    returns

    a list of states in reverse chronological order

    Definition Classes

    State

32. def updateValues(fn: (ResultValue) ⇒ ResultValue): State

    

    Definition Classes

    ScalaCellState → State

33. def updateValuesM[R](fn: (ResultValue) ⇒ RIO[R, ResultValue]): RIO[R, State]

    

    Definition Classes

    ScalaCellState → State

34. val values: List[ResultValue]

    

    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)

    Definition Classes

    ScalaCellState → State

35. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

36. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

37. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38. def withPrev(prev: State): ScalaCellState

    

    Definition Classes

    ScalaCellState → State