com.tinkerpop.blueprints.impls.tg.TinkerVertex Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of blueprints-core Show documentation
Show all versions of blueprints-core Show documentation
Core interfaces and utilities for Blueprints
The newest version!
package com.tinkerpop.blueprints.impls.tg;
import com.tinkerpop.blueprints.Direction;
import com.tinkerpop.blueprints.Edge;
import com.tinkerpop.blueprints.Vertex;
import com.tinkerpop.blueprints.VertexQuery;
import com.tinkerpop.blueprints.util.DefaultVertexQuery;
import com.tinkerpop.blueprints.util.MultiIterable;
import com.tinkerpop.blueprints.util.StringFactory;
import com.tinkerpop.blueprints.util.VerticesFromEdgesIterable;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
/**
* @author Marko A. Rodriguez (http://markorodriguez.com)
*/
class TinkerVertex extends TinkerElement implements Vertex, Serializable {
protected Map> outEdges = new HashMap>();
protected Map> inEdges = new HashMap>();
protected TinkerVertex(final String id, final TinkerGraph graph) {
super(id, graph);
}
public Iterable getEdges(final Direction direction, final String... labels) {
if (direction.equals(Direction.OUT)) {
return this.getOutEdges(labels);
} else if (direction.equals(Direction.IN))
return this.getInEdges(labels);
else {
return new MultiIterable(Arrays.asList(this.getInEdges(labels), this.getOutEdges(labels)));
}
}
public Iterable getVertices(final Direction direction, final String... labels) {
return new VerticesFromEdgesIterable(this, direction, labels);
}
private Iterable getInEdges(final String... labels) {
if (labels.length == 0) {
final List totalEdges = new ArrayList();
for (final Collection edges : this.inEdges.values()) {
totalEdges.addAll(edges);
}
return totalEdges;
} else if (labels.length == 1) {
final Set edges = this.inEdges.get(labels[0]);
if (null == edges) {
return Collections.emptyList();
} else {
return new ArrayList(edges);
}
} else {
final List totalEdges = new ArrayList();
for (final String label : labels) {
final Set edges = this.inEdges.get(label);
if (null != edges) {
totalEdges.addAll(edges);
}
}
return totalEdges;
}
}
private Iterable getOutEdges(final String... labels) {
if (labels.length == 0) {
final List totalEdges = new ArrayList();
for (final Collection edges : this.outEdges.values()) {
totalEdges.addAll(edges);
}
return totalEdges;
} else if (labels.length == 1) {
final Set edges = this.outEdges.get(labels[0]);
if (null == edges) {
return Collections.emptyList();
} else {
return new ArrayList(edges);
}
} else {
final List totalEdges = new ArrayList();
for (final String label : labels) {
final Set edges = this.outEdges.get(label);
if (null != edges) {
totalEdges.addAll(edges);
}
}
return totalEdges;
}
}
public VertexQuery query() {
return new DefaultVertexQuery(this);
}
public String toString() {
return StringFactory.vertexString(this);
}
public Edge addEdge(final String label, final Vertex vertex) {
return this.graph.addEdge(null, this, vertex, label);
}
protected void addOutEdge(final String label, final Edge edge) {
Set edges = this.outEdges.get(label);
if (null == edges) {
edges = new HashSet();
this.outEdges.put(label, edges);
}
edges.add(edge);
}
protected void addInEdge(final String label, final Edge edge) {
Set edges = this.inEdges.get(label);
if (null == edges) {
edges = new HashSet();
this.inEdges.put(label, edges);
}
edges.add(edge);
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy