All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.neo4j.server.rest.repr.PathRepresentation Maven / Gradle / Ivy

There is a newer version: 5.26.1
Show newest version
/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [https://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j 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.
 *
 * This program 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 this program.  If not, see .
 */
package org.neo4j.server.rest.repr;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import org.neo4j.graphdb.Node;
import org.neo4j.graphdb.Path;
import org.neo4j.graphdb.Relationship;
import org.neo4j.internal.helpers.collection.IterableWrapper;

public class PathRepresentation

extends ObjectRepresentation // implements // ExtensibleRepresentation { private final P path; public PathRepresentation(P path) { super(RepresentationType.PATH); this.path = path; } protected P getPath() { return path; } @Mapping("start") public ValueRepresentation startNode() { return ValueRepresentation.uri(NodeRepresentation.path(path.startNode())); } @Mapping("end") public ValueRepresentation endNode() { return ValueRepresentation.uri(NodeRepresentation.path(path.endNode())); } @Mapping("length") public ValueRepresentation length() { return ValueRepresentation.number(path.length()); } @Mapping("nodes") public ListRepresentation nodes() { return new ListRepresentation(RepresentationType.NODE, new IterableWrapper<>(path.nodes()) { @Override protected Representation underlyingObjectToObject(Node node) { return ValueRepresentation.uri(NodeRepresentation.path(node)); } }); } @Mapping("relationships") public ListRepresentation relationships() { return new ListRepresentation(RepresentationType.RELATIONSHIP, new IterableWrapper<>(path.relationships()) { @Override protected Representation underlyingObjectToObject(Relationship node) { return ValueRepresentation.uri(RelationshipRepresentation.path(node)); } }); } @Mapping("directions") public ListRepresentation directions() { List directionStrings = new ArrayList<>(); Iterator nodeIterator = path.nodes().iterator(); Iterator relationshipIterator = path.relationships().iterator(); Relationship rel; Node startNode; Node endNode = nodeIterator.next(); while (relationshipIterator.hasNext()) { rel = relationshipIterator.next(); startNode = endNode; endNode = nodeIterator.next(); if (rel.getStartNode().getElementId().equals(startNode.getElementId()) && rel.getEndNode().getElementId().equals(endNode.getElementId())) { directionStrings.add("->"); } else { directionStrings.add("<-"); } } return new ListRepresentation(RepresentationType.STRING, new IterableWrapper<>(directionStrings) { @Override protected Representation underlyingObjectToObject(String directionString) { return ValueRepresentation.string(directionString); } }); } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy