Lazy `TransitivePath` operation

RobinTF commented 3 weeks ago

This PR enables the TransitivePath operation to yield its result lazily and to consume its left/right child lazily. Note that the graph which is transitively traversed needs to be fully materialized due to the underlying algorithm. E.G when computing the (large) result of wdt:P31/wdt:P279*, the large result and the wdt:P31 can be dealt with lazily, but the full wdt:P279 predicate needs to be materialized.

codecov[bot] commented 3 weeks ago

Codecov Report

Attention: Patch coverage is 91.83673% with 16 lines in your changes missing coverage. Please review.

Project coverage is 89.11%. Comparing base (05a3f69) to head (b1014d1). Report is 3 commits behind head on master.

Files with missing lines	Patch %	Lines
src/engine/TransitivePathImpl.h	91.45%	1 Missing and 9 partials :warning:
src/engine/TransitivePathBase.cpp	88.46%	0 Missing and 6 partials :warning:

Additional details and impacted files

```diff @@ Coverage Diff @@ ## master #1595 +/- ## ========================================== + Coverage 89.08% 89.11% +0.02% ========================================== Files 371 371 Lines 34437 34491 +54 Branches 3899 3908 +9 ========================================== + Hits 30678 30735 +57 + Misses 2484 2478 -6 - Partials 1275 1278 +3 ```

:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.