Binary app

include/do-verify/ptl.hpp

@@ -35,7 +35,12 @@ struct ptl_parser : ptl_grammar{
   std::unordered_map<NodeKey, int, NodeKeyHash> node_dedup_map;
   std::string last_error;
 
-  int add_or_find_node(const ParsedNode &node) {
+  int add_or_find_node(ParsedNode node) {
+    if (node.type == NodeType::AND || node.type == NodeType::OR) {
+      if (node.leftOperandIndex > node.rightOperandIndex) {
+        std::swap(node.leftOperandIndex, node.rightOperandIndex);
+      }
+    }
     NodeKey key{node.type, node.leftOperandIndex, node.rightOperandIndex, node.a, node.b};
     auto it = node_dedup_map.find(key);
     if (it != node_dedup_map.end()) {

src/MTLEngine.cpp

@@ -208,6 +208,17 @@ bool run_evaluation(std::vector<DiscreteNode> &nodes, db_interval_set::IntervalS
 
 }
 
+// TODO
+// feature list çıkar (double buffer)
+// testlere bak
+// feature list: binary executable mi / library mi
+// timescales birleştirme
+// random propertyler / doğru olmasına gerek yok
+// bir de timecales gibi doğru olan multi-property
+// text filedan propertyleri okusun binary
+// hyperfine kullan
+// 
+
 bool run_evaluation(std::vector<DiscreteNode> &nodes, std::map<std::string, unsigned int, std::less<>> &proposition_map, db_interval_set::IntervalSetHolder &setHolder, const int time, const std::vector<std::pair<std::string_view, bool>> &propositionInputs) {
     for (const auto &propInput : propositionInputs) {
         auto &propNode = nodes[proposition_map.find(propInput.first)->second];