[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Theorem shift-left

btree_io_shift_left#(POSITION, R; ZH) {let N = POSITION in while N + 1 < ZH[R].usedsize do ZH[R].zbranches[N] := ZH[R].zbranches[N + 1], N := N + 1}