ancestors: introduce firm leap-based iterator
This adds a new ordered ancestor iterator implementation using the firm leap information, which is lighter to store than the soft and hard leaps.
Depends on: !31 (merged)
This adds a new ordered ancestor iterator implementation using the firm leap information, which is lighter to store than the soft and hard leaps.
Depends on: !31 (merged)