k3priorityqueue 0.1.2__tar.gz → 0.1.4__tar.gz

k3priorityqueue-0.1.4/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2020 张炎泼
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

k3priorityqueue-0.1.4/PKG-INFO

@@ -0,0 +1,143 @@
+Metadata-Version: 2.4
+Name: k3priorityqueue
+Version: 0.1.4
+Summary: Priority queue with weighted producer support
+Author-email: Zhang Yanpo <drdr.xp@gmail.com>
+License: MIT
+Project-URL: Homepage, https://github.com/pykit3/k3priorityqueue
+Project-URL: Documentation, https://k3priorityqueue.readthedocs.io
+Keywords: queue,priority-queue,producer,weighted
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Developers
+Classifier: Topic :: Software Development :: Libraries
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: k3heap
+Provides-Extra: dev
+Requires-Dist: pytest>=7.0; extra == "dev"
+Requires-Dist: ruff; extra == "dev"
+Requires-Dist: coverage; extra == "dev"
+Requires-Dist: k3ut; extra == "dev"
+Requires-Dist: k3thread; extra == "dev"
+Provides-Extra: publish
+Requires-Dist: build; extra == "publish"
+Requires-Dist: twine; extra == "publish"
+Requires-Dist: pk3; extra == "publish"
+Provides-Extra: docs
+Requires-Dist: mkdocs>=1.5; extra == "docs"
+Requires-Dist: mkdocs-material>=9.0; extra == "docs"
+Requires-Dist: mkdocstrings[python]>=0.24; extra == "docs"
+Dynamic: license-file
+
+# k3priorityqueue
+
+[![Action-CI](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml/badge.svg)](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml)
+[![Build Status](https://travis-ci.com/pykit3/k3priorityqueue.svg?branch=master)](https://travis-ci.com/pykit3/k3priorityqueue)
+[![Documentation Status](https://readthedocs.org/projects/k3priorityqueue/badge/?version=stable)](https://k3priorityqueue.readthedocs.io/en/stable/?badge=stable)
+[![Package](https://img.shields.io/pypi/pyversions/k3priorityqueue)](https://pypi.org/project/k3priorityqueue)
+
+priorityQueue is a queue with priority support
+
+k3priorityqueue is a component of [pykit3] project: a python3 toolkit set.
+
+
+PriorityQueue is a queue with priority support:
+
+The numbers of items it pops from each producer matches exactly the ratio of their priority:
+If the priorities of 3 producer A, B and C are 1, 3 and 7, and it runs long
+enough, it is expected that the number of items popped from A, B and C are
+1:3:7.
+
+import k3priorityqueue
+
+producers = (
+    # id, priority, iterable
+    (1, 1, [1] * 10),
+    (2, 2, [2] * 10),
+    (3, 3, [3] * 10),
+)
+pq = k3priorityqueue.PriorityQueue()
+for pid, prio, itr in producers:
+    pq.add_producer(pid, prio, itr)
+
+count = {}
+for _ in range(12):
+    val = pq.get()
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('respect priority ratio: counts:', repr(count))
+
+while True:
+    try:
+        val = pq.get()
+    except k3priorityqueue.Empty as e:
+        break
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('consumed all: counts:', repr(count))
+
+
+
+
+# Install
+
+```
+pip install k3priorityqueue
+```
+
+# Synopsis
+
+```python
+
+import k3priorityqueue
+
+producers = (
+    # id, priority, iterable
+    (1, 1, [1] * 10),
+    (2, 2, [2] * 10),
+    (3, 3, [3] * 10),
+)
+pq = k3priorityqueue.PriorityQueue()
+for pid, prio, itr in producers:
+    pq.add_producer(pid, prio, itr)
+
+count = {}
+for _ in range(12):
+    val = pq.get()
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('respect priority ratio: counts:', repr(count))
+
+while True:
+    try:
+        val = pq.get()
+    except k3priorityqueue.Empty as e:
+        break
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('consumed all: counts:', repr(count))
+```
+
+#   Author
+
+Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
+
+#   Copyright and License
+
+The MIT License (MIT)
+
+Copyright (c) 2015 Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
+
+
+[pykit3]: https://github.com/pykit3

k3priorityqueue-0.1.4/README.md

@@ -0,0 +1,105 @@
+# k3priorityqueue
+
+[![Action-CI](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml/badge.svg)](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml)
+[![Build Status](https://travis-ci.com/pykit3/k3priorityqueue.svg?branch=master)](https://travis-ci.com/pykit3/k3priorityqueue)
+[![Documentation Status](https://readthedocs.org/projects/k3priorityqueue/badge/?version=stable)](https://k3priorityqueue.readthedocs.io/en/stable/?badge=stable)
+[![Package](https://img.shields.io/pypi/pyversions/k3priorityqueue)](https://pypi.org/project/k3priorityqueue)
+
+priorityQueue is a queue with priority support
+
+k3priorityqueue is a component of [pykit3] project: a python3 toolkit set.
+
+
+PriorityQueue is a queue with priority support:
+
+The numbers of items it pops from each producer matches exactly the ratio of their priority:
+If the priorities of 3 producer A, B and C are 1, 3 and 7, and it runs long
+enough, it is expected that the number of items popped from A, B and C are
+1:3:7.
+
+import k3priorityqueue
+
+producers = (
+    # id, priority, iterable
+    (1, 1, [1] * 10),
+    (2, 2, [2] * 10),
+    (3, 3, [3] * 10),
+)
+pq = k3priorityqueue.PriorityQueue()
+for pid, prio, itr in producers:
+    pq.add_producer(pid, prio, itr)
+
+count = {}
+for _ in range(12):
+    val = pq.get()
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('respect priority ratio: counts:', repr(count))
+
+while True:
+    try:
+        val = pq.get()
+    except k3priorityqueue.Empty as e:
+        break
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('consumed all: counts:', repr(count))
+
+
+
+
+# Install
+
+```
+pip install k3priorityqueue
+```
+
+# Synopsis
+
+```python
+
+import k3priorityqueue
+
+producers = (
+    # id, priority, iterable
+    (1, 1, [1] * 10),
+    (2, 2, [2] * 10),
+    (3, 3, [3] * 10),
+)
+pq = k3priorityqueue.PriorityQueue()
+for pid, prio, itr in producers:
+    pq.add_producer(pid, prio, itr)
+
+count = {}
+for _ in range(12):
+    val = pq.get()
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('respect priority ratio: counts:', repr(count))
+
+while True:
+    try:
+        val = pq.get()
+    except k3priorityqueue.Empty as e:
+        break
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('consumed all: counts:', repr(count))
+```
+
+#   Author
+
+Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
+
+#   Copyright and License
+
+The MIT License (MIT)
+
+Copyright (c) 2015 Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
+
+
+[pykit3]: https://github.com/pykit3

{k3priorityqueue-0.1.2/k3priorityqueue → k3priorityqueue-0.1.4}/__init__.py

@@ -42,27 +42,20 @@ while True:
 print('consumed all: counts:', repr(count))
 """
 
-# from .proc import CalledProcessError
-# from .proc import ProcError
+from importlib.metadata import version
 
-__version__ = "0.1.2"
-__name__ = "k3priorityqueue"
+__version__ = version("k3priorityqueue")
 
 from .priorityqueue import (
     Empty,
-
     Producer,
     PriorityQueue,
-
     default_priority,
 )
 
 __all__ = [
-    'Empty',
-
-    'Producer',
-    'PriorityQueue',
-
-    'default_priority',
+    "Empty",
+    "Producer",
+    "PriorityQueue",
+    "default_priority",
 ]
-

k3priorityqueue-0.1.4/k3priorityqueue.egg-info/PKG-INFO

@@ -0,0 +1,143 @@
+Metadata-Version: 2.4
+Name: k3priorityqueue
+Version: 0.1.4
+Summary: Priority queue with weighted producer support
+Author-email: Zhang Yanpo <drdr.xp@gmail.com>
+License: MIT
+Project-URL: Homepage, https://github.com/pykit3/k3priorityqueue
+Project-URL: Documentation, https://k3priorityqueue.readthedocs.io
+Keywords: queue,priority-queue,producer,weighted
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Developers
+Classifier: Topic :: Software Development :: Libraries
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: k3heap
+Provides-Extra: dev
+Requires-Dist: pytest>=7.0; extra == "dev"
+Requires-Dist: ruff; extra == "dev"
+Requires-Dist: coverage; extra == "dev"
+Requires-Dist: k3ut; extra == "dev"
+Requires-Dist: k3thread; extra == "dev"
+Provides-Extra: publish
+Requires-Dist: build; extra == "publish"
+Requires-Dist: twine; extra == "publish"
+Requires-Dist: pk3; extra == "publish"
+Provides-Extra: docs
+Requires-Dist: mkdocs>=1.5; extra == "docs"
+Requires-Dist: mkdocs-material>=9.0; extra == "docs"
+Requires-Dist: mkdocstrings[python]>=0.24; extra == "docs"
+Dynamic: license-file
+
+# k3priorityqueue
+
+[![Action-CI](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml/badge.svg)](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml)
+[![Build Status](https://travis-ci.com/pykit3/k3priorityqueue.svg?branch=master)](https://travis-ci.com/pykit3/k3priorityqueue)
+[![Documentation Status](https://readthedocs.org/projects/k3priorityqueue/badge/?version=stable)](https://k3priorityqueue.readthedocs.io/en/stable/?badge=stable)
+[![Package](https://img.shields.io/pypi/pyversions/k3priorityqueue)](https://pypi.org/project/k3priorityqueue)
+
+priorityQueue is a queue with priority support
+
+k3priorityqueue is a component of [pykit3] project: a python3 toolkit set.
+
+
+PriorityQueue is a queue with priority support:
+
+The numbers of items it pops from each producer matches exactly the ratio of their priority:
+If the priorities of 3 producer A, B and C are 1, 3 and 7, and it runs long
+enough, it is expected that the number of items popped from A, B and C are
+1:3:7.
+
+import k3priorityqueue
+
+producers = (
+    # id, priority, iterable
+    (1, 1, [1] * 10),
+    (2, 2, [2] * 10),
+    (3, 3, [3] * 10),
+)
+pq = k3priorityqueue.PriorityQueue()
+for pid, prio, itr in producers:
+    pq.add_producer(pid, prio, itr)
+
+count = {}
+for _ in range(12):
+    val = pq.get()
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('respect priority ratio: counts:', repr(count))
+
+while True:
+    try:
+        val = pq.get()
+    except k3priorityqueue.Empty as e:
+        break
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('consumed all: counts:', repr(count))
+
+
+
+
+# Install
+
+```
+pip install k3priorityqueue
+```
+
+# Synopsis
+
+```python
+
+import k3priorityqueue
+
+producers = (
+    # id, priority, iterable
+    (1, 1, [1] * 10),
+    (2, 2, [2] * 10),
+    (3, 3, [3] * 10),
+)
+pq = k3priorityqueue.PriorityQueue()
+for pid, prio, itr in producers:
+    pq.add_producer(pid, prio, itr)
+
+count = {}
+for _ in range(12):
+    val = pq.get()
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('respect priority ratio: counts:', repr(count))
+
+while True:
+    try:
+        val = pq.get()
+    except k3priorityqueue.Empty as e:
+        break
+    count[val] = count.get(val, 0) + 1
+    print(val)
+
+print('consumed all: counts:', repr(count))
+```
+
+#   Author
+
+Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
+
+#   Copyright and License
+
+The MIT License (MIT)
+
+Copyright (c) 2015 Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
+
+
+[pykit3]: https://github.com/pykit3

k3priorityqueue-0.1.4/k3priorityqueue.egg-info/SOURCES.txt

@@ -0,0 +1,16 @@
+LICENSE
+README.md
+__init__.py
+priorityqueue.py
+pyproject.toml
+synopsis.py
+./__init__.py
+./priorityqueue.py
+./synopsis.py
+k3priorityqueue.egg-info/PKG-INFO
+k3priorityqueue.egg-info/SOURCES.txt
+k3priorityqueue.egg-info/dependency_links.txt
+k3priorityqueue.egg-info/requires.txt
+k3priorityqueue.egg-info/top_level.txt
+test/test_doctest.py
+test/test_k3priorityqueue.py

k3priorityqueue-0.1.4/k3priorityqueue.egg-info/requires.txt

@@ -0,0 +1,18 @@
+k3heap
+
+[dev]
+pytest>=7.0
+ruff
+coverage
+k3ut
+k3thread
+
+[docs]
+mkdocs>=1.5
+mkdocs-material>=9.0
+mkdocstrings[python]>=0.24
+
+[publish]
+build
+twine
+pk3

{k3priorityqueue-0.1.2/k3priorityqueue → k3priorityqueue-0.1.4}/priorityqueue.py

@@ -30,7 +30,7 @@ class Producer(object):
     def __init__(self, producer_id, priority, iterable):
         self.consumed = 0
         self.iterable_lock = threading.RLock()
-        self.stat = {'get': 0}
+        self.stat = {"get": 0}
         self.cmp_key = (0, 0)
 
         self.producer_id = producer_id
@@ -38,22 +38,20 @@ class Producer(object):
         self.set_iterable(iterable)
 
     def get(self):
-
         with self.iterable_lock:
             try:
                 val = next(self.iterable)
-                self.stat['get'] += 1
+                self.stat["get"] += 1
                 self.consume()
                 return val
             except StopIteration:
-                raise Empty('no more item in ' + str(self))
+                raise Empty("no more item in " + str(self))
 
     def set_priority(self, priority):
-
         priority = float(priority)
 
         if priority <= 0:
-            raise ValueError('priority can not be less or euqal 0: ' + str(priority))
+            raise ValueError("priority can not be less or euqal 0: " + str(priority))
 
         self.priority = priority
         self.item_cost = default_priority / float(self.priority)
@@ -67,7 +65,7 @@ class Producer(object):
         self.cmp_key = (self.consumed, self.item_cost)
 
     def __str__(self):
-        return '[{producer_id}={priority} c={consumed}]'.format(
+        return "[{producer_id}={priority} c={consumed}]".format(
             producer_id=self.producer_id,
             priority=self.priority,
             consumed=self.consumed,
@@ -92,6 +90,7 @@ class PriorityQueue(object):
     To re-enable a producer, call `PriorityQueue.add_producer()` with the same
     `producer_id`.
     """
+
     def __init__(self):
         self.producer_by_id = {}
 
@@ -153,7 +152,6 @@ class PriorityQueue(object):
             del self.producer_by_id[producer_id]
 
     def _remove_from_heaps(self, producer):
-
         try:
             self.empty_heap.remove(producer)
         except k3heap.NotFound:
@@ -166,22 +164,20 @@ class PriorityQueue(object):
 
     def get(self):
         """
-            Returns an item.
+        Returns an item.
         """
         while True:
-
             with self.heap_lock:
                 try:
                     p = self.consumable_heap.get()
                 except k3heap.Empty:
-                    raise Empty('no more queue has any item')
+                    raise Empty("no more queue has any item")
 
                 try:
                     # NOTE: if p.iterable blocks, everything is blocked
                     val = p.get()
 
                 except Empty:
-
                     self.consumable_heap.remove(p)
                     self.empty_heap.push(p)
 
@@ -197,4 +193,4 @@ class PriorityQueue(object):
         for cq in self.producer_by_id.values():
             qs.append(str(cq))
 
-        return ' '.join(qs)
+        return " ".join(qs)

k3priorityqueue-0.1.4/pyproject.toml

@@ -0,0 +1,61 @@
+[build-system]
+requires = ["setuptools>=61.0"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "k3priorityqueue"
+version = "0.1.4"
+description = "Priority queue with weighted producer support"
+readme = "README.md"
+license = {text = "MIT"}
+requires-python = ">=3.9"
+authors = [
+    { name = "Zhang Yanpo", email = "drdr.xp@gmail.com" }
+]
+keywords = ["queue", "priority-queue", "producer", "weighted"]
+classifiers = [
+    "Development Status :: 4 - Beta",
+    "Intended Audience :: Developers",
+    "Topic :: Software Development :: Libraries",
+    "License :: OSI Approved :: MIT License",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.9",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+]
+dependencies = [
+    "k3heap",
+]
+
+[project.urls]
+Homepage = "https://github.com/pykit3/k3priorityqueue"
+Documentation = "https://k3priorityqueue.readthedocs.io"
+
+[project.optional-dependencies]
+dev = [
+    "pytest>=7.0",
+    "ruff",
+    "coverage",
+    "k3ut",
+    "k3thread",
+]
+publish = [
+    "build",
+    "twine",
+    "pk3",
+]
+docs = [
+    "mkdocs>=1.5",
+    "mkdocs-material>=9.0",
+    "mkdocstrings[python]>=0.24",
+]
+
+[tool.setuptools]
+packages = ["k3priorityqueue"]
+
+[tool.setuptools.package-dir]
+k3priorityqueue = "."
+
+[tool.ruff]
+line-length = 120

{k3priorityqueue-0.1.2/k3priorityqueue → k3priorityqueue-0.1.4}/synopsis.py

@@ -16,14 +16,14 @@ for _ in range(12):
     count[val] = count.get(val, 0) + 1
     print(val)
 
-print('respect priority ratio: counts:', repr(count))
+print("respect priority ratio: counts:", repr(count))
 
 while True:
     try:
         val = pq.get()
-    except k3priorityqueue.Empty as e:
+    except k3priorityqueue.Empty:
         break
     count[val] = count.get(val, 0) + 1
     print(val)
 
-print('consumed all: counts:', repr(count))
+print("consumed all: counts:", repr(count))

k3priorityqueue-0.1.4/test/test_doctest.py

@@ -0,0 +1,8 @@
+import doctest
+
+import k3priorityqueue
+
+
+def load_tests(loader, tests, ignore):
+    tests.addTests(doctest.DocTestSuite(k3priorityqueue))
+    return tests

k3priorityqueue-0.1.4/test/test_k3priorityqueue.py

@@ -0,0 +1,233 @@
+import random
+import unittest
+
+import k3priorityqueue
+import k3thread
+import k3ut
+
+dd = k3ut.dd
+
+
+class TestConsumedQueue(unittest.TestCase):
+    def test_init(self):
+        cq = k3priorityqueue.Producer(1, 1, [])
+        self.assertEqual(1, cq.priority)
+        self.assertEqual(0, cq.consumed)
+        self.assertEqual(k3priorityqueue.default_priority / cq.priority, cq.item_cost)
+
+    def test_priority(self):
+        self.assertRaises(ValueError, k3priorityqueue.Producer, 1, 0, [])
+        self.assertRaises(ValueError, k3priorityqueue.Producer, 1, -1, [])
+        self.assertRaises(ValueError, k3priorityqueue.Producer, 1, "", [])
+
+    def test_consumed(self):
+        a = k3priorityqueue.Producer(1, 1, [1, 2])
+        b = k3priorityqueue.Producer(1, 10, range(20))
+
+        self.assertEqual(1, a.get())
+        self.assertEqual(2, a.get())
+        self.assertRaises(k3priorityqueue.Empty, a.get)
+
+        for i in range(20):
+            b.get()
+
+        self.assertEqual(a.consumed, b.consumed)
+
+    def test_lt_init(self):
+        a = k3priorityqueue.Producer(1, 1, [1, 2])
+        b = k3priorityqueue.Producer(1, 1, [1, 2])
+
+        self.assertFalse(a < b, "both empty")
+        self.assertFalse(b < a, "both empty")
+
+        a.get()
+        b.get()
+
+        self.assertFalse(a < b, "both empty")
+        self.assertFalse(b < a, "both empty")
+
+    def test_lt(self):
+        a = k3priorityqueue.Producer(1, 1, range(100))
+        b = k3priorityqueue.Producer(1, 10, range(100))
+
+        # 0 0, but b has smaller item_cost
+        self.assertFalse(a < b, "b has higher priority")
+        self.assertTrue(b < a, "b has higher priority")
+
+        # 0 0.1
+        b.get()
+        self.assertTrue(a < b, "b consumed 1")
+        self.assertFalse(b < a, "b consumed 1")
+
+        # 1 0.1
+        a.get()
+        self.assertFalse(a < b, "a consumed 1")
+        self.assertTrue(b < a, "a consumed 1")
+
+        # 1 0.2
+        b.get()
+        self.assertFalse(a < b, "a b consumed 1")
+        self.assertTrue(b < a, "a b consumed 1")
+
+        # 1 1
+        for _ in range(8):
+            b.get()
+        self.assertFalse(a < b, "a b consumed 1")
+        self.assertTrue(b < a, "a consume 1 b consumed 10")
+
+        # 1 1.1
+        b.get()
+        self.assertTrue(a < b, "a b consumed 1")
+        self.assertFalse(b < a, "a b consumed 1")
+
+
+class TestPriorityQueue(unittest.TestCase):
+    def test_get(self):
+        producers = (
+            # id, priority, iterable
+            (1, 1, [1] * 10),
+            (2, 2, [2] * 10),
+            (3, 3, [3] * 10),
+        )
+        expected = [
+            3,  # .3    0  0.0
+            2,  # .3   .5  0.0
+            1,  # .3   .5  1.0
+            3,  # .6   .5  1.0
+            2,  # .6  1.0  1.0
+            3,  # 1.0  1.0  1.0
+            3,  # 1.3  1.0  1.0
+            2,  # 1.3  1.5  1.0
+            1,  # 1.3  1.5  2.0
+            3,  # 1.6  1.5  2.0
+            2,  # 1.6  2.0  2.0
+            3,  # 2.0  2.0  2.0
+        ]
+        pq = k3priorityqueue.PriorityQueue()
+        for pid, prio, itr in producers:
+            pq.add_producer(pid, prio, itr)
+
+        dd(pq)
+        rst = []
+        for _ in expected:
+            val = pq.get()
+            rst.append(val)
+        self.assertEqual(expected, rst)
+
+    def test_add_queue(self):
+        pq = k3priorityqueue.PriorityQueue()
+        pq.add_producer(1, 1, [1, 1])
+        self.assertEqual(1, pq.get())
+
+        # re-add should update iterable
+        pq.add_producer(1, 1, [2, 2])
+        self.assertEqual(2, pq.get())
+
+        # new queue with higher priority comes first
+        pq.add_producer(2, 10, [10, 10])
+        self.assertEqual(10, pq.get())
+
+    def test_add_queue_update_priority(self):
+        pq = k3priorityqueue.PriorityQueue()
+
+        pq.add_producer(1, 1, [1, 1, 1])
+        self.assertEqual(1, pq.get())
+
+        pq.add_producer(2, 2, [2, 2, 2])
+        self.assertEqual(2, pq.get())
+        self.assertEqual(2, pq.get())
+
+        # re-add should update priority, iterable and adjust heap
+        pq.add_producer(1, 10, [10, 10, 10])
+        dd(pq)
+        dd(pq.consumable_heap)
+
+        self.assertEqual(10, pq.get())
+
+    def test_remove_queue(self):
+        pq = k3priorityqueue.PriorityQueue()
+        pq.add_producer(1, 1, [1, 1])
+        pq.remove_producer(1)
+
+        self.assertRaises(k3priorityqueue.Empty, pq.get)
+        pq.add_producer(1, 1, [1, 1])
+        pq.add_producer(10, 10, [10, 10])
+        self.assertEqual(10, pq.get())
+
+        pq.remove_producer(10)
+        self.assertEqual(1, pq.get())
+
+    def test_remove_queue_inexistent(self):
+        pq = k3priorityqueue.PriorityQueue()
+        self.assertRaises(KeyError, pq.remove_producer, 1)
+        pq.remove_producer(1, ignore_not_found=True)
+
+    def test_bench(self):
+        pq = k3priorityqueue.PriorityQueue()
+
+        ntimes = 10240
+        nq = 1024
+        n_thread = 3
+        ths = []
+
+        def worker():
+            for _ in range(ntimes):
+                pq.get()
+
+        for i in range(1, nq + 1):
+            pq.add_producer(i, i, yield_forever())
+
+        with k3ut.Timer() as t:
+            for i in range(n_thread):
+                th = k3thread.daemon(worker)
+                ths.append(th)
+
+            for th in ths:
+                th.join()
+
+            us_per_call = t.spent() / ntimes / n_thread * 1000 * 1000
+            dd(us_per_call, "us/call")
+
+        self.assertLess(us_per_call, 100)
+
+    def test_concurrent(self):
+        pq = k3priorityqueue.PriorityQueue()
+        ntimes = 10240
+        nq = 3
+        n_thread = 3
+        ths = []
+
+        def worker():
+            for _ in range(ntimes):
+                pq.get()
+
+        for i in range(1, nq + 1):
+            pq.add_producer(i, i, yield_forever())
+
+        for i in range(n_thread):
+            th = k3thread.daemon(worker)
+            ths.append(th)
+
+        for th in ths:
+            th.join()
+
+        consumed = []
+        got = 0
+        for i in range(1, nq + 1):
+            q = pq.producer_by_id[i]
+            consumed.append(q.consumed)
+            dd("get:", q.stat)
+            got += q.stat["get"]
+
+        self.assertEqual(ntimes * n_thread, got)
+
+        dd("consumed:", consumed)
+        self.assertAlmostEqual(consumed[0], consumed[1])
+        self.assertAlmostEqual(consumed[1], consumed[2])
+
+
+def yield_forever():
+    i = random.randint(1, 1000000)
+    while True:
+        i += 1
+        yield (i * 2654435769) & 0xFFFFFFFF

k3priorityqueue-0.1.2/PKG-INFO

@@ -1,124 +0,0 @@
-Metadata-Version: 2.1
-Name: k3priorityqueue
-Version: 0.1.2
-Summary: priorityQueue is a queue with priority support
-Home-page: https://github.com/pykit3/k3priorityqueue
-Author: Zhang Yanpo
-Author-email: drdr.xp@gmail.com
-License: MIT
-Description: # k3priorityqueue
-        
-        [![Action-CI](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml/badge.svg)](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml)
-        [![Build Status](https://travis-ci.com/pykit3/k3priorityqueue.svg?branch=master)](https://travis-ci.com/pykit3/k3priorityqueue)
-        [![Documentation Status](https://readthedocs.org/projects/k3priorityqueue/badge/?version=stable)](https://k3priorityqueue.readthedocs.io/en/stable/?badge=stable)
-        [![Package](https://img.shields.io/pypi/pyversions/k3priorityqueue)](https://pypi.org/project/k3priorityqueue)
-        
-        priorityQueue is a queue with priority support
-        
-        k3priorityqueue is a component of [pykit3] project: a python3 toolkit set.
-        
-        
-        PriorityQueue is a queue with priority support:
-        
-        The numbers of items it pops from each producer matches exactly the ratio of their priority:
-        If the priorities of 3 producer A, B and C are 1, 3 and 7, and it runs long
-        enough, it is expected that the number of items popped from A, B and C are
-        1:3:7.
-        
-        import k3priorityqueue
-        
-        producers = (
-            # id, priority, iterable
-            (1, 1, [1] * 10),
-            (2, 2, [2] * 10),
-            (3, 3, [3] * 10),
-        )
-        pq = k3priorityqueue.PriorityQueue()
-        for pid, prio, itr in producers:
-            pq.add_producer(pid, prio, itr)
-        
-        count = {}
-        for _ in range(12):
-            val = pq.get()
-            count[val] = count.get(val, 0) + 1
-            print(val)
-        
-        print('respect priority ratio: counts:', repr(count))
-        
-        while True:
-            try:
-                val = pq.get()
-            except k3priorityqueue.Empty as e:
-                break
-            count[val] = count.get(val, 0) + 1
-            print(val)
-        
-        print('consumed all: counts:', repr(count))
-        
-        
-        
-        
-        # Install
-        
-        ```
-        pip install k3priorityqueue
-        ```
-        
-        # Synopsis
-        
-        ```python
-        
-        import k3priorityqueue
-        
-        producers = (
-            # id, priority, iterable
-            (1, 1, [1] * 10),
-            (2, 2, [2] * 10),
-            (3, 3, [3] * 10),
-        )
-        pq = k3priorityqueue.PriorityQueue()
-        for pid, prio, itr in producers:
-            pq.add_producer(pid, prio, itr)
-        
-        count = {}
-        for _ in range(12):
-            val = pq.get()
-            count[val] = count.get(val, 0) + 1
-            print(val)
-        
-        print('respect priority ratio: counts:', repr(count))
-        
-        while True:
-            try:
-                val = pq.get()
-            except k3priorityqueue.Empty as e:
-                break
-            count[val] = count.get(val, 0) + 1
-            print(val)
-        
-        print('consumed all: counts:', repr(count))
-        ```
-        
-        #   Author
-        
-        Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
-        
-        #   Copyright and License
-        
-        The MIT License (MIT)
-        
-        Copyright (c) 2015 Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
-        
-        
-        [pykit3]: https://github.com/pykit3
-Keywords: python,priorityqueue
-Platform: UNKNOWN
-Classifier: Development Status :: 4 - Beta
-Classifier: Intended Audience :: Developers
-Classifier: Topic :: Software Development :: Libraries
-Classifier: Programming Language :: Python :: 3.6
-Classifier: Programming Language :: Python :: 3.7
-Classifier: Programming Language :: Python :: 3.8
-Classifier: Programming Language :: Python :: Implementation :: PyPy
-Requires-Python: >=3.0
-Description-Content-Type: text/markdown

k3priorityqueue-0.1.2/k3priorityqueue/setup.py

@@ -1,23 +0,0 @@
-# DO NOT EDIT!!! built with `python _building/build_setup.py`
-import setuptools
-setuptools.setup(
-    name="k3priorityqueue",
-    packages=["k3priorityqueue"],
-    version="0.1.2",
-    license='MIT',
-    description='priorityQueue is a queue with priority support',
-    long_description="# k3priorityqueue\n\n[![Action-CI](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml/badge.svg)](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml)\n[![Build Status](https://travis-ci.com/pykit3/k3priorityqueue.svg?branch=master)](https://travis-ci.com/pykit3/k3priorityqueue)\n[![Documentation Status](https://readthedocs.org/projects/k3priorityqueue/badge/?version=stable)](https://k3priorityqueue.readthedocs.io/en/stable/?badge=stable)\n[![Package](https://img.shields.io/pypi/pyversions/k3priorityqueue)](https://pypi.org/project/k3priorityqueue)\n\npriorityQueue is a queue with priority support\n\nk3priorityqueue is a component of [pykit3] project: a python3 toolkit set.\n\n\nPriorityQueue is a queue with priority support:\n\nThe numbers of items it pops from each producer matches exactly the ratio of their priority:\nIf the priorities of 3 producer A, B and C are 1, 3 and 7, and it runs long\nenough, it is expected that the number of items popped from A, B and C are\n1:3:7.\n\nimport k3priorityqueue\n\nproducers = (\n    # id, priority, iterable\n    (1, 1, [1] * 10),\n    (2, 2, [2] * 10),\n    (3, 3, [3] * 10),\n)\npq = k3priorityqueue.PriorityQueue()\nfor pid, prio, itr in producers:\n    pq.add_producer(pid, prio, itr)\n\ncount = {}\nfor _ in range(12):\n    val = pq.get()\n    count[val] = count.get(val, 0) + 1\n    print(val)\n\nprint('respect priority ratio: counts:', repr(count))\n\nwhile True:\n    try:\n        val = pq.get()\n    except k3priorityqueue.Empty as e:\n        break\n    count[val] = count.get(val, 0) + 1\n    print(val)\n\nprint('consumed all: counts:', repr(count))\n\n\n\n\n# Install\n\n```\npip install k3priorityqueue\n```\n\n# Synopsis\n\n```python\n\nimport k3priorityqueue\n\nproducers = (\n    # id, priority, iterable\n    (1, 1, [1] * 10),\n    (2, 2, [2] * 10),\n    (3, 3, [3] * 10),\n)\npq = k3priorityqueue.PriorityQueue()\nfor pid, prio, itr in producers:\n    pq.add_producer(pid, prio, itr)\n\ncount = {}\nfor _ in range(12):\n    val = pq.get()\n    count[val] = count.get(val, 0) + 1\n    print(val)\n\nprint('respect priority ratio: counts:', repr(count))\n\nwhile True:\n    try:\n        val = pq.get()\n    except k3priorityqueue.Empty as e:\n        break\n    count[val] = count.get(val, 0) + 1\n    print(val)\n\nprint('consumed all: counts:', repr(count))\n```\n\n#   Author\n\nZhang Yanpo (张炎泼) <drdr.xp@gmail.com>\n\n#   Copyright and License\n\nThe MIT License (MIT)\n\nCopyright (c) 2015 Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>\n\n\n[pykit3]: https://github.com/pykit3",
-    long_description_content_type="text/markdown",
-    author='Zhang Yanpo',
-    author_email='drdr.xp@gmail.com',
-    url='https://github.com/pykit3/k3priorityqueue',
-    keywords=['python', 'priorityqueue'],
-    python_requires='>=3.0',
-
-    install_requires=['k3ut>=0.1.15,<0.2', 'k3heap>=0.1.5,<0.2', 'k3thread>=0.1.0,<0.2'],
-    classifiers=[
-        'Development Status :: 4 - Beta',
-        'Intended Audience :: Developers',
-        'Topic :: Software Development :: Libraries',
-    ] + ['Programming Language :: Python :: 3.6', 'Programming Language :: Python :: 3.7', 'Programming Language :: Python :: 3.8', 'Programming Language :: Python :: Implementation :: PyPy'],
-)

k3priorityqueue-0.1.2/k3priorityqueue.egg-info/PKG-INFO

@@ -1,124 +0,0 @@
-Metadata-Version: 2.1
-Name: k3priorityqueue
-Version: 0.1.2
-Summary: priorityQueue is a queue with priority support
-Home-page: https://github.com/pykit3/k3priorityqueue
-Author: Zhang Yanpo
-Author-email: drdr.xp@gmail.com
-License: MIT
-Description: # k3priorityqueue
-        
-        [![Action-CI](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml/badge.svg)](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml)
-        [![Build Status](https://travis-ci.com/pykit3/k3priorityqueue.svg?branch=master)](https://travis-ci.com/pykit3/k3priorityqueue)
-        [![Documentation Status](https://readthedocs.org/projects/k3priorityqueue/badge/?version=stable)](https://k3priorityqueue.readthedocs.io/en/stable/?badge=stable)
-        [![Package](https://img.shields.io/pypi/pyversions/k3priorityqueue)](https://pypi.org/project/k3priorityqueue)
-        
-        priorityQueue is a queue with priority support
-        
-        k3priorityqueue is a component of [pykit3] project: a python3 toolkit set.
-        
-        
-        PriorityQueue is a queue with priority support:
-        
-        The numbers of items it pops from each producer matches exactly the ratio of their priority:
-        If the priorities of 3 producer A, B and C are 1, 3 and 7, and it runs long
-        enough, it is expected that the number of items popped from A, B and C are
-        1:3:7.
-        
-        import k3priorityqueue
-        
-        producers = (
-            # id, priority, iterable
-            (1, 1, [1] * 10),
-            (2, 2, [2] * 10),
-            (3, 3, [3] * 10),
-        )
-        pq = k3priorityqueue.PriorityQueue()
-        for pid, prio, itr in producers:
-            pq.add_producer(pid, prio, itr)
-        
-        count = {}
-        for _ in range(12):
-            val = pq.get()
-            count[val] = count.get(val, 0) + 1
-            print(val)
-        
-        print('respect priority ratio: counts:', repr(count))
-        
-        while True:
-            try:
-                val = pq.get()
-            except k3priorityqueue.Empty as e:
-                break
-            count[val] = count.get(val, 0) + 1
-            print(val)
-        
-        print('consumed all: counts:', repr(count))
-        
-        
-        
-        
-        # Install
-        
-        ```
-        pip install k3priorityqueue
-        ```
-        
-        # Synopsis
-        
-        ```python
-        
-        import k3priorityqueue
-        
-        producers = (
-            # id, priority, iterable
-            (1, 1, [1] * 10),
-            (2, 2, [2] * 10),
-            (3, 3, [3] * 10),
-        )
-        pq = k3priorityqueue.PriorityQueue()
-        for pid, prio, itr in producers:
-            pq.add_producer(pid, prio, itr)
-        
-        count = {}
-        for _ in range(12):
-            val = pq.get()
-            count[val] = count.get(val, 0) + 1
-            print(val)
-        
-        print('respect priority ratio: counts:', repr(count))
-        
-        while True:
-            try:
-                val = pq.get()
-            except k3priorityqueue.Empty as e:
-                break
-            count[val] = count.get(val, 0) + 1
-            print(val)
-        
-        print('consumed all: counts:', repr(count))
-        ```
-        
-        #   Author
-        
-        Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
-        
-        #   Copyright and License
-        
-        The MIT License (MIT)
-        
-        Copyright (c) 2015 Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>
-        
-        
-        [pykit3]: https://github.com/pykit3
-Keywords: python,priorityqueue
-Platform: UNKNOWN
-Classifier: Development Status :: 4 - Beta
-Classifier: Intended Audience :: Developers
-Classifier: Topic :: Software Development :: Libraries
-Classifier: Programming Language :: Python :: 3.6
-Classifier: Programming Language :: Python :: 3.7
-Classifier: Programming Language :: Python :: 3.8
-Classifier: Programming Language :: Python :: Implementation :: PyPy
-Requires-Python: >=3.0
-Description-Content-Type: text/markdown

k3priorityqueue-0.1.2/k3priorityqueue.egg-info/SOURCES.txt

@@ -1,10 +0,0 @@
-setup.py
-k3priorityqueue/__init__.py
-k3priorityqueue/priorityqueue.py
-k3priorityqueue/setup.py
-k3priorityqueue/synopsis.py
-k3priorityqueue.egg-info/PKG-INFO
-k3priorityqueue.egg-info/SOURCES.txt
-k3priorityqueue.egg-info/dependency_links.txt
-k3priorityqueue.egg-info/requires.txt
-k3priorityqueue.egg-info/top_level.txt

k3priorityqueue-0.1.2/k3priorityqueue.egg-info/requires.txt

@@ -1,3 +0,0 @@
-k3ut<0.2,>=0.1.15
-k3heap<0.2,>=0.1.5
-k3thread<0.2,>=0.1.0

k3priorityqueue-0.1.2/setup.py

@@ -1,23 +0,0 @@
-# DO NOT EDIT!!! built with `python _building/build_setup.py`
-import setuptools
-setuptools.setup(
-    name="k3priorityqueue",
-    packages=["k3priorityqueue"],
-    version="0.1.2",
-    license='MIT',
-    description='priorityQueue is a queue with priority support',
-    long_description="# k3priorityqueue\n\n[![Action-CI](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml/badge.svg)](https://github.com/pykit3/k3priorityqueue/actions/workflows/python-package.yml)\n[![Build Status](https://travis-ci.com/pykit3/k3priorityqueue.svg?branch=master)](https://travis-ci.com/pykit3/k3priorityqueue)\n[![Documentation Status](https://readthedocs.org/projects/k3priorityqueue/badge/?version=stable)](https://k3priorityqueue.readthedocs.io/en/stable/?badge=stable)\n[![Package](https://img.shields.io/pypi/pyversions/k3priorityqueue)](https://pypi.org/project/k3priorityqueue)\n\npriorityQueue is a queue with priority support\n\nk3priorityqueue is a component of [pykit3] project: a python3 toolkit set.\n\n\nPriorityQueue is a queue with priority support:\n\nThe numbers of items it pops from each producer matches exactly the ratio of their priority:\nIf the priorities of 3 producer A, B and C are 1, 3 and 7, and it runs long\nenough, it is expected that the number of items popped from A, B and C are\n1:3:7.\n\nimport k3priorityqueue\n\nproducers = (\n    # id, priority, iterable\n    (1, 1, [1] * 10),\n    (2, 2, [2] * 10),\n    (3, 3, [3] * 10),\n)\npq = k3priorityqueue.PriorityQueue()\nfor pid, prio, itr in producers:\n    pq.add_producer(pid, prio, itr)\n\ncount = {}\nfor _ in range(12):\n    val = pq.get()\n    count[val] = count.get(val, 0) + 1\n    print(val)\n\nprint('respect priority ratio: counts:', repr(count))\n\nwhile True:\n    try:\n        val = pq.get()\n    except k3priorityqueue.Empty as e:\n        break\n    count[val] = count.get(val, 0) + 1\n    print(val)\n\nprint('consumed all: counts:', repr(count))\n\n\n\n\n# Install\n\n```\npip install k3priorityqueue\n```\n\n# Synopsis\n\n```python\n\nimport k3priorityqueue\n\nproducers = (\n    # id, priority, iterable\n    (1, 1, [1] * 10),\n    (2, 2, [2] * 10),\n    (3, 3, [3] * 10),\n)\npq = k3priorityqueue.PriorityQueue()\nfor pid, prio, itr in producers:\n    pq.add_producer(pid, prio, itr)\n\ncount = {}\nfor _ in range(12):\n    val = pq.get()\n    count[val] = count.get(val, 0) + 1\n    print(val)\n\nprint('respect priority ratio: counts:', repr(count))\n\nwhile True:\n    try:\n        val = pq.get()\n    except k3priorityqueue.Empty as e:\n        break\n    count[val] = count.get(val, 0) + 1\n    print(val)\n\nprint('consumed all: counts:', repr(count))\n```\n\n#   Author\n\nZhang Yanpo (张炎泼) <drdr.xp@gmail.com>\n\n#   Copyright and License\n\nThe MIT License (MIT)\n\nCopyright (c) 2015 Zhang Yanpo (张炎泼) <drdr.xp@gmail.com>\n\n\n[pykit3]: https://github.com/pykit3",
-    long_description_content_type="text/markdown",
-    author='Zhang Yanpo',
-    author_email='drdr.xp@gmail.com',
-    url='https://github.com/pykit3/k3priorityqueue',
-    keywords=['python', 'priorityqueue'],
-    python_requires='>=3.0',
-
-    install_requires=['k3ut>=0.1.15,<0.2', 'k3heap>=0.1.5,<0.2', 'k3thread>=0.1.0,<0.2'],
-    classifiers=[
-        'Development Status :: 4 - Beta',
-        'Intended Audience :: Developers',
-        'Topic :: Software Development :: Libraries',
-    ] + ['Programming Language :: Python :: 3.6', 'Programming Language :: Python :: 3.7', 'Programming Language :: Python :: 3.8', 'Programming Language :: Python :: Implementation :: PyPy'],
-)