return P.between(((List) value).get(0), ((List) value).get(1)); case "inside": return P.inside(((List) value).get(0), ((List) value).get(1)); case "outside": return P.outside(((List) value).get(0), ((List) value).get(1));
return P.between(((List) value).get(0), ((List) value).get(1)); else if (predicate.equals("inside")) return P.inside(((List) value).get(0), ((List) value).get(1)); else if (predicate.equals("outside")) return P.outside(((List) value).get(0), ((List) value).get(1));
return P.between(((List) value).get(0), ((List) value).get(1)); else if (predicate.equals("inside")) return P.inside(((List) value).get(0), ((List) value).get(1)); else if (predicate.equals("outside")) return P.outside(((List) value).get(0), ((List) value).get(1));
@Override public Traversal<Vertex, Vertex> get_g_VX1X_outE_hasXweight_inside_0_06X_inV(final Object v1Id) { return g.V(v1Id).outE().has("weight", P.inside(0.0d, 0.6d)).inV(); }
@Test public void testQueryByIntPropUsingInsideWithMultiResults() { Assume.assumeTrue("Not support range condition query", storeFeatures().supportsQueryWithRangeCondition()); HugeGraph graph = graph(); initPersonIndex(false); init5Persons(); // 19 < age && age < 21 (that's age == 20) List<Vertex> vertexes = graph.traversal().V() .hasLabel("person") .has("age", P.inside(19, 21)) .toList(); Assert.assertEquals(2, vertexes.size()); // 3 < age && age < 21 (that's age == 19 or age == 20) vertexes = graph.traversal().V() .hasLabel("person").has("age", P.inside(3, 21)) .toList(); Assert.assertEquals(3, vertexes.size()); // 0 < age && age < 22 (that's all) vertexes = graph.traversal().V() .hasLabel("person") .has("age", P.inside(0, 22)) .toList(); Assert.assertEquals(5, vertexes.size()); }
@Test public void testQueryByIntPropUsingInsideWithOneResult() { Assume.assumeTrue("Not support range condition query", storeFeatures().supportsQueryWithRangeCondition()); HugeGraph graph = graph(); initPersonIndex(false); init5Persons(); // 3 < age && age < 20 (that's age == 19) List<Vertex> vertexes = graph.traversal().V() .hasLabel("person").has("age", P.inside(3, 20)) .toList(); Assert.assertEquals(1, vertexes.size()); Assert.assertEquals(19, vertexes.get(0).property("age").value()); }
Assert.assertNotNull(vertex); vertex = graph().traversal().V().hasLabel("person") .has("age", P.inside(2, 4)).next(); Assert.assertNotNull(vertex); }); vertex = graph().traversal().V().hasLabel("person") .has("age", P.inside(2, 4)).next(); Assert.assertNotNull(vertex); .has("age", P.inside(2, 4)).next(); });
@Test public void testAddIndexLabelOfVertexWithVertexExist() { Assume.assumeTrue("Not support range condition query", storeFeatures().supportsQueryWithRangeCondition()); super.initPropertyKeys(); SchemaManager schema = graph().schema(); schema.vertexLabel("person").properties("name", "age", "city") .primaryKeys("name").create(); graph().addVertex(T.label, "person", "name", "Baby", "city", "Hongkong", "age", 3); graph().tx().commit(); Assert.assertThrows(NoIndexException.class, () -> { graph().traversal().V().hasLabel("person") .has("city", "Hongkong").next(); }); schema.indexLabel("personByCity").onV("person").secondary() .by("city").create(); Vertex vertex = graph().traversal().V().hasLabel("person") .has("city", "Hongkong").next(); Assert.assertNotNull(vertex); Assert.assertThrows(NoIndexException.class, () -> { graph().traversal().V().hasLabel("person") .has("age", P.inside(2, 4)).next(); }); schema.indexLabel("personByAge").onV("person").range() .by("age").create(); vertex = graph().traversal().V().hasLabel("person") .has("age", P.inside(2, 4)).next(); Assert.assertNotNull(vertex); }
return P.between(((List) value).get(0), ((List) value).get(1)); else if (predicate.equals("inside")) return P.inside(((List) value).get(0), ((List) value).get(1)); else if (predicate.equals("outside")) return P.outside(((List) value).get(0), ((List) value).get(1));
return P.between(((List) value).get(0), ((List) value).get(1)); else if (predicate.equals("inside")) return P.inside(((List) value).get(0), ((List) value).get(1)); else if (predicate.equals("outside")) return P.outside(((List) value).get(0), ((List) value).get(1));
.has("age", P.inside(4, 10)).toList(); Assert.assertNotNull(vertex); Assert.assertEquals(2, vertex.size());
@Override public Traversal<Vertex, Vertex> get_g_VX1X_outE_hasXweight_inside_0_06X_inV(final Object v1Id) { return g.V(v1Id).outE().has("weight", P.inside(0.0d, 0.6d)).inV(); }