com.publictransitanalytics.scoregenerator.output.SectorReachInformation.java Source code

Introduction

Here is the source code for com.publictransitanalytics.scoregenerator.output.SectorReachInformation.java

Source

/*
 * Copyright 2017 Public Transit Analytics.
 *
 * Licensed 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.publictransitanalytics.scoregenerator.output;

import com.google.common.collect.ImmutableMultiset;
import com.google.common.collect.TreeMultimap;
import com.publictransitanalytics.scoregenerator.tracking.MovementPath;
import java.time.LocalDateTime;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.NavigableSet;
import java.util.Set;
import java.util.stream.Collectors;

/**
 * Describes the information pertaining to the rider's arrival at a Sector over
 * a time range.
 *
 * @author Public Transit Analytics
 */
public class SectorReachInformation {

    private final int reachCount;
    private final Map<SimplePath, Integer> pathCounts;
    private final Set<String> reachTimes;

    public SectorReachInformation(final Set<MovementPath> bestPaths, final int count,
            final Set<LocalDateTime> reachTimes) throws InterruptedException {

        reachCount = count;
        this.reachTimes = reachTimes.stream().map(time -> time.toLocalTime().toString())
                .collect(Collectors.toSet());

        final TreeMultimap<Integer, SimplePath> frequencyMap = TreeMultimap.create(Integer::compareTo,
                (p1, p2) -> p1.toString().compareTo(p2.toString()));

        if (bestPaths != null) {
            final ImmutableMultiset.Builder<SimplePath> bestSimplePathsBuilder = ImmutableMultiset.builder();
            for (final MovementPath bestPath : bestPaths) {
                bestSimplePathsBuilder.add(new SimplePath(bestPath));
            }
            final ImmutableMultiset<SimplePath> bestSimplePaths = bestSimplePathsBuilder.build();

            for (final SimplePath path : bestSimplePaths.elementSet()) {
                frequencyMap.put(bestSimplePaths.count(path), path);
            }

            pathCounts = new LinkedHashMap<>();
            for (final Integer frequency : frequencyMap.keySet().descendingSet()) {
                final NavigableSet<SimplePath> pathsForFrequency = frequencyMap.get(frequency);
                for (final SimplePath pathForFrequency : pathsForFrequency) {
                    pathCounts.put(pathForFrequency, frequency);
                }
            }
        } else {
            pathCounts = null;
        }
    }

}