mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 15:01:08 +00:00
976e385c1d
* Implemented KD-Tree Data Structure * Implemented KD-Tree Data Structure. updated DIRECTORY.md. * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Create __init__.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Replaced legacy `np.random.rand` call with `np.random.Generator` in kd_tree/example_usage.py * Replaced legacy `np.random.rand` call with `np.random.Generator` in kd_tree/hypercube_points.py * added typehints and docstrings * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * docstring for search() * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Added tests. Updated docstrings/typehints * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * updated tests and used | for type annotations * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * E501 for build_kdtree.py, hypercube_points.py, nearest_neighbour_search.py * I001 for example_usage.py and test_kdtree.py * I001 for example_usage.py and test_kdtree.py * Update data_structures/kd_tree/build_kdtree.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update data_structures/kd_tree/example/hypercube_points.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update data_structures/kd_tree/example/hypercube_points.py Co-authored-by: Christian Clauss <cclauss@me.com> * Added new test cases requested in Review. Refactored the test_build_kdtree() to include various checks. * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Considered ruff errors * Considered ruff errors * Apply suggestions from code review * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update kd_node.py * imported annotations from __future__ * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Implementation of the suffix tree data structure * Adding data to DIRECTORY.md * Minor file renaming * minor correction * renaming in DIRECTORY.md * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Considering ruff part-1 * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Considering ruff part-2 * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Considering ruff part-3 * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Considering ruff part-4 * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Considering ruff part-5 * Implemented Suffix Tree Data Structure. Added some comments to my files in #11532, #11554. * updating DIRECTORY.md * Implemented Suffix Tree Data Structure. Added some comments to my files in #11532, #11554. --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: Ramy-Badr-Ahmed <Ramy-Badr-Ahmed@users.noreply.github.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()
|