Loosen the version requirement for six

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

diff --git a/tasklib/lazy.py b/tasklib/lazy.py
index c3feed574a81eed69f05c5e34733cb1450173602..a1b63ef4fcf48ce1dfb881564b408f77a0374207 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']
 
@@ -42,6 +42,12 @@ class LazyUUIDTask(object):
     def __repr__(self):
         return "LazyUUIDTask: {0}".format(self._uuid)
 
+    def __copy__(self):
+        return LazyUUIDTask(self._tw, self._uuid)
+
+    def __deepcopy__(self, memo):
+        return LazyUUIDTask(self._tw, self._uuid)
+
     @property
     def saved(self):
         """
@@ -49,6 +55,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
@@ -110,18 +124,37 @@ class LazyUUIDTaskSet(object):
     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)