com.graphhopper.util.details.IntersectionValues Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of graphhopper-core Show documentation

GraphHopper is a fast and memory efficient Java road routing engine working seamlessly with OpenStreetMap data.

There is a newer version: 10.0

/*
 *  Licensed to GraphHopper GmbH under one or more contributor
 *  license agreements. See the NOTICE file distributed with this work for
 *  additional information regarding copyright ownership.
 *
 *  GraphHopper GmbH licenses this file to you under the Apache License,
 *  Version 2.0 (the "License"); you may not use this file except in
 *  compliance with the License. You may obtain a copy of the License at
 *
 *       http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */
package com.graphhopper.util.details;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.stream.Collectors;

public class IntersectionValues {
    public int bearing;
    public boolean entry;
    public boolean in;
    public boolean out;

    /**
     *  create a List of IntersectionValues from a PathDetail
     */
    public static List createList(Map intersectionMap) {
        List list = new ArrayList<>();

        List bearings = (List) intersectionMap.get("bearings");
        Integer in = (Integer) intersectionMap.get("in");
        Integer out = (Integer) intersectionMap.get("out");
        List entry = (List) intersectionMap.get("entries");

        if (bearings.size() != entry.size()) {
            throw new IllegalStateException("Bearings and entry array sizes different");
        }
        int numEntries = bearings.size();

        for (int i = 0; i < numEntries; i++) {
            IntersectionValues iv = new IntersectionValues();
            iv.bearing = bearings.get(i);
            iv.entry = entry.get(i);
            iv.in = (in == i);
            iv.out = (out == i);

            list.add(iv);
        }
        return list;
    }

    /**
     * create a PathDetail from a List of IntersectionValues
     */
    public static Map createIntersection(List list) {
        Map intersection = new HashMap<>();

        intersection.put("bearings",
                list.stream().map(x -> x.bearing).collect(Collectors.toList()));
        intersection.put("entries",
                list.stream().map(x -> x.entry).collect(Collectors.toList()));

        for (int m = 0; m < list.size(); m++) {
            IntersectionValues intersectionValues = list.get(m);
            if (intersectionValues.in) {
                intersection.put("in", m);
            }
            if (intersectionValues.out) {
                intersection.put("out", m);
            }
        }
        return intersection;
    }
}