Îõ³h* ¼ Æ/      !"#$%&'() * + , - . 1.9.0  Safe-Inferred 1ÍÚÛÝæð(C) 2026, QBayLogic B.V.BSD2 (see the file LICENSE)%QBayLogic B.V.  Safe-Inferred)*1ËÍÚÛÝæð/clash-prelude-hedgehogLike SomeSNat, but with bounds.clash-prelude-hedgehog Generate a , between the given bounds (inclusive). Uses   and shrinks to lower.1For example, to bring into scope the constraints (KnownNat n, 1 <= n, n <= 8): ÅSomeBoundedSNat (SNat :: SNat n) <- forAll (genSomeBoundedSNat @1 @8)clash-prelude-hedgehogLike  but does not shrink.clash-prelude-hedgehog Generate a Ó between the given bounds (inclusive). To do so, uses a given term level generator.NBØ: Make sure the given generator respects the bounds that it is passed at the term level.(C) 2021, QBayLogic B.V.BSD2 (see the file LICENSE)%QBayLogic B.V.  Safe-Inferred 1ÍÚÛÝæðË  (C) 2021-2022, QBayLogic B.V.BSD2 (see the file LICENSE)%QBayLogic B.V.  Safe-Inferred )*1ÍÚÛÝæðn  (C) 2021-2022, QBayLogic B.V.BSD2 (see the file LICENSE)%QBayLogic B.V.  Safe-Inferred )*1ÍÚÛÝæð(C) 2021-2022, QBayLogic B.V.BSD2 (see the file LICENSE)%QBayLogic B.V.  Safe-Inferred )*1ÍÚÛÝæð²(C) 2021-2022, QBayLogic B.V.BSD2 (see the file LICENSE)%QBayLogic B.V.  Safe-Inferred )*1ÍÚÛÝæðS(C) 2021-2024, QBayLogic B.V.BSD2 (see the file LICENSE)%QBayLogic B.V.  Safe-Inferred)*1ËÍØÚÛÝæð Å#clash-prelude-hedgehogÓGenerate a bit which is guaranteed to be defined. This will either have the value / or 0.$clash-prelude-hedgehog×Generate a bit which is not guaranteed to be defined. This will either have the value / or 0, or throw an  XException.%clash-prelude-hedgehog1Generate a bit vector where all bits are defined.&clash-prelude-hedgehog7Generate a bit vector where some bits may be undefined.#$%&!"'#$%&!"' (C) 2021-2022, QBayLogic B.V.BSD2 (see the file LICENSE)%QBayLogic B.V.  Safe-Inferred)*1ËÍÚÛÝæð ¸+clash-prelude-hedgehogÿGenerate a potentially empty vector, where each element is produced using the supplied generator. For a non-empty vector, see ,.,clash-prelude-hedgehogÿGenerate a non-empty vector, where each element is produced using the supplied generator. For a potentially empty vector, see +.+,)*-+,)*-1  !!"#$%%&'())*+,-./ 0 0 1 2 3 45675689$clash-prelude-hedgehog-1.9.0-inplace.Clash.Hedgehog.Annotations.SynthesisAttributesClash.Hedgehog.Promoted.NatClash.Hedgehog.SignalClash.Hedgehog.Sized.IndexClash.Hedgehog.Sized.RTreeClash.Hedgehog.Sized.SignedClash.Hedgehog.Sized.UnsignedClash.Hedgehog.Sized.BitVectorClash.Hedgehog.Sized.Vectorclash-prelude-hedgehogHedgehog.RangelineargenAttrSomeBoundedSNatgenSomeBoundedSNatgenSomeBoundedSNat_genSomeBoundedSNat#$fShowSomeBoundedSNat genSignal genActiveEdgegenInitBehavior genResetKindgenResetPolarity SomeIndexgenIndex genSomeIndex$fShowSomeIndex SomeRTreegenRTreegenNonEmptyRTree genSomeRTree$fShowSomeRTree SomeSigned genSigned genSomeSigned$fShowSomeSigned SomeUnsigned genUnsignedgenSomeUnsigned$fShowSomeUnsigned SomeBitVector genDefinedBitgenBitgenDefinedBitVector genBitVectorgenSomeBitVector$fShowSomeBitVectorSomeVecgenVecgenNonEmptyVec genSomeVec $fShowSomeVecclash-prelude-1.9.0-inplaceClash.Sized.Internal.BitVectorlowhigh