QSUGraph

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. object Extractors

   

   This object contains extraction helpers in terms of QSU nodes.

5. def NameState[T[_[_]], F[_]](implicit arg0: MonadState_[F, (scala.collection.immutable.Map[QScriptUniform[T, Symbol], Symbol], scala.collection.immutable.Map[Symbol, Symbol])]): MonadState_[F, (NodeNames[T], Renames)]

   

6. object QSUPattern

   

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. implicit def birecursive[T[_[_]]]: Aux[QSUGraph[T], [β$24$]EnvT[Symbol, [β$1$]QScriptUniform[T, β$1$], β$24$]]

   

   Definition Classes

   QSUGraphInstances0

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. implicit def corecursive[T[_[_]]]: Aux[QSUGraph[T], [β$22$]EnvT[Symbol, [β$1$]QScriptUniform[T, β$1$], β$22$]]

    

    Definition Classes

    QSUGraphInstances

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

    

    Definition Classes

    AnyRef

12. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

13. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

14. def fromAnnotatedTree[T[_[_]]](qsu: Cofree[[β$3$]QScriptUniform[T, β$3$], slamdata.Predef.Option[slamdata.Predef.Symbol]])(implicit arg0: RecursiveT[T]): (Renames, QSUGraph[T])

    

    Construct a QSUGraph from a tree of QScriptUniform by compacting common subtrees, providing a mapping from the provided attribute to the final graph vertex names.

15. def fromTree[T[_[_]]](qsu: T[[β$5$]QScriptUniform[T, β$5$]])(implicit arg0: RecursiveT[T]): QSUGraph[T]

    

    Construct a QSUGraph from a tree of QScriptUniform by compacting common subtrees.

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

    

    Definition Classes

    AnyRef → Any

17. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

20. final def notify(): Unit

    

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

22. implicit def recursive[T[_[_]]]: Aux[QSUGraph[T], [β$23$]EnvT[Symbol, [β$1$]QScriptUniform[T, β$1$], β$23$]]

    

    Definition Classes

    QSUGraphInstances

23. def refold[T[_[_]]](sym: slamdata.Predef.Symbol, qsu: QScriptUniform[T, QSUGraph[T]]): QSUGraph[T]

    

24. def root[T[_[_]]]: PLens[QSUGraph[T], QSUGraph[T], slamdata.Predef.Symbol, slamdata.Predef.Symbol]

    

25. implicit def show[T[_[_]]](implicit arg0: ShowT[T]): Show[QSUGraph[T]]

    

    Definition Classes

    QSUGraphInstances

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

    

    Definition Classes

    AnyRef

27. def toString(): String

    

    Definition Classes

    AnyRef → Any

28. def vertices[T[_[_]]]: PLens[QSUGraph[T], QSUGraph[T], QSUVerts[T], QSUVerts[T]]

    

29. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

32. def withName[T[_[_]], F[_]](node: QScriptUniform[T, slamdata.Predef.Symbol])(implicit arg0: Monad[F], arg1: NameGenerator[F], MS: MonadState_[F, RevIdx[T]]): F[QSUGraph[T]]