|
|
Accept broad, return narrow: group_by and merge_counts
|
Medium
|
Primitives
|
|
|
|
A Fetcher Protocol three implementations can satisfy
|
Medium
|
Primitives
|
|
|
|
A generic Result[T, E]
|
Medium
|
Primitives
|
|
|
|
BoundedBuffer: a blocking queue from one Condition
|
Medium
|
Primitives
|
|
|
|
Bounds versus constraints: clamp and dedupe
|
Hard
|
Framework
|
|
|
|
Capstone: a typed, cancellable, observable worker pool
|
Hard
|
End-to-End
|
|
|
|
Exception chaining: raise ... from
|
Medium
|
Primitives
|
|
|
|
fetch_all: structured fan-out with TaskGroup
|
Medium
|
Primitives
|
|
|
|
Free-Threading: Writing Code That Survives It
|
Hard
|
Research
|
|
|
|
Generic dataclasses, Self, and the covariance question
|
Hard
|
Framework
|
|
|
|
Generic partition and chunk
|
Medium
|
Primitives
|
|
|
|
map_with_failures: partial success on a thread pool
|
Medium
|
Primitives
|
|
|
|
Order-preserving dedupe and a real sliding window
|
Easy
|
Primitives
|
|
|
|
@overload: one implementation, several honest signatures
|
Hard
|
Primitives
|
|
|
|
Placement 1/6: generics and variance
|
Medium
|
Primitives
|
|
|
|
Process Is a Typing Black Hole — Prefer Executors
|
Easy
|
Primitives
|
|
|
|
run_sync: the sync boundary a library should expose
|
Easy
|
Primitives
|
|
|
|
run_workers: results, errors and a join deadline
|
Medium
|
Primitives
|
|
|
|
Self-types, and restricting a method to one parameterisation
|
Medium
|
Framework
|
|
|
|
Subinterpreters: PEP 734 and the Typed Queue
|
Medium
|
Research
|
|
|
|
TypeVarTuple: generics over an arbitrary number of types
|
Hard
|
Primitives
|
|
|
|
Typing the error path: Result, attempt and Never
|
Hard
|
Primitives
|
|
|
|
Variance in generic protocols
|
Hard
|
Primitives
|
|
|
|
with_cleanup: bounded cleanup on every exit path
|
Hard
|
Primitives
|
|
|
|
Writing generic code over dataclasses under --strict
|
Hard
|
Framework
|
|