Helper function to add 'value' to the table.

Return a deep copy of the current board.

Return the children of the node. Initially the children are raw data, but later they too are converted to Node_Base by the Memory_vi

Set the 'add_new_line_flag' to add a new line to the table when adding the next table element.

Return the id of the node.

Helper function to add dots to the table.

Helper function to get locals of the stack with 'stack_inex' of the call stack.

Add child to the table either as reference if it is a Node_Base or as a value otherwise.

Return the type of the data represented by the node.

Return if the node is a hidden node in the graph.

Renders the graph of 'data' to 'outfile' or `memory_graph.render_filename` when not specified.

Returns a slice of the call stack. Parameters: begin_functions - list of (function-name, offset), begins at the index of the first

Return the original data represented by the node.

Return a unique name for the node.

Return the name of the type of the data represented by the node.

Check if a new line should be added to the table, and if so add it and sets the 'add_new_line_flag' to False.

Filter out the jupyter specific keys that polute the graph.

Returns a dictionary representing the data on the call stack. Each key is the stack level and function name, each value is the locals of the fra

Construct the HTML table string with the 'border' and 'color' settings.

Go over each parent of 'node_id', and add each missing index to each if it is missing. Don't add more than 'max_missing_edges' for each type

Filter out the colab specific keys that polute the graph.

Generate all possible child boards from the current board by sliding each possible tile into the empty space.

Escape HTML characters in 's' for safe display in the graph.

Helper function to add the HTML table frame to the string s setting the 'border' and 'color'.

Filter out the ipython specific keys that polute the graph.

Returns 'True' if 'obj' is not considered state, e.g. a function or method.

Filter out the marimo specific keys that polute the graph.

Replace newlines in 's' with <BR/> tags for HTML display.

Returns the index of stack_functions that matches the first name in 'begin_functions' and adds corresponding 'offset'.

Returns the index starting from 'begin_index' of stack_functions that matches the first name in end_functions.

Recursively build the decision tree. Args: data: Subset of training data for this node Returns:

Find the best split point using information gain or similar metric. Args: data: Training data subset

Calculate information gain of a split. Args: parent: Parent dataset left: Left child dataset righ

Recursively traverse tree to make prediction.

Add missing edges to each visible node in the graph by addding slices to 'id_to_slices'. It either shows all edges to a node, or uses dashed edge

Add a parent to the node.

Add missing edges in 'type_to_parent_indices' to each parent. If the parent wasn't visible before, recursively add missing edges to its paren

Helper function to add a reference to the table.

Adds a subgraph to 'graphviz_graph' for 'nodes_to_subgraph'.

Adds 'node' to 'graphviz_graph' with its children and edges.