abstract
class
SyncGuide extends LocalGuide[Stream]
Instance Constructors
-
new
SyncGuide()
Type Members
-
type
K[_] = Coeval[_]
Abstract Value Members
-
abstract
def
assistent: Assistent
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
branchStep(step: BranchStep, steps: List[Step])(implicit graph: Lspace): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
def
buildNextStep(steps: List[Step])(implicit graph: structure.Graph): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
-
def
clipStep[T](step: ClipStep)(implicit graph: Lspace): (Stream[Librarian[T]]) ⇒ Stream[Librarian[T]]
-
def
clone(): AnyRef
-
def
collectingBarrierStep(step: GroupingBarrierStep, steps: List[Step], isRootGroup: Boolean = false)(implicit graph: Lspace): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
def
countStep(step: Count, steps: List[Step])(implicit graph: structure.Graph): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
def
createF[T](t: T): Stream[T]
-
def
createLibrarian[T](get: T, path: TraversalPath = TraversalPath(), loops: Int = 0, mit: Option[Instant] = None, permissions: List[String] = List()): Librarian[T]
-
def
emptyF[T]: Stream[T]
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
-
def
filterStep(step: FilterStep, steps: List[Step])(implicit graph: Lspace): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
head(f: Stream[Librarian[Any]]): Coeval[Librarian[Any]]
-
def
headOption(f: Stream[Librarian[Any]]): Coeval[Librarian[Any]]
-
def
headOptionOption(f: Stream[Librarian[Any]]): Coeval[Librarian[Any]]
-
final
def
isInstanceOf[T0]: Boolean
-
def
moveStep(step: MoveStep, steps: List[Step])(implicit graph: Lspace): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
projectStep[Traversals <: HList](step: Project[Traversals], steps: List[Step])(implicit graph: Lspace): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
-
def
raiseError[T](ex: Exception): Stream[T]
-
def
rearrangeBarrierStep(step: RearrangeBarrierStep, steps: List[Step])(implicit graph: Lspace): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
def
reducingBarrierStep(step: ReducingBarrierStep, steps: List[Step])(implicit graph: Lspace): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
def
reducingStep[T](step: ReducingStep)(implicit graph: Lspace): (Stream[Librarian[T]]) ⇒ Stream[Librarian[T]]
-
def
resourceStep(step: ResourceStep, steps: List[Step])(implicit graph: Lspace): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
def
select(step: Select[_], traversers: Stream[Librarian[Any]])(implicit graph: structure.Graph): Stream[Librarian[Any]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
takeByTimeSpan(f: Stream[Librarian[Any]], timespan: FiniteDuration): Stream[Librarian[Any]]
-
def
toList(f: Stream[Librarian[Any]]): Coeval[Librarian[Any]]
-
def
toMap(f: Stream[Librarian[(Any, Any)]]): Coeval[Librarian[Any]]
-
def
toSet(f: Stream[Librarian[Any]]): Coeval[Librarian[Any]]
-
def
toString(): String
-
def
toValue(v: Any): Any
-
-
-
def
traverseStep(step: TraverseStep, steps: List[Step])(implicit graph: Lspace): (Stream[Librarian[Any]]) ⇒ Stream[Librarian[Any]]
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from Guide[Stream]
Inherited from AnyRef
Inherited from Any
