def add (self, k, evt): if k in self.k2e: self.k2e[k].append (evt) else: self.k2e[k] = [evt] bisect.insort (self.k, k)