def slice(self, start): if start < 0: raise userError(u"slice/1: Negative start") keys = self.objectSet.keys()[start:] rv = monteSet() for k in keys: rv[k] = None return rv
def _slice(self, start, stop): if start < 0: raise userError(u"slice/2: Negative start") if stop < 0: raise userError(u"slice/2: Negative stop") keys = self.objectSet.keys()[start:stop] rv = monteSet() for k in keys: rv[k] = None return rv
def slice(self, start, stop=-1): assert start >= 0 if stop < 0: keys = self.objectSet.keys()[start:] else: keys = self.objectSet.keys()[start:stop] rv = monteSet() for k in keys: rv[k] = None return ConstSet(rv)
def _and(self, other): if (len(self.objectSet) > len(other)): bigger = self.objectSet smaller = other else: bigger = other smaller = self.objectSet rv = monteSet() for k in smaller: if k in bigger: rv[k] = None return rv
def _and(self, otherSet): other = unwrapSet(otherSet) if (len(self.objectSet) > len(other)): bigger = self.objectSet smaller = other else: bigger = other smaller = self.objectSet rv = monteSet() for k in smaller: if k in bigger: rv[k] = None return ConstSet(rv)
def __init__(self, objectSet, guard=None): self._g = guard self.objectSet = monteSet() for obj in objectSet: self.objectSet[self.coerce(obj)] = None
def prepareReport(self, auditors): s = monteSet() for (k, (result, _, _)) in self.cache.items(): if result: s[k] = None return AuditorReport(s)
def prepareReport(self): s = monteSet() for (k, (result, _, _)) in self.cache.items(): if result: s[k] = None return AuditorReport(s, self.guardInfo.isDynamic())