Package com.thinkaurelius.faunus

Examples of com.thinkaurelius.faunus.FaunusVertex

60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
        }
        edgeMapReduceDriver.run();

        Map<Long, FaunusVertex> incrementalGraph = new HashMap<Long, FaunusVertex>();
        // VERTICES
        FaunusVertex marko1 = new FaunusVertex(11l);
        marko1.setProperty("name", "marko");
        marko1.setProperty("height", "5'11");
        FaunusVertex stephen1 = new FaunusVertex(22l);
        stephen1.setProperty("name", "stephen");
        FaunusVertex vadas1 = new FaunusVertex(33l);
        vadas1.setProperty("name", "vadas");
        // EDGES
        marko1.addEdge(Direction.OUT, "worksWith", stephen1.getIdAsLong());
        stephen1.addEdge(Direction.IN, "worksWith", marko1.getIdAsLong());
        marko1.addEdge(Direction.OUT, "worksWith", vadas1.getIdAsLong());
        vadas1.addEdge(Direction.IN, "worksWith", marko1.getIdAsLong());
        stephen1.addEdge(Direction.OUT, "worksWith", vadas1.getIdAsLong());
        vadas1.addEdge(Direction.IN, "worksWith", stephen1.getIdAsLong());
        incrementalGraph.put(11l, marko1);
        incrementalGraph.put(22l, stephen1);
        incrementalGraph.put(33l, vadas1);
        conf = new Configuration();
        conf.set(BlueprintsGraphOutputMapReduce.FAUNUS_GRAPH_OUTPUT_BLUEPRINTS_SCRIPT_FILE, "./data/BlueprintsScript.groovy");
View Full Code Here
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
        }
        edgeMapReduceDriver.run();

        Map<Long, FaunusVertex> incrementalGraph = new HashMap<Long, FaunusVertex>();
        // VERTICES
        FaunusVertex marko1 = new FaunusVertex(11l);
        marko1.setProperty("name", "marko");
        FaunusVertex lop1 = new FaunusVertex(22l);
        lop1.setProperty("name", "lop");
        FaunusVertex vadas1 = new FaunusVertex(33l);
        vadas1.setProperty("name", "vadas");
        // EDGES
        marko1.addEdge(Direction.OUT, "created", lop1.getIdAsLong()).setProperty("since", 2009);
        marko1.addEdge(Direction.OUT, "knows", vadas1.getIdAsLong()).setProperty("since", 2008);
        lop1.addEdge(Direction.IN, "created", marko1.getIdAsLong()).setProperty("since", 2009);
        vadas1.addEdge(Direction.IN, "knows", marko1.getIdAsLong()).setProperty("since", 2008);
        incrementalGraph.put(11l, marko1);
        incrementalGraph.put(22l, lop1);
        incrementalGraph.put(33l, vadas1);
        conf = new Configuration();
        conf.set(BlueprintsGraphOutputMapReduce.FAUNUS_GRAPH_OUTPUT_BLUEPRINTS_SCRIPT_FILE, "./data/BlueprintsScript.groovy");
View Full Code Here
49
50
51
52
53
54
55
        @Override
        public void setup(final Mapper.Context context) throws IOException, InterruptedException {
            this.direction = Direction.valueOf(context.getConfiguration().get(DIRECTION));
            this.labels = context.getConfiguration().getStrings(LABELS, new String[0]);
            this.vertex = new FaunusVertex(context.getConfiguration().getBoolean(FaunusCompiler.PATH_ENABLED, false));
        }
View Full Code Here
91
92
93
94
95
96
97
        private FaunusVertex vertex;

        @Override
        public void setup(final Reducer.Context context) throws IOException, InterruptedException {
            this.vertex = new FaunusVertex(context.getConfiguration().getBoolean(FaunusCompiler.PATH_ENABLED, false));
        }
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
        reader.initialize(new FileSplit(new Path(ScriptRecordReaderTest.class.getResource("graph-of-the-gods.id").toURI()), 0, Long.MAX_VALUE, new String[]{}),
                new TaskAttemptContext(conf, new TaskAttemptID()));
        int counter = 0;
        while (reader.nextKeyValue()) {
            assertEquals(reader.getCurrentKey(), NullWritable.get());
            FaunusVertex vertex = reader.getCurrentValue();
            long id = vertex.getIdAsLong();
            assertEquals(id, counter++);
            assertEquals(vertex.getPropertyKeys().size(), 0);
            assertEquals(count(vertex.getEdges(Direction.IN)), 0);
            if (id == 1 || id == 2 || id == 3 || id == 7 || id == 11) {
                assertTrue(count(vertex.getEdges(Direction.OUT)) > 0);
            } else {
                assertTrue(count(vertex.getEdges(Direction.OUT)) == 0);
            }
        }
        assertEquals(counter, 12);
        reader.close();
    }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
        VertexToFaunusBinary.write(marko, out);
        VertexToFaunusBinary.write(stephen, out);

        DataInput in = new DataInputStream(new ByteArrayInputStream(bytes1.toByteArray()));

        FaunusVertex markoFaunus = new FaunusVertex(in);
        assertEquals(markoFaunus.getProperty("name"), "marko");
        assertEquals(markoFaunus.getProperty("age"), 32);
        assertEquals(markoFaunus.getPropertyKeys().size(), 2);
        assertEquals(asList(markoFaunus.getEdges(Direction.OUT)).size(), 1);
        assertFalse(markoFaunus.getEdges(Direction.IN).iterator().hasNext());
        assertTrue(markoFaunus.getEdges(Direction.OUT, "knows").iterator().hasNext());
        assertFalse(markoFaunus.getEdges(Direction.OUT, "blah").iterator().hasNext());
        FaunusEdge edge = (FaunusEdge) markoFaunus.getEdges(Direction.OUT).iterator().next();
        assertEquals(edge.getLabel(), "knows");
        assertEquals(edge.getProperty("weight"), 0.2);
        assertEquals(edge.getProperty("type"), "coworker");
        assertEquals(edge.getPropertyKeys().size(), 2);
        assertEquals(edge.getVertex(Direction.IN).getId(), 3l);
        assertEquals(edge.getVertex(Direction.OUT).getId(), 1l);

        FaunusVertex stephenFaunus = new FaunusVertex(in);
        assertEquals(stephenFaunus.getProperty("name"), "stephen");
        assertEquals(stephenFaunus.getProperty("weight"), 160.42);
        assertTrue((Boolean) stephenFaunus.getProperty("male"));
        assertEquals(stephenFaunus.getPropertyKeys().size(), 3);
        assertEquals(asList(stephenFaunus.getEdges(Direction.IN)).size(), 1);
        assertFalse(stephenFaunus.getEdges(Direction.OUT).iterator().hasNext());
        assertTrue(stephenFaunus.getEdges(Direction.IN, "knows").iterator().hasNext());
        assertFalse(stephenFaunus.getEdges(Direction.IN, "blah").iterator().hasNext());
        edge = (FaunusEdge) stephenFaunus.getEdges(Direction.IN).iterator().next();
        assertEquals(edge.getLabel(), "knows");
        assertEquals(edge.getProperty("weight"), 0.2);
        assertEquals(edge.getProperty("type"), "coworker");
        assertEquals(edge.getPropertyKeys().size(), 2);
        assertEquals(edge.getVertex(Direction.IN).getId(), 3l);
View Full Code Here
28
29
30
31
32
33
34
35
36
37
38
39
        int counter = 0;
        Map<Long, FaunusVertex> graph = new HashMap<Long, FaunusVertex>();
        while (reader.nextKeyValue()) {
            counter++;
            assertEquals(reader.getCurrentKey(), NullWritable.get());
            FaunusVertex vertex = reader.getCurrentValue();
            graph.put(vertex.getIdAsLong(), vertex);
        }
        identicalStructure(graph, ExampleGraph.GRAPH_OF_THE_GODS);
        assertEquals(counter, 12);
        reader.close();
    }
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
                new TaskAttemptContext(new Configuration(), new TaskAttemptID()));
        int counter = 0;
        while (reader.nextKeyValue()) {
            counter++;
            assertEquals(reader.getCurrentKey(), NullWritable.get());
            FaunusVertex vertex = reader.getCurrentValue();
            assertEquals(((List) vertex.getEdges(Direction.IN)).size(), 0);
        }
        assertEquals(counter, 12);
        reader.close();
    }
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
                new TaskAttemptContext(new Configuration(), new TaskAttemptID()));
        int counter = 0;
        while (reader.nextKeyValue()) {
            counter++;
            assertEquals(reader.getCurrentKey(), NullWritable.get());
            FaunusVertex vertex = reader.getCurrentValue();
            assertEquals(((List) vertex.getEdges(Direction.BOTH)).size(), 0);
        }
        assertEquals(counter, 12);
        reader.close();
    }
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
31
32
33
        assertFalse(query.doesFilter());
        assertEquals(query.limit, Integer.MAX_VALUE);
        assertEquals(query.hasContainers.size(), 0);
        assertEquals(query.direction, Direction.BOTH);
        assertEquals(query.labels.length, 0);
        FaunusVertex vertex = new FaunusVertex(1);
        vertex.setProperty("name", "marko");
        vertex.addEdge("knows", vertex).setProperty("time", 1);
        query.defaultFilter(vertex);
        assertEquals(vertex.getProperty("name"), "marko");
        assertEquals(vertex.getPropertyKeys().size(), 1);
        assertEquals(vertex.getVertices(Direction.OUT).iterator().next(), vertex);
        assertEquals(vertex.getEdges(Direction.OUT).iterator().next().getProperty("time"), new Integer(1));
    }
View Full Code Here
TOP

Related Classes of com.thinkaurelius.faunus.FaunusVertex

  • com.thinkaurelius.faunus.formats.BlueprintsGraphOutputMapReduce$Reduce
  • com.thinkaurelius.faunus.formats.BlueprintsGraphOutputMapReduceTest
  • com.thinkaurelius.faunus.formats.edgelist.EdgeListInputMapReduce$Map
  • com.thinkaurelius.faunus.formats.edgelist.EdgeListInputMapReduceTest
  • com.thinkaurelius.faunus.formats.edgelist.rdf.RDFBlueprintsHandler
  • com.thinkaurelius.faunus.formats.edgelist.rdf.RDFBlueprintsHandlerTest
  • com.thinkaurelius.faunus.formats.graphson.FaunusGraphSONUtility
  • com.thinkaurelius.faunus.formats.graphson.FaunusGraphSONUtility$FaunusElementFactory
  • com.thinkaurelius.faunus.formats.graphson.FaunusGraphSONUtilityTest
  • com.thinkaurelius.faunus.formats.graphson.GraphSONRecordReaderTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.