Returns a dictionary of array module names paired to their entry points A convenience wrapper for importlib.metadata.entry_points(). It has the

Decorator to apply an invariant for rules in a RuleBasedStateMachine. The decorated function will be run after every rule and can raise an exc

r"""Generate IP addresses - ``v=4`` for :class:`~python:ipaddress.IPv4Address`\ es, ``v=6`` for :class:`~python:ipaddress.IPv6Address`\ es, or lea

Returns whether this strategy is currently empty. Unlike ``empty``, which is computed based on static information and cannot change,

Check the arguments to ``@given`` for basic usage constraints. Most errors are not raised immediately; instead we return a dummy test functio

Returns True if the key is currently pinned.

Mark this part of the tree as not worth re-exploring.

Mark this part of the tree as not worth re-exploring.

Returns a syntactically-valid expression describing `f`. This is often, but not always, the exact lambda definition string which appears in t

Returns True if the left is strictly simpler than the right according to the standards of this shrinker.

Note that the draw at node i was forced.

Attempt to insert padding around the result of a regex draw while preserving the match.

Move ``value`` from key ``src`` to key ``dest``. Equivalent to ``delete(src, value)`` followed by ``save(src, value)``, but

The underlying timezone-naive ``datetime64[unit]`` dtype that backs a :class:`~pandas.DatetimeTZDtype`.

Return the most-general dtype strategy. Elements drawn from this strategy may be simple (from the subtype_strategy), or several such values d

Called when a key is written that does not currently appear in the map. Returns the score to associate with the key.

Make an updated signature for the wrapped test.

For inline-creating a choice node or list of choice nodes, where you don't care about the constraints. This uses maximally-permissable constr

Reset _first_postinit_what, so that we don't think we're in post-init. Additionally, if it was set that means that there has been a sideeffect tha

Take an AST; return a ConstructivePredicate. >>> lambda x: x >= 0 {"min_value": 0}, None >>> lambda x: x < 10 {"max_value": 10, "excl

Called every time a key that is already in the map is read or written. Returns the new score for the key.

Called after a key has been evicted, with the score it had had at the point of eviction.

Register a listener function that will be called with data when it gets removed from the front because something else dominates it.

Set union of n sequences, ordered for reproducibility across runs.

Return a collection of choice sequence nodes which cause the test to pass. Optionally restrict this by a certain prefix, which is useful for e