Skip to main content

A python library providing concurrent push based lazy linked lists

Project description


|build-status| |coverage|

A python library providing a useful abstraction for recording state transitions, compressing them, and distributing to multiple listeners.



The :class:`Succession` class provides a way to reduce long chains of updates
down to a reduced chain with the same effect.

For example, assume that you only care about the sum of the numbers pushed to a
succession, and that it's fine to replace all of the numbers from before you started
listening with the current total. You can do something like the following:

>>> succession = Succession(compress=lambda items: [sum(items)])
<succession.Succession object at 0x7f5a65a10518>
>>> from_start = succession.iter()
>>> for i in [1, 2, 3, 4, 5]:
... succession.push(i)
... succession.close()
>>> from_end = succession.iter()
>>> list(from_start)
[1, 2, 3, 4, 5])
>>> list(from_end)

Iterators forked earlier will not miss any transitions added from the time they
were created. Compression is only applied to transitions before the fork.

Recommended method is to use the version from `pypi`_

.. code::

pip install succession

- Source code:
- Issue tracker:
- Continuous integration:
- PyPI:

The project is licensed under the BSD license. See `LICENSE`_ for details.

.. |build-status| image::
:alt: Build Status
.. |coverage| image::
:alt: Coverage
.. _pypi:

Project details

Download files

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

Source Distribution

succession-0.5.0.tar.gz (4.1 kB view hashes)

Uploaded Source

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page