Function result of dumping y to x

result of dumping y to x

Format:

result of dumping y to x

Input:

list x -

list y -

Output:

list - None

Properties that reference this function:

reverse of s = result of dumping s to [ ] (Reverse by Dumping)

result of dumping [ y, ys ] to xs = result of dumping ys to [ y, xs ] (Push Stack)

result of dumping [ y, [ ] ] to xs = [ y, xs ] (Push Stack (2))

result of dumping [ ] to xs = xs (Push Stack (3))

result of appending y to xs = result of dumping (result of dumping xs to [ ]) to [ y, [ ] ] (Appending to a Stack)

remaining elements after [ x, xs ] is popped at index [ 0, [ ] ] and visited stack is ys = result of dumping xs to ys (Pop Index (2))

remaining elements after [ x, xs ] is popped at index 0 and visited stack is ys = reverse of (result of dumping xs to ys) (Pop Index End)

remaining elements after [ x, xs ] is popped at index 0 and visited stack is ys = result of dumping ys to xs (Pop Index End Alternate)

stack after popping a value from stack [ x, xs ] at index 0 in traversed elements: result = result of dumping xs to result (Pop At List End)

set index 0 of remaining stack [ x, rest ] to value with visited : visited = result of dumping [ value, visited ] to rest (Set element end)

output of function store_compute where input key is key, value is value, map is [ ], and processed map is kvs = result of dumping kvs to [ entry key: value, [ ] ] (Set Key Value Add Dump)

Conditional properties that reference this function:

if entry_key = key, then output of function store_compute where input key is key, value is value, map is [ entry entry_key: entry_value, remaining ], and processed map is kvs = result of dumping kvs to [ entry key: value, remaining ]
(link)
if entry_key = key, then output of function delete_entry where input key is key, map is [ pair (entry_key, value), remaining ], and processed is kvs = result of dumping kvs to remaining
(link)
if the following are true:
- children of the node top in graph graph = children
- elements of children that are not in tree tree = new_elements
- nodes with values new_elements and parent top = final_elems
- result of dumping final_elems to rest = new_stack
then output of the build_dft_tree function where input graph is graph, tree is tree, and neighbor stack is [ node (top, parent), rest ] = output of the build_dft_tree function where input graph is graph, tree is [ node (top, parent), tree ], and neighbor stack is new_stack
(link)

Comments

Please log in to add comments