travis: Drop support for Python2.6

[etc/taskwarrior.git] / tasklib / lazy.py

diff --git a/tasklib/lazy.py b/tasklib/lazy.py
index 0bd93323762c7f8d265dd6ae455118d27f5b8f80..891eb5e9e83266fb4bb056b0d4d22b820959d2a0 100644 (file)
--- a/tasklib/lazy.py
+++ b/tasklib/lazy.py
@@ -29,7 +29,7 @@ class LazyUUIDTask(object):
         # Getattr is called only if the attribute could not be found using
         # normal means
         self.replace()
         # Getattr is called only if the attribute could not be found using
         # normal means
         self.replace()

-        return self.name
+        return getattr(self, name)

 
     def __eq__(self, other):
         if other['uuid']:
 
     def __eq__(self, other):
         if other['uuid']:


@@ -39,6 +39,16 @@ class LazyUUIDTask(object):
     def __hash__(self):
         return self['uuid'].__hash__()
 
     def __hash__(self):
         return self['uuid'].__hash__()
 

+    def __repr__(self):
+        return "LazyUUIDTask: {0}".format(self._uuid)
+
+    @property
+    def saved(self):
+        """
+        Implementation of the 'saved' property. Always returns True.
+        """
+        return True
+

     def replace(self):
         """
         Performs conversion to the regular Task object, referenced by the
     def replace(self):
         """
         Performs conversion to the regular Task object, referenced by the


@@ -66,12 +76,24 @@ class LazyUUIDTaskSet(object):
     def __getattr__(self, name):
         # Getattr is called only if the attribute could not be found using
         # normal means
     def __getattr__(self, name):
         # Getattr is called only if the attribute could not be found using
         # normal means

-        self.replace()
-        return self.name
+
+        if name.startswith('__'):
+            # If some internal method was being search, do not convert
+            # to TaskQuerySet just because of that
+            raise AttributeError
+        else:
+            self.replace()
+            return getattr(self, name)
+
+    def __repr__(self):
+        return "LazyUUIDTaskSet([{0}])".format(', '.join(self._uuids))

 
     def __eq__(self, other):
         return set(t['uuid'] for t in other) == self._uuids
 
 
     def __eq__(self, other):
         return set(t['uuid'] for t in other) == self._uuids
 

+    def __ne__(self, other):
+        return not (self == other)
+

     def __contains__(self, task):
         return task['uuid'] in self._uuids
 
     def __contains__(self, task):
         return task['uuid'] in self._uuids
 


@@ -79,9 +101,101 @@ class LazyUUIDTaskSet(object):
         return len(self._uuids)
 
     def __iter__(self):
         return len(self._uuids)
 
     def __iter__(self):

-        self.replace()
-        for task in self:
-            yield task
+        for uuid in self._uuids:
+            yield LazyUUIDTask(self._tw, uuid)
+
+    def __sub__(self, other):
+        return self.difference(other)
+
+    def __isub__(self, other):
+        return self.difference_update(other)
+
+    def __rsub__(self, other):
+        return LazyUUIDTaskSet(self._tw,
+            set(t['uuid'] for t in other) - self._uuids)
+
+    def __or__(self, other):
+        return self.union(other)
+
+    def __ior__(self, other):
+        return self.update(other)
+
+    def __ror__(self, other):
+        return self.union(other)
+
+    def __xor__(self, other):
+        return self.symmetric_difference(other)
+
+    def __ixor__(self, other):
+        return self.symmetric_difference_update(other)
+
+    def __rxor__(self, other):
+        return self.symmetric_difference(other)
+
+    def __and__(self, other):
+        return self.intersection(other)
+
+    def __iand__(self, other):
+        return self.intersection_update(other)
+
+    def __rand__(self, other):
+        return self.intersection(other)
+
+    def __le__(self, other):
+        return self.issubset(other)
+
+    def __ge__(self, other):
+        return self.issuperset(other)
+
+    def issubset(self, other):
+        return all([task in other for task in self])
+
+    def issuperset(self, other):
+        return all([task in self for task in other])
+
+    def union(self, other):
+        return LazyUUIDTaskSet(self._tw,
+            self._uuids | set(t['uuid'] for t in other))
+
+    def intersection(self, other):
+        return LazyUUIDTaskSet(self._tw,
+            self._uuids & set(t['uuid'] for t in other))
+
+    def difference(self, other):
+        return LazyUUIDTaskSet(self._tw,
+            self._uuids - set(t['uuid'] for t in other))
+
+    def symmetric_difference(self, other):
+        return LazyUUIDTaskSet(self._tw,
+            self._uuids ^ set(t['uuid'] for t in other))
+
+    def update(self, other):
+        self._uuids |= set(t['uuid'] for t in other)
+        return self
+
+    def intersection_update(self, other):
+        self._uuids &= set(t['uuid'] for t in other)
+        return self
+
+    def difference_update(self, other):
+        self._uuids -= set(t['uuid'] for t in other)
+        return self
+
+    def symmetric_difference_update(self, other):
+        self._uuids ^= set(t['uuid'] for t in other)
+        return self
+
+    def add(self, task):
+        self._uuids.add(task['uuid'])
+
+    def remove(self, task):
+        self._uuids.remove(task['uuid'])
+
+    def pop(self):
+        return self._uuids.pop()
+
+    def clear(self):
+        self._uuids.clear()

 
     def replace(self):
         """
 
     def replace(self):
         """