Skip to main content
Join the official 2019 Python Developers SurveyStart the survey!

Sorted data structure implementation by using skiplist and dict with Python and C

Project description


PyPI version Supported Python versions Build Status codecov ratel PyPI Downloads GitHub

Skip list is a data structure that allows fast search within an ordered sequence of elements and a probabilistic alternative to Balanced Trees.It is also easier to implement. This library uses redis skip list to implement SortedSet data types for Python

This library modified in four ways:

  1. This implementation is allowed to repeated scores.
  2. The comparison is not just by score but by key data.
  3. It's a doubly linked list with the backward being only at "level 1". This allows to traverse the list from tail to head, useful for zrevrange.
  4. This implementation is combined with dict data structure for fast search.

Skip Lists are data structure that can be used in place of balanced trees. They are easier to implement and generally faster. This library uses redis skip lists to implement SortedSet data types for Python.

SortedSet is implemented in Python and C with high performance.

Here is a few examples:

from boost_collections.zskiplist.zset_node import ZsetNode
from boost_collections.zskiplist.zset_obj import ZsetObj
zset_obj = ZsetObj()
elements = [ZsetNode('a', 1), ZsetNode('a', 2), ZsetNode('c', 2)]
# multi elements added
# multi elements added nx
zset_obj.zadd(elements=elements, 'nx')
# one element added
zset_obj.zadd(elements=ZsetNode('d', 1))
# zincrby
zset_obj.zincrby(ZsetNode('a', 1), 'incr')
# zcard
# zscore
# zrange
zset_obj.zrange(0, -1, True)
# zrevrange
zset_obj.zrevrange(0, 1, True)
# zrange_by_score
zset_obj.zrange_by_score(1, 0, 2, 0)
# zrevrange_by_score
zset_obj.zrevrange_by_score(1, 0, 2, 0)


  • Python 2.7, 3.5+


pip install ratel

cd ratel
python install

Time Complexity

ZsetObj Operations Average Case
zadd O(log N)
zincrby O(log N)
zrem O(log N)
zscore O(1)
zcard O(1)
zrange O(log(N) + M)
zrevrange O(log(N) + M)
zfloor O(log N)
zlower O(log N)
zrange_by_score O(log(N) + M)
zrevrange_by_score O(log(N) + M)


0.3.4 2018-12-04 zadd zincrby zrem zscore zcard zrange zrevrange

0.4.0 2018-12-23 zfloor zlower

0.4.1 2019-01-23 access

0.5.0 2019-04-25 zrange_by_score zrevrange_by_score




Welcome to feedback and improvements.Please submit a pull request!

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for ratel, version 0.5.3
Filename, size File type Python version Upload date Hashes
Filename, size ratel-0.5.3.tar.gz (12.9 kB) File type Source Python version None Upload date Hashes View hashes

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN SignalFx SignalFx Supporter DigiCert DigiCert EV certificate StatusPage StatusPage Status page