Run Detail
completedqwen3.8-27b30 answersRecorded for these videos
Provider
openrouter
Challenge Version
v1.0
Turns
30
Duration
302.2s
Total Tokens
222,010
Input Tokens
5,244
Output Tokens
216,766
Reasoning Tokens
213,072
Reasoning Effort
default
Cached Input Tokens
2,304
Est. Cost
$0.4341
Started
11/4/2026, 11:17:54 PM
OR Provider
Tenstorrent
Finish Reason
stop
Generation ID
gen-1793834507-HjMG3KDfmVXeRLo83xuV
Turns (30)
Turn #1Raw score: 1
128 in289 out238 reasoning64 cached417 total2.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
return year % 400 == 0 or (year % 4 == 0 and year % 100 != 0)
Turn #2Raw score: 1
128 in349 out296 reasoning64 cached477 total3.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
return (year % 4 == 0 and year % 100 != 0) or (year % 400 == 0)
Turn #3Raw score: 1
128 in133 out82 reasoning261 total1.0s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
return year % 400 == 0 or (year % 4 == 0 and year % 100 != 0)
Turn #4Raw score: 1
164 in747 out635 reasoning911 total5.8s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write rle(s: str) -> str to perform run-length encoding on s. Replace each run of consecutive identical characters with that character followed by the run length. rle("aaabcc") returns "a3b1c2" and rle("") returns "".
assistant
def rle(s: str) -> str:
if not s:
return ""
result = []
current = s[0]
count = 1
for ch in s[1:]:
if ch == current:
count += 1
else:
result.append(f"{current}{count}")
current = ch
count = 1
result.append(f"{current}{count}")
return "".join(result)
Turn #5Raw score: 1
164 in392 out280 reasoning556 total3.2s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write rle(s: str) -> str to perform run-length encoding on s. Replace each run of consecutive identical characters with that character followed by the run length. rle("aaabcc") returns "a3b1c2" and rle("") returns "".
assistant
def rle(s: str) -> str:
if not s:
return ""
result = []
current = s[0]
count = 1
for ch in s[1:]:
if ch == current:
count += 1
else:
result.append(f"{current}{count}")
current = ch
count = 1
result.append(f"{current}{count}")
return "".join(result)
Turn #6Raw score: 1
164 in169 out122 reasoning333 total1.4s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write rle(s: str) -> str to perform run-length encoding on s. Replace each run of consecutive identical characters with that character followed by the run length. rle("aaabcc") returns "a3b1c2" and rle("") returns "".
assistant
from itertools import groupby
def rle(s: str) -> str:
return "".join(f"{char}{len(list(run))}" for char, run in groupby(s))
Turn #7Raw score: 1
159 in638 out533 reasoning64 cached797 total4.5s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write chunks(items, n: int) -> list[list]. items is an iterable, which may be a generator. Return consecutive lists of n elements, where the last list may be shorter. Raise ValueError when n is less than 1.
assistant
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
result: list[list] = []
current: list = []
for item in items:
current.append(item)
if len(current) == n:
result.append(current)
current = []
if current:
result.append(current)
return result
Turn #8Raw score: 1
159 in1,191 out1,086 reasoning64 cached1,350 total8.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write chunks(items, n: int) -> list[list]. items is an iterable, which may be a generator. Return consecutive lists of n elements, where the last list may be shorter. Raise ValueError when n is less than 1.
assistant
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
result: list[list] = []
current: list = []
for item in items:
current.append(item)
if len(current) == n:
result.append(current)
current = []
if current:
result.append(current)
return result
Turn #9Raw score: 1
159 in1,185 out1,080 reasoning64 cached1,344 total8.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write chunks(items, n: int) -> list[list]. items is an iterable, which may be a generator. Return consecutive lists of n elements, where the last list may be shorter. Raise ValueError when n is less than 1.
assistant
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
result: list[list] = []
current: list = []
for item in items:
current.append(item)
if len(current) == n:
result.append(current)
current = []
if current:
result.append(current)
return result
Turn #10Raw score: 0
197 in32,000 out32,000 reasoning64 cached32,197 total185.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write round_half_up(value: str, digits: int) -> str. The string value represents a decimal number. Round it to digits decimal places, rounding exact ties away from zero based on the exact value written in value. Return a string with exactly digits decimal places, and omit the decimal point when digits is 0. round_half_up("2.675", 2) returns "2.68".
Turn #11Raw score: 0
197 in32,000 out32,000 reasoning192 cached32,197 total218.2s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write round_half_up(value: str, digits: int) -> str. The string value represents a decimal number. Round it to digits decimal places, rounding exact ties away from zero based on the exact value written in value. Return a string with exactly digits decimal places, and omit the decimal point when digits is 0. round_half_up("2.675", 2) returns "2.68".
Turn #12Raw score: 0
197 in24,768 out24,767 reasoning192 cached24,965 total151.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write round_half_up(value: str, digits: int) -> str. The string value represents a decimal number. Round it to digits decimal places, rounding exact ties away from zero based on the exact value written in value. Return a string with exactly digits decimal places, and omit the decimal point when digits is 0. round_half_up("2.675", 2) returns "2.68".
Turn #13Raw score: 1
192 in2,788 out2,526 reasoning64 cached2,980 total24.3s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write parse_kv(line: str) -> dict[str, str]. The string line contains key=value pairs separated by one or more spaces. A value may be enclosed in double quotes; if so, it may contain spaces and =, and the quotes are not included in the parsed value. A value may be empty, as in c=. If a key repeats, use the last value. Return {} for an empty line.
assistant
def parse_kv(line: str) -> dict[str, str]:
parsed: dict[str, str] = {}
if not line.strip():
return parsed
i = 0
n = len(line)
while i < n:
while i < n and line[i].isspace():
i += 1
if i >= n:
break
key_start = i
while i < n and line[i] != "=" and not line[i].isspace():
i += 1
key = line[key_start:i]
if i < n and line[i] == "=":
i += 1
if i < n and line[i] == '"':
i += 1
value_start = i
while i < n and line[i] != '"':
i += 1
parsed[key] = line[value_start:i]
if i < n:
i += 1
else:
value_start = i
while i < n and not line[i].isspace():
i += 1
parsed[key] = line[value_start:i]
return parsed
Turn #14Raw score: 1
192 in13,190 out12,922 reasoning64 cached13,382 total133.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write parse_kv(line: str) -> dict[str, str]. The string line contains key=value pairs separated by one or more spaces. A value may be enclosed in double quotes; if so, it may contain spaces and =, and the quotes are not included in the parsed value. A value may be empty, as in c=. If a key repeats, use the last value. Return {} for an empty line.
assistant
def parse_kv(line: str) -> dict[str, str]:
if not line.strip():
return {}
result: dict[str, str] = {}
i = 0
n = len(line)
while i < n:
while i < n and line[i].isspace():
i += 1
if i >= n:
break
key_start = i
while i < n and line[i] != "=" and not line[i].isspace():
i += 1
if i >= n or line[i] != "=":
continue
key = line[key_start:i]
i += 1
if i < n and line[i] == '"':
i += 1
value_start = i
while i < n and line[i] != '"':
i += 1
value = line[value_start:i]
if i < n:
i += 1
else:
value_start = i
while i < n and not line[i].isspace():
i += 1
value = line[value_start:i]
result[key] = value
return result
Turn #15Raw score: 1
192 in17,126 out16,852 reasoning64 cached17,318 total136.0s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write parse_kv(line: str) -> dict[str, str]. The string line contains key=value pairs separated by one or more spaces. A value may be enclosed in double quotes; if so, it may contain spaces and =, and the quotes are not included in the parsed value. A value may be empty, as in c=. If a key repeats, use the last value. Return {} for an empty line.
assistant
def parse_kv(line: str) -> dict[str, str]:
result: dict[str, str] = {}
if not line.strip():
return result
i = 0
n = len(line)
while i < n:
while i < n and line[i].isspace():
i += 1
if i >= n:
break
key_start = i
while i < n and not line[i].isspace() and line[i] != '=':
i += 1
key = line[key_start:i]
if i >= n or line[i] != '=':
continue
i += 1
if i < n and line[i] == '"':
i += 1
value_start = i
while i < n and line[i] != '"':
i += 1
value = line[value_start:i]
if i < n:
i += 1
else:
value_start = i
while i < n and not line[i].isspace():
i += 1
value = line[value_start:i]
if key:
result[key] = value
return result
Turn #16Raw score: 1
178 in702 out554 reasoning64 cached880 total6.0s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]. The input intervals may be in any order. Merge intervals that overlap or touch, so (1, 2) and (2, 3) become (1, 3). Return the merged intervals as tuples sorted by start, and leave the input list unchanged.
assistant
def merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]:
if not intervals:
return []
sorted_intervals = sorted(intervals, key=lambda interval: (interval[0], interval[1]))
merged: list[tuple[int, int]] = [tuple(sorted_intervals[0])]
for start, end in sorted_intervals[1:]:
last_start, last_end = merged[-1]
if start <= last_end:
merged[-1] = (last_start, max(last_end, end))
else:
merged.append((start, end))
return merged
Turn #17Raw score: 1
178 in451 out316 reasoning128 cached629 total3.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]. The input intervals may be in any order. Merge intervals that overlap or touch, so (1, 2) and (2, 3) become (1, 3). Return the merged intervals as tuples sorted by start, and leave the input list unchanged.
assistant
def merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]:
if not intervals:
return []
sorted_intervals = sorted(intervals)
merged: list[tuple[int, int]] = [tuple(sorted_intervals[0])]
for start, end in sorted_intervals[1:]:
last_start, last_end = merged[-1]
if start <= last_end:
merged[-1] = (last_start, max(last_end, end))
else:
merged.append((start, end))
return merged
Turn #18Raw score: 1
178 in778 out644 reasoning128 cached956 total5.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]. The input intervals may be in any order. Merge intervals that overlap or touch, so (1, 2) and (2, 3) become (1, 3). Return the merged intervals as tuples sorted by start, and leave the input list unchanged.
assistant
def merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]:
if not intervals:
return []
merged: list[list[int]] = []
for start, end in sorted(intervals, key=lambda x: (x[0], x[1])):
if not merged or start > merged[-1][1]:
merged.append([start, end])
elif end > merged[-1][1]:
merged[-1][1] = end
return [(start, end) for start, end in merged]
Turn #19Raw score: 1
154 in1,700 out1,600 reasoning64 cached1,854 total12.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write add_months(d: datetime.date, months: int) -> datetime.date to add months calendar months to d. months may be negative. If the day does not exist in the target month, use the last day of that month.
assistant
import calendar
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
total = d.year * 12 + (d.month - 1) + months
year, month = divmod(total, 12)
month += 1
last_day = calendar.monthrange(year, month)[1]
return datetime.date(year, month, min(d.day, last_day))
Turn #20Raw score: 1
154 in2,686 out2,582 reasoning64 cached2,840 total19.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write add_months(d: datetime.date, months: int) -> datetime.date to add months calendar months to d. months may be negative. If the day does not exist in the target month, use the last day of that month.
assistant
import calendar
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
month_index = d.year * 12 + (d.month - 1) + months
year = month_index // 12
month = month_index % 12 + 1
last_day = calendar.monthrange(year, month)[1]
return datetime.date(year, month, min(d.day, last_day))
Turn #21Raw score: 1
154 in4,442 out4,272 reasoning128 cached4,596 total33.4s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write add_months(d: datetime.date, months: int) -> datetime.date to add months calendar months to d. months may be negative. If the day does not exist in the target month, use the last day of that month.
assistant
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
month_index = d.month - 1 + months
year = d.year + month_index // 12
month = month_index % 12 + 1
if month == 2:
last_day = 29 if (year % 4 == 0 and (year % 100 != 0 or year % 400 == 0)) else 28
elif month in (4, 6, 9, 11):
last_day = 30
else:
last_day = 31
return datetime.date(year, month, min(d.day, last_day))
Turn #22Raw score: 1
178 in1,586 out1,491 reasoning64 cached1,764 total12.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write top_k_words(text: str, k: int) -> list[tuple[str, int]]. A word is a maximal sequence of ASCII letters and apostrophes. Words compare case-insensitively and are returned in lowercase. Return the k most frequent words as (word, count) tuples, sorted by highest count first, breaking ties alphabetically by word.
assistant
import re
from collections import Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
if k <= 0:
return []
counts = Counter(word.lower() for word in re.findall(r"[A-Za-z']+", text))
return sorted(counts.items(), key=lambda item: (-item[1], item[0]))[:k]
Turn #23Raw score: 1
178 in2,262 out2,159 reasoning64 cached2,440 total17.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write top_k_words(text: str, k: int) -> list[tuple[str, int]]. A word is a maximal sequence of ASCII letters and apostrophes. Words compare case-insensitively and are returned in lowercase. Return the k most frequent words as (word, count) tuples, sorted by highest count first, breaking ties alphabetically by word.
assistant
from collections import Counter
import re
_WORD_RE = re.compile(r"[A-Za-z']+")
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
if k <= 0:
return []
counts = Counter(word.lower() for word in _WORD_RE.findall(text))
return sorted(counts.items(), key=lambda item: (-item[1], item[0]))[:k]
Turn #24Raw score: 1
178 in1,018 out916 reasoning128 cached1,196 total7.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write top_k_words(text: str, k: int) -> list[tuple[str, int]]. A word is a maximal sequence of ASCII letters and apostrophes. Words compare case-insensitively and are returned in lowercase. Return the k most frequent words as (word, count) tuples, sorted by highest count first, breaking ties alphabetically by word.
assistant
import re
from collections import Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
if k <= 0:
return []
words = [word.lower() for word in re.findall(r"[A-Za-z']+", text)]
counts = Counter(words)
return sorted(counts.items(), key=lambda item: (-item[1], item[0]))[:k]
Turn #25Raw score: 1
214 in5,786 out5,625 reasoning64 cached6,000 total45.2s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write flatten(obj: dict, sep: str = ".") -> dict. Flatten nested dicts and lists into a single level, joining keys with sep and using list indices as keys. Keep an empty dict or empty list as the value at its key. flatten({"a": {"b": 1}, "c": [{"d": 2}, 3], "e": {}}) returns {"a.b": 1, "c.0.d": 2, "c.1": 3, "e": {}}.
assistant
def flatten(obj: dict, sep: str = ".") -> dict:
result = {}
def add(key, value):
if isinstance(value, dict):
if value:
for k, v in value.items():
add(key + sep + str(k), v)
else:
result[key] = value
elif isinstance(value, list):
if value:
for i, v in enumerate(value):
add(key + sep + str(i), v)
else:
result[key] = value
else:
result[key] = value
for k, v in obj.items():
add(str(k), v)
return result
Turn #26Raw score: 1
214 in9,197 out9,006 reasoning192 cached9,411 total68.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write flatten(obj: dict, sep: str = ".") -> dict. Flatten nested dicts and lists into a single level, joining keys with sep and using list indices as keys. Keep an empty dict or empty list as the value at its key. flatten({"a": {"b": 1}, "c": [{"d": 2}, 3], "e": {}}) returns {"a.b": 1, "c.0.d": 2, "c.1": 3, "e": {}}.
assistant
def flatten(obj: dict, sep: str = ".") -> dict:
result: dict = {}
stack = [(value, str(key)) for key, value in reversed(obj.items())]
while stack:
value, prefix = stack.pop()
if isinstance(value, dict):
if not value:
result[prefix] = value
else:
for key, item in reversed(value.items()):
stack.append((item, prefix + sep + str(key)))
elif isinstance(value, list):
if not value:
result[prefix] = value
else:
for index in range(len(value) - 1, -1, -1):
stack.append((value[index], prefix + sep + str(index)))
else:
result[prefix] = value
return result
Turn #27Raw score: 1
214 in20,052 out19,849 reasoning20,266 total150.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write flatten(obj: dict, sep: str = ".") -> dict. Flatten nested dicts and lists into a single level, joining keys with sep and using list indices as keys. Keep an empty dict or empty list as the value at its key. flatten({"a": {"b": 1}, "c": [{"d": 2}, 3], "e": {}}) returns {"a.b": 1, "c.0.d": 2, "c.1": 3, "e": {}}.
assistant
def flatten(obj: dict, sep: str = ".") -> dict:
result = {}
stack = [(None, obj)]
while stack:
prefix, value = stack.pop()
if isinstance(value, (dict, list)) and value:
if isinstance(value, dict):
for key, item in reversed(list(value.items())):
key = str(key)
full_key = key if prefix is None else f"{prefix}{sep}{key}"
stack.append((full_key, item))
else:
for index in range(len(value) - 1, -1, -1):
item = value[index]
full_key = str(index) if prefix is None else f"{prefix}{sep}{index}"
stack.append((full_key, item))
elif prefix is not None:
result[prefix] = value
return result
Turn #28Raw score: 1
184 in15,453 out15,305 reasoning128 cached15,637 total151.5s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write lru(maxsize: int), a decorator factory that caches a function's results by its positional arguments without using functools.lru_cache or functools.cache. It stores at most maxsize results. When the cache is full, evict the least recently used result. A cache hit counts as a use. The decorated function must preserve its original __name__.
assistant
from collections import OrderedDict
def lru(maxsize: int):
def decorator(func):
cache = OrderedDict()
def wrapper(*args, **kwargs):
key = args
if key in cache:
cache.move_to_end(key)
return cache[key]
result = func(*args, **kwargs)
if maxsize is None or maxsize > 0:
cache[key] = result
if maxsize is not None and len(cache) > maxsize:
cache.popitem(last=False)
return result
wrapper.__name__ = func.__name__
return wrapper
return decorator
Turn #29Raw score: 1
184 in11,216 out11,039 reasoning128 cached11,400 total115.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write lru(maxsize: int), a decorator factory that caches a function's results by its positional arguments without using functools.lru_cache or functools.cache. It stores at most maxsize results. When the cache is full, evict the least recently used result. A cache hit counts as a use. The decorated function must preserve its original __name__.
assistant
def lru(maxsize: int):
def decorator(func):
store = {}
def wrapper(*args, **kwargs):
if maxsize <= 0:
return func(*args, **kwargs)
key = args
if key in store:
value = store.pop(key)
store[key] = value
return value
value = func(*args, **kwargs)
if len(store) >= maxsize:
store.pop(next(iter(store)))
store[key] = value
return value
wrapper.__name__ = getattr(func, "__name__", "lru")
wrapper.__doc__ = getattr(func, "__doc__", None)
wrapper.__wrapped__ = func
return wrapper
return decorator
Turn #30Raw score: 1
184 in12,472 out12,295 reasoning12,656 total126.4s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write lru(maxsize: int), a decorator factory that caches a function's results by its positional arguments without using functools.lru_cache or functools.cache. It stores at most maxsize results. When the cache is full, evict the least recently used result. A cache hit counts as a use. The decorated function must preserve its original __name__.
assistant
from collections import OrderedDict
def lru(maxsize: int):
def decorator(func):
cache = OrderedDict()
def wrapper(*args, **kwargs):
key = args
if maxsize is None or maxsize > 0:
if key in cache:
cache.move_to_end(key)
return cache[key]
value = func(*args, **kwargs)
if maxsize is not None and len(cache) >= maxsize:
cache.popitem(last=False)
cache[key] = value
return value
return func(*args, **kwargs)
wrapper.__name__ = func.__name__
wrapper.__doc__ = func.__doc__
wrapper.__wrapped__ = func
return wrapper
return decorator