Skip to main content

More Collections! Some useful data structures for dealing with Data

Project description

Some useful data structures for collections of data

Class Index

Provide indexing for a list. Inner properties can be used for keys, and keys can be tuples of properties.

Class UniqueIndex

Same as Index, but includes checks and optimization to ensure members’ keys are unique.

Class Queue

A Queue is a list, with add() and pop(). It ensures members in the queue are not duplicated by not adding the ones already found in the queue.

Class Matrix

A multidimensional grid of values that can be used like a Mapping from a-tuple-of-coordinates to the value at that coordinate. Plus a few other convenience methods.

This is a naive implementation. The hope it is a simple facade to a faster implementation.

Class Relation

Store the many-to-many relations between two domains

Project details


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

mo-collections-1.1.17229.zip (20.4 kB view details)

Uploaded Source

File details

Details for the file mo-collections-1.1.17229.zip.

File metadata

File hashes

Hashes for mo-collections-1.1.17229.zip
Algorithm Hash digest
SHA256 6f0e412ac35694745211987fd4aff41a04dce5a5d97e21b5e5cf22bc226d0b54
MD5 d73f6f3ec75982149b8e4c771a3e3113
BLAKE2b-256 4eee012c466fe41fa065c300cfcfc9ca1146908a314a9d678013b3c566c0186e

See more details on using hashes here.

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