/usr/share/pyshared/pycalendar/recurrenceset.py is in python-pycalendar 2.0~svn13177-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 | ##
# Copyright (c) 2007-2012 Cyrus Daboo. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
##
from pycalendar.utils import set_difference
class PyCalendarRecurrenceSet(object):
def __init__(self):
self.mRrules = []
self.mExrules = []
self.mRdates = []
self.mExdates = []
self.mRperiods = []
self.mExperiods = []
def duplicate(self):
other = PyCalendarRecurrenceSet()
other.mRrules = [i.duplicate() for i in self.mRrules]
other.mExrules = [i.duplicate() for i in self.mExrules]
other.mRdates = [i.duplicate() for i in self.mRdates]
other.mExdates = [i.duplicate() for i in self.mExdates]
other.mRperiods = [i.duplicate() for i in self.mRperiods]
other.mExperiods = [i.duplicate() for i in self.mExperiods]
return other
def hasRecurrence(self):
return ((len(self.mRrules) != 0) or (len(self.mRdates) != 0) or (len(self.mRperiods) != 0)
or (len(self.mExrules) != 0) or (len(self.mExdates) != 0)
or (len(self.mExperiods) != 0))
def equals(self, comp):
# Look at RRULEs
if not self.equalsRules(self.mRrules, comp.self.mRrules):
return False
# Look at EXRULEs
if not self.equalsRules(self.mExrules, comp.self.mExrules):
return False
# Look at RDATEs
if not self.equalsDates(self.mRdates, comp.self.mRdates):
return False
if not self.equalsPeriods(self.mRperiods, comp.self.mRperiods):
return False
# Look at EXDATEs
if not self.equalsDates(self.mExdates, comp.self.mExdates):
return False
if not self.equalsPeriods(self.mExperiods, comp.self.mExperiods):
return False
# If we get here they match
return True
def equalsRules(self, rules1, rules2):
# Check sizes first
if len(rules1) != len(rules2):
return False
elif len(rules1) == 0:
return True
# Do sledge hammer O(n^2) approach as its not easy to sort these things
# for a smarter test.
# In most cases there will only be one rule anyway, so this should not
# be too painful.
temp2 = rules2[:]
for r1 in rules1:
found = False
for r2 in temp2:
if r1.equals(r2):
# Remove the one found so it is not tested again
temp2.remove(r2)
found = True
break
if not found:
return False
return True
def equalsDates(self, dates1, dates2):
# Check sizes first
if len(dates1) != len(dates2):
return False
elif len(dates1) == 0:
return True
# Copy each and sort for comparison
dt1 = dates1[:]
dt2 = dates2[:]
dt1.sort(key=lambda x: x.getPosixTime())
dt2.sort(key=lambda x: x.getPosixTime())
return dt1.equal(dt2)
def equalsPeriods(self, periods1, periods2):
# Check sizes first
if len(periods1) != len(periods2):
return False
elif len(periods1) == 0:
return True
# Copy each and sort for comparison
p1 = periods1[:]
p2 = periods2[:]
p1.sort()
p2.sort()
return p1.equal(p2)
def addRule(self, rule):
self.mRrules.append(rule)
def subtractRule(self, rule):
self.mExrules.append(rule)
def addDT(self, dt):
self.mRdates.append(dt)
def subtractDT(self, dt):
self.mExdates.append(dt)
def addPeriod(self, p):
self.mRperiods.append(p)
def subtractPeriod(self, p):
self.mExperiods.append(p)
def getRules(self):
return self.mRrules
def getExrules(self):
return self.mExrules
def getDates(self):
return self.mRdates
def getExdates(self):
return self.mExdates
def getPeriods(self):
return self.mRperiods
def getExperiods(self):
return self.mExperiods
def expand(self, start, range, items, float_offset=0):
# Need to return whether the limit was applied or not
limited = False
# Now create list of items to include
include = []
# Always include the initial DTSTART if within the range
if range.isDateWithinPeriod(start):
include.append(start)
else:
limited = True
# RRULES
for iter in self.mRrules:
if iter.expand(start, range, include, float_offset=float_offset):
limited = True
# RDATES
for iter in self.mRdates:
if range.isDateWithinPeriod(iter):
include.append(iter)
else:
limited = True
for iter in self.mRperiods:
if range.isPeriodOverlap(iter):
include.append(iter.getStart())
else:
limited = True
# Make sure the list is unique
include = [x for x in set(include)]
include.sort(key=lambda x: x.getPosixTime())
# Now create list of items to exclude
exclude = []
# EXRULES
for iter in self.mExrules:
iter.expand(start, range, exclude, float_offset=float_offset)
# EXDATES
for iter in self.mExdates:
if range.isDateWithinPeriod(iter):
exclude.append(iter)
for iter in self.mExperiods:
if range.isPeriodOverlap(iter):
exclude.append(iter.getStart())
# Make sure the list is unique
exclude = [x for x in set(exclude)]
exclude.sort(key=lambda x: x.getPosixTime())
# Add difference between to the two sets (include - exclude) to the
# results
items.extend(set_difference(include, exclude))
return limited
def changed(self):
# RRULES
for iter in self.mRrules:
iter.clear()
# EXRULES
for iter in self.mExrules:
iter.clear()
def excludeFutureRecurrence(self, exclude):
# Adjust RRULES to end before start
for iter in self.mRrules:
iter.excludeFutureRecurrence(exclude)
# Remove RDATES on or after start
self.mRdates.removeOnOrAfter(exclude)
for iter in self.mRperiods:
if iter > exclude:
self.mRperiods.remove(iter)
# UI operations
def isSimpleUI(self):
# Right now the Event dialog only handles a single RRULE (but we allow
# any number of EXDATES as deleted
# instances will appear as EXDATES)
if ((len(self.mRrules) > 1) or (len(self.mExrules) > 0)
or (len(self.mRdates) > 0) or (len(self.mRperiods) > 0)):
return False
# Also, check the rule iteself
elif len(self.mRrules) == 1:
return self.mRrules.firstElement().isSimpleRule()
else:
return True
def isAdvancedUI(self):
# Right now the Event dialog only handles a single RRULE
if ((len(self.mRrules) > 1) or (len(self.mExrules) > 0)
or (len(self.mRdates) > 0) or (len(self.mRperiods) > 0)):
return False
# Also, check the rule iteself
elif len(self.mRrules) == 1:
return self.mRrules.firstElement().isAdvancedRule()
else:
return True
def getUIRecurrence(self):
if len(self.mRrules) == 1:
return self.mRrules[0]
else:
return None
def getUIDescription(self):
# Check for anything
if not self.hasRecurrence():
return "No Recurrence"
# Look for a single RRULE and return its descriptor
if ((len(self.mRrules) == 1) and (len(self.mExrules) == 0) and (len(self.mRdates) == 0)
and (len(self.mExdates) == 0) and (len(self.mRperiods) == 0)
and (len(self.mExperiods) == 0)):
return self.mRrules.firstElement().getUIDescription()
# Indicate some form of complex recurrence
return "Multiple recurrence rules, dates or exclusions"
|