com.tinkerpop.gremlin.process.graph.step.sideEffect.TreeTest Maven / Gradle / Ivy

Go to download
package com.tinkerpop.gremlin.process.graph.step.sideEffect;

import com.tinkerpop.gremlin.LoadGraphWith;
import com.tinkerpop.gremlin.process.AbstractGremlinProcessTest;
import com.tinkerpop.gremlin.process.Traversal;
import com.tinkerpop.gremlin.process.graph.step.util.Tree;
import com.tinkerpop.gremlin.structure.Vertex;
import org.junit.Test;

import java.util.Arrays;
import java.util.List;
import java.util.Map;

import static com.tinkerpop.gremlin.LoadGraphWith.GraphData.CLASSIC;
import static org.junit.Assert.*;

/**
 * @author Marko A. Rodriguez (http://markorodriguez.com)
 * @author Stephen Mallette (http://stephen.genoprime.com)
 */
public abstract class TreeTest extends AbstractGremlinProcessTest {
    public abstract Traversal get_g_v1_out_out_treeXnameX(final Object v1Id);

    public abstract Traversal get_g_v1_out_out_treeXnameX_asXaX_both_both_capXaX(final Object v1Id);

    @Test
    @LoadGraphWith(CLASSIC)
    public void g_v1_out_out_treeXnameX() {
        List> traversals = Arrays.asList(get_g_v1_out_out_treeXnameX(convertToVertexId("marko")), get_g_v1_out_out_treeXnameX_asXaX_both_both_capXaX(convertToVertexId("marko")));
        traversals.forEach(traversal -> {
            printTraversalForm(traversal);
            final Tree tree = traversal.next();
            assertFalse(traversal.hasNext());
            assertEquals(1, tree.size());
            assertTrue(tree.containsKey("marko"));
            assertEquals(1, ((Map) tree.get("marko")).size());
            assertTrue(((Map) tree.get("marko")).containsKey("josh"));
            assertTrue(((Map) ((Map) tree.get("marko")).get("josh")).containsKey("lop"));
            assertTrue(((Map) ((Map) tree.get("marko")).get("josh")).containsKey("ripple"));
        });
    }

    public static class JavaTreeTest extends TreeTest {
        public JavaTreeTest() {
            requiresGraphComputer = false;
        }

        public Traversal get_g_v1_out_out_treeXnameX(final Object v1Id) {
            return (Traversal) g.v(v1Id).out().out().tree(v -> ((Vertex) v).value("name"));
        }

        public Traversal get_g_v1_out_out_treeXnameX_asXaX_both_both_capXaX(final Object v1Id) {
            return g.v(v1Id).out().out().tree(v -> ((Vertex) v).value("name")).as("a").both().both().cap("a");
        }
    }

    public static class JavaComputerTreeTest extends TreeTest {
        public JavaComputerTreeTest() {
            requiresGraphComputer = true;
        }

        public Traversal get_g_v1_out_out_treeXnameX(final Object v1Id) {
            // todo: micropaths don't have vertex properties
            return (Traversal) g.v(v1Id).out().out().tree(v -> ((Vertex) v).value("name"));
        }

        public Traversal get_g_v1_out_out_treeXnameX_asXaX_both_both_capXaX(final Object v1Id) {
            return g.v(v1Id).out().out().tree(v -> ((Vertex) v).value("name")).as("a").both().both().cap("a");
        }
    }
}