1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227
|
"""This file benchmarks dataclass-like libraries. It measures the following
operations:
- Time to import a new class definition
- Time to create an instance of that class
- Time to compare an instance of that class with another instance.
"""
from time import perf_counter
order_template = """
def __{method}__(self, other):
if type(self) is not type(other):
return NotImplemented
return (
(self.a, self.b, self.c, self.d, self.e) {op}
(other.a, other.b, other.c, other.d, other.e)
)
"""
classes_template = """
import reprlib
class C{n}:
def __init__(self, a, b, c, d, e):
self.a = a
self.b = b
self.c = c
self.d = d
self.e = e
@reprlib.recursive_repr()
def __repr__(self):
return (
f"{{type(self).__name__}}(a={{self.a!r}}, b={{self.b!r}}, "
f"c={{self.c!r}}, d={{self.d!r}}, e={{self.e!r}})"
)
def __eq__(self, other):
if type(self) is not type(other):
return NotImplemented
return (
self.a == other.a and
self.b == other.b and
self.c == other.c and
self.d == other.d and
self.e == other.e
)
""" + "".join(
[
order_template.format(method="lt", op="<"),
order_template.format(method="le", op="<="),
order_template.format(method="gt", op=">"),
order_template.format(method="ge", op=">="),
]
)
attrs_template = """
from attr import define
@define(order=True)
class C{n}:
a: int
b: int
c: int
d: int
e: int
"""
dataclasses_template = """
from dataclasses import dataclass
@dataclass(order=True)
class C{n}:
a: int
b: int
c: int
d: int
e: int
"""
pydantic_template = """
from pydantic import BaseModel
class C{n}(BaseModel):
a: int
b: int
c: int
d: int
e: int
"""
msgspec_template = """
from msgspec import Struct
class C{n}(Struct, order=True):
a: int
b: int
c: int
d: int
e: int
"""
BENCHMARKS = [
("msgspec", "msgspec", msgspec_template),
("standard classes", None, classes_template),
("attrs", "attrs", attrs_template),
("dataclasses", None, dataclasses_template),
("pydantic", "pydantic", pydantic_template),
]
def bench(name, template):
N_classes = 100
source = "\n".join(template.format(n=i) for i in range(N_classes))
code_obj = compile(source, "__main__", "exec")
# Benchmark defining new types
N = 200
start = perf_counter()
for _ in range(N):
ns = {}
exec(code_obj, ns)
end = perf_counter()
define_time = ((end - start) / (N * N_classes)) * 1e6
C = ns["C0"]
# Benchmark creating new instances
N = 1000
M = 1000
start = perf_counter()
for _ in range(N):
[C(a=i, b=i, c=i, d=i, e=i) for i in range(M)]
end = perf_counter()
init_time = ((end - start) / (N * M)) * 1e6
# Benchmark equality
N = 1000
M = 1000
val = M - 1
needle = C(a=val, b=val, c=val, d=val, e=val)
haystack = [C(a=i, b=i, c=i, d=i, e=i) for i in range(M)]
start = perf_counter()
for _ in range(N):
haystack.index(needle)
end = perf_counter()
equality_time = ((end - start) / (N * M)) * 1e6
# Benchmark order
try:
needle < needle
except TypeError:
order_time = None
else:
start = perf_counter()
for _ in range(N):
for obj in haystack:
if obj >= needle:
break
end = perf_counter()
order_time = ((end - start) / (N * M)) * 1e6
return (name, define_time, init_time, equality_time, order_time)
def format_table(results):
columns = (
"",
"import (μs)",
"create (μs)",
"equality (μs)",
"order (μs)",
)
def f(n):
return "N/A" if n is None else f"{n:.2f}"
rows = []
for name, *times in results:
rows.append((f"**{name}**", *(f(t) for t in times)))
widths = tuple(max(max(map(len, x)), len(c)) for x, c in zip(zip(*rows), columns))
row_template = ("|" + (" %%-%ds |" * len(columns))) % widths
header = row_template % tuple(columns)
bar_underline = "+%s+" % "+".join("=" * (w + 2) for w in widths)
bar = "+%s+" % "+".join("-" * (w + 2) for w in widths)
parts = [bar, header, bar_underline]
for r in rows:
parts.append(row_template % r)
parts.append(bar)
return "\n".join(parts)
def main():
import argparse
parser = argparse.ArgumentParser(description="Benchmark msgspec Struct operations")
parser.add_argument(
"--versions",
action="store_true",
help="Output library version info, and exit immediately",
)
args = parser.parse_args()
if args.versions:
import sys
import importlib.metadata
for _, lib, _ in BENCHMARKS:
if lib is not None:
version = importlib.metadata.version(lib)
print(f"- {lib}: {version}")
sys.exit(0)
results = []
for name, _, source in BENCHMARKS:
results.append(bench(name, source))
print(format_table(results))
if __name__ == "__main__":
main()
|