43e5f428af
* Update KVT layers abstraction details: modelled after Aristo layers * Simplified KVT database iterators (removed item counters) why: Not needed for production functions * Simplify KVT merge function `layersCc()` * Simplified Aristo database iterators (removed item counters) why: Not needed for production functions * Update failure condition for hash labels compiler `hashify()` why: Node need not be rejected as long as links are on the schedule. In that case, `redo[]` is to become `wff.base[]` at a later stage. * Update merging layers and label update functions why: + Merging a stack of layers with `layersCc()` could be simplified + Merging layers will optimise the reverse `kMap[]` table maps `pAmk: label->{vid, ..}` by deleting empty mappings `label->{}` where they are redundant. + Updated `layersPutLabel()` for optimising `pAmk[]` tables |
||
---|---|---|
.. | ||
kvt_desc | ||
kvt_init | ||
kvt_walk | ||
kvt_constants.nim | ||
kvt_debug.nim | ||
kvt_desc.nim | ||
kvt_init.nim | ||
kvt_layers.nim | ||
kvt_persistent.nim | ||
kvt_tx.nim | ||
kvt_utils.nim | ||
kvt_walk.nim |