@@ -7138,6 +7138,12 @@ public void testQueryEdgeByBooleanRangePredicate() {
71387138 "tool" , "shovel" , "reason" , "jeer" ,
71397139 "arrested" , true );
71407140
7141+ List <Edge > hasLtEdges = graph .traversal ().E ()
7142+ .has ("arrested" , P .lt (true ))
7143+ .toList ();
7144+ Assert .assertEquals (1 , hasLtEdges .size ());
7145+ Assert .assertEquals (1 , (int ) hasLtEdges .get (0 ).value ("id" ));
7146+
71417147 List <Edge > whereEdges = graph .traversal ().E ()
71427148 .where (__ .has ("arrested" , P .lt (true )))
71437149 .toList ();
@@ -7153,6 +7159,51 @@ public void testQueryEdgeByBooleanRangePredicate() {
71537159 .toList ();
71547160 Assert .assertEquals (1 , matchEdges .size ());
71557161 Assert .assertEquals (1 , (int ) matchEdges .get (0 ).value ("id" ));
7162+
7163+ List <Edge > hasLteFalseEdges = graph .traversal ().E ()
7164+ .has ("arrested" , P .lte (false ))
7165+ .toList ();
7166+ Assert .assertEquals (1 , hasLteFalseEdges .size ());
7167+ Assert .assertEquals (1 , (int ) hasLteFalseEdges .get (0 ).value ("id" ));
7168+
7169+ List <Edge > hasGtFalseEdges = graph .traversal ().E ()
7170+ .has ("arrested" , P .gt (false ))
7171+ .toList ();
7172+ Assert .assertEquals (1 , hasGtFalseEdges .size ());
7173+ Assert .assertEquals (2 , (int ) hasGtFalseEdges .get (0 ).value ("id" ));
7174+
7175+ List <Edge > hasGteTrueEdges = graph .traversal ().E ()
7176+ .has ("arrested" , P .gte (true ))
7177+ .toList ();
7178+ Assert .assertEquals (1 , hasGteTrueEdges .size ());
7179+ Assert .assertEquals (2 , (int ) hasGteTrueEdges .get (0 ).value ("id" ));
7180+
7181+ List <Edge > hasGteFalseEdges = graph .traversal ().E ()
7182+ .has ("arrested" , P .gte (false ))
7183+ .toList ();
7184+ Assert .assertEquals (2 , hasGteFalseEdges .size ());
7185+ Set <Integer > gteFalseIds = new HashSet <>();
7186+ for (Edge edge : hasGteFalseEdges ) {
7187+ gteFalseIds .add (edge .value ("id" ));
7188+ }
7189+ Assert .assertEquals (ImmutableSet .of (1 , 2 ), gteFalseIds );
7190+
7191+ List <Edge > hasLteTrueEdges = graph .traversal ().E ()
7192+ .has ("arrested" , P .lte (true ))
7193+ .toList ();
7194+ Assert .assertEquals (2 , hasLteTrueEdges .size ());
7195+ Set <Integer > lteTrueIds = new HashSet <>();
7196+ for (Edge edge : hasLteTrueEdges ) {
7197+ lteTrueIds .add (edge .value ("id" ));
7198+ }
7199+ Assert .assertEquals (ImmutableSet .of (1 , 2 ), lteTrueIds );
7200+
7201+ Assert .assertEquals (0 , graph .traversal ().E ()
7202+ .has ("arrested" , P .lt (false ))
7203+ .toList ().size ());
7204+ Assert .assertEquals (0 , graph .traversal ().E ()
7205+ .has ("arrested" , P .gt (true ))
7206+ .toList ().size ());
71567207 }
71577208
71587209 @ Test
0 commit comments