durable_rules 0.34.53 → 0.34.54

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a01733997ce444fcb2910a67668c5e10b8893161
-  data.tar.gz: 50ee1913a41d48dcd28d7315a32ef8dffa5fb075
+  metadata.gz: 06aca017b6ef6c5368d78a1ffacc5a79af6f0a7d
+  data.tar.gz: 88fc00734924f677ca7ea05fa1c1906e04bdd773
 SHA512:
-  metadata.gz: '077958cc68110cfa8bf9e6354019281d112f0f1ee63b8cc295b95e85af9c9ed22dba29b8c80edb866be8c3d6f37c70bd1151257f7fe492fc49a6fdd930f31574'
-  data.tar.gz: 87f14ddb90146ce93cfed1eaafce9bd720e650c1d121695a324010a7b3a08e28f1d1cfd843b527e0a49b96a39e6fa856d900f00aac6dbfb0803595e3d7fbb2fb
+  metadata.gz: df6e4423db1c3a5fe1b6b059d9f58896cf0398bee3376c4a9a0317e0e8890e0e2302ea572117f7b8b27027cde58d4a3a723b90bf2bdc682ce17418d17bc12b3d
+  data.tar.gz: 209c2fda5a36962ace358c796cc600297a1785980ffad6f7f77980d443c3ba052441b730fe59567205a133a0957cf367d0051b6ae00e04dc12be9b2097dd8132

data/src/rules/events.c

@@ -989,6 +989,7 @@ static unsigned int isArrayMatch(ruleset *tree,
                     char exists = 0;
                     for(unsigned int propertyIndex = 0; propertyIndex < jo.propertiesLength; ++propertyIndex) {
                         if (listNode->value.a.hash == jo.properties[propertyIndex].hash) {
+                            // filter out not exists (OP_NEX)
                             exists = 1;
                             break;
                         }
@@ -1052,8 +1053,8 @@ static unsigned int isArrayMatch(ruleset *tree,
                 }
             }
 
-            // no next offset means we found a valid path
-            if (!currentAlpha->nextOffset) {
+            // no next offset and no nextListOffest means we found a valid path
+            if (!currentAlpha->nextOffset && !currentAlpha->nextListOffset) {
                 *propertyMatch = 1;
                 break;
             } 
@@ -1094,6 +1095,7 @@ static unsigned int handleAlpha(ruleset *tree,
     while (top) {
         --top;
         currentAlpha = stack[top];
+        // add all disjunctive nodes to stack
         if (currentAlpha->nextListOffset) {
             unsigned int *nextList = &tree->nextPool[currentAlpha->nextListOffset];
             for (entry = 0; nextList[entry] != 0; ++entry) {
@@ -1101,6 +1103,7 @@ static unsigned int handleAlpha(ruleset *tree,
                 char exists = 0;
                 for(unsigned int propertyIndex = 0; propertyIndex < jo->propertiesLength; ++propertyIndex) {
                     if (listNode->value.a.hash == jo->properties[propertyIndex].hash) {
+                        // filter out not exists (OP_NEX)
                         exists = 1;
                         break;
                     }
@@ -1117,6 +1120,7 @@ static unsigned int handleAlpha(ruleset *tree,
             }
         }
 
+        // calculate conjunctive nodes
         if (currentAlpha->nextOffset) {
             unsigned int *nextHashset = &tree->nextPool[currentAlpha->nextOffset];
             for(unsigned int propertyIndex = 0; propertyIndex < jo->propertiesLength; ++propertyIndex) {

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: durable_rules
 version: !ruby/object:Gem::Version
-  version: 0.34.53
+  version: 0.34.54
 platform: ruby
 authors:
 - Jesus Ruiz
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-09-24 00:00:00.000000000 Z
+date: 2018-10-01 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake