12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697 |
- # -*- coding: utf-8 -*-
- # Copyright 2016 OpenMarket Ltd
- #
- # 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.
- class _Entry(object):
- __slots__ = ["end_key", "queue"]
- def __init__(self, end_key):
- self.end_key = end_key
- self.queue = []
- class WheelTimer(object):
- """Stores arbitrary objects that will be returned after their timers have
- expired.
- """
- def __init__(self, bucket_size=5000):
- """
- Args:
- bucket_size (int): Size of buckets in ms. Corresponds roughly to the
- accuracy of the timer.
- """
- self.bucket_size = bucket_size
- self.entries = []
- self.current_tick = 0
- def insert(self, now, obj, then):
- """Inserts object into timer.
- Args:
- now (int): Current time in msec
- obj (object): Object to be inserted
- then (int): When to return the object strictly after.
- """
- then_key = int(then / self.bucket_size) + 1
- if self.entries:
- min_key = self.entries[0].end_key
- max_key = self.entries[-1].end_key
- if then_key <= max_key:
- # The max here is to protect against inserts for times in the past
- self.entries[max(min_key, then_key) - min_key].queue.append(obj)
- return
- next_key = int(now / self.bucket_size) + 1
- if self.entries:
- last_key = self.entries[-1].end_key
- else:
- last_key = next_key
- # Handle the case when `then` is in the past and `entries` is empty.
- then_key = max(last_key, then_key)
- # Add empty entries between the end of the current list and when we want
- # to insert. This ensures there are no gaps.
- self.entries.extend(
- _Entry(key) for key in xrange(last_key, then_key + 1)
- )
- self.entries[-1].queue.append(obj)
- def fetch(self, now):
- """Fetch any objects that have timed out
- Args:
- now (ms): Current time in msec
- Returns:
- list: List of objects that have timed out
- """
- now_key = int(now / self.bucket_size)
- ret = []
- while self.entries and self.entries[0].end_key <= now_key:
- ret.extend(self.entries.pop(0).queue)
- return ret
- def __len__(self):
- l = 0
- for entry in self.entries:
- l += len(entry.queue)
- return l
|