eu.interedition.collatex.neo4j.Neo4jVariantGraphVertex.java Source code

Introduction

Here is the source code for eu.interedition.collatex.neo4j.Neo4jVariantGraphVertex.java

Source

/*
 * Copyright (c) 2013 The Interedition Development Group.
 *
 * This file is part of CollateX.
 *
 * CollateX is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * CollateX is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with CollateX.  If not, see <http://www.gnu.org/licenses/>.
 */

package eu.interedition.collatex.neo4j;

import static com.google.common.collect.Iterables.*;
import static org.neo4j.graphdb.Direction.*;

import java.util.Set;

import javax.annotation.Nullable;

import eu.interedition.collatex.VariantGraph;
import org.neo4j.graphdb.Node;
import org.neo4j.graphdb.Relationship;

import com.google.common.base.Function;
import com.google.common.collect.Iterables;
import com.google.common.collect.Sets;

import eu.interedition.collatex.Token;
import eu.interedition.collatex.Witness;

/**
 * @author <a href="http://gregor.middell.net/" title="Homepage">Gregor Middell</a>
 */
public class Neo4jVariantGraphVertex implements VariantGraph.Vertex {
    protected final Neo4jVariantGraph graph;
    protected final Node node;

    public Neo4jVariantGraphVertex(Neo4jVariantGraph graph, Node node) {
        this.graph = graph;
        this.node = node;
    }

    public Neo4jVariantGraphVertex(Neo4jVariantGraph graph, Set<Token> tokens) {
        this(graph, graph.database.createNode());
        setTokens(tokens);
    }

    @Override
    public Iterable<? extends VariantGraph.Edge> incoming() {
        return incoming(null);
    }

    @Override
    public Iterable<? extends VariantGraph.Edge> incoming(Set<Witness> witnesses) {
        return Iterables.filter(
                transform(node.getRelationships(Neo4jGraphRelationships.PATH, INCOMING), graph.edgeWrapper),
                Neo4jVariantGraphEdge.createTraversableFilter(witnesses));
    }

    @Override
    public Iterable<? extends VariantGraph.Edge> outgoing() {
        return outgoing(null);
    }

    @Override
    public Iterable<? extends VariantGraph.Edge> outgoing(Set<Witness> witnesses) {
        return Iterables.filter(
                transform(node.getRelationships(Neo4jGraphRelationships.PATH, OUTGOING), graph.edgeWrapper),
                Neo4jVariantGraphEdge.createTraversableFilter(witnesses));
    }

    @Override
    public Iterable<? extends VariantGraph.Transposition> transpositions() {
        return transform(node.getRelationships(Neo4jGraphRelationships.TRANSPOSITION),
                new Function<Relationship, VariantGraph.Transposition>() {
                    @Override
                    public VariantGraph.Transposition apply(@Nullable Relationship relationship) {
                        return graph.transpositionWrapper.apply(relationship.getStartNode());
                    }
                });
    }

    @Override
    public Set<Token> tokens() {
        return tokens(null);
    }

    @Override
    public Set<Token> tokens(Set<Witness> witnesses) {
        return graph.adapter.getTokens(this, witnesses);
    }

    @Override
    public Set<Witness> witnesses() {
        final Set<Witness> witnesses = Sets.newHashSet();
        for (Token token : tokens()) {
            witnesses.add(token.getWitness());
        }
        return witnesses;
    }

    @Override
    public void add(Iterable<Token> tokens) {
        final Set<Token> tokenSet = Sets.newHashSet(tokens());
        Iterables.addAll(tokenSet, tokens);
        setTokens(tokenSet);
    }

    public void setTokens(Set<Token> tokens) {
        graph.adapter.setTokens(this, tokens);
    }

    @Override
    public String toString() {
        return Iterables.toString(tokens());
    }

    @Override
    public VariantGraph graph() {
        return graph;
    }

    public Node getNode() {
        return node;
    }

    @Override
    public void delete() {
        node.delete();
    }

    @Override
    public int hashCode() {
        return node.hashCode();
    }

    @Override
    public boolean equals(Object obj) {
        if (obj != null && obj instanceof Neo4jVariantGraphVertex) {
            return node.equals(((Neo4jVariantGraphVertex) obj).node);
        }
        return super.equals(obj);
    }
}