1 files changed, 131 insertions, 0 deletions
diff --git a/examples/widgets/itemviews/editabletreemodel/treeitem.py b/examples/widgets/itemviews/editabletreemodel/treeitem.py
new file mode 100644
index 000000000..0f761b199
--- /dev/null
+++ b/examples/widgets/itemviews/editabletreemodel/treeitem.py
@@ -0,0 +1,131 @@
+#############################################################################
+##
+## Copyright (C) 2022 The Qt Company Ltd.
+## Contact: http://www.qt.io/licensing/
+##
+## This file is part of the Qt for Python examples of the Qt Toolkit.
+##
+## $QT_BEGIN_LICENSE:BSD$
+## You may use this file under the terms of the BSD license as follows:
+##
+## "Redistribution and use in source and binary forms, with or without
+## modification, are permitted provided that the following conditions are
+## met:
+##   * Redistributions of source code must retain the above copyright
+##     notice, this list of conditions and the following disclaimer.
+##   * Redistributions in binary form must reproduce the above copyright
+##     notice, this list of conditions and the following disclaimer in
+##     the documentation and/or other materials provided with the
+##     distribution.
+##   * Neither the name of The Qt Company Ltd nor the names of its
+##     contributors may be used to endorse or promote products derived
+##     from this software without specific prior written permission.
+##
+##
+## THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+## "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+## LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+## A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+## OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+## SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+## LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+## DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+## THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+## (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+## OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
+##
+## $QT_END_LICENSE$
+##
+#############################################################################
+
+
+class TreeItem:
+    def __init__(self, data: list, parent: 'TreeItem' = None):
+        self.item_data = data
+        self.parent_item = parent
+        self.child_items = []
+
+    def child(self, number: int) -> 'TreeItem':
+        if number < 0 or number >= len(self.child_items):
+            return None
+        return self.child_items[number]
+
+    def last_child(self):
+        return self.child_items[-1] if self.child_items else None
+
+    def child_count(self) -> int:
+        return len(self.child_items)
+
+    def child_number(self) -> int:
+        if self.parent_item:
+            return self.parent_item.child_items.index(self)
+        return 0
+
+    def column_count(self) -> int:
+        return len(self.item_data)
+
+    def data(self, column: int):
+        if column < 0 or column >= len(self.item_data):
+            return None
+        return self.item_data[column]
+
+    def insert_children(self, position: int, count: int, columns: int) -> bool:
+        if position < 0 or position > len(self.child_items):
+            return False
+
+        for row in range(count):
+            data = [None] * columns
+            item = TreeItem(data.copy(), self)
+            self.child_items.insert(position, item)
+
+        return True
+
+    def insert_columns(self, position: int, columns: int) -> bool:
+        if position < 0 or position > len(self.item_data):
+            return False
+
+        for column in range(columns):
+            self.item_data.insert(position, None)
+
+        for child in self.child_items:
+            child.insert_columns(position, columns)
+
+        return True
+
+    def parent(self):
+        return self.parent_item
+
+    def remove_children(self, position: int, count: int) -> bool:
+        if position < 0 or position + count > len(self.child_items):
+            return False
+
+        for row in range(count):
+            self.child_items.pop(position)
+
+        return True
+
+    def remove_columns(self, position: int, columns: int) -> bool:
+        if position < 0 or position + columns > len(self.item_data):
+            return False
+
+        for column in range(columns):
+            self.item_data.pop(position)
+
+        for child in self.child_items:
+            child.remove_columns(position, columns)
+
+        return True
+
+    def set_data(self, column: int, value):
+        if column < 0 or column >= len(self.item_data):
+            return False
+
+        self.item_data[column] = value
+        return True
+
+    def __repr__(self) -> str:
+        result = f"<treeitem.TreeItem at 0x{id(self):x}"
+        for d in self.item_data:
+            result += f' "{d}"' if d else " <None>"
+        result += f", {len(self.child_items)} children>"
+        return result