Run Detail
completednex-n2.630 answersRecorded for these videos
Provider
openrouter
Challenge Version
v1.0
Turns
30
Duration
508.4s
Total Tokens
94,909
Input Tokens
3,978
Output Tokens
90,931
Reasoning Tokens
87,612
Reasoning Effort
default
Est. Cost
$0.0368
Started
11/10/2026, 12:15:50 PM
OR Provider
Nex AGI
Finish Reason
length
Generation ID
gen-1794312962-u8EQCNWbUWAl6wVQ9Bla
Turns (30)
Turn #1Raw score: 1
86 in237 out194 reasoning323 total3.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 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 #2Raw score: 1
86 in718 out675 reasoning804 total8.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 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
86 in687 out644 reasoning773 total8.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 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 #4Raw score: 1
122 in669 out567 reasoning791 total7.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 ""
parts: list[str] = []
current = s[0]
count = 1
for ch in s[1:]:
if ch == current:
count += 1
else:
parts.append(f"{current}{count}")
current = ch
count = 1
parts.append(f"{current}{count}")
return "".join(parts)
Turn #5Raw score: 1
122 in746 out639 reasoning868 total9.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 ""
parts: list[str] = []
current = s[0]
count = 1
for ch in s[1:]:
if ch == current:
count += 1
else:
parts.append(current)
parts.append(str(count))
current = ch
count = 1
parts.append(current)
parts.append(str(count))
return "".join(parts)
Turn #6Raw score: 1
122 in161 out114 reasoning283 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
from itertools import groupby
def rle(s: str) -> str:
return "".join(f"{char}{sum(1 for _ in group)}" for char, group in groupby(s))
Turn #7Raw score: 1
117 in821 out730 reasoning938 total9.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 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
117 in755 out674 reasoning872 total9.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 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
from itertools import islice
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
iterator = iter(items)
result = []
while True:
chunk = list(islice(iterator, n))
if not chunk:
return result
result.append(chunk)
Turn #9Raw score: 1
117 in650 out578 reasoning767 total6.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 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
from itertools import islice
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
it = iter(items)
result = []
while chunk := list(islice(it, n)):
result.append(chunk)
return result
Turn #10Raw score: 0
153 in32,000 out32,000 reasoning32,153 total495.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 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: 1
153 in5,544 out5,386 reasoning5,697 total61.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".
assistant
from decimal import Decimal, ROUND_HALF_UP, localcontext
def round_half_up(value: str, digits: int) -> str:
d = Decimal(value)
if not d.is_finite():
return str(d)
_, coeffs, exp = d.as_tuple()
int_digits = len(coeffs) + exp
if int_digits < 1:
int_digits = 1
with localcontext() as ctx:
ctx.prec = int_digits + digits + 2
quantum = Decimal((0, (1,), -digits))
result = d.quantize(quantum, rounding=ROUND_HALF_UP)
if result == 0:
result = result.copy_abs()
return format(result, "f")
Turn #12Raw score: 1
153 in9,334 out9,232 reasoning9,487 total102.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 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".
assistant
from decimal import Decimal, ROUND_HALF_UP, localcontext
def round_half_up(value: str, digits: int) -> str:
with localcontext() as ctx:
ctx.prec = len(value) + max(digits, 0) + 10
number = Decimal(value)
quantum = Decimal(1).scaleb(-digits)
rounded = number.quantize(quantum, rounding=ROUND_HALF_UP)
return format(rounded, "f")
Turn #13Raw score: 1
150 in2,756 out2,638 reasoning2,906 total23.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 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
import re
_KV_PATTERN = re.compile(r'([^\s=]+)=("([^"]*)"|[^\s]*)')
def parse_kv(line: str) -> dict[str, str]:
result: dict[str, str] = {}
for match in _KV_PATTERN.finditer(line):
key = match.group(1)
quoted_value = match.group(3)
if quoted_value is not None:
value = quoted_value
else:
value = match.group(2)
result[key] = value
return result
Turn #14Raw score: 1
150 in8,987 out8,758 reasoning9,137 total87.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 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] = {}
i = 0
n = len(line)
while i < n:
while i < n and line[i].isspace():
i += 1
if i >= n:
break
eq = line.find("=", i)
if eq == -1:
while i < n and not line[i].isspace():
i += 1
continue
key = line[i:eq]
i = eq + 1
if i < n and line[i] == '"':
i += 1
start = i
while i < n and line[i] != '"':
i += 1
value = line[start:i]
if i < n:
i += 1
else:
start = i
while i < n and not line[i].isspace():
i += 1
value = line[start:i]
result[key] = value
return result
Turn #15Raw score: 1
150 in3,048 out2,809 reasoning3,198 total31.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 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] = {}
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]
parsed[key] = value
return parsed
Turn #16Raw score: 1
136 in629 out510 reasoning765 total8.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 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]] = [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
136 in544 out400 reasoning680 total6.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 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 iv: iv[0])
merged: list[tuple[int, int]] = []
current_start, current_end = sorted_intervals[0]
for start, end in sorted_intervals[1:]:
if start <= current_end:
if end > current_end:
current_end = end
else:
merged.append((current_start, current_end))
current_start, current_end = start, end
merged.append((current_start, current_end))
return merged
Turn #18Raw score: 1
136 in627 out484 reasoning763 total8.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 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 iv: iv[0])
merged: list[tuple[int, int]] = []
current_start, current_end = sorted_intervals[0]
for start, end in sorted_intervals[1:]:
if start <= current_end:
if end > current_end:
current_end = end
else:
merged.append((current_start, current_end))
current_start, current_end = start, end
merged.append((current_start, current_end))
return merged
Turn #19Raw score: 1
112 in293 out199 reasoning405 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 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_index = divmod(total, 12)
month = month_index + 1
day = min(d.day, calendar.monthrange(year, month)[1])
return datetime.date(year, month, day)
Turn #20Raw score: 1
112 in2,034 out1,925 reasoning2,146 total19.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 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
new_year, month_index = divmod(total, 12)
new_month = month_index + 1
last_day = calendar.monthrange(new_year, new_month)[1]
new_day = min(d.day, last_day)
return datetime.date(new_year, new_month, new_day)
Turn #21Raw score: 1
112 in405 out304 reasoning517 total4.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_index = divmod(total, 12)
month = month_index + 1
last_day = calendar.monthrange(year, month)[1]
day = min(d.day, last_day)
return datetime.date(year, month, day)
Turn #22Raw score: 1
136 in1,355 out1,265 reasoning1,491 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
import re
from collections import Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
words = re.findall(r"[A-Za-z']+", text)
counts = Counter(word.lower() for word in words)
ranked = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return ranked[:max(k, 0)]
Turn #23Raw score: 1
136 in528 out432 reasoning664 total6.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 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 = re.findall(r"[A-Za-z']+", text)
counts = Counter(word.lower() for word in words)
ranked = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return ranked[:k]
Turn #24Raw score: 1
136 in852 out766 reasoning988 total9.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 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
import heapq
from collections import Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
words = re.findall(r"[A-Za-z']+", text)
counts = Counter(word.lower() for word in words)
return heapq.nsmallest(k, counts.items(), key=lambda item: (-item[1], item[0]))
Turn #25Raw score: 1
172 in2,133 out1,963 reasoning2,305 total23.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 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 = {}
def walk(prefix: str, value) -> None:
if isinstance(value, dict):
if not value:
result[prefix] = {}
else:
for key, sub in value.items():
walk(f"{prefix}{sep}{key}" if prefix else f"{key}", sub)
elif isinstance(value, list):
if not value:
result[prefix] = []
else:
for index, sub in enumerate(value):
walk(f"{prefix}{sep}{index}" if prefix else f"{index}", sub)
else:
result[prefix] = value
for key, value in obj.items():
walk(f"{key}", value)
return result
Turn #26Raw score: 1
172 in898 out756 reasoning1,070 total10.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 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
from __future__ import annotations
def flatten(obj: dict, sep: str = ".") -> dict:
result: dict = {}
def _flatten(current, prefix: str) -> None:
if isinstance(current, dict):
items = current.items()
else:
items = enumerate(current)
for key, value in items:
new_key = f"{prefix}{sep}{key}" if prefix else str(key)
if (isinstance(value, dict) or isinstance(value, list)) and value:
_flatten(value, new_key)
else:
result[new_key] = value
_flatten(obj, "")
return result
Turn #27Raw score: 1
172 in3,769 out3,605 reasoning3,941 total37.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 = {}
def walk(prefix: str, value: object) -> None:
if isinstance(value, dict):
if not value:
result[prefix] = {}
return
for k, v in value.items():
walk(prefix + sep + str(k) if prefix else str(k), v)
elif isinstance(value, list):
if not value:
result[prefix] = []
return
for i, v in enumerate(value):
walk(prefix + sep + str(i) if prefix else str(i), v)
else:
result[prefix] = value
if not obj:
return {}
walk("", obj)
return result
Turn #28Raw score: 1
142 in7,437 out7,297 reasoning7,579 total94.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 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):
if maxsize <= 0 or kwargs:
return func(*args, **kwargs)
key = args
try:
result = cache.pop(key)
except KeyError:
result = func(*args, **kwargs)
if len(cache) >= maxsize:
cache.popitem(last=False)
cache[key] = result
else:
cache[key] = result
return result
wrapper.__name__ = func.__name__
return wrapper
return decorator
Turn #29Raw score: 1
142 in874 out759 reasoning1,016 total10.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)
cache[key] = result
if len(cache) > maxsize:
cache.popitem(last=False)
return result
wrapper.__name__ = func.__name__
return wrapper
return decorator
Turn #30Raw score: 1
142 in1,440 out1,309 reasoning1,582 total18.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
from typing import Any, Callable
def lru(maxsize: int) -> Callable:
def decorator(func: Callable) -> Callable:
cache: OrderedDict[tuple, Any] = OrderedDict()
def wrapper(*args: Any) -> Any:
if args in cache:
cache.move_to_end(args)
return cache[args]
result = func(*args)
cache[args] = result
if len(cache) > maxsize:
cache.popitem(last=False)
return result
wrapper.__name__ = func.__name__
return wrapper
return decorator