org.apache.tinkerpop.gremlin.tinkergraph.structure.TinkerEdge Maven / Gradle / Ivy
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF 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 org.apache.tinkerpop.gremlin.tinkergraph.structure;
import org.apache.tinkerpop.gremlin.structure.T;
import org.apache.tinkerpop.gremlin.structure.Direction;
import org.apache.tinkerpop.gremlin.structure.Edge;
import org.apache.tinkerpop.gremlin.structure.Graph;
import org.apache.tinkerpop.gremlin.structure.Property;
import org.apache.tinkerpop.gremlin.structure.Vertex;
import org.apache.tinkerpop.gremlin.structure.util.ElementHelper;
import org.apache.tinkerpop.gremlin.structure.util.StringFactory;
import org.apache.tinkerpop.gremlin.util.iterator.IteratorUtils;
import java.util.Collections;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.stream.Collectors;
/**
* @author Marko A. Rodriguez (http://markorodriguez.com)
*/
public final class TinkerEdge extends TinkerElement implements Edge {
protected Map properties;
protected final Vertex inVertex;
protected final Vertex outVertex;
private final boolean allowNullPropertyValues;
protected TinkerEdge(final Object id, final Vertex outVertex, final String label, final Vertex inVertex) {
super(id, label);
this.outVertex = outVertex;
this.inVertex = inVertex;
this.allowNullPropertyValues = outVertex.graph().features().edge().supportsNullPropertyValues();
TinkerHelper.autoUpdateIndex(this, T.label.getAccessor(), this.label, null);
}
@Override
public Property property(final String key, final V value) {
if (this.removed) throw elementAlreadyRemoved(Edge.class, id);
ElementHelper.validateProperty(key, value);
if (!allowNullPropertyValues && null == value) {
properties(key).forEachRemaining(Property::remove);
return Property.empty();
}
final Property oldProperty = super.property(key);
final Property newProperty = new TinkerProperty<>(this, key, value);
if (null == this.properties) this.properties = new HashMap<>();
this.properties.put(key, newProperty);
TinkerHelper.autoUpdateIndex(this, key, value, oldProperty.isPresent() ? oldProperty.value() : null);
return newProperty;
}
@Override
public Property property(final String key) {
return null == this.properties ? Property.empty() : this.properties.getOrDefault(key, Property.empty());
}
@Override
public Set keys() {
return null == this.properties ? Collections.emptySet() : this.properties.keySet();
}
@Override
public void remove() {
final TinkerVertex outVertex = (TinkerVertex) this.outVertex;
final TinkerVertex inVertex = (TinkerVertex) this.inVertex;
if (null != outVertex && null != outVertex.outEdges) {
final Set edges = outVertex.outEdges.get(this.label());
if (null != edges)
edges.remove(this);
}
if (null != inVertex && null != inVertex.inEdges) {
final Set edges = inVertex.inEdges.get(this.label());
if (null != edges)
edges.remove(this);
}
TinkerHelper.removeElementIndex(this);
((TinkerGraph) this.graph()).edges.remove(this.id());
this.properties = null;
this.removed = true;
}
@Override
public String toString() {
return StringFactory.edgeString(this);
}
@Override
public Vertex outVertex() {
return this.outVertex;
}
@Override
public Vertex inVertex() {
return this.inVertex;
}
@Override
public Iterator vertices(final Direction direction) {
if (removed) return Collections.emptyIterator();
switch (direction) {
case OUT:
return IteratorUtils.of(this.outVertex);
case IN:
return IteratorUtils.of(this.inVertex);
default:
return IteratorUtils.of(this.outVertex, this.inVertex);
}
}
@Override
public Graph graph() {
return this.inVertex.graph();
}
@Override
public Iterator> properties(final String... propertyKeys) {
if (null == this.properties) return Collections.emptyIterator();
if (propertyKeys.length == 1) {
final Property property = this.properties.get(propertyKeys[0]);
return null == property ? Collections.emptyIterator() : IteratorUtils.of(property);
} else
return (Iterator) this.properties.entrySet().stream().filter(entry -> ElementHelper.keyExists(entry.getKey(), propertyKeys)).map(entry -> entry.getValue()).collect(Collectors.toList()).iterator();
}
}