hex.tables.clean_table_entry__table (arity 3)¶
@Assumes: n must be a power of 2, and it must be (1<<n)-padded.
A table. When jumping to entry d - it xors d into dst, and jumps to ret.
n is a size-constant, dst/ret are hexes.
Signature¶
def clean_table_entry__table n, dst, ret @ clean { ... }
Defined in hex/tables_init.fj — lines 42–47 (view on GitHub).
Complexity¶
Time:
log(n) / 2 (an overage over all entries, of jumping to an entry in this table)Space:
n
See the complexity glossary for what @, w, dw, dbit, n mean.