build(deps): bump @effect/vitest from 4.0.0-rc.112 to 4.0.0-rc.113

[dependabot]

Bumps @effect/vitest from 4.0.0-rc.112 to 4.0.0-rc.113.

Release notes

Sourced from @​effect/vitest's releases.

@​effect/vitest@​4.0.0-rc.113

Patch Changes

• #7254 a63dcbf Thanks @​gcanti! - Add the experimental Schema-first effect/unstable/arbitrary/Arbitrary module for native generation without fast-check. Arbitrary.schema derives an opaque arbitrary from the decoded Schema Type, Arbitrary.sampleEffect provides interruptible sampling with typed exhaustion, and Arbitrary.checkEffect returns structured property results. The initial implementation supports bounded discards, shrinking, replay, and recursive and mutually recursive Schemas. SampleError and Exhausted include the effective seed so discarded runs remain reproducible even when the caller did not provide one. Arbitrary.isArbitrary identifies values through the module's nominal protocol. Numeric constraints retain NaN when it is accepted by their supported Order.Number bounds. Union derivation validates oneOf exclusivity and isolates lazy cross-member shrinking from unrelated random generation. Object derivation keeps optional-property selection constructive when candidate fields have different recursive costs. Struct, Record, JSON-object, and record-shaped Arbitrary.all outputs periodically use a null prototype as an edge case, preserving that prototype throughout shrinking and replay without perturbing structural PRNG choices. The change adds 0.01–0.03 KB gzip to representative Arbitrary fixtures and leaves production-only bundle sentinels unchanged.

  Add Arbitrary.map, Arbitrary.flatMap, Arbitrary.filter, Arbitrary.filterMap, and Arbitrary.all for composing derived Arbitraries without exposing a second catalog of primitive constructors. Filtering remains bounded and promotes valid shrink descendants through rejected nodes. maxShrinks bounds every inspected shrink candidate, including candidates rejected before property evaluation, while retaining the best shrunk input found when the budget is exhausted. flatMap provides deterministic dependent generation, source-first shrinking, post-source PRNG checkpoints, and one shared residual recursion budget. all combines tuples, iterables, and records with a shared budget, randomized internal generation order, stable output shape, and independent member shrinking. Arbitrary values implement Pipeable for composition with data-last combinators.

  Add the experimental Schema arbitraryConstraint and toCodecArbitrary annotations and their Schema.Annotations.ToArbitrary types. Declarations can provide a Schema Link optimized for generation, while filters can contribute native semantic constraints. The callback receives decoded type parameters and normalized constraints. The compiler owns efficient representations for common built-ins, including JSON, RegExp, URL, Date, byte arrays, ReadonlyMap, and ReadonlySet. Effect-specific HashMap, HashSet, Chunk, Graph, BigDecimal, and date-time declarations keep local generation Links, while declarations with productive canonical codecs require no arbitrary-specific annotation. Schema.isUniqueKey provides key-based Map uniqueness for explicit array representations.

  The same ownership policy applies to formatter and equivalence derivation: implementations for common declarations live in their compiler, while domain-specific and dynamically constructed declarations retain local annotations. Declarations whose intrinsic Equal implementation already matches their Schema equivalence need no annotation or compiler special case. This keeps unused common callbacks out of production Schema bundles.

  Against the previous layout, schema-toArbitrary decreases from 36.68 KB to 33.24 KB gzip and arbitrary-combinators decreases from 37.16 KB to 33.70 KB. schema-toFormatter increases from 18.92 KB to 19.49 KB and schema-toEquivalence increases from 19.05 KB to 19.39 KB because callers that explicitly derive these capabilities now retain the common declaration handlers. Generic production fixtures remain unchanged; an equivalence-specific production fixture using common declarations decreases from 20.75 KB to 20.48 KB, while declarations whose intrinsic equality is sufficient decrease from 23.42 KB to 23.34 KB. An Arbitrary-specific production fixture using common declarations decreases from 20.35 KB to 19.61 KB, while one using the locally annotated BigDecimal and date-time declarations increases from 18.34 KB to 23.01 KB. The complete 31-scenario native Arbitrary comparison reports no statistically classified runtime regression; the five moved BigDecimal and date-time scenarios remain within measurement noise.

  Add SchemaGetter.forbiddenEncoding, a reusable getter for the encode side of decode-only Schema transformations.

... (truncated)

Changelog

Sourced from @​effect/vitest's changelog.

4.0.0-rc.113

Patch Changes

• #7254 a63dcbf Thanks @​gcanti! - Add the experimental Schema-first effect/unstable/arbitrary/Arbitrary module for native generation without fast-check. Arbitrary.schema derives an opaque arbitrary from the decoded Schema Type, Arbitrary.sampleEffect provides interruptible sampling with typed exhaustion, and Arbitrary.checkEffect returns structured property results. The initial implementation supports bounded discards, shrinking, replay, and recursive and mutually recursive Schemas. SampleError and Exhausted include the effective seed so discarded runs remain reproducible even when the caller did not provide one. Arbitrary.isArbitrary identifies values through the module's nominal protocol. Numeric constraints retain NaN when it is accepted by their supported Order.Number bounds. Union derivation validates oneOf exclusivity and isolates lazy cross-member shrinking from unrelated random generation. Object derivation keeps optional-property selection constructive when candidate fields have different recursive costs. Struct, Record, JSON-object, and record-shaped Arbitrary.all outputs periodically use a null prototype as an edge case, preserving that prototype throughout shrinking and replay without perturbing structural PRNG choices. The change adds 0.01–0.03 KB gzip to representative Arbitrary fixtures and leaves production-only bundle sentinels unchanged.

  Add Arbitrary.map, Arbitrary.flatMap, Arbitrary.filter, Arbitrary.filterMap, and Arbitrary.all for composing derived Arbitraries without exposing a second catalog of primitive constructors. Filtering remains bounded and promotes valid shrink descendants through rejected nodes. maxShrinks bounds every inspected shrink candidate, including candidates rejected before property evaluation, while retaining the best shrunk input found when the budget is exhausted. flatMap provides deterministic dependent generation, source-first shrinking, post-source PRNG checkpoints, and one shared residual recursion budget. all combines tuples, iterables, and records with a shared budget, randomized internal generation order, stable output shape, and independent member shrinking. Arbitrary values implement Pipeable for composition with data-last combinators.

  Add the experimental Schema arbitraryConstraint and toCodecArbitrary annotations and their Schema.Annotations.ToArbitrary types. Declarations can provide a Schema Link optimized for generation, while filters can contribute native semantic constraints. The callback receives decoded type parameters and normalized constraints. The compiler owns efficient representations for common built-ins, including JSON, RegExp, URL, Date, byte arrays, ReadonlyMap, and ReadonlySet. Effect-specific HashMap, HashSet, Chunk, Graph, BigDecimal, and date-time declarations keep local generation Links, while declarations with productive canonical codecs require no arbitrary-specific annotation. Schema.isUniqueKey provides key-based Map uniqueness for explicit array representations.

  The same ownership policy applies to formatter and equivalence derivation: implementations for common declarations live in their compiler, while domain-specific and dynamically constructed declarations retain local annotations. Declarations whose intrinsic Equal implementation already matches their Schema equivalence need no annotation or compiler special case. This keeps unused common callbacks out of production Schema bundles.

  Against the previous layout, schema-toArbitrary decreases from 36.68 KB to 33.24 KB gzip and arbitrary-combinators decreases from 37.16 KB to 33.70 KB. schema-toFormatter increases from 18.92 KB to 19.49 KB and schema-toEquivalence increases from 19.05 KB to 19.39 KB because callers that explicitly derive these capabilities now retain the common declaration handlers. Generic production fixtures remain unchanged; an equivalence-specific production fixture using common declarations decreases from 20.75 KB to 20.48 KB, while declarations whose intrinsic equality is sufficient decrease from 23.42 KB to 23.34 KB. An Arbitrary-specific production fixture using common declarations decreases from 20.35 KB to 19.61 KB, while one using the locally annotated BigDecimal and date-time declarations increases from 18.34 KB to 23.01 KB. The complete 31-scenario native Arbitrary comparison reports no statistically classified runtime regression; the five moved BigDecimal and date-time scenarios remain within measurement noise.

... (truncated)

Commits

• d3b837a Version Packages (rc) (#8125)
• 3993340 Fix Vitest timeout finalizer ordering (#8154)
• 7105c73 Revert "Version Packages (rc) (#7446)" (#8124)
• 54adcab Version Packages (rc) (#7446)
• e9915d5 Upgrade Vitest integrations to version 5 (#8104)
• cce221e Update compatible workspace dependencies (#8096)
• c1693ff Update repository dependencies (#7534)
• a63dcbf Native Arbitraries (#7254)
• See full diff in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

• @dependabot rebase will rebase this PR
• @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
• @dependabot show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @dependabot ignore this major version will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this minor version will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this dependency will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)