affix-tree

Name	affix-tree JSON
Version	0.1.1 JSON
	download
home_page	https://github.com/ean-db/affix-tree
Summary	A trie-like data structure that allows storing and searching data based on the longest matching prefix or suffix of a given string.
upload_time	2025-02-15 09:15:09
maintainer	None
docs_url	None
author	EAN-DB
requires_python	>=3.12
license	MIT
keywords	trie suffix tree prefix tree
VCS
bugtrack_url
requirements	No requirements were recorded.
Travis-CI	No Travis.
coveralls test coverage	No coveralls.

            # affix-tree

A trie-like data structure that allows storing and searching data based on the longest matching
prefix or suffix of a given string.

## Installation

```commandline
pip install affix-tree
```

## Usage

### As a prefix tree

```pycon
>>> from affix_tree import AffixTree

>>> prefix_tree: AffixTree[int] = AffixTree()
>>> prefix_tree.add('prefix', 1)
>>> prefix_tree.add('prefix-2', 2)

>>> prefix_tree.find('prefix-2-test')

2
```

### As a suffix tree

```pycon
>>> from affix_tree import AffixTree

>>> prefix_tree: AffixTree[int] = AffixTree(is_suffix_tree=True)
>>> prefix_tree.add('suffix', 1)
>>> prefix_tree.add('2-suffix', 2)

>>> prefix_tree.find('test-2-suffix')

2
```

            

Raw data

            {
    "_id": null,
    "home_page": "https://github.com/ean-db/affix-tree",
    "name": "affix-tree",
    "maintainer": null,
    "docs_url": null,
    "requires_python": ">=3.12",
    "maintainer_email": null,
    "keywords": "trie, suffix tree, prefix tree",
    "author": "EAN-DB",
    "author_email": "support@ean-db.com",
    "download_url": "https://files.pythonhosted.org/packages/8c/dc/cfb1bbaca4bed1221afd1bd80c645f944248b502d2b13cc61e362f0a98bf/affix_tree-0.1.1.tar.gz",
    "platform": null,
    "description": "# affix-tree\n\nA trie-like data structure that allows storing and searching data based on the longest matching\nprefix or suffix of a given string.\n\n## Installation\n\n```commandline\npip install affix-tree\n```\n\n## Usage\n\n### As a prefix tree\n\n```pycon\n>>> from affix_tree import AffixTree\n\n>>> prefix_tree: AffixTree[int] = AffixTree()\n>>> prefix_tree.add('prefix', 1)\n>>> prefix_tree.add('prefix-2', 2)\n\n>>> prefix_tree.find('prefix-2-test')\n\n2\n```\n\n### As a suffix tree\n\n```pycon\n>>> from affix_tree import AffixTree\n\n>>> prefix_tree: AffixTree[int] = AffixTree(is_suffix_tree=True)\n>>> prefix_tree.add('suffix', 1)\n>>> prefix_tree.add('2-suffix', 2)\n\n>>> prefix_tree.find('test-2-suffix')\n\n2\n```\n",
    "bugtrack_url": null,
    "license": "MIT",
    "summary": "A trie-like data structure that allows storing and searching data based on the longest matching prefix or suffix of a given string.",
    "version": "0.1.1",
    "project_urls": {
        "Homepage": "https://github.com/ean-db/affix-tree",
        "Repository": "https://github.com/ean-db/affix-tree"
    },
    "split_keywords": [
        "trie",
        " suffix tree",
        " prefix tree"
    ],
    "urls": [
        {
            "comment_text": "",
            "digests": {
                "blake2b_256": "6ac6c566de2487c5b2c4ec2649f956e0a26e044d8ad45f5abe3322ec186d058a",
                "md5": "fc46a04598e2a45c16fe13ecaff6742f",
                "sha256": "4f076d0a0d2739c406e9eff41cec7042359cc1201b17dea6d10461c9c5ffd218"
            },
            "downloads": -1,
            "filename": "affix_tree-0.1.1-py3-none-any.whl",
            "has_sig": false,
            "md5_digest": "fc46a04598e2a45c16fe13ecaff6742f",
            "packagetype": "bdist_wheel",
            "python_version": "py3",
            "requires_python": ">=3.12",
            "size": 2312,
            "upload_time": "2025-02-15T09:15:07",
            "upload_time_iso_8601": "2025-02-15T09:15:07.858174Z",
            "url": "https://files.pythonhosted.org/packages/6a/c6/c566de2487c5b2c4ec2649f956e0a26e044d8ad45f5abe3322ec186d058a/affix_tree-0.1.1-py3-none-any.whl",
            "yanked": false,
            "yanked_reason": null
        },
        {
            "comment_text": "",
            "digests": {
                "blake2b_256": "8cdccfb1bbaca4bed1221afd1bd80c645f944248b502d2b13cc61e362f0a98bf",
                "md5": "baee032824689f0463a55aaffcf1f7e0",
                "sha256": "cb547ba6983bf9ca2e4c0c78ade30ea6ff8bdad66dacbe4d3b9610731c74bcf1"
            },
            "downloads": -1,
            "filename": "affix_tree-0.1.1.tar.gz",
            "has_sig": false,
            "md5_digest": "baee032824689f0463a55aaffcf1f7e0",
            "packagetype": "sdist",
            "python_version": "source",
            "requires_python": ">=3.12",
            "size": 1778,
            "upload_time": "2025-02-15T09:15:09",
            "upload_time_iso_8601": "2025-02-15T09:15:09.417260Z",
            "url": "https://files.pythonhosted.org/packages/8c/dc/cfb1bbaca4bed1221afd1bd80c645f944248b502d2b13cc61e362f0a98bf/affix_tree-0.1.1.tar.gz",
            "yanked": false,
            "yanked_reason": null
        }
    ],
    "upload_time": "2025-02-15 09:15:09",
    "github": true,
    "gitlab": false,
    "bitbucket": false,
    "codeberg": false,
    "github_user": "ean-db",
    "github_project": "affix-tree",
    "travis_ci": false,
    "coveralls": false,
    "github_actions": true,
    "lcname": "affix-tree"
}