appier 1.33.3__tar.gz → 1.33.5__tar.gz

{appier-1.33.3/src/appier.egg-info → appier-1.33.5}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 1.1
 Name: appier
-Version: 1.33.3
+Version: 1.33.5
 Summary: Appier Framework
 Home-page: http://appier.hive.pt
 Author: Hive Solutions Lda.

{appier-1.33.3 → appier-1.33.5}/setup.py

@@ -44,7 +44,7 @@ def read_file(path):
 
 setuptools.setup(
     name="appier",
-    version="1.33.3",
+    version="1.33.5",
     author="Hive Solutions Lda.",
     author_email="development@hive.pt",
     description="Appier Framework",

{appier-1.33.3 → appier-1.33.5}/src/appier/__init__.py

@@ -291,7 +291,15 @@ from .smtp import (
     header,
 )
 from .storage import StorageEngine, BaseEngine, FsEngine
-from .structures import OrderedDict, LazyDict, LazyValue, GeneratorFile, lazy_dict, lazy
+from .structures import (
+    OrderedDict,
+    LazyDict,
+    LazyValue,
+    GeneratorFile,
+    LimitedSizeDict,
+    lazy_dict,
+    lazy,
+)
 from .typesf import (
     AbstractType,
     Type,

{appier-1.33.3 → appier-1.33.5}/src/appier/base.py

@@ -94,7 +94,7 @@ NAME = "appier"
 """ The name to be used to describe the framework while working
 on its own environment, this is just a descriptive value """
 
-VERSION = "1.33.3"
+VERSION = "1.33.5"
 """ The version of the framework that is currently installed
 this value may be used for debugging/diagnostic purposes """
 
@@ -4207,6 +4207,35 @@ class App(
             )
             line = line.decode(encoding, "ignore") if legacy.is_bytes(line) else line
 
+            # runs the template for the path, so that it's possible to better
+            # understand the origin of the path execution
+            path_f = template % (path, lineno, context)
+
+            # in case the path to the file does not exists, then there's nothing
+            # remaining to be done in terms of specific stack format
+            if not path or not os.path.exists(path):
+                # creates the "file-less" item dictionary to be used to a certain
+                # degree of debuggability
+                item_d = dict(
+                    id=id,
+                    path=path,
+                    path_f=path_f,
+                    line=line,
+                    lineno=lineno,
+                    context=context,
+                    lines=[],
+                    lines_b=[],
+                )
+                cls._extended_handle(item_d)
+
+                # adds the newly created formatted item to the list of formatted
+                # items to be returned at the end of the method execution
+                formatted.append(item_d)
+
+                # continues the loop as this is not a valid file and no
+                # further information can be retrieved
+                continue
+
             # opens the current file in stack trace and reads the complete
             # contents from it so that the target lines may be read
             file = open(path, "rb")
@@ -4220,7 +4249,7 @@ class App(
             contents_d = contents.decode(encoding, "ignore")
 
             # generates a new random identifier for the current stack item
-            # this is going to be used to identify it univocally
+            # this is going to be used to identify it uniquely
             id = str(uuid.uuid4())
 
             # normalizes the currently extracted path by ensuring that it's
@@ -4259,10 +4288,6 @@ class App(
             # directly print the complete set of lines in the structure
             lines_b = legacy.u("\n").join((line["line"] for line in lines))
 
-            # runs the template for the path, so that it's possible to better
-            # understand the origin of the path execution
-            path_f = template % (path, lineno, context)
-
             # creates the dictionary that contains the complete set of information
             # about the current line in the stack and then runs the pipeline of
             # operation in it to properly process it

{appier-1.33.3 → appier-1.33.5}/src/appier/http.py

@@ -1120,7 +1120,7 @@ def _quote(values, plus=False, safe="/"):
 
     final = dict()
 
-    for key, value in values.items():
+    for key, value in values:
         key = method(key, safe=safe)
         value = method(value[0], safe=safe)
         final[key] = value

{appier-1.33.3 → appier-1.33.5}/src/appier/scheduler.py

@@ -187,6 +187,14 @@ class SchedulerTask(object):
         self.date = SchedulerDate.from_cron(cron)
         self._enabled = True
 
+    def __eq__(self, other):
+        if isinstance(other, self.__class__):
+            return True
+        return False
+
+    def __lt__(self, other):
+        return False
+
     def enable(self):
         self._enabled = True
 

{appier-1.33.3 → appier-1.33.5}/src/appier/structures.py

@@ -29,6 +29,7 @@ __license__ = "Apache License, Version 2.0"
 """ The license for the module """
 
 import os
+import collections
 
 
 class OrderedDict(dict):
@@ -280,5 +281,30 @@ class GeneratorFile(object):
         self._generator.close()
 
 
+class LimitedSizeDict(dict):
+    """
+    Size limited dictionary that removes the oldest item
+    once the maximum size is reached.
+
+    Useful for caching purposes where the cache should have
+    a limited size and the oldest items should be removed
+    once the maximum size is reached, constrains memory usage.
+    """
+
+    def __init__(self, max_size=128):
+        dict.__init__(self)
+        self.max_size = max_size
+        self._order = collections.deque()
+
+    def __setitem__(self, key, value):
+        if key in self:
+            self._order.remove(key)
+        elif len(self) >= self.max_size:
+            oldest_key = self._order.popleft()
+            del self[oldest_key]
+        dict.__setitem__(self, key, value)
+        self._order.append(key)
+
+
 lazy_dict = LazyDict
 lazy = LazyValue

{appier-1.33.3 → appier-1.33.5}/src/appier/test/scheduler.py

@@ -134,6 +134,33 @@ class CronSchedulerTest(unittest.TestCase):
             scheduler.next_run(), datetime.datetime(2013, 4, 10, hour=0, minute=11)
         )
 
+    def test_duplicate(self):
+        state = dict(value=0)
+
+        def increment():
+            state["value"] += 1
+
+        scheduler = appier.CronScheduler(None)
+        task1 = scheduler.schedule(
+            lambda: increment(),
+            appier.SchedulerDate(minutes=11, days_of_month=10, days_of_week=2),
+            now=datetime.datetime(2013, 1, 1, hour=1, minute=1),
+        )
+        task2 = scheduler.schedule(
+            lambda: increment(),
+            appier.SchedulerDate(minutes=11, days_of_month=10, days_of_week=2),
+            now=datetime.datetime(2013, 1, 1, hour=1, minute=1),
+        )
+        self.assertNotEqual(task1, None)
+        self.assertNotEqual(task2, None)
+        self.assertEqual(isinstance(task1, appier.SchedulerTask), True)
+        self.assertEqual(isinstance(task2, appier.SchedulerTask), True)
+        self.assertEqual(task1.enabled, True)
+        self.assertEqual(task2.enabled, True)
+        self.assertEqual(
+            scheduler.next_run(), datetime.datetime(2013, 4, 10, hour=0, minute=11)
+        )
+
 
 class SchedulerDateTest(unittest.TestCase):
 

{appier-1.33.3 → appier-1.33.5}/src/appier/test/structures.py

@@ -220,3 +220,41 @@ class LazyDictTest(unittest.TestCase):
         self.assertEqual(struct["first"], 1)
         self.assertEqual(isinstance(struct.__getitem__("second", True), int), True)
         self.assertEqual(struct["second"], 2)
+
+
+class LimitedSizeDictTest(unittest.TestCase):
+    def setUp(self):
+        self.dict_size = 1024
+        self.limited_dict = appier.LimitedSizeDict(self.dict_size)
+
+    def test_add_single_item(self):
+        self.limited_dict["first"] = "first_value"
+        self.assertIn("first", self.limited_dict)
+        self.assertEqual(self.limited_dict["first"], "first_value")
+
+    def test_exceeding_size_limit(self):
+        for index in range(self.dict_size + 1):
+            self.limited_dict["key_%d" % index] = "value_%d" % index
+        self.assertNotIn("key_0", self.limited_dict)
+        self.assertIn("key_%d" % self.dict_size, self.limited_dict)
+
+    def test_maintaining_order(self):
+        for index in range(self.dict_size):
+            self.limited_dict["key_%d" % index] = "value_%d" % index
+        self.limited_dict["new_key"] = "new_value"
+        self.assertNotIn("key_0", self.limited_dict)
+        self.assertIn("new_key", self.limited_dict)
+        self.assertEqual(self.limited_dict["new_key"], "new_value")
+
+    def test_update_existing_key(self):
+        self.limited_dict["first"] = "first_value"
+        self.limited_dict["first"] = "second_value"
+        self.assertEqual(self.limited_dict["first"], "second_value")
+        self.assertEqual(len(self.limited_dict), 1)
+
+    def test_repr(self):
+        self.limited_dict["first"] = "first_value"
+        self.limited_dict["second"] = "second_value"
+        repr_str = repr(self.limited_dict)
+        self.assertIn("'first': 'first_value'", repr_str)
+        self.assertIn("'second': 'second_value'", repr_str)

{appier-1.33.3 → appier-1.33.5}/src/appier/util.py

@@ -503,7 +503,7 @@ def install_pip(package, delayed=False, isolated=True, user=None):
         result = pip_main(args)
     if result == 0:
         return
-    raise exceptions.OperationalError(message="pip error")
+    raise exceptions.OperationalError(message="pip error, exit code (%d)" % result)
 
 
 def install_pip_s(package, delayed=False):

{appier-1.33.3 → appier-1.33.5/src/appier.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 1.1
 Name: appier
-Version: 1.33.3
+Version: 1.33.5
 Summary: Appier Framework
 Home-page: http://appier.hive.pt
 Author: Hive Solutions Lda.