IdMapping (core 1.3.0-alpha01 API)

All Known Subinterfaces:

Graph, NodeMapping

All Known Implementing Classes:

FilterGraph, HugeGraph, IdMap, NodeFilteredGraph, UnionGraph
```
public interface IdMapping
```
Bi-directional mapping between two id spaces.

Field Summary

Fields
Modifier and Type Field Description

static long START_NODE_ID
Defines the lower bound of mapped ids TODO: function?

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`boolean`	`contains(long nodeId)`	Returns true iff the nodeId is mapped, otherwise false.
`long`	`nodeCount()`	Number of mapped nodeIds.
`long`	`toMappedNodeId(long nodeId)`	Map original nodeId to inner nodeId
`long`	`toOriginalNodeId(long nodeId)`	Map inner nodeId back to original nodeId

- Field Detail
  - START_NODE_ID
```
static final long START_NODE_ID
```
    Defines the lower bound of mapped ids TODO: function?
    
    See Also:
    
    Constant Field Values
- Method Detail
  - toMappedNodeId
```
long toMappedNodeId(long nodeId)
```
    Map original nodeId to inner nodeId
  - toOriginalNodeId
```
long toOriginalNodeId(long nodeId)
```
    Map inner nodeId back to original nodeId
  - contains
```
boolean contains(long nodeId)
```
    Returns true iff the nodeId is mapped, otherwise false.
  - nodeCount
```
long nodeCount()
```
    Number of mapped nodeIds.