| __eq__(self, object other) | MemoryHierarchy | |
| __init__(self, OperationalArrayABC operational_array, str name="Memory Hierarchy", **Any attr) | MemoryHierarchy | |
| __jsonrepr__(self) | MemoryHierarchy | |
| add_edge(self, T edge_from, T edge_to) | DiGraphWrapper | |
| add_edges_from(self, Sequence[tuple[T, T]|tuple[T, T, Any]] edges) | DiGraphWrapper | |
| add_memory(self, MemoryInstance memory_instance, list[MemoryOperand] operands, PortAllocation port_alloc, ServedMemDimensions served_dimensions) | MemoryHierarchy | |
| add_node(self, T node) | DiGraphWrapper | |
| add_nodes_from(self, Sequence[T] node) | DiGraphWrapper | |
| all_simple_paths(self, T producer, T consumer) | DiGraphWrapper | |
| get_inner_memories(self) | MemoryHierarchy | |
| get_memory_levels(self, MemoryOperand mem_op) | MemoryHierarchy | |
| get_node_with_id(self, int node_id) | DiGraphWrapper | |
| get_operand_top_level(self, MemoryOperand operand) | MemoryHierarchy | |
| get_operands(self) | MemoryHierarchy | |
| get_operator_top_level(self, MemoryOperand operand) | MemoryHierarchy | |
| get_outer_memories(self) | MemoryHierarchy | |
| get_top_memories(self) | MemoryHierarchy | |
| has_same_performance(self, "MemoryHierarchy" other) | MemoryHierarchy | |
| in_degree(self) | DiGraphWrapper | |
| in_edges(self, T node, Literal[False] data) | DiGraphWrapper | |
| in_edges(self, T node, Literal[True] data) | DiGraphWrapper | |
| in_edges(self, T node) | DiGraphWrapper | |
| in_edges(self, T node, bool data=False) | DiGraphWrapper | |
| memory_level_id | MemoryHierarchy | |
| name | MemoryHierarchy | |
| nb_levels | MemoryHierarchy | |
| node_list(self) | DiGraphWrapper | |
| operational_array | MemoryHierarchy | |
| out_degree(self, Literal[None] node) | DiGraphWrapper | |
| out_degree(self) | DiGraphWrapper | |
| out_degree(self, T node) | DiGraphWrapper | |
| out_degree(self, T|None node=None) | DiGraphWrapper | |
| out_edges(self, T node, Literal[True] data) | DiGraphWrapper | |
| out_edges(self, T node, Literal[False] data) | DiGraphWrapper | |
| out_edges(self, T node) | DiGraphWrapper | |
| out_edges(self, T node, bool data=False) | DiGraphWrapper | |
| predecessors(self, T node) | DiGraphWrapper | |
| remove_nodes_from(self, Iterator[T] nodes) | DiGraphWrapper | |
| shortest_path(self, T producer, T consumer) | DiGraphWrapper | |
| successors(self, T node) | DiGraphWrapper | |
| topological_sort(self) | DiGraphWrapper | |
1.9.1