[core] Build row range indexes directly from bitmap ranges

[jerry-024]

Purpose

DE scan planning converts global-index matches into row ranges, then calls RowRangeIndex.create, which copies, sorts and merges those ranges again. For non-negative row IDs, the bitmap conversion already produces ordered, disjoint ranges. Reprocessing them adds allocations and traversal overhead, especially when an index query returns many fragmented ranges.

Add RowRangeIndex.fromBitmap and use it in DataEvolutionBatchScan to build the range index directly from the converted ranges. Mixed-sign bitmaps retain the existing signed sort-and-merge path because bitmap iteration uses unsigned order. The general create(List<Range>) API keeps its existing behavior.

Tests

Added an equivalence test covering empty and singleton bitmaps, sparse and contiguous ranges, 32-bit boundaries, mixed signs and long-value boundaries. It checks range queries against the existing construction path and verifies that subsequent bitmap mutations do not change the constructed index.

Local validation with JDK 11:

• Passed RowRangeIndexTest (2 tests) and RoaringNavigableMap64Test (8 tests).
• Passed DataEvolutionBatchScanTest (6 tests) and DataEvolutionFileStoreScanTest#testIntersectsRowRanges (1 test).
• Passed Spotless checks.
• BtreeGlobalIndexTableTest#testBTreeGlobalIndexWithCoreScan failed during index creation with NoSuchMethodError: ManifestAvroReader.<init>(SeekableInputStream). This end-to-end check remains unverified.