mirror of
https://github.com/zulip/zulip.git
synced 2025-11-04 22:13:26 +00:00
ebebd04587
Pathways that only catch internal code errors should use AssertionError so that they are not included when computing test coverage.
30 lines
1.1 KiB
Python
30 lines
1.1 KiB
Python
from zerver.lib.timestamp import floor_to_hour, floor_to_day, timestamp_to_datetime
|
|
from analytics.lib.counts import CountStat
|
|
|
|
from datetime import datetime, timedelta
|
|
from typing import List, Optional
|
|
|
|
# If min_length is None, returns end_times from ceiling(start) to floor(end), inclusive.
|
|
# If min_length is greater than 0, pads the list to the left.
|
|
# So informally, time_range(Sep 20, Sep 22, day, None) returns [Sep 20, Sep 21, Sep 22],
|
|
# and time_range(Sep 20, Sep 22, day, 5) returns [Sep 18, Sep 19, Sep 20, Sep 21, Sep 22]
|
|
def time_range(start, end, frequency, min_length):
|
|
# type: (datetime, datetime, str, Optional[int]) -> List[datetime]
|
|
if frequency == CountStat.HOUR:
|
|
end = floor_to_hour(end)
|
|
step = timedelta(hours=1)
|
|
elif frequency == CountStat.DAY:
|
|
end = floor_to_day(end)
|
|
step = timedelta(days=1)
|
|
else:
|
|
raise AssertionError("Unknown frequency: %s" % (frequency,))
|
|
|
|
times = []
|
|
if min_length is not None:
|
|
start = min(start, end - (min_length-1)*step)
|
|
current = end
|
|
while current >= start:
|
|
times.append(current)
|
|
current -= step
|
|
return list(reversed(times))
|