- The minimum supported Rust version has been increased to 1.64.0.
regex-syntax
version 0.7 is now used.- Print a seed to stderr for a failed test even when a regressions file is already present.
- Fixed a performance issue with
VarBitSet::saturated
that can slow downVecStrategy
PROPTEST_
environment variables now take precedence over tests' non-default configuration.
- Don't implement Arbitrary for NonZeroU128 and NonZeroI128 on wasm targets where u128 and i128 Arbitrary impls don't exist
- Minimal failing input is now printed using debug pretty-printing
- Made public
VarBitSet
,SizeRange
read-only methods and num sampling functions in preparation for release of aproptest-state-machine
crate. - Removed dependency on
quick_error
- Start publishing MSRV
- Sampling from large ranges of floats such as
(0f32)..
no longer panics with newer versions of therand
crate - [dependencies.x86] was bumped to latest current version. x86 crate does was on a very old version 0.33.0 which used a removed macro from rust.
- The calculation for the arbitrary impl of Layout was using a max_size that was too large and overflowing Layout. This has been fixed.
- Test for arbitrary AllocError was referring to AllocErr which does not exist, this was fixed.
- NoneError has been removed from rust so it was subsequently removed from proptest. It was blocking compilation. evidence: rust-lang/rust#85614
try_reserve
is stable so removed from unstable featurestry_trait
has been changed totry_trait_v2
so that was adjusted inCargo.toml
.prop_assert_ne!
now uses fully qualifiedprop_assert_eq!
- Persisted tests are not counted against the number of cases to run
- Add
Arbitrary
impls for arrays of all sizes using const generics - Add
Arbitrary
impls forcore::num::NonZero*
- Adds ability to disable failure persistence via env var
PROPTEST_DISABLE_FAILURE_PERSISTENCE
proptest
no longer depends on thequick-error
crate.
-
The minimum supported Rust version has been increased to 1.50.0.
-
The version of the
rand
crate has been increased to 0.8. -
Due to changes in the
getrandom
crate, if you wish to use proptest on thewasm32-unknown-unknown
target, you must manually add a dependency on that crate and enable a feature that will allow it to work. Refer to thegetrandom
crate documentation for more information.
prop_shuffle()
can now produce all permutations.
- Tuple strategies up to 12 elements are now supported, for parity with the
blanket implementations that
std
provides.
- Added
RngAlgorithm::Recorder
and supporting APIs which allow capturing random data generated as part of generating a value or running a test.
-
The version of the
rand
crate has been increased to 0.7. -
The
proptest!
macro no longer accepts function bodies which implicitly return a value (which would then be discarded). -
The
TupleUnion
implementation inproptest
0.9 has been removed and replaced withLazyTupleUnion
.prop_oneof!
is unaffected and continues to be the recommended way to build a union of strategies.
-
Enabling the
hardware-rng
optional dependency (disabled by default) allows obtaining non-deterministic random seeds even inno_std
environments provided the architecture is x86 or AMD64. -
Added missing
?Sized
bound toB
on the implementation ofArbitrary
forstd::borrow::Cow<'_, B>
.
prop_assert!
andprop_assume!
should now be usable inno_std
environments.
-
rusty_fork
has been bumped to 0.3.0, which adds support for a number of new test flags when running forked tests. -
The
PassThrough
RNG algorithm now returns 0 instead of panicking when it runs out of entropy.
- Fixed #186, a Rust future-compatibility issue.
- Fixed a Rust future-compatibility issue (rust-lang/rust#65819).
- The
unstable
feature one again works against the latest nightly.
-
Unions and the
prop_oneof!
combinator now generate value trees lazily.In previous versions of
proptest
, if a value tree for a union variant was generated, so would value trees for earlier variants -- as a result, union value tree generation was linear in the number of variants.In
proptest
0.9.4 and above, value trees are only generated for union variants that are picked. Union value tree generation is now independent of the number of variants.
TupleUnion
has been deprecated, and its implementation will be replaced byLazyTupleUnion
's in 0.10.0.
-
The return type of
prop_oneof!
has changed fromTupleUnion
toLazyTupleUnion
.prop_oneof!
's return type is documented to not be stable, and that continues to be the case. -
Shrinking is now limited to four times as many iterations as configured number of test cases by default.
-
prop_assert_eq!
andprop_assert_ne!
produce output more similar to theassert_eq!
andassert_ne!
macros. This should also make it easier to visually parse out the source location in the resulting messages.
This is a minor release to correct some packaging errors. The license files are now included in the files published to crates.io, and some unneeded files are now excluded.
-
Closures generated by
prop_compose!
are nowmove
. This is not expected to cause any breakage since there is no way to successfully use a borrowing closure with that macro. -
There is now highly experimental support for building on Web Assembly. Refer to the Proptest book for build instructions.
-
Using proptest with the default
std
feature enabled, thespin
crate is no longer brought in as a dependency. -
Using proptest with the
std
feature disabled, neitherspin
norlazy_static
are brought in as dependencies.
Starting in this version, the default RNG algorithm has been changed from XorShift to ChaCha since it produces higher-quality randomness. This may make test case generation a bit slower but it avoids certain pathological cases that the old generator had.
The old algorithm is still supported, and is used automatically when reading old failure persistence files.
Note that this change also affects the internal representation of RNG seeds,
which affects the FailurePersistence
trait which previously only supported
the seed representation for XorShift. This release maintains source
compatibility with 0.9.0 by providing defaults for the new methods which
delegate (when possible) to the old ones, but be aware that custom failure
persistence implementations using the old API will not function when using an
RNG other than XorShift.
To keep using the old algorithm, you can set the environment variable
PROPTEST_RNG_ALGORITHM
to xs
or set Config.rng_algorithm
to
RngAlgorithm::XorShift
in code.
Besides ChaCha, this version also adds a PassThrough
RNG "algorithm" which
makes it possible to use an external source of entropy with Proptest.
-
TestRng
instances can be created with thefrom_seed
function. -
TestRunner
instances can be created with user-providedTestRng
s. -
TestRunner
now has adeterministic()
constructor which uses the same RNG every time, to facilitate doing statistical tests on strategy outputs. -
There is now a work-around for a compiler bug which prevents building with
-C link-dead-code
. Please see this issue for details: proptest-rs#124
- The
load_persisted_failures
andsave_persisted_failure
methods on theFailurePersistence
trait have been deprecated and will be removed in 0.10.0.
-
The minimum Rust version has been increased to 1.32.0.
-
The version of the
rand
crate has been increased to 0.6. -
The
ValueFor
type alias (deprecated in 0.8.0) has been removed. ReplaceValueFor<S>
withS::Value
or<S as Strategy>::Value
as necessary. -
From<SizeRange>
implementations converting aSizeRange
back to various std types have been removed since they were of limited utility and had unclear or incorrect conversion properties. -
Many optional elements (such as trailing commas or function visibility modifiers) in certain macros could be specified more than once. The macros now accept at most one occurrence.
-
Visibility modifiers inside
prop_compose
must no longer be enclosed in brackets. Unless other modifiers (e.g.,unsafe
) are also in use, simply removing the brackets is sufficient.
-
Rust 2018 style macro imports are now supported.
-
In a Rust 2018 crate, all the macros can be brought into scope with
import proptest::prelude::*;
. -
The proptest macros now accept trailing commas in more locations.
-
Visibility modifiers can now be passed to
prop_compose!
without enclosing them in brackets. Unfortunately, the old way could not continue to be supported due to the way thevis
macro matcher works.
-
The
nightly
feature, which was formerly required for using proptest with#[no_std]
, has been removed. References to the feature can simply be deleted. -
When using the
unstable
feature and settingdefault-features = false
, theAtomicI64
andAtomicU64
types are not supported unless theatomic64bit
feature is enabled. This supportsno_std
usage on platforms which do not support atomic 64-bit operations.
-
Generated strings are now much more likely to contain right-to-left override characters.
-
Most of the crate-level documentation has been relocated to the Proptest Book.
-
Add
max_shrink_iters
andmax_shrink_time
options to test configuration to allow capping the resources expended on shrinking test cases. -
Add
verbose
option to make proptest give details about what is happening as the test executes. -
When a failure is saved to the persistence file, the message now also includes the seed that was saved so that it can manually be added to the appropriate file should the test have run somewhere where the updated file is not accessible (for example, on a CI system).
any::<SystemTime>()
now generates random values centred on the UNIX epoch rather than always producing the current time.
- When using forking, proptest will now detect conditions which cause the child process to crash without running any tests, and will fail quickly instead of respawning child processes.
-
Vec<S> where S: Strategy
is now itself aStrategy
for producing fixed-sizeVec
s whose values are derived from the respective strategies. -
It is now possible to configure the test runner to cache test results to avoid spending time running identical tests. See
Config.result_cache
. -
Add
sample::Index
, a type for generating indices into runtime-sized slices and vectors. -
Add
sample::Selector
, a type for picking items out of dynamically-created iterables.
-
Fix panic when using
sample::subsequence
with an empty vector. -
Fix panic when using
sample::subsequence
with a size equal to the size of the input vector. -
Fix sampled bitset strategies on integers not allowing to generate exactly the same number of bits as the integer is wide.
-
Passing empty size ranges to functions requiring a non-empty size range now panic with an explicit message immediately rather than causing an arithmetic error when generating input values.
-
There were a few cases where proptest would accept a
SizeRange
with an inclusive maximum value ofusize::MAX
. Size ranges are now always clamped tousize::MAX - 1
.
- Fix build when nightly features are enabled.
- Nightly and no_std support work against latest nightly once again.
- Added
bits::bool_vec
for generatingVec<bool>
as a bit set.
-
impl Arbitrary for CollectionAllocErr
is temporarily removed pending it being available outside thealloc
crate again. -
bits::bitset
is no longer available without thebit-set
feature (enabled by default), which is not compatible with#[no_std]
environments.
- Fix that regex-based string generation could transpose the order of a literal and a non-literal component.
-
Macros which previously accepted
pattern in strategy
syntax to specify arguments now also acceptpattern: type
syntax as shorthand forpattern in any::<type>()
. -
Closure-style
proptest!
invocation no longer requires the body to use block syntax. -
Closure-style
proptest!
invocation now accepts custom configurations.
proptest!
now has form that accepts a closure. See the documentation for the macro for more details.
-
Fix spurious warning about corrupt regression files. The files were not corrupt but the parser was failing to handle the blank line at the end.
-
The
multiplex_alloc!
andmultiplex_core!
macros which were unintentionally exported in 0.8.0 are no longer exported. This is not considered a breaking change since they were not supposed to be accessible, and in any case would not have expanded into valid code in most other crates.
-
A combinator
.prop_filter_map
has been added toStrategy
. It is similar to.filter_map
forIterator
in that it is the combination of.prop_filter
and.prop_map
. -
i128
andu128
are now supported without any feature flags and on stable. -
More implementations of
Arbitrary
are supported foralloc
+no_std
users. -
size_range
now accepts inclusive ranges of formlow..=high
and..=high
. Thus, you can construct avec
strategy as:vec(elt_strategy, low..=high)
andvec(elt_strategy, ..=high)
. This also applies to other functions acceptingInto<SizeRange>
. -
..= high
is now a valid strategy. Please note that..= 1
will naturally include numbers lower than0
for sized types. -
low..=high
is also a valid strategy. -
Arbitrary
is implemented forRangeInclusive<Idx>
,RangeToInclusive
, andDecodeUtf16
on stable. -
Bitset strategies and
subsequence
now accept all range syntaxes.
- Fix a race condition where a test failing due to running ever so slightly over the set timeout could cause the test harness to converge to the incorrect failing value, a non-failing value, or panic.
- The type alias
ValueFor<S>
is now deprecated and will be removed in version 0.9. You should just useS::Value
instead.
-
A minimum version of 1.27 of Rust is now required.
-
regex-syntax
version 0.6 is now used. -
rand
version 0.5 is now used. -
As a consequence, the
FailurePersistence
trait will now use[u8; 16]
seeds instead of[u32; 4]
. However, the stored failure persistence files using the defaultFileFailurePersistence
will still use[u32; 4]
so your old failure persistence files should still work. -
The RNG used by proptest has been changed to a PRNG
TestRng
which proptest exposes. This is currently a simple new-type wrapper aroundXorShiftRng
. In the future, this will give us more freedom to make changes without breakage. -
The feature flag
i128_support
has been removed. The features it added are now always supported. -
The associated type
Value
ofStrategy
has been renamed toTree
. A new associated typeValue
has been added toStrategy
which always refers to the same type as<S::Tree as ValueTree>::Value
for some strategyS
. This change allows you to write-> impl Strategy<Value = T>
for functions returning aStrategy
generatingT
s. This is more ergonomic to use than-> impl Strategy<Value = impl ValueTree<Value = T>>
. -
The method
new_value
inStrategy
has been renamed tonew_tree
to mirror the renaming ofValue
toTree
. -
As a consequence change, the associated type
ValueTree
has been removed fromArbitrary
. -
The methods
run
andrun_one
onTestRunner
now takes a function-under-test that accepts the generated type by value instead of by reference instead. This means that you don't need to writeref value in my_strategy
and can writevalue in my_strategy
instead even iftypeof(value)
doesn't implementCopy
. This is also a step in the direction of allowing strategies to generate references when generic associated types (GATs) land. However,ref value in my_strategy
will still be accepted, so not a lot of breakage should come of this if you've usedproptest! { .. }
. -
prop_compose!
no longer applies.boxed()
to the strategy produced. Therefore,-> BoxedStrategy<T>
is no longer the correct type. The new return type is-> impl Strategy<Value = T>
. If you want the old behaviour, you can use.boxed()
yourself. -
Arbitrary
forSizeRange
changed its associated type to useRangeInclusive
. Same applies forCString
. -
Many APIs now use
impl Trait
in argument position, which could affect code using turbofishes to specify types explicitly. -
char
APIs which formerly represented a range as(start, end)
now requirestart..=end
.
- As
std::io::{Chars, CharsError}
have been deprecated on nightly, theirArbitrary
implementations have been removed.
- Fix that
bool
would not shrink correctly, leading to hangs when tests takingbool
parameters would fail in certain circumstances.
-
It is now possible to run test cases in sub-processes. This allows using proptest to test functions which may cause the test process to terminate abruptly, such as by calling
abort()
or even suffering a segmentation fault. This requires the "fork" feature, enabled by default. -
Added support for setting a timeout which applies on a per-test-case (i.e., single input rather than the whole test) basis. This allows using proptest to find inputs which cause code to get stuck in infinite loops or exhibit other pathological performance behaviour. This requires the "timeout" feature (and transitively, the "fork" feature), enabled by default.
See also the documentation for these features.
-
Fix that failure persistence file would be written to the incorrect location in projects using workspaces. See #24 for more details and instructions on how to migrate any persistence files that had been written to the wrong location.
-
Fix a case where
any::<ArgsOs>()
orany::<VarsOs>()
could panic on Windows.
- Support for the
hashmap_core
crate is removed pending Amanieu/hashmap_core#3.
-
The persistence system has been refactored to allow for non-file-system based persistence.
FailurePersistence
is now a trait, and the prior file-based enum which fulfilled that purpose is now calledFileFailurePersistence
and implements the generic trait. The default behavior has not changed. -
Reflecting the change to persistence,
Config.failure_persistence
is now of typeOption<Box<FailurePersistence>>
. -
The
source_file
used as an optional reference point to the location of the calling test is now tracked on theConfig
struct rather than theTestRunner
.
- Experimental support on nightly for working in
#![no_std]
environments has been added. To use it, one must disable the default-features for proptest and use the new "alloc" and "nightly" features. Currently access to a heap allocator is still required.
- There is a small change of breakage if you've relied on
Recursive
using anArc<BoxedStrategy<T>>
asRecursive
now internally usesBoxedStrategy<T>
instead as well as expecting aFn(BoxedStrategy<T>) -> R
instead ofFn(Arc<BoxedStrategy<T>>) -> R
. In addition, the type of recursive strategies has changed fromRecursive<BoxedStrategy<T>, F>
to justRecursive<T, F>
.
-
Reduced indirections and heap allocations inside
Recursive<T, F>
somewhat. -
BoxedStrategy<T>
andSBoxedStrategy<T>
now useArc
internally instead of usingBox
. While this has marginal overhead, it also reduces the overhead inRecursive<T, F>
. The upside to this change is also that you can very cheaply clone strategies. -
Filter
is marginally faster.
-
Removed
impl Arbitrary for LocalKeyState
sinceLocalKeyState
no longer exists in the nightly compiler. -
Unstable features compile on latest nightly again.
-
proptest::strategy::Union
andproptest::strategy::TupleUnion
now work with weighted strategies even if the sum of the weights overflows au32
. -
Added
SIGNALING_NAN
strategy to generate signalling NaNs if supported by the platform. Note that this is not included inANY
.
-
Fixed values produced via
prop_recursive()
not shrinking from the recursive to the non-recursive case. -
Fix that
QUIET_NAN
would generate signalling NaNs on most platforms on Rust 1.24.0 and later.
-
There is a small chance of breakage if you've relied on the constraints put on type inference by the closure in
leaf.prop_recursive(..)
having a fixed output type. The output type is now any strategy that generates the same type asleaf
. This change is intended to make working with recursive types a bit easier as you no longer have to use.boxed()
inside the closure you pass to.prop_recursive(..)
. -
There is a small chance of breakage wrt. type inference due to the introduction of
SizeRange
. -
There is a small chance of breakage wrt. type inference due to the introduction of
Probability
. -
BoxedStrategy
andSBoxedStrategy
are now newtypes instead of being type aliases. You will only experience breaking changes if you've directly used.boxed()
and not(S)BoxedStrategy<T>
but ratherBox<Strategy<Value = Box<ValueTree<Value = T>>>>
. The probability of breakage is very small, but still possible. The benefit of this change is that calling.boxed()
or.sboxed()
twice only boxes once. This can happen in situations where you have functionsStrategy -> BoxedStrategy
or with code generation. -
proptest::char::ANY
has been removed. Any remaining uses must be replaced byproptest::char::any()
. -
proptest::strategy::Singleton
has been removed. Any remaining uses must be replaced byproptest::strategy::Just
.
-
Proptest now has an
Arbitrary
trait inproptest::arbitrary
and re-exported in theproptest::prelude
.Arbitrary
has also beenimpl
emented for most of the standard library. The trait provides a mechanism to define a canonicalStrategy
for a given type just likeArbitrary
in Haskell's QuickCheck. Deriving for this trait will also be provided soon in the crateproptest_derive
. To use the canonical strategy for a certain typeT
, you can simply useany::<T>()
. This is the major new addition of this release. -
The
any_with
,arbitrary
,arbitrary_with
free functions in the moduleproptest::arbitrary
. -
The
ArbitraryF1
andArbitraryF2
traits inproptest::arbitrary::functor
. These are "higher order"Arbitrary
traits that correspond to theArbitrary1
andArbitrary2
type classes in Haskell's QuickCheck. They are mainly provided to support a common set of container-like types in custom deriving self-recursive types inproptest_derive
. More on this later releases. -
The strategies in
proptest::option
andproptest::result
now accept a typeProbability
which is a wrapper aroundf64
. Conversions from types such asf64
are provided to make the interface ergonomic to use. Users may also use theproptest::option::prob
function to explicitly construct the type. -
The strategies in
proptest::collections
now accept a typeSizeRange
which is a wrapper aroundRange<usize>
. Conversions from types such asusize
andRange<usize>
are provided to make the interface ergonomic to use. Users may also use theproptest::collections::size_bounds
function to explicitly construct the type. -
A
.prop_map_into()
operation on all strategies that map usingInto<OutputType>
. This is a clearer and cheaper operation than using.prop_map(OutputType::from)
. -
A nonshrinking
LazyJust
strategy that can be used instead ofJust
when you have non-Clone
types. -
Anything that can be coerced to
fn() -> T
whereT: Debug
is aStrategy
whereValueFor<fn() -> T> == T
. This is intended to make it easier to reuse proptest for unit tests with manual input space partition wherefn() -> T
provides fixtures.
-
Relaxed the constraints of
btree_map
removing'static
. -
Reduced the heap allocation inside
Recursive
somewhat.
- The
unstable
feature now works again.
- The
proptest::num::f32
andproptest::num::f64
modules now have additional constants (e.g.,POSITIVE
,SUBNORMAL
,INFINITE
) which can be used to generate subsets of the floating-point domain by class and sign.
proptest::num::f32::ANY
andproptest::num::f64::ANY
now actually produce arbitrary values. Previously, they had the same effect as0.0..1.0
. While this fix is a very substantial change in behaviour, it was not considered a breaking change since (a) the new behaviour is consistent with the documentation and expectations, (b) it's quite unlikely anyone was depending on the old behaviour since anyone who wanted that range would have written it out, and (c) Proptest isn't generally a transitive dependency so the chance of this update happening "by surprise" is low.
-
proptest::char::ANY
replaced withproptest::char::any()
.proptest::char::ANY
is present but deprecated, and will be removed in proptest 0.5.0. -
Instead of returning
-> Result<Self::Value, String>
, strategies are expected to return-> Result<Self::Value, Reason>
instead.Reason
reduces the amount of heap allocations, especially for.prop_filter(..)
where you may now also pass in&'static str
. You will only experience breaks if you've written your own strategy types or if you've usedTestCaseError::Reject
orTestCaseError::Fail
explicitly. -
Update of externally-visible crate
rand
to0.4.2
.
-
Added
proptest::test_runner::Reason
which allows you to avoid heap allocation in some places and may be used to make the API richer in the future without incurring more breaking changes. -
Added a type alias
proptest::strategy::NewTree<S>
whereS: Strategy
defined as:type NewTree<S> = Result<<S as Strategy>::Value, Rejection>
.
- Cases where
file!()
returns a relative path, such as on Windows, are now handled more reasonably. See #24 for more details and instructions on how to migrate any persistence files that had been written to the wrong location.
Boxing Day Special
-
Added support for
i128
andu128
. Since this is an unstable feature in Rust, this is hidden behind the featureunstable
which you have to explicitly opt into in yourCargo.toml
file. -
Failing case persistence. By default, when a test fails, Proptest will now save the seed for the failing test to a file, and later runs will test the persisted failing cases before generating new ones.
-
Added
UniformArrayStrategy
and helper functions to simplify generating homogeneous arrays with non-Copy
inner strategies. -
Trait
rand::Rng
and structrand::XorShiftRng
are now included inproptest::prelude
.
- Fix a case where certain combinations of strategies, like two
prop_shuffle()
s in close proximity, could result in low-quality randomness.
-
Added
SampledBitSetStrategy
to generate bit sets based on size distribution. -
Added
Strategy::sboxed()
andSBoxedStrategy
to makeSend + Sync
boxed strategies. -
RegexGeneratorStrategy
is nowSend
andSync
. -
Added a type alias
ValueFor<S>
whereS: Strategy
. This is a shorter way to refer to:<<S as Strategy>::Value as ValueTree>::Value
. -
Added a type alias
type W<T> = (u32, T)
for a weighted strategyT
in the context of union strategies. -
TestRunner
now implementsDefault
. -
Added
Config::with_cases(number_of_cases: u32) -> Config
for simpler construction of aConfig
that only differs by the number of test cases. -
All default fields of
Config
can now be overridden by setting environment variables. See the docs of that struct for more details. -
Bumped dependency
rand = "0.3.18"
. -
Added
proptest::sample::subsequence
which returns a strategy generating subsequences, of the sourceVec
, with a size within the givenRange
. -
Added
proptest::sample::select
which returns a strategy selecting exactly one value from another collection. -
Added
prop_perturb
strategy combinator. -
Added
strategy::check_strategy_sanity()
function to do sanity checks on the shrinking implementation of a strategy. -
Added
prop_shuffle
strategy combinator. -
Added
strategy::Fuse
adaptor.
-
Fix bug where
Vec
, array and tuple shrinking could corrupt the state of their inner values, for example leading to out-of-range integers. -
Fix bug where
Flatten
(a.k.a. theprop_flat_map
combinator) could fail to converge to a failing test case during shrinking. -
Fix
TupleUnion
sometimes panicking during shrinking if there were more than two choices.
- Added
CharStrategy::new_borrowed
.
-
Union
now supports weighting viaUnion::new_weighted
. Corresponding syntax to specify weights is also available inprop_oneof!
. -
Added
TupleUnion
, which works likeUnion
but permits doing static dispatch even with heterogeneous delegate strategies. -
prop_oneof!
is smarter about how it combines the input strategies. -
Added
option
module to generate weighted or unweightedOption
types. -
Added
result
module to generate weighted or unweightedResult
types. -
All
bits
submodules now have amasked
function to create a strategy for generating subsets of an arbitrary bitmask.
-
Union::new
now has a generic argument type which could impact type inference. -
The concrete types produced by
prop_oneof!
have changed. -
API functions which used to return
BoxedStrategy
now return a specific type. -
BitSetStrategy<T>
is no longerCopy
for non-Copy
typesT
norDebug
for non-Debug
typesT
. -
BitSetLike::max
has been renamed toBitSetLike::len
.
-
Added
prop_assert!
macro family to assert without panicking, for quieter test failure modes. -
New
prelude
module for easier importing of important things. -
Renamed
Singleton
toJust
. (The old name is still available.) -
Failure messages produced by
proptest!
are now much more readable. -
Added in-depth tutorial.
Strategy
now requiresstd::fmt::Debug
.
-
Strategy
now has a family ofprop_flat_map()
combinators for producing dynamic and higher-order strategies. -
Strategy
has aprop_recursive()
combinator which allows generating recursive structures. -
Added
proptest::bool::weighted()
to pull booleans from a weighted distribution. -
New
prop_oneof!
macro makes it easier to select from one of several strategies. -
New
prop_compose!
macro to simplify writing most types of custom strategies.
Add strategy::NoShrink
, Strategy::no_shrink()
.