Add py-heapdict 1.0.1

heapdict implements the MutableMapping ABC, meaning it works pretty much like a
regular Python dict. It's designed to be used as a priority queue, where items
are added and consumed as follows:

  hd = heapdict()
  hd[obj1] = priority1
  hd[obj2] = priority2
  # ...
  (obj, priority) = hd.popitem()

Compared to an ordinary dict, a heapdict has the following differences:
- popitem():
  Remove and return the (key, priority) pair with the lowest priority, instead
  of a random object.
- peekitem():
  Return the (key, priority) pair with the lowest priority, without removing it.

Unlike the Python standard library's heapq module, the heapdict supports
efficiently changing the priority of an existing object (often called "decrease-
key" in textbooks). Altering the priority is important for many algorithms such
as Dijkstra's Algorithm and A*.

WWW: https://github.com/DanielStutzbach/heapdict

devel/Makefile

@@ -4486,6 +4486,7 @@
     SUBDIR += py-gtfslib
     SUBDIR += py-gyp
     SUBDIR += py-hash_ring
+    SUBDIR += py-heapdict
     SUBDIR += py-hghooks
     SUBDIR += py-hgsubversion
     SUBDIR += py-hgtools

devel/py-heapdict/Makefile

@@ -0,0 +1,25 @@
+# Created by: Po-Chuan Hsieh <sunpoet@FreeBSD.org>
+# $FreeBSD$
+
+PORTNAME=	heapdict
+PORTVERSION=	1.0.1
+CATEGORIES=	devel python
+MASTER_SITES=	CHEESESHOP
+PKGNAMEPREFIX=	${PYTHON_PKGNAMEPREFIX}
+DISTNAME=	HeapDict-${PORTVERSION}
+
+MAINTAINER=	sunpoet@FreeBSD.org
+COMMENT=	Heap with decrease-key and increase-key operations
+
+LICENSE=	BSD3CLAUSE
+LICENSE_FILE=	${WRKSRC}/LICENSE
+
+USES=		python
+USE_PYTHON=	autoplist concurrent distutils
+
+NO_ARCH=	yes
+
+do-test:
+	cd ${WRKSRC} && ${SETENV} ${MAKE_ENV} ${PYTHON_CMD} test_heap.py
+
+.include <bsd.port.mk>

devel/py-heapdict/distinfo

@@ -0,0 +1,3 @@
+TIMESTAMP = 1580562237
+SHA256 (HeapDict-1.0.1.tar.gz) = 8495f57b3e03d8e46d5f1b2cc62ca881aca392fd5cc048dc0aa2e1a6d23ecdb6
+SIZE (HeapDict-1.0.1.tar.gz) = 4274

devel/py-heapdict/pkg-descr

@@ -0,0 +1,23 @@
+heapdict implements the MutableMapping ABC, meaning it works pretty much like a
+regular Python dict. It's designed to be used as a priority queue, where items
+are added and consumed as follows:
+
+  hd = heapdict()
+  hd[obj1] = priority1
+  hd[obj2] = priority2
+  # ...
+  (obj, priority) = hd.popitem()
+
+Compared to an ordinary dict, a heapdict has the following differences:
+- popitem():
+  Remove and return the (key, priority) pair with the lowest priority, instead
+  of a random object.
+- peekitem():
+  Return the (key, priority) pair with the lowest priority, without removing it.
+
+Unlike the Python standard library's heapq module, the heapdict supports
+efficiently changing the priority of an existing object (often called "decrease-
+key" in textbooks). Altering the priority is important for many algorithms such
+as Dijkstra's Algorithm and A*.
+
+WWW: https://github.com/DanielStutzbach/heapdict