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.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
File details
Details for the file inigo-1.0.tar.gz.
File metadata
- Download URL: inigo-1.0.tar.gz
- Upload date:
- Size: 2.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 666d44ae2352169d60be0a9ed7230635ffaf6009f7e9c8c9ebf9726500977fa2 |
|
| MD5 | caf1f8eec4b273a2d6b7ef04c1ddda11 |
|
| BLAKE2b-256 | 437856c271d5c2683b82ae18d17948281fc6f1fc71c9035ed5f39c50b42694fb |
