Skip to main content

Priority queue with unique items

Project description

This is a very simple Python class for creating priority queues which maintain unique copies of elements.

This is achieved by storing a separate set of elements that have been inserted and checking each time whether the new elements is in that set or not. An optional key parameter allows to specify a function that will be calculated on each element before checking it against the set.

put() will return True if the element was not present in the queue and False otherwise.

Project details


Release history Release notifications | RSS feed

This version

0.1

Download files

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

Source Distribution

pqunique-0.1.tar.gz (3.5 kB view hashes)

Uploaded source

Built Distribution

pqunique-0.1-py3-none-any.whl (3.5 kB view hashes)

Uploaded py3

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Huawei Huawei PSF Sponsor Microsoft Microsoft PSF Sponsor NVIDIA NVIDIA PSF Sponsor Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page