org.locationtech.geogig.storage.memory.PathToRootWalker.java Source code

Introduction

Here is the source code for org.locationtech.geogig.storage.memory.PathToRootWalker.java

Source

/* Copyright (c) 2014 Boundless and others.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Distribution License v1.0
 * which accompanies this distribution, and is available at
 * https://www.eclipse.org/org/documents/edl-v10.html
 *
 * Contributors:
 * Justin Deoliveira (Boundless) - initial implementation
 */
package org.locationtech.geogig.storage.memory;

import java.util.Iterator;
import java.util.List;
import java.util.Queue;
import java.util.Set;

import com.google.common.collect.Iterables;
import com.google.common.collect.Lists;
import com.google.common.collect.Sets;

/**
 * Walks a path from the specified node to a root, bifurcating along the way in cases where a node
 * has multiple parents. 
 *
 * @author Justin Deoliveira, Boundless
 *
 */
public class PathToRootWalker implements Iterator<List<Node>> {

    /**
     * node queue
     */
    Queue<Node> q;

    /**
     * visited nodes
     */
    Set<Node> seen;

    public PathToRootWalker(Node start) {
        q = Lists.newLinkedList();
        q.add(start);

        seen = Sets.newHashSet();
    }

    @Override
    public boolean hasNext() {
        return !q.isEmpty();
    }

    @Override
    public List<Node> next() {
        List<Node> curr = Lists.newArrayList();
        List<Node> next = Lists.newArrayList();

        while (!q.isEmpty()) {
            Node node = q.poll();
            curr.add(node);

            Iterables.addAll(next, node.to());
        }

        seen.addAll(curr);
        q.addAll(next);
        return curr;
    }

    public boolean seen(Node node) {
        return seen.contains(node);
    }

    @Override
    public void remove() {
        throw new UnsupportedOperationException();
    }
}