Package com.tinkerpop.blueprints

Examples of com.tinkerpop.blueprints.Direction.opposite()

277
278
279
280
281
282
283
284
285
286
287
          } else if (curr.getSchemaClass().isSubClassOf(OrientEdgeType.CLASS_NAME)) {
            final Direction direction = getConnectionDirection(iFieldName, useVertexFieldsForEdgeLabels);

            // EDGE, REMOVE THE EDGE
            if (iVertexToRemove.equals(OrientEdge.getConnection(curr, direction.opposite()))) {
              it.remove();
              if (iAlsoInverse)
                removeInverseEdge(iVertex, iFieldName, iVertexToRemove, curr, useVertexFieldsForEdgeLabels);
              found = true;
              break;
View Full Code Here
330
331
332
333
334
335
336
337
338
339
340
          } else if (curr.getSchemaClass().isSubClassOf(OrientEdgeType.CLASS_NAME)) {
            final Direction direction = getConnectionDirection(iFieldName, useVertexFieldsForEdgeLabels);

            // EDGE, REMOVE THE EDGE
            if (iVertexToRemove.equals(OrientEdge.getConnection(curr, direction.opposite()))) {
              it.remove();
              if (iAlsoInverse)
                removeInverseEdge(iVertex, iFieldName, iVertexToRemove, curr, useVertexFieldsForEdgeLabels);
              found = true;
              break;
View Full Code Here
751
752
753
754
755
756
757
758
759
760
761
                    useVertexFieldsForEdgeLabels);

                // EDGE, REMOVE THE EDGE
                if (iVertexToRemove.equals(OrientEdge
                    .getConnection(curr,
                        direction.opposite()))) {
                  it.remove();
                  if (iAlsoInverse)
                    removeInverseEdge(iVertex,
                        iFieldName,
                        iVertexToRemove, curr,
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
      Direction edgeDirection = (Direction) edgePath.get(cursor);
      String edgeLabel = (String) edgePath.get(cursor + 1);
      Iterable<Edge> edges = from.getEdges(edgeDirection, edgeLabel);
      for (Edge edge : edges) {
        edgesToCopy.add(edge);
        Vertex tail = edge.getVertex(edgeDirection.opposite());
        copy(tail);
        browse(tail, cursor + 2, edgePath);
      }
    }
  }
View Full Code Here
75
76
77
78
79
80
81
82
83
84
85
                }
                if (objectcompare != 0) return objectcompare;
            }
        } else {
            Preconditions.checkArgument(r1.isEdge() && r2.isEdge());
            int vertexcompare = r1.getVertex(EdgeDirection.position(dir1.opposite())).
                    compareTo(r2.getVertex(EdgeDirection.position(dir1.opposite())));
            if (vertexcompare != 0) return vertexcompare;
        }
        //TODO: if graph is simple, return 0
        // 5)compare relation ids
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
                if (objectcompare != 0) return objectcompare;
            }
        } else {
            Preconditions.checkArgument(r1.isEdge() && r2.isEdge());
            int vertexcompare = r1.getVertex(EdgeDirection.position(dir1.opposite())).
                    compareTo(r2.getVertex(EdgeDirection.position(dir1.opposite())));
            if (vertexcompare != 0) return vertexcompare;
        }
        //TODO: if graph is simple, return 0
        // 5)compare relation ids
        return r1.compareTo(r2);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.