{ "info": { "author": "Shlomi Fish", "author_email": "shlomif@shlomifish.org", "bugtrack_url": null, "classifiers": [ "Development Status :: 2 - Pre-Alpha", "Intended Audience :: Developers", "License :: OSI Approved :: MIT License", "Natural Language :: English", "Programming Language :: Python :: 2", "Programming Language :: Python :: 2.6", "Programming Language :: Python :: 2.7", "Programming Language :: Python :: 3", "Programming Language :: Python :: 3.3", "Programming Language :: Python :: 3.4", "Programming Language :: Python :: 3.5" ], "description": "===============================\nModInt\n===============================\n\n\n.. image:: https://img.shields.io/pypi/v/modint.svg\n :target: https://pypi.python.org/pypi/modint\n\n.. image:: https://img.shields.io/travis/shlomif/modint.svg\n :target: https://travis-ci.org/shlomif/modint\n\n.. image:: https://readthedocs.org/projects/modint/badge/?version=latest\n :target: https://modint.readthedocs.io/en/latest/?badge=latest\n :alt: Documentation Status\n\n.. image:: https://pyup.io/repos/github/shlomif/modint/shield.svg\n :target: https://pyup.io/repos/github/shlomif/modint/\n :alt: Updates\n\n\nPython implementation of the Chinese Remainder algorithm\n\n\n* Free software: MIT license\n* Documentation: https://modint.readthedocs.io.\n\n\nFeatures\n--------\n\nA usable implementation of the Chinese Remainder algorithm (see\nhttps://en.wikipedia.org/wiki/Chinese_remainder_theorem ) under the permissive\nMIT/Expat licence. Written because none other similarly-licensed ones\ncould be found.\n\nWhat this does is given two-or-more pairwise coprime bases integers and their\ncorresponding moduli, it finds an integer that yields these moduli for all the\nbases.\n\nExample\n-------\n\nHere is an example::\n\n from modint import ChineseRemainderConstructor, chinese_remainder\n\n cr = ChineseRemainderConstructor([2, 5])\n # Because 5 % 2 == 1 and 5 % 5 == 0\n assert cr.rem([1, 0]) == 5\n # Because 8 % 2 == 0 and 8 % 5 == 3\n assert cr.rem([0, 3]) == 8\n\n # Convenience function\n assert chinese_remainder([2, 3, 7], [1, 2, 3]) == 17\n\nCredits\n---------\n\nThis package was created with Cookiecutter_ and the `audreyr/cookiecutter-pypackage`_ project template.\n\n.. _Cookiecutter: https://github.com/audreyr/cookiecutter\n.. _`audreyr/cookiecutter-pypackage`: https://github.com/audreyr/cookiecutter-pypackage\n\n\n\n=======\nHistory\n=======\n\n0.2.1 (2018-05-02)\n------------------\n\n* Fix tests.\n\n0.2.0 (2017-12-09)\n------------------\n\n* Better documentation with synopses and examples.\n\n* Add Travis-CI.\n\n0.1.0 (2017-03-16)\n------------------\n\n* First release on PyPI.\n", "description_content_type": "", "docs_url": null, "download_url": "", "downloads": { "last_day": -1, "last_month": -1, "last_week": -1 }, "home_page": "https://github.com/shlomif/modint", "keywords": "modint", "license": "MIT license", "maintainer": "", "maintainer_email": "", "name": "modint", "package_url": "https://pypi.org/project/modint/", "platform": "", "project_url": "https://pypi.org/project/modint/", "project_urls": { "Homepage": "https://github.com/shlomif/modint" }, "release_url": "https://pypi.org/project/modint/0.2.1/", "requires_dist": null, "requires_python": "", "summary": "Python implementation of the Chinese Remainder algorithm", "version": "0.2.1" }, "last_serial": 3827535, "releases": { "0.1.0": [ { "comment_text": "", "digests": { "md5": "88fdbca8625fd5526ac36e051f905ace", "sha256": "117a3e75b9be8a60e8c5bce2b2b535f9db5ce8ed6bf491679ef840ea6e239c25" }, "downloads": -1, "filename": "modint-0.1.0.tar.gz", "has_sig": false, "md5_digest": "88fdbca8625fd5526ac36e051f905ace", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 12865, "upload_time": "2017-12-05T13:22:48", "url": "https://files.pythonhosted.org/packages/30/f5/7aa5652ee54a8852b6323295943778eba297ff654b5aaec90ce21699d88d/modint-0.1.0.tar.gz" } ], "0.2.0": [ { "comment_text": "", "digests": { "md5": "4188785a2fd1bc6a0889481e6b6723c9", "sha256": "3a9f046086c4d9294b86232579d50a3e0fcc9f48c106c30d596b337ee0fb802a" }, "downloads": -1, "filename": "modint-0.2.0.tar.gz", "has_sig": false, "md5_digest": "4188785a2fd1bc6a0889481e6b6723c9", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 12947, "upload_time": "2017-12-09T14:17:29", "url": "https://files.pythonhosted.org/packages/86/7b/7c8148c1121f2cd2ec27ca5d50c3e9be934f5c1426601e9d96569b1d4985/modint-0.2.0.tar.gz" } ], "0.2.1": [ { "comment_text": "", "digests": { "md5": "fb42cf35fd19af29598ce56cc0ee276f", "sha256": "6708e4bb6cad98fe7bfebc0594444c2597fee688f280daa3f2aaa4db14c0f974" }, "downloads": -1, "filename": "modint-0.2.1.tar.gz", "has_sig": false, "md5_digest": "fb42cf35fd19af29598ce56cc0ee276f", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 13461, "upload_time": "2018-05-02T15:55:40", "url": "https://files.pythonhosted.org/packages/53/b7/09673d7f03d15a1b5a518415c036aebd47ae0cd0fcc4dc0531568c02bc98/modint-0.2.1.tar.gz" } ] }, "urls": [ { "comment_text": "", "digests": { "md5": "fb42cf35fd19af29598ce56cc0ee276f", "sha256": "6708e4bb6cad98fe7bfebc0594444c2597fee688f280daa3f2aaa4db14c0f974" }, "downloads": -1, "filename": "modint-0.2.1.tar.gz", "has_sig": false, "md5_digest": "fb42cf35fd19af29598ce56cc0ee276f", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 13461, "upload_time": "2018-05-02T15:55:40", "url": "https://files.pythonhosted.org/packages/53/b7/09673d7f03d15a1b5a518415c036aebd47ae0cd0fcc4dc0531568c02bc98/modint-0.2.1.tar.gz" } ] }