Java Code Examples for org.apache.tinkerpop.gremlin.structure.Edge#equals()
The following examples show how to use
org.apache.tinkerpop.gremlin.structure.Edge#equals() .
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: TinkerGraphGraphSONSerializerV2d0Test.java From tinkergraph-gremlin with Apache License 2.0 | 4 votes |
/** * Checks sequentially vertices and edges of both graphs. Will check sequentially Vertex IDs, Vertex Properties IDs * and values and classes. Then same for edges. To use when serializing a Graph and deserializing the supposedly * same Graph. */ private boolean approximateGraphsCheck(Graph g1, Graph g2) { final Iterator<Vertex> itV = g1.vertices(); final Iterator<Vertex> itVRead = g2.vertices(); while (itV.hasNext()) { final Vertex v = itV.next(); final Vertex vRead = itVRead.next(); // Will only check IDs but that's 'good' enough. if (!v.equals(vRead)) { return false; } final Iterator itVP = v.properties(); final Iterator itVPRead = vRead.properties(); while (itVP.hasNext()) { final VertexProperty vp = (VertexProperty) itVP.next(); final VertexProperty vpRead = (VertexProperty) itVPRead.next(); if (!vp.value().equals(vpRead.value()) || !vp.equals(vpRead)) { return false; } } } final Iterator<Edge> itE = g1.edges(); final Iterator<Edge> itERead = g2.edges(); while (itE.hasNext()) { final Edge e = itE.next(); final Edge eRead = itERead.next(); // Will only check IDs but that's good enough. if (!e.equals(eRead)) { return false; } final Iterator itEP = e.properties(); final Iterator itEPRead = eRead.properties(); while (itEP.hasNext()) { final Property ep = (Property) itEP.next(); final Property epRead = (Property) itEPRead.next(); if (!ep.value().equals(epRead.value()) || !ep.equals(epRead)) { return false; } } } return true; }
Example 2
Source File: TinkerGraphGraphSONSerializerV2d0Test.java From tinkerpop with Apache License 2.0 | 4 votes |
/** * Checks sequentially vertices and edges of both graphs. Will check sequentially Vertex IDs, Vertex Properties IDs * and values and classes. Then same for edges. To use when serializing a Graph and deserializing the supposedly * same Graph. */ private boolean approximateGraphsCheck(Graph g1, Graph g2) { final Iterator<Vertex> itV = g1.vertices(); final Iterator<Vertex> itVRead = g2.vertices(); while (itV.hasNext()) { final Vertex v = itV.next(); final Vertex vRead = itVRead.next(); // Will only check IDs but that's 'good' enough. if (!v.equals(vRead)) { return false; } final Iterator itVP = v.properties(); final Iterator itVPRead = vRead.properties(); while (itVP.hasNext()) { final VertexProperty vp = (VertexProperty) itVP.next(); final VertexProperty vpRead = (VertexProperty) itVPRead.next(); if (!vp.value().equals(vpRead.value()) || !vp.equals(vpRead)) { return false; } } } final Iterator<Edge> itE = g1.edges(); final Iterator<Edge> itERead = g2.edges(); while (itE.hasNext()) { final Edge e = itE.next(); final Edge eRead = itERead.next(); // Will only check IDs but that's good enough. if (!e.equals(eRead)) { return false; } final Iterator itEP = e.properties(); final Iterator itEPRead = eRead.properties(); while (itEP.hasNext()) { final Property ep = (Property) itEP.next(); final Property epRead = (Property) itEPRead.next(); if (!ep.value().equals(epRead.value()) || !ep.equals(epRead)) { return false; } } } return true; }