Changes between Initial Version and Version 1 of Ticket #11382, comment 13
- Timestamp:
- 2015-05-15T19:05:26+02:00 (10 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Ticket #11382, comment 13
initial v1 3 3 I took some time to write a patch that does not have the memory issues you discussed. I did not use a segmentation approach but instead used a mixture of bitsets and normal integer lists that has a size limit in O(<number of set bits>). I changed the key/value rules to not contain the key rules. This requires one additional or when merging, but it ensures that every rule only produces one single set bit in any of the rule bitsets. 4 4 5 I did not notice any performance changes, in theory there sould be imrpovements when having many rules (since bitset merging is faster).5 I did not notice any real performance changes (less than noise), in theory there sould be imrpovements when having many rules (since bitset merging is faster).