add licensing details

Author: brentru

LICENSE

@@ -2,6 +2,7 @@ The MIT License (MIT)
 
 Copyright (c) 2019 Brent Rubell for Adafruit Industries
 
+
 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
@@ -19,3 +20,9 @@ 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.
+
+matcher.py for matching MQTT topics from the Eclipse Paho MQTT Python Client
+https://github.com/eclipse/paho.mqtt.python
+
+Eclipse Paho MQTT Python Client is dual licensed under the Eclipse Public License 1.0 and the
+Eclipse Distribution License 1.0 as described in the epl-v10 and edl-v10 files.

adafruit_minimqtt/adafruit_minimqtt.py

@@ -4,7 +4,7 @@
 #
 # Original Work Copyright (c) 2016 Paul Sokolovsky, uMQTT
 # Modified Work Copyright (c) 2019 Bradley Beach, esp32spi_mqtt
-#
+# 
 # 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

adafruit_minimqtt/matcher.py

@@ -1,3 +1,18 @@
+# Copyright (c) 2017 Yotch <https://github.com/yoch>
+#
+# This file is dual licensed under the Eclipse Public License 1.0 and the
+# Eclipse Distribution License 1.0 as described in the epl-v10 and edl-v10 files.
+#
+#
+"""
+`matcher`
+====================================================================================
+
+MQTT topic filter matcher from the Eclipse Project's Paho.MQTT.Python
+https://github.com/eclipse/paho.mqtt.python/blob/master/src/paho/mqtt/matcher.py
+* Author(s): Yotch (https://github.com/yoch)
+"""
+
 class MQTTMatcher(object):
     """Intended to manage topic filters including wildcards.
 
@@ -7,7 +22,7 @@ class MQTTMatcher(object):
     some topic name."""
 
     class Node(object):
-        __slots__ = "_children", "_content"
+        __slots__ = '_children', '_content'
 
         def __init__(self):
             self._children = {}
@@ -20,15 +35,15 @@ def __setitem__(self, key, value):
         """Add a topic filter :key to the prefix tree
         and associate it to :value"""
         node = self._root
-        for sym in key.split("/"):
+        for sym in key.split('/'):
             node = node._children.setdefault(sym, self.Node())
         node._content = value
 
     def __getitem__(self, key):
         """Retrieve the value associated with some topic filter :key"""
         try:
             node = self._root
-            for sym in key.split("/"):
+            for sym in key.split('/'):
                 node = node._children[sym]
             if node._content is None:
                 raise KeyError(key)
@@ -41,25 +56,24 @@ def __delitem__(self, key):
         lst = []
         try:
             parent, node = None, self._root
-            for k in key.split("/"):
-                parent, node = node, node._children[k]
-                lst.append((parent, k, node))
+            for k in key.split('/'):
+                 parent, node = node, node._children[k]
+                 lst.append((parent, k, node))
             # TODO
             node._content = None
         except KeyError:
             raise KeyError(key)
         else:  # cleanup
             for parent, k, node in reversed(lst):
                 if node._children or node._content is not None:
-                    break
+                     break
                 del parent._children[k]
 
     def iter_match(self, topic):
         """Return an iterator on all values associated with filters 
         that match the :topic"""
-        lst = topic.split("/")
-        normal = not topic.startswith("$")
-
+        lst = topic.split('/')
+        normal = not topic.startswith('$')
         def rec(node, i=0):
             if i == len(lst):
                 if node._content is not None:
@@ -69,12 +83,11 @@ def rec(node, i=0):
                 if part in node._children:
                     for content in rec(node._children[part], i + 1):
                         yield content
-                if "+" in node._children and (normal or i > 0):
-                    for content in rec(node._children["+"], i + 1):
+                if '+' in node._children and (normal or i > 0):
+                    for content in rec(node._children['+'], i + 1):
                         yield content
-            if "#" in node._children and (normal or i > 0):
-                content = node._children["#"]._content
+            if '#' in node._children and (normal or i > 0):
+                content = node._children['#']._content
                 if content is not None:
                     yield content
-
-        return rec(self._root)
+        return rec(self._root)