grapheme
========
A Python package for working with user perceived characters. More specifically,
string manipulation and calculation functions for working with grapheme cluster
groups (graphemes) as defined by the `Unicode Standard Annex #29 <http://unicode.org/reports/tr29/>`_.
`documentation <https://grapheme.readthedocs.io/>`_
.. code-block:: console
pip install grapheme
The currently supported version of Unicode: 13.0.0.
What? Why?
==========
Unicode strings are made up of a series of unicode characters, but a unicode character does not
always map to a user perceived character. Some human perceived characters are represented as two
or more unicode characters.
However, all built in python string functions and string methods work with single unicode characters
without considering their connection to each other.
.. code-block:: python
>>> string = 'u̲n̲d̲e̲r̲l̲i̲n̲e̲d̲'
>>> len(string)
20
>>> grapheme.length(string)
10
>>> string[:3]
'u̲n'
>>> grapheme.substr(string, 0, 3)
'u̲n̲d̲'
This library implements the unicode default rules for extended grapheme clusters, and provides
a set of functions for string manipulation based on graphemes.
Documentation
=============
See `<https://grapheme.readthedocs.io/en/latest/>`_.
When should I consider graphemes instead of unicode characters?
===============================================================
You should consider working with graphemes over unicode code points when:
* You wish to count characters as perceived by users.
* You wish to split or truncate text at some user perceived lengths.
* You wish to split or truncate text without risk of corrupting the characters.
* Formatting text by length, such as creating text based tables in monospaced fonts
You should work with normal python string functions when:
* You wish to count or split by unicode codepoints for compliance with storage
limitations (such as database maximum length)
* When working with systems that put limits on strings by unicode character
lengths
* When you prioritize performance over correctness (see performance notes below)
* When working with very long strings (see performance notes below)
* If simplicity is more important than accuracy
Performance
===========
Calculating graphemes require traversing the string and checking each character
against a set of rules and the previous character(s). Because of this, all
functions in this module will scale linearly to the string length.
Whenever possible, they will only traverse the string for as long as needed and return
early as soon as the requested output is generated. For example, the `grapheme.slice`
function only has to traverse the string until the last requested grapheme is found, and
does not care about the rest of the string.
You should probably only use this package for testing/manipulating fairly short strings
or with the beginning of long strings.
When testing with a string of 10 000 ascii characters, and a 3.1 GHz processor, the execution
time for some possible calls is roughly:
================================================================ ==========================
Code Approximate execution time
================================================================ ==========================
`len(long_ascii_string)` 8.1e-10 seconds
`grapheme.length(long_ascii_string)` 1.5e-04 seconds
`grapheme.length(long_ascii_string, 500)` 8.7e-06 seconds
`long_ascii_string[0:100]` 1.3e-09 seconds
`grapheme.slice(long_ascii_string, 0, 100)` 2.5e-06 seconds
`long_ascii_string[:100] in long_ascii_string` 4.0e-09 seconds
`grapheme.contains(long_ascii_string, long_ascii_string[:100])` 3.9e-06 seconds
`long_ascii_string[-100:] in long_ascii_string` 2.1e-07 seconds
`grapheme.contains(long_ascii_string, long_ascii_string[-100:])` 1.9e-04 seconds
================================================================ ==========================
Execution times may improve in later releases, but calculating graphemes is and will continue
to be notably slower than just counting unicode code points.
Examples of grapheme cluster groups
===================================
This is not a complete list, but a some examples of when graphemes use multiple
characters:
* CR+LF
* Hangul (korean)
* Emoji with modifiers
* Combining marks
* Zero Width Join
Development quick start
=======================
If you wish to contribute or edit this package, create a fork and clone it.
Then install in locally editable (``-e``) mode and run the tests.
.. code-block:: console
pip install -e .[test]
py.test
Unicode version upgrade
-----------------------
The library will issue a new release for each new unicode version.
The steps necessary for this:
1. Verify that there has been no material changes to the rulesets in Unicode
`Annex #29 <http://unicode.org/reports/tr29/>`_ (see modifications).
2. Download the `data files <http://www.unicode.org/Public/>`_ from unicode into the unicode-data folder.
For the given version, some are in `ucd` and some are in `ucd/auxiliary`.
3. Run `make process-data-files` to parse those files (will update the
`grapheme_break_property.json` file).
4. Update the unicode version in the documentation and in the source code.
5. Bump the version.
Raw data
{
"_id": null,
"home_page": "https://github.com/alvinlindstam/grapheme",
"name": "grapheme",
"maintainer": "",
"docs_url": null,
"requires_python": "",
"maintainer_email": "",
"keywords": "",
"author": "Alvin Lindstam",
"author_email": "alvin.lindstam@gmail.com",
"download_url": "https://files.pythonhosted.org/packages/ce/e7/bbaab0d2a33e07c8278910c1d0d8d4f3781293dfbc70b5c38197159046bf/grapheme-0.6.0.tar.gz",
"platform": "",
"description": "grapheme\n========\n\nA Python package for working with user perceived characters. More specifically,\nstring manipulation and calculation functions for working with grapheme cluster\ngroups (graphemes) as defined by the `Unicode Standard Annex #29 <http://unicode.org/reports/tr29/>`_.\n\n`documentation <https://grapheme.readthedocs.io/>`_\n\n.. code-block:: console\n\n pip install grapheme\n\nThe currently supported version of Unicode: 13.0.0.\n\nWhat? Why?\n==========\n\nUnicode strings are made up of a series of unicode characters, but a unicode character does not\nalways map to a user perceived character. Some human perceived characters are represented as two\nor more unicode characters.\n\nHowever, all built in python string functions and string methods work with single unicode characters\nwithout considering their connection to each other.\n\n.. code-block:: python\n\n >>> string = 'u\u0332n\u0332d\u0332e\u0332r\u0332l\u0332i\u0332n\u0332e\u0332d\u0332'\n >>> len(string)\n 20\n >>> grapheme.length(string)\n 10\n >>> string[:3]\n 'u\u0332n'\n >>> grapheme.substr(string, 0, 3)\n 'u\u0332n\u0332d\u0332'\n\nThis library implements the unicode default rules for extended grapheme clusters, and provides\na set of functions for string manipulation based on graphemes.\n\nDocumentation\n=============\n\nSee `<https://grapheme.readthedocs.io/en/latest/>`_.\n\nWhen should I consider graphemes instead of unicode characters?\n===============================================================\n\nYou should consider working with graphemes over unicode code points when:\n\n* You wish to count characters as perceived by users.\n* You wish to split or truncate text at some user perceived lengths.\n* You wish to split or truncate text without risk of corrupting the characters.\n* Formatting text by length, such as creating text based tables in monospaced fonts\n\nYou should work with normal python string functions when:\n\n* You wish to count or split by unicode codepoints for compliance with storage\n limitations (such as database maximum length)\n* When working with systems that put limits on strings by unicode character\n lengths\n* When you prioritize performance over correctness (see performance notes below)\n* When working with very long strings (see performance notes below)\n* If simplicity is more important than accuracy\n\nPerformance\n===========\n\nCalculating graphemes require traversing the string and checking each character\nagainst a set of rules and the previous character(s). Because of this, all\nfunctions in this module will scale linearly to the string length.\n\nWhenever possible, they will only traverse the string for as long as needed and return\nearly as soon as the requested output is generated. For example, the `grapheme.slice`\nfunction only has to traverse the string until the last requested grapheme is found, and\ndoes not care about the rest of the string.\n\nYou should probably only use this package for testing/manipulating fairly short strings\nor with the beginning of long strings.\n\nWhen testing with a string of 10 000 ascii characters, and a 3.1 GHz processor, the execution\ntime for some possible calls is roughly:\n\n================================================================ ==========================\nCode Approximate execution time\n================================================================ ==========================\n`len(long_ascii_string)` 8.1e-10 seconds\n`grapheme.length(long_ascii_string)` 1.5e-04 seconds\n`grapheme.length(long_ascii_string, 500)` 8.7e-06 seconds\n`long_ascii_string[0:100]` 1.3e-09 seconds\n`grapheme.slice(long_ascii_string, 0, 100)` 2.5e-06 seconds\n`long_ascii_string[:100] in long_ascii_string` 4.0e-09 seconds\n`grapheme.contains(long_ascii_string, long_ascii_string[:100])` 3.9e-06 seconds\n`long_ascii_string[-100:] in long_ascii_string` 2.1e-07 seconds\n`grapheme.contains(long_ascii_string, long_ascii_string[-100:])` 1.9e-04 seconds\n================================================================ ==========================\n\nExecution times may improve in later releases, but calculating graphemes is and will continue\nto be notably slower than just counting unicode code points.\n\nExamples of grapheme cluster groups\n===================================\n\nThis is not a complete list, but a some examples of when graphemes use multiple\ncharacters:\n\n* CR+LF\n* Hangul (korean)\n* Emoji with modifiers\n* Combining marks\n* Zero Width Join\n\nDevelopment quick start\n=======================\n\nIf you wish to contribute or edit this package, create a fork and clone it.\n\nThen install in locally editable (``-e``) mode and run the tests.\n\n.. code-block:: console\n\n pip install -e .[test]\n py.test\n\nUnicode version upgrade\n-----------------------\n\nThe library will issue a new release for each new unicode version.\n\nThe steps necessary for this:\n\n1. Verify that there has been no material changes to the rulesets in Unicode\n `Annex #29 <http://unicode.org/reports/tr29/>`_ (see modifications).\n2. Download the `data files <http://www.unicode.org/Public/>`_ from unicode into the unicode-data folder.\n For the given version, some are in `ucd` and some are in `ucd/auxiliary`.\n3. Run `make process-data-files` to parse those files (will update the\n `grapheme_break_property.json` file).\n4. Update the unicode version in the documentation and in the source code.\n5. Bump the version.",
"bugtrack_url": null,
"license": "MIT",
"summary": "Unicode grapheme helpers",
"version": "0.6.0",
"split_keywords": [],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "cee7bbaab0d2a33e07c8278910c1d0d8d4f3781293dfbc70b5c38197159046bf",
"md5": "c12a0161d7381e74cca9a564cf555782",
"sha256": "44c2b9f21bbe77cfb05835fec230bd435954275267fea1858013b102f8603cca"
},
"downloads": -1,
"filename": "grapheme-0.6.0.tar.gz",
"has_sig": false,
"md5_digest": "c12a0161d7381e74cca9a564cf555782",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 207306,
"upload_time": "2020-03-07T17:13:55",
"upload_time_iso_8601": "2020-03-07T17:13:55.492961Z",
"url": "https://files.pythonhosted.org/packages/ce/e7/bbaab0d2a33e07c8278910c1d0d8d4f3781293dfbc70b5c38197159046bf/grapheme-0.6.0.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2020-03-07 17:13:55",
"github": true,
"gitlab": false,
"bitbucket": false,
"github_user": "alvinlindstam",
"github_project": "grapheme",
"travis_ci": true,
"coveralls": false,
"github_actions": false,
"lcname": "grapheme"
}
JSON
