Skip to main contentModule scan
Source - Counts π
- Counts the statediff walk accumulates.
- Diffs π
- Statediff walk context: the bitmaps each rowβs entries are tested
against.
- Family π
- One familyβs residue: its losers, their winners, the rows a heal pass
completes, and the counts that impugn the scan.
- Notification π
- The
sroomid field of a stored notification value. - Scan π
- Everything one scan measured, and the worklists the repair consumes.
- Resolved π
- What dereferencing one candidateβs identity proved.
- MAX_SHORT π
- Exclusive upper bound on verifiable short ids.
- any_unclaimed π
- Whether any reverse keyβs short id went unclaimed by a forward value.
- bits_of π
- by_identity π
- by_short π
- candidate_identity π
- candidate_short π
- contenders π
- Counts candidates contending for a slot another candidate already
claims.
- dangling_winners π
- Streams a forward map against the reverse bitmap for dangling winners.
- diffs π
- Folds every statediff row through the walk, its parent keyset first.
- disposable π
- family π
- Scans one family in two passes, and a third only where the bitmaps
disagree.
- get_bit π
- loser_candidates π
- Collects reverse keys no forward value claims.
- pdu_shortroomid π
- Extracts the shortroomid of a pdu id sitting behind a separator.
- references π
- resolution π
- resolve π
- Dereferences each candidateβs identity to split losers from winners.
- reverse_bitmap π
- Streams a reverse map into its keyset bitmap, its row count, and its
count of keys that are not an 8-byte short id.
- scan π
- Measures short id injectivity across both families.
- set_bit π
- short_of π
- strays π
- Counts shortroomid references with no forward row.
- sweep π
- Reads the deeper indexes once a loser exists in either family.
- Bits π
- Bitmap over the short id space, one bit per id up to the global counter.
- Candidate π
- One short id paired with the identity its row names.
- Candidates π
- Reverse rows no forward value claims, paired with the identities they
name.
- Identity π
- Owned copy of a reverse-map identity, used to dereference a loser.
- Relations π
- The
relatesto_typed rows to rewrite, each with its stale child value. - Resolution π
- One familyβs resolution: losers, the winner each maps to, the rows a
promotion can heal, and the count the dereference could not settle.