Called when a value has been either added to or deleted from a key in the underlying database store. The possible values for ``event`

Return ``(op, bound)`` for filter conditions like ``partial(op, bound)``, with a single positional argument to one of the five comparison operator

Narrow [min_value, max_value] to satisfy the condition ``func(arg, x)``. ``shift(value, steps)`` moves value by that many of the smallest represe

Inverse of :func:`_float_to_position` on the integer-valued range. Always returns an integer-valued, non-negative float.

Classify the values a timezones= strategy can generate: "none" if only None, "aware" if only tzinfo instances, or "unknown" if we can't tell.

Helper: run _try_inline_lambda and return the printer output, or None.

Return a strategy for array shapes (tuples of int >= 1). * ``min_dims`` is the smallest length that the generated shape can possess. * ``max_

The number of bytes required to represent an n-bit number. Equivalent to (n + 7) // 8, but slightly faster. This really is called enough times

Recalculates is_exhausted if necessary, and then returns it. A node is exhausted if: - Its transition is Conclusion or Kille

Checks that value is either unspecified, or a valid integer. Otherwise raises InvalidArgument.

When introducing a rule in a RuleBasedStateMachine, this function can be used to mark bundles from which each value used in a step with the gi

This function tests whether the given datetime can be round-tripped to and from UTC. It is an exact inverse of (and very similar to) the dateutil

A deferred strategy allows you to write a strategy that references other strategies that have not yet been defined. This allows for the easy d

Return an iterable over all values matching this key.

Creates a strategy which can generate any value of the given dtype. Compatible parameters are passed to the inferred strategy function while

This is identical to the sets function but instead returns frozensets.

Inverse of char_in_shrink_order.

Performs some preliminary reductions that should not be repeated as part of the main shrink passes. The main reason why these can't b

Prefer known-FTZ modules, then top-level packages, then alphabetical.

Select choices starting from ``prefix```, preferring to move left then wrapping around to the right.

Select choices uniformly at random.

Called whenever hypothesis requires a concrete (non-symbolic) value from a potentially symbolic value. Hypothesis will not check that

base: A strategy to start from. extend: A function which takes a strategy and returns a new strategy. min_leaves: The minimum number of elem

Handle properties which may be mutually recursive among a set of strategies. These are essentially lazily cached properties, with the ability

Return a set of names of required args to target that were not supplied in args or kwargs. This is used in builds() to determine which argume

Set up just enough of the Hypothesis machinery to use draw on a strategy.

Save ``value`` under ``key``. If ``value`` is already present in ``key``, silently do nothing.