Class BaseGraph

core/src/main/java/com/graphhopper/storage/BaseGraph.java:49–1093

The base graph handles nodes and edges file format. It can be used with different Directory implementations like RAMDirectory for fast access or via MMapDirectory for virtual-memory and not thread safe usage. Note: A RAM DataAccess Object is thread-safe in itself but if used in this Graph implem

 * loadExisting, (4) usage, (5) flush, (6) close
 */
public class BaseGraph implements Graph, Closeable {
    final static long MAX_UNSIGNED_INT = 0xFFFF_FFFFL;
    final BaseGraphNodesAndEdges store;
    final NodeAccess nodeAccess;
    final KVStorage edgeKVStorage;
    // can be null if turn costs are not supported
    final TurnCostStorage turnCostStorage;
    final BitUtil bitUtil;
    // length | nodeA | nextNode | ... | nodeB
    private final DataAccess wayGeometry;
    private final Directory dir;
    private final int segmentSize;
    private boolean initialized = false;
    private long minGeoRef;
    private long maxGeoRef;
    private final int eleBytesPerCoord;

    public BaseGraph(Directory dir, boolean withElevation, boolean withTurnCosts, int segmentSize, int bytesForFlags) {
        this.dir = dir;
        this.bitUtil = BitUtil.LITTLE;
        this.wayGeometry = dir.create("geometry", segmentSize);
        this.edgeKVStorage = new KVStorage(dir, true);
        this.store = new BaseGraphNodesAndEdges(dir, withElevation, withTurnCosts, segmentSize, bytesForFlags);
        this.nodeAccess = new GHNodeAccess(store);
        this.segmentSize = segmentSize;
        this.turnCostStorage = withTurnCosts ? new TurnCostStorage(this, dir.create("turn_costs", dir.getDefaultType("turn_costs", true), segmentSize)) : null;
        this.eleBytesPerCoord = (nodeAccess.getDimension() == 3 ? 3 : 0);
    }

    BaseGraphNodesAndEdges getStore() {
        return store;
    }

    private int getOtherNode(int nodeThis, long edgePointer) {
        int nodeA = store.getNodeA(edgePointer);
        return nodeThis == nodeA ? store.getNodeB(edgePointer) : nodeA;
    }

    private boolean isAdjacentToNode(int node, long edgePointer) {
        return store.getNodeA(edgePointer) == node || store.getNodeB(edgePointer) == node;
    }

    private static boolean isTestingEnabled() {
        boolean enableIfAssert = false;
        assert (enableIfAssert = true) : true;
        return enableIfAssert;
    }

    public void debugPrint() {
        store.debugPrint();
    }

    @Override
    public BaseGraph getBaseGraph() {
        return this;
    }

    public boolean isInitialized() {