https://github.com/wroberts/pyredblack
Cython interface to red-black trees implemented in C++
https://github.com/wroberts/pyredblack
balanced-search-trees binary-search-tree data-structure python python-2 python-3 red-black-tree
Last synced: 3 months ago
JSON representation
Cython interface to red-black trees implemented in C++
- Host: GitHub
- URL: https://github.com/wroberts/pyredblack
- Owner: wroberts
- License: mit
- Created: 2015-02-26T13:21:38.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2019-11-25T17:52:13.000Z (almost 6 years ago)
- Last Synced: 2025-06-15T04:08:36.077Z (4 months ago)
- Topics: balanced-search-trees, binary-search-tree, data-structure, python, python-2, python-3, red-black-tree
- Language: Python
- Size: 71.3 KB
- Stars: 8
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.rst
- License: LICENSE.rst
Awesome Lists containing this project
README
============
pyredblack
============
.. image:: https://travis-ci.org/wroberts/pyredblack.svg?branch=master
:target: https://travis-ci.org/wroberts/pyredblack
.. image:: https://coveralls.io/repos/wroberts/pyredblack/badge.svg?branch=master
:target: https://coveralls.io/r/wroberts/pyredblack?branch=master
:alt: Test code coverage
.. image:: https://img.shields.io/pypi/v/pyredblack.svg
:target: https://pypi.python.org/pypi/pyredblack/
:alt: Latest Version
Copyright (c) 2015 Will Roberts
Licensed under the MIT License (see ``LICENSE.rst`` for details).
Cython interface to red-black trees implemented in C++.
`Red-black trees`_ are a kind of `self-balancing binary tree`_. They
maintain their entries in sorted order and have O(log n) for
insertion, lookup, and deletion. You can `read more about red-black
trees`_ and `see animations of insertion, lookup, and deletion`_.
.. _`Red-black trees`: http://en.wikipedia.org/wiki/Red%E2%80%93black_tree
.. _`self-balancing binary tree`: http://en.wikipedia.org/wiki/Self-balancing_binary_search_tree
.. _`read more about red-black trees`: http://www.eternallyconfuzzled.com/tuts/datastructures/jsw_tut_rbtree.aspx
.. _`see animations of insertion, lookup, and deletion`: https://www.cs.usfca.edu/~galles/visualization/RedBlack.html
This package provides dictionary and set objects based on
red-black-trees; these can be used as drop-in replacements for the
built-in ``dict`` and ``set`` types, except that they maintain their
contents in sorted order.
Dictionary (``rbdict``)::
>>> import pyredblack
>>> d = pyredblack.rbdict(Germany = 'Berlin',
Hungary = 'Budapest',
Ireland = 'Dublin',
Portugal = 'Lisbon',
Cyprus = 'Nicosia',
Greenland = 'Nuuk',
Iceland = 'Reykjavik',
Macedonia = 'Skopje',
Bulgaria = 'Sofia',
Sweden = 'Stockholm')
>>> len(d)
10
>>> d['Ireland']
'Dublin'
>>> d.keys()
['Bulgaria', 'Cyprus', 'Germany', 'Greenland', 'Hungary',
'Iceland', 'Ireland', 'Macedonia', 'Portugal', 'Sweden']
>>> d.values()
['Sofia', 'Nicosia', 'Berlin', 'Nuuk', 'Budapest',
'Reykjavik', 'Dublin', 'Skopje', 'Lisbon', 'Stockholm']
>>> d.popitem()
('Bulgaria', 'Sofia')
>>> d.popitem()
('Cyprus', 'Nicosia')
>>> d.popitem()
('Germany', 'Berlin')
Set (``rbset``)::
>>> fruit = pyredblack.rbset(['apple', 'orange', 'apple', 'pear',
'orange', 'banana'])
>>> 'orange' in fruit
True
>>> 'crabgrass' in fruit
False
>>> a = pyredblack.rbset('abracadabra')
>>> b = pyredblack.rbset('alacazam')
>>> list(a)
['a', 'b', 'c', 'd', 'r']
>>> list(a - b)
['b', 'd', 'r']
>>> list(a | b)
['a', 'b', 'c', 'd', 'l', 'm', 'r', 'z']
>>> list(a & b)
['a', 'c']
>>> list(a ^ b)
['b', 'd', 'l', 'm', 'r', 'z']
>>> a.pop()
'a'
>>> a.pop()
'b'
>>> a.pop()
'c'
Requirements
------------
- Python 2.7, Python 3.2+
- Cython (and a C++ compiler)
Todo
----
- implement slicing on dictionaries