# ==================================================================================================================== #
#             _____           _ _             _____                                                                    #
#  _ __  _   |_   _|__   ___ | (_)_ __   __ _|_   _| __ ___  ___                                                       #
# | '_ \| | | || |/ _ \ / _ \| | | '_ \ / _` | | || '__/ _ \/ _ \                                                      #
# | |_) | |_| || | (_) | (_) | | | | | | (_| |_| || | |  __/  __/                                                      #
# | .__/ \__, ||_|\___/ \___/|_|_|_| |_|\__, (_)_||_|  \___|\___|                                                      #
# |_|    |___/                          |___/                                                                          #
# ==================================================================================================================== #
# Authors:                                                                                                             #
#   Patrick Lehmann                                                                                                    #
#                                                                                                                      #
# License:                                                                                                             #
# ==================================================================================================================== #
# Copyright 2017-2025 Patrick Lehmann - Bötzingen, Germany                                                             #
#                                                                                                                      #
# Licensed under the Apache License, Version 2.0 (the "License");                                                      #
# you may not use this file except in compliance with the License.                                                     #
# You may obtain a copy of the License at                                                                              #
#                                                                                                                      #
#   http://www.apache.org/licenses/LICENSE-2.0                                                                         #
#                                                                                                                      #
# Unless required by applicable law or agreed to in writing, software                                                  #
# distributed under the License is distributed on an "AS IS" BASIS,                                                    #
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.                                             #
# See the License for the specific language governing permissions and                                                  #
# limitations under the License.                                                                                       #
#                                                                                                                      #
# SPDX-License-Identifier: Apache-2.0                                                                                  #
# ==================================================================================================================== #
#
"""Performance tests for pyTooling.Tree."""
from pyTooling.Tree import Node
from . import PerformanceTest


if __name__ == "__main__":  # pragma: no cover
	print("ERROR: you called a testcase declaration file as an executable module.")
	print("Use: 'python -m unittest <testcase module>'")
	exit(1)


class Tree(PerformanceTest):
	def test_AddChildren(self) -> None:
		def wrapper(count: int):
			def func():
				rootNode = Node(0)

				for i in range(1, count):
					rootNode.AddChild(Node(i))

			return func

		self.runTests(wrapper, self.counts)

	def test_SetParent(self) -> None:
		def wrapper(count: int):
			def func():
				rootNode = Node(0)

				for i in range(1, count):
					Node(i, parent=rootNode)

			return func

		self.runTests(wrapper, self.counts)

	def test_AddLongAncestorChain(self) -> None:
		def wrapper(count: int):
			def func():
				parentNode = Node(0)
				for i in range(1, count):
					parentNode = Node(i, parent=parentNode)

			return func

		self.runTests(wrapper, self.counts)

	def test_AddLongChildBranch(self) -> None:
		def wrapper(count: int):
			def func():
				parentNode = Node(0)
				for i in range(1, count):
					node = Node(i)
					parentNode.AddChild(node)
					parentNode = node

			return func

		self.runTests(wrapper, self.counts)

	def test_Path(self) -> None:
		def wrapper(count: int):
			def func():
				parentNode = Node(0)
				for i in range(1, count):
					parentNode = Node(i, parent=parentNode)

				leaf = parentNode
				_ = leaf.Path

			return func

		self.runTests(wrapper, self.counts)

	def test_GetPath(self) -> None:
		def wrapper(count: int):
			def func():
				parentNode = Node(0)
				for i in range(1, count):
					parentNode = Node(i, parent=parentNode)

				leaf = parentNode
				_ = [node for node in leaf.GetPath()]

			return func

		self.runTests(wrapper, self.counts)

	def test_AddFlatTree(self) -> None:
		def run(count: int):
			def func():
				trees = []
				for i in range(1, 10):
					parentNode = Node(count * i)
					for j in range(1, count):
						_ = Node(count * i + j, parent=parentNode)

					trees.append(parentNode)

				rootNode = Node(0)
				rootNode.AddChildren(trees)

			return func

		self.runTests(run, self.counts[:-1])