Lifecycle

abstract def start(a: A): Unit

To the graph at uri, appends the content of graph.

abstract def stop(a: A): Unit

To the graph at uri, removes the matching triples from delete, then adds the ones in insert.

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (Lifecycle[Rdf, A], B)

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def ensuring(cond: (Lifecycle[Rdf, A]) ⇒ Boolean, msg: ⇒ Any): Lifecycle[Rdf, A]

def ensuring(cond: (Lifecycle[Rdf, A]) ⇒ Boolean): Lifecycle[Rdf, A]

def ensuring(cond: Boolean, msg: ⇒ Any): Lifecycle[Rdf, A]

def ensuring(cond: Boolean): Lifecycle[Rdf, A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val lifecycleSyntax: LifecycleSyntax[Rdf, A]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def →[B](y: B): (Lifecycle[Rdf, A], B)