make graphRegex simpler

Context

In issue Bug : Advanced node testing with Graph Regex an... (#86 - closed), the problem arises from the syntax of the lambda declaration, which is not intuitive.This modification aims to automatically add the lambda key as a test and eliminate the need to do it in two steps. It also adds the ability to accept True and False as bool in expressions.

Modified files

Add the automatically add the lambda key in :

src/graphRegex/GraphRegex.cpp

Add the True and False :

src/nodeTester/ConditionalLexer.cpp

CI :

unit_tests/graphRegex/Test_GraphRegex.cpp

src/graphRegex/GraphRegex.cpp

@@ -117,6 +117,8 @@ std::set<std::shared_ptr<MatchSolution>> GraphRegex::match(std::shared_ptr<Graph
             std::vector<std::shared_ptr<MatchSolution>> solution = fsm->test(combination);
             solutions.insert(solutions.end(), solution.begin(), solution.end());
         }
+
+
     }
     return _findLargestCompatibleSet(solutions);
 }
@@ -142,7 +144,10 @@ void GraphRegex::setNodeKey(const std::string key,std::function<bool(NodePtr)> f
         throw std::runtime_error(key + " is define");
     }
     mAllLambda[key] = f;
+    
     _majConditionalInterpreterLambda();
+    //we add the lambda as key by default 
+    setNodeKey(key, key + "($)==true");
 }
 
 void GraphRegex::_majConditionalInterpreterLambda(){