Skip to main content

Decaying list data structure

Project description

“Let me explain. No, there is too much. Let me sum up.” ~ Inigo Montoya

Inigos are simple sequences which experience loss of information with time. They are append-only and grow logarithmically in size with their input, instead of linearly, discarding information as they grow.

License

Inigo is available under the MIT/X11 license; see LICENSE for details.

Credits

The name of the library and data structure goes to Allen Short, who also provided the classic movie quote.

David Barbour’s explanation of the possible uses of inigos inspired me to provide a Python implementation. His article is at http://awelonblue.wordpress.com/2013/01/24/exponential-decay-of-history-improved/ and is worth reading.

Project details


Release history Release notifications | RSS feed

This version

1.0

Download files

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

Files for inigo, version 1.0
Filename, size File type Python version Upload date Hashes
Filename, size inigo-1.0.tar.gz (2.7 kB) File type Source Python version None Upload date Hashes View

Supported by

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page