refactor(bindx): decompose store internals (memoized reachability → RelationStore split)#49

Open

matej21 wants to merge 21 commits into

mainfrom

refactor/relationstore-decomposition

Commits on Jul 2, 2026

perf(bindx): memoize reachability walk via sub-store mutation counters

matej21
and
claude
committed
test(bindx): cover reachability memoization cache hit/invalidation

matej21
and
claude
committed
refactor(bindx): centralize temp-id rekey in RekeyOrchestrator

matej21
and
claude
committed
test(bindx): cover RekeyOrchestrator resolution and ordering contract

matej21
and
claude
committed
feat(bindx): add pessimistic presentation primitive (inert)

matej21
and
claude
committed
test(bindx): cover the pessimistic presentation primitive

matej21
and
claude
committed
refactor(bindx): route handle display reads through presentation

matej21
and
claude
committed
refactor(bindx): delete pessimistic mutate-restore dance

matej21
and
claude
committed
test(bindx): pin parent-notification behavior before childToParents rework

matej21
and
claude
committed
refactor(bindx): make RelationStore authoritative for has-one

matej21
and
claude
committed
refactor(bindx): derive parent notification from relation edges; remove childToParents

matej21
and
claude
committed
refactor(bindx): collapse has-many planned-addition sets into one map

matej21
and
claude
committed
refactor(bindx): decompose RelationStore into composed HasOneStore + HasManyStore

matej21
and
claude
committed
fix(bindx): make has-one refetch baseline advance non-notifying

matej21
and
claude
committed
fix(bindx): guard connectExistingToHasMany against duplicate ordered id

matej21
and
claude
committed
test(bindx): pin reachability cache invalidation for has-one edges

matej21
and
claude
committed
docs(bindx): document bare-id contract of getParentKeysForChild

matej21
and
claude
committed
perf(bindx): back relation queries with a bidirectional edge index

matej21
and
claude
committed
test(bindx): cover the relation edge index

matej21
and
claude
committed
fix(bindx): handle null has-one refetch presentation
matej21
committed
fix(bindx): present pessimistic relation baselines
matej21
committed

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

refactor(bindx): decompose store internals (memoized reachability → RelationStore split)#49

refactor(bindx): decompose store internals (memoized reachability → RelationStore split)#49
matej21 wants to merge 21 commits into
mainfrom
refactor/relationstore-decomposition

Commits on Jul 2, 2026

perf(bindx): memoize reachability walk via sub-store mutation counters

test(bindx): cover reachability memoization cache hit/invalidation

refactor(bindx): centralize temp-id rekey in RekeyOrchestrator

test(bindx): cover RekeyOrchestrator resolution and ordering contract

feat(bindx): add pessimistic presentation primitive (inert)

test(bindx): cover the pessimistic presentation primitive

refactor(bindx): route handle display reads through presentation

refactor(bindx): delete pessimistic mutate-restore dance

test(bindx): pin parent-notification behavior before childToParents rework

refactor(bindx): make RelationStore authoritative for has-one

refactor(bindx): derive parent notification from relation edges; remove childToParents

refactor(bindx): collapse has-many planned-addition sets into one map

refactor(bindx): decompose RelationStore into composed HasOneStore + HasManyStore

fix(bindx): make has-one refetch baseline advance non-notifying

fix(bindx): guard connectExistingToHasMany against duplicate ordered id

test(bindx): pin reachability cache invalidation for has-one edges

docs(bindx): document bare-id contract of getParentKeysForChild

perf(bindx): back relation queries with a bidirectional edge index

test(bindx): cover the relation edge index

fix(bindx): handle null has-one refetch presentation

fix(bindx): present pessimistic relation baselines