{ "info": { "author": "Francesco Romani", "author_email": "fromani@gmail.com", "bugtrack_url": null, "classifiers": [ "Development Status :: 3 - Alpha", "Environment :: Other Environment", "Intended Audience :: Developers", "License :: OSI Approved :: zlib/libpng License", "Operating System :: POSIX", "Programming Language :: C", "Programming Language :: Python :: 2.7", "Programming Language :: Python :: Implementation :: CPython", "Topic :: Software Development :: Libraries", "Topic :: Software Development :: Libraries :: Python Modules", "Topic :: Utilities" ], "description": "A skip list is a data structure for storing a sorted list\r\n of items using a hierarchy of linked lists that connect increasingly\r\n sparse subsequences of the items. These auxiliary lists allow item\r\n lookup with efficiency comparable to balanced binary search trees (that\r\n is, with number of probes proportional to log n instead of n).", "description_content_type": null, "docs_url": null, "download_url": "", "downloads": { "last_day": -1, "last_month": -1, "last_week": -1 }, "home_page": "http://bitbucket.org/mojaves/pyskiplist", "keywords": "", "license": "zlib", "maintainer": "", "maintainer_email": "", "name": "skiplist", "package_url": "https://pypi.org/project/skiplist/", "platform": "posix", "project_url": "https://pypi.org/project/skiplist/", "project_urls": { "Homepage": "http://bitbucket.org/mojaves/pyskiplist" }, "release_url": "https://pypi.org/project/skiplist/0.1.0/", "requires_dist": null, "requires_python": null, "summary": "Skiplists are a simpler alternative to balanced binary trees", "version": "0.1.0" }, "last_serial": 867059, "releases": { "0.0.1": [], "0.1.0": [] }, "urls": [] }