Skip to main content

Module scan

Module scan 

Source

StructsΒ§

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.

EnumsΒ§

Resolved πŸ”’
What dereferencing one candidate’s identity proved.

ConstantsΒ§

MAX_SHORT πŸ”’
Exclusive upper bound on verifiable short ids.

FunctionsΒ§

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.

Type AliasesΒ§

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.