Packages

final case class GraphRepresentation(_id: String, _rev: String, name: String, edgeDefinitions: List[GraphEdgeDefinition] = List.empty, minReplicationFactor: Option[Int] = None, numberOfShards: Option[Int] = None, orphanCollections: List[String] = List.empty, replicationFactor: Option[Int] = None, isSmart: Boolean = false, smartGraphAttribute: Option[String] = None) extends Product with Serializable

The information about a graph

_id

The internal id value of this graph.

_rev

The revision of this graph. Can be used to make sure to not override concurrent modifications to this graph.

name

The name of the graph.

edgeDefinitions

An array of definitions for the relations of the graph. Each has the following type:

minReplicationFactor

The minimal replication factor used for every new collection in the graph. If one shard has less than minReplicationFactor copies, we cannot write to this shard, but to all others.

numberOfShards

Number of shards created for every new collection in the graph.

orphanCollections

An array of additional vertex collections. Documents within these collections do not have edges within this graph.

replicationFactor

The replication factor used for every new collection in the graph.

isSmart

Flag if the graph is a SmartGraph (Enterprise Edition only) or not.

smartGraphAttribute

The name of the sharding attribute in smart graph case (Enterprise Edition only)

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphRepresentation
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GraphRepresentation(_id: String, _rev: String, name: String, edgeDefinitions: List[GraphEdgeDefinition] = List.empty, minReplicationFactor: Option[Int] = None, numberOfShards: Option[Int] = None, orphanCollections: List[String] = List.empty, replicationFactor: Option[Int] = None, isSmart: Boolean = false, smartGraphAttribute: Option[String] = None)

    _id

    The internal id value of this graph.

    _rev

    The revision of this graph. Can be used to make sure to not override concurrent modifications to this graph.

    name

    The name of the graph.

    edgeDefinitions

    An array of definitions for the relations of the graph. Each has the following type:

    minReplicationFactor

    The minimal replication factor used for every new collection in the graph. If one shard has less than minReplicationFactor copies, we cannot write to this shard, but to all others.

    numberOfShards

    Number of shards created for every new collection in the graph.

    orphanCollections

    An array of additional vertex collections. Documents within these collections do not have edges within this graph.

    replicationFactor

    The replication factor used for every new collection in the graph.

    isSmart

    Flag if the graph is a SmartGraph (Enterprise Edition only) or not.

    smartGraphAttribute

    The name of the sharding attribute in smart graph case (Enterprise Edition only)

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. val _id: String
  5. val _rev: String
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  8. val edgeDefinitions: List[GraphEdgeDefinition]
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  13. val isSmart: Boolean
  14. val minReplicationFactor: Option[Int]
  15. val name: String
  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. val numberOfShards: Option[Int]
  20. val orphanCollections: List[String]
  21. val replicationFactor: Option[Int]
  22. val smartGraphAttribute: Option[String]
  23. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  24. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped