class ReverseGraphTile extends AnyRef
Contains the routing graph data for a single tile, needed to perform an efficient reverse expansion of a graph.
- Alphabetic
- By Inheritance
- ReverseGraphTile
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
ReverseGraphTile(tileId: TileId, firstIncomingEdgeIndexIndices: Array[Int], incomingEdgeIndices: Array[Int], incomingEdgeSources: Array[Int], externalEdgeTileIds: Array[Long], externalEdgeIndices: Array[Int])
- firstIncomingEdgeIndexIndices
For every vertex, the index of its first incoming edge.
- incomingEdgeIndices
For every incoming edge, its index in GraphTile
edges
- incomingEdgeSources
For every edge, sorted the same as in GraphTile
edges
, the index of its source vertex- externalEdgeTileIds
For every external edge, its TileId
- externalEdgeIndices
For every external edge, its index in the GraphTile
edges
array in the origin tile.
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
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
edgeCount: Int
The total number of internal and external edges in this GraphTile.
The total number of internal and external edges in this GraphTile.
- Annotations
- @inline()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
externalEdgeCount: Int
The number of edges whose source vertex belong to another tile.
The number of edges whose source vertex belong to another tile.
- Annotations
- @inline()
- val externalEdgeIndices: Array[Int]
- val externalEdgeTileIds: Array[Long]
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- val firstIncomingEdgeIndexIndices: Array[Int]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- val incomingEdgeIndices: Array[Int]
- val incomingEdgeSources: Array[Int]
-
def
internalVertexCount: Int
The number of vertices that belong to this ReverseGraphTile.
The number of vertices that belong to this ReverseGraphTile.
- Annotations
- @inline()
-
def
isEdgeInternal(edgeIndex: Int): Boolean
Predicate indicating if an edge index refers to an internal edge.
Predicate indicating if an edge index refers to an internal edge.
- Annotations
- @inline()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- val tileId: TileId
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
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( ... ) @native()