mirror of
https://github.com/RustPython/RustPython.git
synced 2026-10-28 18:59:04 +08:00
Lee Dogeon
99a63f92aa
Add dependency-free CPU-bound workloads adapted from pyperformance 1.14.0 to cover interpreter, standard-library serialization, regex, numeric, and garbage-collection paths under the existing Criterion and CodSpeed harnesses. Keep inputs deterministic and scale expensive cases for simulation while checking that benchmark execution does not leak interpreter state. Assisted-by: Codex:gpt-5.6-sol
56 lines
1.7 KiB
Python
56 lines
1.7 KiB
Python
# Adapted from python/pyperformance 1.14.0 (nqueens).
|
|
"""Simple, brute-force N-Queens solver."""
|
|
|
|
__author__ = "collinwinter@google.com (Collin Winter)"
|
|
|
|
|
|
# Pure-Python implementation of itertools.permutations().
|
|
def permutations(iterable, r=None):
|
|
"""permutations(range(3), 2) --> (0,1) (0,2) (1,0) (1,2) (2,0) (2,1)"""
|
|
pool = tuple(iterable)
|
|
n = len(pool)
|
|
if r is None:
|
|
r = n
|
|
indices = list(range(n))
|
|
cycles = list(range(n - r + 1, n + 1))[::-1]
|
|
yield tuple(pool[i] for i in indices[:r])
|
|
while n:
|
|
for i in reversed(range(r)):
|
|
cycles[i] -= 1
|
|
if cycles[i] == 0:
|
|
indices[i:] = indices[i + 1:] + indices[i:i + 1]
|
|
cycles[i] = n - i
|
|
else:
|
|
j = cycles[i]
|
|
indices[i], indices[-j] = indices[-j], indices[i]
|
|
yield tuple(pool[i] for i in indices[:r])
|
|
break
|
|
else:
|
|
return
|
|
|
|
|
|
# From http://code.activestate.com/recipes/576647/
|
|
def n_queens(queen_count):
|
|
"""N-Queens solver.
|
|
|
|
Args:
|
|
queen_count: the number of queens to solve for. This is also the
|
|
board size.
|
|
|
|
Yields:
|
|
Solutions to the problem. Each yielded value is looks like
|
|
(3, 8, 2, 1, 4, ..., 6) where each number is the column position for the
|
|
queen, and the index into the tuple indicates the row.
|
|
"""
|
|
cols = range(queen_count)
|
|
for vec in permutations(cols):
|
|
if (queen_count == len(set(vec[i] + i for i in cols))
|
|
== len(set(vec[i] - i for i in cols))):
|
|
yield vec
|
|
|
|
|
|
def bench_n_queens(queen_count):
|
|
list(n_queens(queen_count))
|
|
|
|
bench_n_queens(8)
|