Function result of appending y to xs

append y to the end of xs

Format:

result of appending y to xs

Input:

Output:

Properties that reference this function:

Conditional properties that reference this function:

• if the following are true:
  • Expression Stack at time t = [ [ ], [ [ Python list elements, ys ], rest ] ]
  • Value Stack at time t = [ values, [ next_level, other_levels ] ]

  then Python Object Store at time (t + 1) = result of appending (Python list (reverse of values)) to (Python Object Store at time t)

  (link)
• if the following are true:
  • Expression Stack at time t = [ [ ], [ [ obj.append(x), ys ], rest ] ]
  • Value Stack at time t = [ [ value, [ ] ], [ next_level, other_levels ] ]
  • value at obj in map (Variables Map at time t) = Python reference idx
  • the element at index idx of stack (Python Object Store at time t) = Python list entries

  then Python Object Store at time (t + 1) = result of storing (Python list (result of appending value to entries)) at index idx of stack (Python Object Store at time t)

  (link)
• if the following are true:
  • Expression Stack at time t = [ [ ], [ [ Python dictionary entries, ys ], rest ] ]
  • Value Stack at time t = [ values, [ next_level, other_levels ] ]

  then Python Object Store at time (t + 1) = result of appending (Python dictionary (reverse of values)) to (Python Object Store at time t)

  (link)
• if the following are true:
  • Expression Stack at time t = [ [ ], [ [ Python constructor with name: class_name and arguments: args, ys ], rest ] ]
  • Function Variables Map at time t = [ ]
  • Parameters List at time t = [ self, p_rest ]

  then Python Object Store at time (t + 1) = result of appending (Python object: [ entry "__class_name__": class_name, [ ] ]) to (Python Object Store at time t)

  (link)
• if the following are true:
  • expression state at time t = "call_function_begin"
  • Value Stack at time t = [ values, stack ]
  • the expression at time t = Python list elements

  then Python Object Store at time (t + 1) = result of appending (Python list (reverse of values)) to (Python Object Store at time t)

  (link)
• if the following are true:
  • expression state at time t = "call_function_begin"
  • Value Stack at time t = [ [ value, [ ] ], stack ]
  • the expression at time t = obj.append(x)
  • value at obj in map (Variables Map at time t) = Python reference idx
  • the element at index idx of stack (Python Object Store at time t) = Python list entries

  then Python Object Store at time (t + 1) = result of storing (Python list (result of appending value to entries)) at index idx of stack (Python Object Store at time t)

  (link)
• if the following are true:
  • expression state at time t = "call_function_begin"
  • Value Stack at time t = [ values, stack ]
  • the expression at time t = Python dictionary elements

  then Python Object Store at time (t + 1) = result of appending (Python dictionary (reverse of values)) to (Python Object Store at time t)

  (link)
• if the following are true:
  • expression state at time t = "call_build_args"
  • the expression at time t = Python constructor with name: class_name and arguments: args
  • Function Variables Map at time t = [ ]
  • Parameters List at time t = [ self, p_rest ]

  then Python Object Store at time (t + 1) = result of appending (Python object: [ entry "__class_name__": class_name, [ ] ]) to (Python Object Store at time t)

  (link)
• if the following are true:
  • val < a
  • the element at index i of stack tree = node (a, (-1), right)

  then output of the bst_insert function where input tree is tree, value is val and index is i = result of storing (node (a, (length of stack tree), right)) at index i of stack (result of appending (node (val, (-1), (-1))) to tree)

  (link)
• if the following are true:
  • val > a
  • the element at index i of stack tree = node (a, left, (-1))

  then output of the bst_insert function where input tree is tree, value is val and index is i = result of storing (node (a, left, (length of stack tree))) at index i of stack (result of appending (node (val, (-1), (-1))) to tree)

  (link)

Comments

Please log in to add comments