travis: Taskwarrior 2.5.1 is not yet released

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

diff --git a/tasklib/lazy.py b/tasklib/lazy.py
index 1e13fc3df3cff9156daf6663211ad27852c57d85..aa2c0654c23f93e2b361bf286c27d677e05b52a2 100644 (file)
--- a/tasklib/lazy.py
+++ b/tasklib/lazy.py
@@ -32,7 +32,7 @@ class LazyUUIDTask(object):
         return getattr(self, name)
 
     def __eq__(self, other):
-        if other['uuid']:
+        if other and other['uuid']:
             # For saved Tasks, just define equality by equality of uuids
             return self['uuid'] == other['uuid']
 
@@ -49,6 +49,14 @@ class LazyUUIDTask(object):
         """
         return True
 
+    @property
+    def _modified_fields(self):
+        return set()
+
+    @property
+    def modified(self):
+        return False
+
     def replace(self):
         """
         Performs conversion to the regular Task object, referenced by the
@@ -105,8 +113,47 @@ class LazyUUIDTaskSet(object):
             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,
-                               self._uuids - set(t['uuid'] for t in other))
+            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])