mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-02-07 01:50:55 +00:00
4fe50bc1fc
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.8.6 → v0.9.1](https://github.com/astral-sh/ruff-pre-commit/compare/v0.8.6...v0.9.1) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update maths/dual_number_automatic_differentiation.py * Update maths/dual_number_automatic_differentiation.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update dual_number_automatic_differentiation.py * Update dual_number_automatic_differentiation.py * No <fin-streamer> tag with the specified data-test attribute found. --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.com>
60 lines
2.1 KiB
Python
60 lines
2.1 KiB
Python
# Created by: Ramy-Badr-Ahmed (https://github.com/Ramy-Badr-Ahmed)
|
|
# in Pull Request: #11554
|
|
# https://github.com/TheAlgorithms/Python/pull/11554
|
|
#
|
|
# Please mention me (@Ramy-Badr-Ahmed) in any issue or pull request
|
|
# addressing bugs/corrections to this file.
|
|
# Thank you!
|
|
|
|
import unittest
|
|
|
|
from data_structures.suffix_tree.suffix_tree import SuffixTree
|
|
|
|
|
|
class TestSuffixTree(unittest.TestCase):
|
|
def setUp(self) -> None:
|
|
"""Set up the initial conditions for each test."""
|
|
self.text = "banana"
|
|
self.suffix_tree = SuffixTree(self.text)
|
|
|
|
def test_search_existing_patterns(self) -> None:
|
|
"""Test searching for patterns that exist in the suffix tree."""
|
|
patterns = ["ana", "ban", "na"]
|
|
for pattern in patterns:
|
|
with self.subTest(pattern=pattern):
|
|
assert self.suffix_tree.search(pattern), (
|
|
f"Pattern '{pattern}' should be found."
|
|
)
|
|
|
|
def test_search_non_existing_patterns(self) -> None:
|
|
"""Test searching for patterns that do not exist in the suffix tree."""
|
|
patterns = ["xyz", "apple", "cat"]
|
|
for pattern in patterns:
|
|
with self.subTest(pattern=pattern):
|
|
assert not self.suffix_tree.search(pattern), (
|
|
f"Pattern '{pattern}' should not be found."
|
|
)
|
|
|
|
def test_search_empty_pattern(self) -> None:
|
|
"""Test searching for an empty pattern."""
|
|
assert self.suffix_tree.search(""), "An empty pattern should be found."
|
|
|
|
def test_search_full_text(self) -> None:
|
|
"""Test searching for the full text."""
|
|
assert self.suffix_tree.search(self.text), (
|
|
"The full text should be found in the suffix tree."
|
|
)
|
|
|
|
def test_search_substrings(self) -> None:
|
|
"""Test searching for substrings of the full text."""
|
|
substrings = ["ban", "ana", "a", "na"]
|
|
for substring in substrings:
|
|
with self.subTest(substring=substring):
|
|
assert self.suffix_tree.search(substring), (
|
|
f"Substring '{substring}' should be found."
|
|
)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
unittest.main()
|