Search and locate to_search := eval_tree[path_to_search].encode in
root_eval:=eval_tree[vec![]].encode (=whole_term.encode(ctx)) such that the match
corresponds to path_to_search (when to_search occurs multiple times). Also returns
a boolean flag envcountered_get_symbol indicating whether a get symbol is between the root and
the path_to_search, in which case, inconsistencies might occur.
Goal: locate byte position of to_search := eval_tree[path_to_search].encode in
root_eval:=eval_tree[vec![]].encode (=whole_term.encode(ctx)) by traversing eval_tree
until reaching node at pat_to_search. Assumptions:
Operate the payloads replacements in eval_tree.encode[vec![]] and returns the modified
bitstring by “splicing”. @payloads follows this order: deeper terms first, left-to-right,
assuming no overlap (no two terms one being a sub-term of the other).