Graph

Instance Constructors

new Graph(name: String, db: String = Arango.defaultDatabase, url: URL = Arango.defaultURL, credentials: Option[Credentials] = Arango.defaultCredentials, timeout: FiniteDuration = 15.seconds)

Value Members

final def !=(arg0: Any): Boolean

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

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

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

Definition Classes
Any
def call[T](query: Query)(implicit decoder: Decoder[T]): Future[T]
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collections: List[AbstractCollection[_]]
def cursor: ArangoCursor
def delete(dropCollections: Boolean = true): Future[Boolean]

Deletes the graph.
Deletes the graph.
dropCollections
true if the collections should also be dropped. Defaults to true.
returns
true if the operation completed successfully
macro def edge[T <: Edge with DocumentOption](name: String, links: (String, String)*): EdgeCollection[T]
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def execute(query: Query): Future[Boolean]
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def first[T](query: Query)(implicit decoder: Decoder[T]): Future[Option[T]]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def init(createGraph: Boolean = true, createCollections: Boolean = true): Future[Boolean]

Initializes this graph instance, database, and session creating the graph and collections if it doesn't already exist (if createGraph and createCollections is true).
Initializes this graph instance, database, and session creating the graph and collections if it doesn't already exist (if createGraph and createCollections is true). This can be invoked multiple times without risk of duplicate functionality.
createGraph
automatically creates the graph if it doesn't already exist if set to true. Defaults to true.
createCollections
automatically creates the collections if they don't already exist if set to true. Defaults to true.
returns
true if the operation completed without error
val initialized: Channel[Boolean]
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def polymorphic[T <: PolymorphicDocumentOption](name: String, types: PolymorphicType[T]*): PolymorphicVertexCollection[T]
macro def polymorphic2[T <: PolymorphicDocumentOption, P1 <: T, P2 <: T](name: String): PolymorphicVertexCollection[T]
macro def polymorphic3[T <: PolymorphicDocumentOption, P1 <: T, P2 <: T, P3 <: T](name: String): PolymorphicVertexCollection[T]
macro def polymorphic4[T <: PolymorphicDocumentOption, P1 <: T, P2 <: T, P3 <: T, P4 <: T](name: String): PolymorphicVertexCollection[T]
macro def polymorphicType[T <: PolymorphicDocumentOption, P <: T](value: String): PolymorphicType[T]
lazy val realTime: RealTime
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def synchronous[T](future: Future[T], timeout: FiniteDuration = 10.seconds): T
def toString(): String

Definition Classes
AnyRef → Any
macro def vertex[T <: DocumentOption](name: String): VertexCollection[T]
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package managed

class Graph extends AnyRef

Instance Constructors

new Graph(name: String, db: String = Arango.defaultDatabase, url: URL = Arango.defaultURL, credentials: Option[Credentials] = Arango.defaultCredentials, timeout: FiniteDuration = 15.seconds)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def call[T](query: Query)(implicit decoder: Decoder[T]): Future[T]

def clone(): AnyRef

def collections: List[AbstractCollection[_]]

def cursor: ArangoCursor

def delete(dropCollections: Boolean = true): Future[Boolean]

macro def edge[T <: Edge with DocumentOption](name: String, links: (String, String)*): EdgeCollection[T]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def execute(query: Query): Future[Boolean]

def finalize(): Unit

def first[T](query: Query)(implicit decoder: Decoder[T]): Future[Option[T]]

final def getClass(): Class[_]

def hashCode(): Int

def init(createGraph: Boolean = true, createCollections: Boolean = true): Future[Boolean]

val initialized: Channel[Boolean]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def polymorphic[T <: PolymorphicDocumentOption](name: String, types: PolymorphicType[T]*): PolymorphicVertexCollection[T]

macro def polymorphic2[T <: PolymorphicDocumentOption, P1 <: T, P2 <: T](name: String): PolymorphicVertexCollection[T]

macro def polymorphic3[T <: PolymorphicDocumentOption, P1 <: T, P2 <: T, P3 <: T](name: String): PolymorphicVertexCollection[T]

macro def polymorphic4[T <: PolymorphicDocumentOption, P1 <: T, P2 <: T, P3 <: T, P4 <: T](name: String): PolymorphicVertexCollection[T]

macro def polymorphicType[T <: PolymorphicDocumentOption, P <: T](value: String): PolymorphicType[T]

lazy val realTime: RealTime

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

def synchronous[T](future: Future[T], timeout: FiniteDuration = 10.seconds): T

def toString(): String

macro def vertex[T <: DocumentOption](name: String): VertexCollection[T]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped