ZSET B+ Tree PR 3: Replace skiplist with FB+ Tree implementation#4206

Open

rainsupreme wants to merge 12 commits into

valkey-io:zset-btreefrom

rainsupreme:oi/pr3-fbtree-v2

Commits on Jul 17, 2026

Replace skiplist with fbtree (flat B+tree) for ZSET ordered index
rainsupreme
committed
Make orderedIndexCountScoreRange O(log N) via rank arithmetic
rainsupreme
committed
Make orderedIndexCountLexRange O(log N) via rank arithmetic
rainsupreme
committed
Use fbtreePeekMin for lex score-prefix lookup (O(1) vs O(log N))
rainsupreme
committed
fbtree: return element from iterator Next/Prev instead of bool+outparam
rainsupreme
committed
fbtree: share range descent between delete and count; pipeline ZCOUNT leaf searches
rainsupreme
committed
fbtree: fix iterator state not cleared after seek, dropping rank-0 reverse results
rainsupreme
committed
fbtree: implement orderedIndexGetHeight via fbtreeHeight
rainsupreme
committed
fbtree: avoid re-seek in seekForBound boundary adjustment
rainsupreme
committed
tests: fold feature-search tests into test_fbtree.cpp
rainsupreme
committed

Commits on Jul 20, 2026