add test case

Change-Id: Ie442cfb0355f36398422ae0616f4c5bce99cc79f
apache · Jan 20, 2022 · d082f2d · d082f2d
1 parent e7359fa
commit d082f2d
Showing 1 changed file with 30 additions and 3 deletions.
diff --git a/hugegraph-test/src/main/java/com/baidu/hugegraph/core/EdgeCoreTest.java b/hugegraph-test/src/main/java/com/baidu/hugegraph/core/EdgeCoreTest.java
@@ -3581,12 +3581,12 @@ public void testQueryOutEdgesOfVertexBySortkeyWithRange() {
         Assert.assertEquals(3, edges.size());
 
         edges = graph.traversal().V(v1).outE("call")
-                     .has("calltime", P.between("2017-5-2","2017-5-4"))
+                     .has("calltime", P.between("2017-5-2", "2017-5-4"))
                      .toList();
         Assert.assertEquals(5, edges.size());
 
         edges = graph.traversal().V(v1).outE("call")
-                     .has("calltime", P.between("2017-5-2","2017-5-4"))
+                     .has("calltime", P.between("2017-5-2", "2017-5-4"))
                      .where(__.not(__.otherV().hasId((v10086.id()))))
                      .toList();
         Assert.assertEquals(3, edges.size());
@@ -4549,6 +4549,33 @@ public void testQueryInEdgesOfVertexByLabelAndFilter() {
         Assert.assertEquals(1, edges.size());
     }
 
+    @Test
+    public void testQueryInEdgesOfVertexByLabels() {
+        HugeGraph graph = graph();
+        init18Edges();
+
+        long size;
+        size = graph.traversal().V().outE("created", "authored", "look")
+                                    .hasLabel("authored", "created")
+                                    .count().next();
+        Assert.assertEquals(5L, size);
+
+        size = graph.traversal().V().outE("created", "authored", "look")
+                                    .hasLabel("authored", "friend")
+                                    .count().next();
+        Assert.assertEquals(3L, size);
+
+        size = graph.traversal().V().outE("created")
+                                    .hasLabel("authored", "created")
+                                    .count().next();
+        Assert.assertEquals(2L, size);
+
+        size = graph.traversal().V().inE("created", "authored", "look")
+                                    .has("score", 3)
+                                    .count().next();
+        Assert.assertEquals(3L, size);
+    }
+
     @Test
     public void testQueryInEdgesOfVertexBySortkey() {
         HugeGraph graph = graph();
@@ -7242,7 +7269,7 @@ public void testAddEdgeWithCollectionIndex() {
 
 
         List<Edge> edges =  graph.traversal().E()
-                                 .has("related","tags",
+                                 .has("related", "tags",
                                       ConditionP.contains("gremlin"))
                                  .toList();